/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/mult-4.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:23:43,142 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:23:43,195 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:43,201 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:23:43,201 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:23:43,224 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:23:43,225 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:23:43,225 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:23:43,225 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:23:43,225 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:23:43,226 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:23:43,226 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:23:43,226 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:23:43,227 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:23:43,227 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:23:43,227 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:23:43,227 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:23:43,227 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:23:43,227 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:23:43,227 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:23:43,227 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:23:43,227 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:23:43,227 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:23:43,227 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:23:43,227 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:23:43,227 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:23:43,227 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:23:43,227 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:23:43,228 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:23:43,228 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:23:43,228 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:23:43,228 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:23:43,228 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:23:43,228 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:23:43,228 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:23:43,228 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:23:43,228 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:23:43,466 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:23:43,472 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:23:43,474 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:23:43,474 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:23:43,475 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:23:43,477 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/mult-4.wvr.bpl [2025-04-26 16:23:43,478 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/mult-4.wvr.bpl' [2025-04-26 16:23:43,496 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:23:43,497 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:23:43,498 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:23:43,498 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:23:43,498 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:23:43,506 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "mult-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:43" (1/1) ... [2025-04-26 16:23:43,527 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "mult-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:43" (1/1) ... [2025-04-26 16:23:43,533 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:23:43,534 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:23:43,536 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:23:43,537 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:23:43,537 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:23:43,542 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "mult-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:43" (1/1) ... [2025-04-26 16:23:43,542 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "mult-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:43" (1/1) ... [2025-04-26 16:23:43,544 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "mult-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:43" (1/1) ... [2025-04-26 16:23:43,544 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "mult-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:43" (1/1) ... [2025-04-26 16:23:43,547 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "mult-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:43" (1/1) ... [2025-04-26 16:23:43,548 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "mult-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:43" (1/1) ... [2025-04-26 16:23:43,552 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "mult-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:43" (1/1) ... [2025-04-26 16:23:43,552 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "mult-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:43" (1/1) ... [2025-04-26 16:23:43,553 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "mult-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:43" (1/1) ... [2025-04-26 16:23:43,565 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:23:43,565 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:23:43,565 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:23:43,566 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:23:43,567 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "mult-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:43" (1/1) ... [2025-04-26 16:23:43,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:43,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:43,591 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:43,594 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:43,616 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:23:43,616 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:23:43,616 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:23:43,616 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:23:43,616 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:23:43,616 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:23:43,616 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:23:43,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:23:43,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:23:43,616 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:23:43,617 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:23:43,617 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:23:43,617 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 16:23:43,617 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 16:23:43,617 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 16:23:43,617 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:43,657 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:23:43,658 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:23:43,773 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:23:43,773 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:23:43,802 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:23:43,802 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:23:43,802 INFO L201 PluginConnector]: Adding new model mult-4.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:23:43 BoogieIcfgContainer [2025-04-26 16:23:43,804 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:23:43,805 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:23:43,806 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:23:43,811 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:23:43,812 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:23:43,812 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "mult-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:43" (1/2) ... [2025-04-26 16:23:43,813 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@546d410e and model type mult-4.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:23:43, skipping insertion in model container [2025-04-26 16:23:43,813 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:23:43,813 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "mult-4.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:23:43" (2/2) ... [2025-04-26 16:23:43,814 INFO L376 chiAutomizerObserver]: Analyzing ICFG mult-4.wvr.bpl [2025-04-26 16:23:43,874 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-26 16:23:43,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 40 transitions, 108 flow [2025-04-26 16:23:43,933 INFO L116 PetriNetUnfolderBase]: 4/32 cut-off events. [2025-04-26 16:23:43,937 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-26 16:23:43,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49 conditions, 32 events. 4/32 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 50 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2025-04-26 16:23:43,943 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 40 transitions, 108 flow [2025-04-26 16:23:43,946 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 32 transitions, 88 flow [2025-04-26 16:23:43,947 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 41 places, 32 transitions, 88 flow [2025-04-26 16:23:43,955 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:23:43,956 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:23:43,956 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:23:43,956 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:23:43,956 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:23:43,956 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:23:43,956 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:23:43,956 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:23:43,957 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:23:44,099 INFO L131 ngComponentsAnalysis]: Automaton has 115 accepting balls. 380 [2025-04-26 16:23:44,100 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:44,100 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:44,106 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:23:44,106 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:23:44,108 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:23:44,108 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 433 states, but on-demand construction may add more states [2025-04-26 16:23:44,123 INFO L131 ngComponentsAnalysis]: Automaton has 115 accepting balls. 380 [2025-04-26 16:23:44,124 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:44,124 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:44,124 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:23:44,124 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:23:44,128 INFO L752 eck$LassoCheckResult]: Stem: "[81] $Ultimate##0-->L70: Formula: (and (= v_i2_5 v_i1_5) (= v_i1_5 0) (= v_i1_5 v_j1_1) (= v_i1_5 v_j2_1)) InVars {i1=v_i1_5, j2=v_j2_1, i2=v_i2_5, j1=v_j1_1} OutVars{i1=v_i1_5, j2=v_j2_1, i2=v_i2_5, j1=v_j1_1} AuxVars[] AssignedVars[]" "[85] L70-->L71: Formula: (= v_counter_6 0) InVars {counter=v_counter_6} OutVars{counter=v_counter_6} AuxVars[] AssignedVars[]" "[60] L71-->L72: Formula: (and (= v_M2_1 v_N1_3) (= v_N2_3 v_N1_3) (= v_M1_1 v_N1_3)) InVars {N2=v_N2_3, M1=v_M1_1, M2=v_M2_1, N1=v_N1_3} OutVars{N2=v_N2_3, M1=v_M1_1, M2=v_M2_1, N1=v_N1_3} AuxVars[] AssignedVars[]" "[84] L72-->L73: Formula: (< 0 v_C_3) InVars {C=v_C_3} OutVars{C=v_C_3} AuxVars[] AssignedVars[]" "[106] L73-->L24-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:23:44,129 INFO L754 eck$LassoCheckResult]: Loop: "[89] L24-1-->L24: Formula: (< v_i1_1 v_N1_1) InVars {i1=v_i1_1, N1=v_N1_1} OutVars{i1=v_i1_1, N1=v_N1_1} AuxVars[] AssignedVars[]" "[91] L24-->L24-1: Formula: (and (= v_i1_6 (+ v_i1_7 1)) (= v_counter_13 (+ v_counter_14 v_C_6))) InVars {i1=v_i1_7, counter=v_counter_14, C=v_C_6} OutVars{i1=v_i1_6, counter=v_counter_13, C=v_C_6} AuxVars[] AssignedVars[counter, i1]" [2025-04-26 16:23:44,132 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:44,132 INFO L85 PathProgramCache]: Analyzing trace with hash 106026957, now seen corresponding path program 1 times [2025-04-26 16:23:44,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:44,138 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34100304] [2025-04-26 16:23:44,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:44,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:44,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:44,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:44,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:44,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:44,190 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:44,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:44,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:44,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:44,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:44,211 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:44,214 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:44,214 INFO L85 PathProgramCache]: Analyzing trace with hash 3811, now seen corresponding path program 1 times [2025-04-26 16:23:44,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:44,214 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013009627] [2025-04-26 16:23:44,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:44,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:44,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:44,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:44,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:44,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:44,221 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:44,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:44,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:44,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:44,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:44,226 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:44,227 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:44,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1187306577, now seen corresponding path program 1 times [2025-04-26 16:23:44,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:44,228 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258288746] [2025-04-26 16:23:44,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:44,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:44,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:23:44,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:23:44,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:44,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:44,239 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:44,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:23:44,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:23:44,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:44,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:44,245 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:44,306 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:44,307 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:44,307 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:44,307 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:44,307 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:23:44,307 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:44,307 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:44,307 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:44,308 INFO L132 ssoRankerPreferences]: Filename of dumped script: mult-4.wvr.bpl_petrified1_Iteration1_Loop [2025-04-26 16:23:44,308 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:44,308 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:44,350 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:44,358 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:44,399 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:44,400 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:23:44,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:44,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:44,404 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:44,405 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:44,406 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:23:44,406 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:23:44,421 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:23:44,421 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {counter=0, C=0} Honda state: {counter=0, C=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:23:44,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-04-26 16:23:44,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:44,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:44,430 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:44,431 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:44,432 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:23:44,432 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:23:44,453 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:44,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:44,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:44,455 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:44,456 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:44,457 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:23:44,457 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:23:44,526 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:23:44,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 16:23:44,531 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:44,531 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:44,531 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:44,531 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:44,531 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:44,531 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:44,531 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:44,531 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:44,531 INFO L132 ssoRankerPreferences]: Filename of dumped script: mult-4.wvr.bpl_petrified1_Iteration1_Loop [2025-04-26 16:23:44,531 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:44,531 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:44,532 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:44,536 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:44,563 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:44,566 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:44,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:44,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:44,569 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:44,570 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:44,572 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:44,582 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:44,582 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:23:44,583 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:44,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:44,583 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:44,590 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:23:44,591 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:23:44,594 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:44,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 16:23:44,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:44,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:44,602 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:44,602 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:44,603 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:44,613 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:44,613 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:23:44,614 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:44,614 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:44,614 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:44,614 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:23:44,614 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:23:44,616 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:44,624 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:23:44,624 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:23:44,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:44,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:44,627 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:44,628 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:44,629 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:44,632 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:44,632 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:23:44,632 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:44,633 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N1, i1) = 1*N1 - 1*i1 Supporting invariants [] [2025-04-26 16:23:44,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 16:23:44,641 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:23:44,674 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:44,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:44,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:44,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:44,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:44,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:44,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:44,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:44,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:44,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:44,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:44,701 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:44,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:44,726 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:44,774 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:44,782 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 433 states, but on-demand construction may add more states 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 16:23:44,926 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 433 states, but on-demand construction may add more states. 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 1197 states and 5058 transitions. Complement of second has 7 states. [2025-04-26 16:23:44,928 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:44,932 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 16:23:44,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2025-04-26 16:23:44,938 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 64 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 16:23:44,939 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:44,939 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 64 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 16:23:44,939 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:44,939 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 64 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 16:23:44,939 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:44,940 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1197 states and 5058 transitions. [2025-04-26 16:23:44,963 INFO L131 ngComponentsAnalysis]: Automaton has 125 accepting balls. 350 [2025-04-26 16:23:44,978 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1197 states to 841 states and 3585 transitions. [2025-04-26 16:23:44,979 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 381 [2025-04-26 16:23:44,982 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 611 [2025-04-26 16:23:44,982 INFO L74 IsDeterministic]: Start isDeterministic. Operand 841 states and 3585 transitions. [2025-04-26 16:23:44,982 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:44,983 INFO L218 hiAutomatonCegarLoop]: Abstraction has 841 states and 3585 transitions. [2025-04-26 16:23:44,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states and 3585 transitions. [2025-04-26 16:23:45,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 613. [2025-04-26 16:23:45,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 613 states have (on average 4.380097879282219) internal successors, (in total 2685), 612 states have internal predecessors, (2685), 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:45,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 2685 transitions. [2025-04-26 16:23:45,042 INFO L240 hiAutomatonCegarLoop]: Abstraction has 613 states and 2685 transitions. [2025-04-26 16:23:45,042 INFO L438 stractBuchiCegarLoop]: Abstraction has 613 states and 2685 transitions. [2025-04-26 16:23:45,042 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:23:45,042 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 613 states and 2685 transitions. [2025-04-26 16:23:45,047 INFO L131 ngComponentsAnalysis]: Automaton has 125 accepting balls. 350 [2025-04-26 16:23:45,047 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:45,047 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:45,048 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:23:45,048 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:23:45,048 INFO L752 eck$LassoCheckResult]: Stem: "[81] $Ultimate##0-->L70: Formula: (and (= v_i2_5 v_i1_5) (= v_i1_5 0) (= v_i1_5 v_j1_1) (= v_i1_5 v_j2_1)) InVars {i1=v_i1_5, j2=v_j2_1, i2=v_i2_5, j1=v_j1_1} OutVars{i1=v_i1_5, j2=v_j2_1, i2=v_i2_5, j1=v_j1_1} AuxVars[] AssignedVars[]" "[85] L70-->L71: Formula: (= v_counter_6 0) InVars {counter=v_counter_6} OutVars{counter=v_counter_6} AuxVars[] AssignedVars[]" "[60] L71-->L72: Formula: (and (= v_M2_1 v_N1_3) (= v_N2_3 v_N1_3) (= v_M1_1 v_N1_3)) InVars {N2=v_N2_3, M1=v_M1_1, M2=v_M2_1, N1=v_N1_3} OutVars{N2=v_N2_3, M1=v_M1_1, M2=v_M2_1, N1=v_N1_3} AuxVars[] AssignedVars[]" "[84] L72-->L73: Formula: (< 0 v_C_3) InVars {C=v_C_3} OutVars{C=v_C_3} AuxVars[] AssignedVars[]" "[106] L73-->L24-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[109] L73-1-->L35-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:45,048 INFO L754 eck$LassoCheckResult]: Loop: "[93] L35-1-->L35: Formula: (< v_i2_1 v_N2_1) InVars {N2=v_N2_1, i2=v_i2_1} OutVars{N2=v_N2_1, i2=v_i2_1} AuxVars[] AssignedVars[]" "[95] L35-->L35-1: Formula: (and (< 0 v_counter_22) (= v_i2_10 (+ v_i2_11 1)) (= v_counter_22 (+ v_counter_21 v_C_10))) InVars {i2=v_i2_11, counter=v_counter_22, C=v_C_10} OutVars{i2=v_i2_10, counter=v_counter_21, C=v_C_10} AuxVars[] AssignedVars[counter, i2]" [2025-04-26 16:23:45,049 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:45,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1008131520, now seen corresponding path program 1 times [2025-04-26 16:23:45,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:45,050 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280427174] [2025-04-26 16:23:45,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:45,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:45,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:23:45,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:23:45,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:45,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:45,056 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:45,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:23:45,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:23:45,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:45,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:45,062 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:45,062 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:45,062 INFO L85 PathProgramCache]: Analyzing trace with hash 3939, now seen corresponding path program 1 times [2025-04-26 16:23:45,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:45,062 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728768131] [2025-04-26 16:23:45,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:45,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:45,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:45,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:45,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:45,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:45,068 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:45,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:45,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:45,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:45,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:45,075 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:45,076 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:45,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1848221154, now seen corresponding path program 1 times [2025-04-26 16:23:45,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:45,076 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687898116] [2025-04-26 16:23:45,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:45,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:45,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:23:45,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:23:45,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:45,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:45,118 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:45,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:23:45,118 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687898116] [2025-04-26 16:23:45,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687898116] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:23:45,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:23:45,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:23:45,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596423240] [2025-04-26 16:23:45,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:23:45,147 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:45,147 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:45,147 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:45,147 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:45,147 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:23:45,147 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:45,147 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:45,147 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:45,147 INFO L132 ssoRankerPreferences]: Filename of dumped script: mult-4.wvr.bpl_petrified1_Iteration2_Loop [2025-04-26 16:23:45,147 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:45,147 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:45,148 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:45,153 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:45,185 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:45,185 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:23:45,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:45,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:45,188 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:45,189 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:45,191 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:23:45,191 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:23:45,210 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:23:45,210 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {counter=1, C=0} Honda state: {counter=1, C=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:23:45,218 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 16:23:45,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:45,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:45,220 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:45,221 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:45,227 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:23:45,227 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:23:45,245 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:45,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:45,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:45,247 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:45,248 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:45,249 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:23:45,249 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:23:45,322 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:23:45,326 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 16:23:45,327 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:45,327 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:45,327 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:45,327 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:45,327 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:45,327 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:45,327 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:45,327 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:45,327 INFO L132 ssoRankerPreferences]: Filename of dumped script: mult-4.wvr.bpl_petrified1_Iteration2_Loop [2025-04-26 16:23:45,327 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:45,327 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:45,328 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:45,336 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:45,367 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:45,367 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:45,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:45,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:45,369 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:45,370 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:45,372 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:45,382 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:45,382 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:23:45,383 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:45,383 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:45,383 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:45,384 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:23:45,384 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:23:45,386 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:45,392 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:45,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:45,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:45,395 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:45,396 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:45,397 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:45,407 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:45,407 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:23:45,407 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:45,407 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:45,407 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:45,408 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:23:45,408 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:23:45,410 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:45,416 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:23:45,417 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:23:45,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:45,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:45,419 INFO L229 MonitoredProcess]: Starting monitored process 13 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:45,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 16:23:45,421 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:45,424 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Exception during sending of exit command (exit): Broken pipe [2025-04-26 16:23:45,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 16:23:45,425 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:23:45,425 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:45,425 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i2, N2) = -1*i2 + 1*N2 Supporting invariants [] [2025-04-26 16:23:45,431 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:45,432 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:23:45,446 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:45,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:23:45,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:23:45,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:45,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:45,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:45,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:45,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:45,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:45,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:45,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:45,476 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:45,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:45,488 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:45,489 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:45,489 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 613 states and 2685 transitions. cyclomatic complexity: 2229 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 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:45,569 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 613 states and 2685 transitions. cyclomatic complexity: 2229. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 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 1883 states and 8638 transitions. Complement of second has 6 states. [2025-04-26 16:23:45,569 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:45,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 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:45,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2025-04-26 16:23:45,570 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 63 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 16:23:45,570 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:45,570 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 63 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 16:23:45,570 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:45,570 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 63 transitions. Stem has 6 letters. Loop has 4 letters. [2025-04-26 16:23:45,570 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:45,570 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1883 states and 8638 transitions. [2025-04-26 16:23:45,608 INFO L131 ngComponentsAnalysis]: Automaton has 122 accepting balls. 286 [2025-04-26 16:23:45,623 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1883 states to 1281 states and 5873 transitions. [2025-04-26 16:23:45,623 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 463 [2025-04-26 16:23:45,626 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 702 [2025-04-26 16:23:45,626 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1281 states and 5873 transitions. [2025-04-26 16:23:45,626 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:45,626 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1281 states and 5873 transitions. [2025-04-26 16:23:45,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1281 states and 5873 transitions. [2025-04-26 16:23:45,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1281 to 1042. [2025-04-26 16:23:45,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1042 states, 1042 states have (on average 4.780230326295586) internal successors, (in total 4981), 1041 states have internal predecessors, (4981), 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:45,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 4981 transitions. [2025-04-26 16:23:45,669 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1042 states and 4981 transitions. [2025-04-26 16:23:45,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:23:45,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:23:45,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:23:45,671 INFO L87 Difference]: Start difference. First operand 1042 states and 4981 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (in total 8), 3 states have internal predecessors, (8), 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:45,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:23:45,725 INFO L93 Difference]: Finished difference Result 1746 states and 7248 transitions. [2025-04-26 16:23:45,726 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1746 states and 7248 transitions. [2025-04-26 16:23:45,742 INFO L131 ngComponentsAnalysis]: Automaton has 122 accepting balls. 286 [2025-04-26 16:23:45,755 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1746 states to 1572 states and 6715 transitions. [2025-04-26 16:23:45,755 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 685 [2025-04-26 16:23:45,757 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 685 [2025-04-26 16:23:45,757 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1572 states and 6715 transitions. [2025-04-26 16:23:45,757 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:45,757 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1572 states and 6715 transitions. [2025-04-26 16:23:45,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states and 6715 transitions. [2025-04-26 16:23:45,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1456. [2025-04-26 16:23:45,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1456 states, 1456 states have (on average 4.366071428571429) internal successors, (in total 6357), 1455 states have internal predecessors, (6357), 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:45,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1456 states to 1456 states and 6357 transitions. [2025-04-26 16:23:45,822 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1456 states and 6357 transitions. [2025-04-26 16:23:45,822 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:23:45,823 INFO L438 stractBuchiCegarLoop]: Abstraction has 1456 states and 6357 transitions. [2025-04-26 16:23:45,823 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:23:45,823 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1456 states and 6357 transitions. [2025-04-26 16:23:45,833 INFO L131 ngComponentsAnalysis]: Automaton has 122 accepting balls. 286 [2025-04-26 16:23:45,833 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:45,833 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:45,834 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:45,834 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:23:45,835 INFO L752 eck$LassoCheckResult]: Stem: "[81] $Ultimate##0-->L70: Formula: (and (= v_i2_5 v_i1_5) (= v_i1_5 0) (= v_i1_5 v_j1_1) (= v_i1_5 v_j2_1)) InVars {i1=v_i1_5, j2=v_j2_1, i2=v_i2_5, j1=v_j1_1} OutVars{i1=v_i1_5, j2=v_j2_1, i2=v_i2_5, j1=v_j1_1} AuxVars[] AssignedVars[]" "[85] L70-->L71: Formula: (= v_counter_6 0) InVars {counter=v_counter_6} OutVars{counter=v_counter_6} AuxVars[] AssignedVars[]" "[60] L71-->L72: Formula: (and (= v_M2_1 v_N1_3) (= v_N2_3 v_N1_3) (= v_M1_1 v_N1_3)) InVars {N2=v_N2_3, M1=v_M1_1, M2=v_M2_1, N1=v_N1_3} OutVars{N2=v_N2_3, M1=v_M1_1, M2=v_M2_1, N1=v_N1_3} AuxVars[] AssignedVars[]" "[84] L72-->L73: Formula: (< 0 v_C_3) InVars {C=v_C_3} OutVars{C=v_C_3} AuxVars[] AssignedVars[]" "[106] L73-->L24-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[89] L24-1-->L24: Formula: (< v_i1_1 v_N1_1) InVars {i1=v_i1_1, N1=v_N1_1} OutVars{i1=v_i1_1, N1=v_N1_1} AuxVars[] AssignedVars[]" "[91] L24-->L24-1: Formula: (and (= v_i1_6 (+ v_i1_7 1)) (= v_counter_13 (+ v_counter_14 v_C_6))) InVars {i1=v_i1_7, counter=v_counter_14, C=v_C_6} OutVars{i1=v_i1_6, counter=v_counter_13, C=v_C_6} AuxVars[] AssignedVars[counter, i1]" "[109] L73-1-->L35-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]" "[112] L74-->L47-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:45,835 INFO L754 eck$LassoCheckResult]: Loop: "[97] L47-1-->L47: Formula: (< v_j1_2 v_M1_2) InVars {M1=v_M1_2, j1=v_j1_2} OutVars{M1=v_M1_2, j1=v_j1_2} AuxVars[] AssignedVars[]" "[99] L47-->L47-1: Formula: (and (= v_j1_6 (+ v_j1_7 1)) (= v_counter_25 (+ v_counter_26 v_C_12))) InVars {counter=v_counter_26, C=v_C_12, j1=v_j1_7} OutVars{counter=v_counter_25, C=v_C_12, j1=v_j1_6} AuxVars[] AssignedVars[counter, j1]" [2025-04-26 16:23:45,835 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:45,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1459683730, now seen corresponding path program 1 times [2025-04-26 16:23:45,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:45,835 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842317636] [2025-04-26 16:23:45,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:45,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:45,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:23:45,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:23:45,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:45,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:45,842 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:45,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:23:45,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:23:45,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:45,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:45,850 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:45,850 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:45,850 INFO L85 PathProgramCache]: Analyzing trace with hash 4067, now seen corresponding path program 1 times [2025-04-26 16:23:45,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:45,851 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802174619] [2025-04-26 16:23:45,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:45,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:45,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:45,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:45,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:45,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:45,853 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:45,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:45,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:45,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:45,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:45,855 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:45,856 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:45,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1698238156, now seen corresponding path program 1 times [2025-04-26 16:23:45,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:45,856 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169043741] [2025-04-26 16:23:45,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:45,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:45,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:23:45,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:23:45,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:45,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:45,863 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:45,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:23:45,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:23:45,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:45,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:45,870 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:45,896 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:45,896 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:45,896 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:45,896 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:45,896 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:23:45,896 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:45,896 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:45,896 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:45,896 INFO L132 ssoRankerPreferences]: Filename of dumped script: mult-4.wvr.bpl_petrified1_Iteration3_Loop [2025-04-26 16:23:45,896 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:45,896 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:45,897 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:45,902 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:45,924 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:45,924 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:23:45,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:45,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:45,926 INFO L229 MonitoredProcess]: Starting monitored process 14 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:45,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 16:23:45,929 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:23:45,929 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:23:45,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:45,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:45,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:45,949 INFO L229 MonitoredProcess]: Starting monitored process 15 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:45,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 16:23:45,952 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:23:45,952 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:23:46,013 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:23:46,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:46,017 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:46,017 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:46,017 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:46,017 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:46,017 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:46,018 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:46,018 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:46,018 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:46,018 INFO L132 ssoRankerPreferences]: Filename of dumped script: mult-4.wvr.bpl_petrified1_Iteration3_Loop [2025-04-26 16:23:46,018 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:46,018 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:46,019 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:46,028 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:46,050 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:46,050 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:46,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:46,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:46,052 INFO L229 MonitoredProcess]: Starting monitored process 16 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:46,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 16:23:46,056 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:46,069 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:46,069 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:23:46,069 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:46,069 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:46,069 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:46,070 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:23:46,070 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:23:46,071 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:46,073 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:23:46,073 INFO L437 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:23:46,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:46,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:46,075 INFO L229 MonitoredProcess]: Starting monitored process 17 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:46,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 16:23:46,077 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:46,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:46,080 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:23:46,080 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:46,080 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(M1, j1) = 1*M1 - 1*j1 Supporting invariants [] [2025-04-26 16:23:46,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:46,088 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:23:46,101 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:46,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:23:46,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:23:46,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:46,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:46,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:46,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:46,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:46,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:46,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:46,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:46,134 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:46,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:46,146 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:46,147 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:46,147 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1456 states and 6357 transitions. cyclomatic complexity: 5110 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 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:46,235 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1456 states and 6357 transitions. cyclomatic complexity: 5110. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 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 4085 states and 18691 transitions. Complement of second has 6 states. [2025-04-26 16:23:46,236 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:46,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (in total 11), 3 states have internal predecessors, (11), 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:46,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2025-04-26 16:23:46,236 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 67 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 16:23:46,236 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:46,236 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 67 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 16:23:46,236 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:46,236 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 67 transitions. Stem has 9 letters. Loop has 4 letters. [2025-04-26 16:23:46,237 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:46,237 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4085 states and 18691 transitions. [2025-04-26 16:23:46,307 INFO L131 ngComponentsAnalysis]: Automaton has 85 accepting balls. 170 [2025-04-26 16:23:46,330 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4085 states to 2244 states and 10225 transitions. [2025-04-26 16:23:46,331 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 567 [2025-04-26 16:23:46,332 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 740 [2025-04-26 16:23:46,332 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2244 states and 10225 transitions. [2025-04-26 16:23:46,332 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:46,332 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2244 states and 10225 transitions. [2025-04-26 16:23:46,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2244 states and 10225 transitions. [2025-04-26 16:23:46,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2244 to 1967. [2025-04-26 16:23:46,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1967 states, 1967 states have (on average 4.64616166751398) internal successors, (in total 9139), 1966 states have internal predecessors, (9139), 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:46,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1967 states to 1967 states and 9139 transitions. [2025-04-26 16:23:46,378 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1967 states and 9139 transitions. [2025-04-26 16:23:46,378 INFO L438 stractBuchiCegarLoop]: Abstraction has 1967 states and 9139 transitions. [2025-04-26 16:23:46,378 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:23:46,378 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1967 states and 9139 transitions. [2025-04-26 16:23:46,404 INFO L131 ngComponentsAnalysis]: Automaton has 85 accepting balls. 170 [2025-04-26 16:23:46,405 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:46,405 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:46,405 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:46,405 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:23:46,406 INFO L752 eck$LassoCheckResult]: Stem: "[81] $Ultimate##0-->L70: Formula: (and (= v_i2_5 v_i1_5) (= v_i1_5 0) (= v_i1_5 v_j1_1) (= v_i1_5 v_j2_1)) InVars {i1=v_i1_5, j2=v_j2_1, i2=v_i2_5, j1=v_j1_1} OutVars{i1=v_i1_5, j2=v_j2_1, i2=v_i2_5, j1=v_j1_1} AuxVars[] AssignedVars[]" "[85] L70-->L71: Formula: (= v_counter_6 0) InVars {counter=v_counter_6} OutVars{counter=v_counter_6} AuxVars[] AssignedVars[]" "[60] L71-->L72: Formula: (and (= v_M2_1 v_N1_3) (= v_N2_3 v_N1_3) (= v_M1_1 v_N1_3)) InVars {N2=v_N2_3, M1=v_M1_1, M2=v_M2_1, N1=v_N1_3} OutVars{N2=v_N2_3, M1=v_M1_1, M2=v_M2_1, N1=v_N1_3} AuxVars[] AssignedVars[]" "[84] L72-->L73: Formula: (< 0 v_C_3) InVars {C=v_C_3} OutVars{C=v_C_3} AuxVars[] AssignedVars[]" "[106] L73-->L24-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[89] L24-1-->L24: Formula: (< v_i1_1 v_N1_1) InVars {i1=v_i1_1, N1=v_N1_1} OutVars{i1=v_i1_1, N1=v_N1_1} AuxVars[] AssignedVars[]" "[91] L24-->L24-1: Formula: (and (= v_i1_6 (+ v_i1_7 1)) (= v_counter_13 (+ v_counter_14 v_C_6))) InVars {i1=v_i1_7, counter=v_counter_14, C=v_C_6} OutVars{i1=v_i1_6, counter=v_counter_13, C=v_C_6} AuxVars[] AssignedVars[counter, i1]" "[109] L73-1-->L35-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]" "[112] L74-->L47-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]" "[115] L75-->L58-1: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2]" [2025-04-26 16:23:46,406 INFO L754 eck$LassoCheckResult]: Loop: "[101] L58-1-->L58: Formula: (< v_j2_3 v_M2_3) InVars {j2=v_j2_3, M2=v_M2_3} OutVars{j2=v_j2_3, M2=v_M2_3} AuxVars[] AssignedVars[]" "[103] L58-->L58-1: Formula: (and (< 0 v_counter_34) (= v_counter_34 (+ v_counter_33 v_C_16)) (= (+ v_j2_11 1) v_j2_10)) InVars {j2=v_j2_11, counter=v_counter_34, C=v_C_16} OutVars{j2=v_j2_10, counter=v_counter_33, C=v_C_16} AuxVars[] AssignedVars[counter, j2]" [2025-04-26 16:23:46,406 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:46,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1994444511, now seen corresponding path program 1 times [2025-04-26 16:23:46,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:46,407 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917614551] [2025-04-26 16:23:46,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:46,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:46,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:23:46,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:46,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:46,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:46,416 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:46,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:23:46,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:46,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:46,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:46,426 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:46,426 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:46,426 INFO L85 PathProgramCache]: Analyzing trace with hash 4195, now seen corresponding path program 1 times [2025-04-26 16:23:46,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:46,426 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438682189] [2025-04-26 16:23:46,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:46,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:46,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:46,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:46,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:46,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:46,433 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:46,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:46,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:46,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:46,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:46,436 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:46,436 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:46,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1105757821, now seen corresponding path program 1 times [2025-04-26 16:23:46,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:46,436 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120232083] [2025-04-26 16:23:46,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:46,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:46,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:23:46,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:23:46,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:46,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:46,442 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:46,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:23:46,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:23:46,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:46,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:46,448 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:46,475 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:46,475 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:46,475 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:46,475 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:46,475 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:23:46,475 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:46,475 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:46,475 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:46,475 INFO L132 ssoRankerPreferences]: Filename of dumped script: mult-4.wvr.bpl_petrified1_Iteration4_Loop [2025-04-26 16:23:46,476 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:46,476 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:46,477 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:46,483 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:46,514 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:46,515 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:23:46,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:46,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:46,517 INFO L229 MonitoredProcess]: Starting monitored process 18 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:46,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 16:23:46,520 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:23:46,520 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:23:46,538 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:23:46,539 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {counter=1, C=0} Honda state: {counter=1, C=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:23:46,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:46,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:46,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:46,547 INFO L229 MonitoredProcess]: Starting monitored process 19 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:46,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 16:23:46,549 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:23:46,549 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:23:46,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:46,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:46,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:46,570 INFO L229 MonitoredProcess]: Starting monitored process 20 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:46,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 16:23:46,571 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:23:46,571 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:23:46,634 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:23:46,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-04-26 16:23:46,639 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:46,639 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:46,639 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:46,639 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:46,639 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:46,639 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:46,639 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:46,639 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:46,639 INFO L132 ssoRankerPreferences]: Filename of dumped script: mult-4.wvr.bpl_petrified1_Iteration4_Loop [2025-04-26 16:23:46,639 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:46,639 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:46,640 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:46,645 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:46,670 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:46,670 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:46,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:46,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:46,673 INFO L229 MonitoredProcess]: Starting monitored process 21 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:46,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 16:23:46,675 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:46,686 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:46,686 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:23:46,686 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:46,686 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:46,686 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:46,687 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:23:46,687 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:23:46,689 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:46,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:46,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:46,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:46,697 INFO L229 MonitoredProcess]: Starting monitored process 22 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:46,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 16:23:46,700 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:46,710 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:46,710 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:23:46,710 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:46,710 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:46,710 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:46,711 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:23:46,711 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:23:46,715 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:46,718 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:23:46,718 INFO L437 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:23:46,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:46,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:46,721 INFO L229 MonitoredProcess]: Starting monitored process 23 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:46,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 16:23:46,722 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:46,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-04-26 16:23:46,726 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:23:46,726 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:46,726 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(M2, j2) = 1*M2 - 1*j2 Supporting invariants [] [2025-04-26 16:23:46,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:46,732 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:23:46,743 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:46,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:23:46,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:23:46,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:46,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:46,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:46,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:46,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:46,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:46,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:46,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:46,776 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:46,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:46,798 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:46,799 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:46,799 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1967 states and 9139 transitions. cyclomatic complexity: 7408 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 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:46,897 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1967 states and 9139 transitions. cyclomatic complexity: 7408. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 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 4731 states and 22442 transitions. Complement of second has 6 states. [2025-04-26 16:23:46,897 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:46,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (in total 12), 3 states have internal predecessors, (12), 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:46,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2025-04-26 16:23:46,900 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 68 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 16:23:46,900 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:46,900 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 68 transitions. Stem has 12 letters. Loop has 2 letters. [2025-04-26 16:23:46,900 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:46,900 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 68 transitions. Stem has 10 letters. Loop has 4 letters. [2025-04-26 16:23:46,900 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:46,900 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4731 states and 22442 transitions. [2025-04-26 16:23:46,962 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:23:46,962 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4731 states to 0 states and 0 transitions. [2025-04-26 16:23:46,962 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:23:46,962 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:23:46,962 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:23:46,962 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:23:46,962 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:23:46,963 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:23:46,963 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:23:46,963 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:23:46,963 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:23:46,963 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:23:46,963 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:23:46,968 INFO L201 PluginConnector]: Adding new model mult-4.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:23:46 BoogieIcfgContainer [2025-04-26 16:23:46,969 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:23:46,969 INFO L158 Benchmark]: Toolchain (without parser) took 3472.18ms. Allocated memory was 159.4MB in the beginning and 213.9MB in the end (delta: 54.5MB). Free memory was 87.3MB in the beginning and 78.3MB in the end (delta: 9.0MB). Peak memory consumption was 64.7MB. Max. memory is 8.0GB. [2025-04-26 16:23:46,970 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.74ms. Allocated memory is still 159.4MB. Free memory is still 88.3MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:23:46,970 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.46ms. Allocated memory is still 159.4MB. Free memory was 87.2MB in the beginning and 85.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:23:46,971 INFO L158 Benchmark]: Boogie Preprocessor took 28.42ms. Allocated memory is still 159.4MB. Free memory was 85.4MB in the beginning and 84.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:23:46,972 INFO L158 Benchmark]: RCFGBuilder took 238.40ms. Allocated memory is still 159.4MB. Free memory was 84.3MB in the beginning and 73.7MB in the end (delta: 10.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 16:23:46,972 INFO L158 Benchmark]: BuchiAutomizer took 3163.63ms. Allocated memory was 159.4MB in the beginning and 213.9MB in the end (delta: 54.5MB). Free memory was 73.6MB in the beginning and 78.3MB in the end (delta: -4.7MB). Peak memory consumption was 52.1MB. Max. memory is 8.0GB. [2025-04-26 16:23:46,973 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.74ms. Allocated memory is still 159.4MB. Free memory is still 88.3MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.46ms. Allocated memory is still 159.4MB. Free memory was 87.2MB in the beginning and 85.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 28.42ms. Allocated memory is still 159.4MB. Free memory was 85.4MB in the beginning and 84.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 238.40ms. Allocated memory is still 159.4MB. Free memory was 84.3MB in the beginning and 73.7MB in the end (delta: 10.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 3163.63ms. Allocated memory was 159.4MB in the beginning and 213.9MB in the end (delta: 54.5MB). Free memory was 73.6MB in the beginning and 78.3MB in the end (delta: -4.7MB). Peak memory consumption was 52.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.0s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 860 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 204 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 200 mSDsluCounter, 258 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 131 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 199 IncrementalHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 127 mSDtfsCounter, 199 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT3 conc0 concLT1 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax100 hnf100 lsp65 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 26ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 3 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (1 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function N1 + -1 * i1 and consists of 5 locations. One deterministic module has affine ranking function -1 * i2 + N2 and consists of 4 locations. One deterministic module has affine ranking function -1 * j1 + M1 and consists of 4 locations. One deterministic module has affine ranking function -1 * j2 + M2 and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:23:46,985 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...