/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/parallel/misc-4.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:22:41,016 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:22:41,061 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:22:41,065 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:22:41,065 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:22:41,087 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:22:41,087 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:22:41,087 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:22:41,088 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:22:41,088 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:22:41,088 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:22:41,088 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:22:41,088 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:22:41,088 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:22:41,088 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:22:41,088 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:22:41,088 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:22:41,088 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:22:41,088 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:22:41,088 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:22:41,088 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:22:41,088 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:22:41,089 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:22:41,089 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:22:41,089 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:22:41,089 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:22:41,089 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:22:41,089 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:22:41,089 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:22:41,089 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:22:41,089 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:22:41,089 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:22:41,089 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:22:41,089 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:22:41,089 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:22:41,091 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:22:41,091 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:22:41,321 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:22:41,328 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:22:41,330 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:22:41,331 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:22:41,331 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:22:41,332 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/misc-4.wvr.bpl [2025-04-26 16:22:41,333 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/parallel/misc-4.wvr.bpl' [2025-04-26 16:22:41,352 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:22:41,353 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:22:41,354 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:22:41,354 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:22:41,354 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:22:41,361 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "misc-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:41" (1/1) ... [2025-04-26 16:22:41,382 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "misc-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:41" (1/1) ... [2025-04-26 16:22:41,386 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:22:41,388 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:22:41,389 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:22:41,389 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:22:41,389 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:22:41,394 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "misc-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:41" (1/1) ... [2025-04-26 16:22:41,395 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "misc-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:41" (1/1) ... [2025-04-26 16:22:41,396 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "misc-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:41" (1/1) ... [2025-04-26 16:22:41,396 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "misc-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:41" (1/1) ... [2025-04-26 16:22:41,397 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "misc-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:41" (1/1) ... [2025-04-26 16:22:41,399 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "misc-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:41" (1/1) ... [2025-04-26 16:22:41,402 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "misc-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:41" (1/1) ... [2025-04-26 16:22:41,402 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "misc-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:41" (1/1) ... [2025-04-26 16:22:41,402 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "misc-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:41" (1/1) ... [2025-04-26 16:22:41,412 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:22:41,413 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:22:41,413 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:22:41,413 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:22:41,417 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "misc-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:41" (1/1) ... [2025-04-26 16:22:41,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:41,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:41,439 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:22:41,445 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:22:41,459 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:22:41,460 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:22:41,460 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:22:41,460 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:22:41,460 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:22:41,460 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:22:41,460 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:22:41,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:22:41,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:22:41,460 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:22:41,460 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:22:41,460 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:22:41,461 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:22:41,494 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:22:41,496 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:22:41,566 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:22:41,566 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:22:41,574 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:22:41,574 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:22:41,576 INFO L201 PluginConnector]: Adding new model misc-4.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:22:41 BoogieIcfgContainer [2025-04-26 16:22:41,576 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:22:41,577 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:22:41,577 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:22:41,582 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:22:41,583 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:22:41,583 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "misc-4.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:22:41" (1/2) ... [2025-04-26 16:22:41,584 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4ac9251a and model type misc-4.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:22:41, skipping insertion in model container [2025-04-26 16:22:41,584 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:22:41,584 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "misc-4.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:22:41" (2/2) ... [2025-04-26 16:22:41,586 INFO L376 chiAutomizerObserver]: Analyzing ICFG misc-4.wvr.bpl [2025-04-26 16:22:41,633 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 16:22:41,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 34 transitions, 89 flow [2025-04-26 16:22:41,685 INFO L116 PetriNetUnfolderBase]: 4/28 cut-off events. [2025-04-26 16:22:41,688 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 16:22:41,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 28 events. 4/28 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 54 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 24. Up to 2 conditions per place. [2025-04-26 16:22:41,693 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 34 transitions, 89 flow [2025-04-26 16:22:41,698 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 28 transitions, 74 flow [2025-04-26 16:22:41,698 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 34 places, 28 transitions, 74 flow [2025-04-26 16:22:41,708 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:22:41,709 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:22:41,709 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:22:41,709 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:22:41,709 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:22:41,709 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:22:41,709 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:22:41,709 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:22:41,710 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:22:41,799 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 200 [2025-04-26 16:22:41,801 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:41,801 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:41,804 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:22:41,805 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:22:41,805 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:22:41,805 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 232 states, but on-demand construction may add more states [2025-04-26 16:22:41,819 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 200 [2025-04-26 16:22:41,820 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:41,820 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:41,820 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:22:41,820 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:22:41,827 INFO L752 eck$LassoCheckResult]: Stem: "[64] $Ultimate##0-->L56: Formula: (and (or (and v_d2_5 v_d1_5) (and (not v_d2_5) (not v_d1_5))) v_d1_5 (= v_pos_9 0) v_v_assert_5) InVars {pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} OutVars{pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} AuxVars[] AssignedVars[]" "[96] L56-->L17: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0]" [2025-04-26 16:22:41,827 INFO L754 eck$LassoCheckResult]: Loop: "[71] L17-->L18: Formula: v_v_assert_1 InVars {v_assert=v_v_assert_1} OutVars{v_assert=v_v_assert_1} AuxVars[] AssignedVars[]" "[73] L18-->L19: Formula: v_d1_1 InVars {d1=v_d1_1} OutVars{d1=v_d1_1} AuxVars[] AssignedVars[]" "[75] L19-->L18-2: Formula: (= (+ v_pos_2 1) v_pos_1) InVars {pos=v_pos_2} OutVars{pos=v_pos_1} AuxVars[] AssignedVars[pos]" "[77] L18-2-->L17: Formula: (or (and v_d1_3 (not v_d1_4)) (and (not v_d1_3) v_d1_4)) InVars {d1=v_d1_4} OutVars{d1=v_d1_3} AuxVars[] AssignedVars[d1]" [2025-04-26 16:22:41,832 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:41,833 INFO L85 PathProgramCache]: Analyzing trace with hash 3041, now seen corresponding path program 1 times [2025-04-26 16:22:41,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:41,839 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130960345] [2025-04-26 16:22:41,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:41,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:41,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:22:41,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:22:41,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:41,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:41,891 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:41,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:22:41,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:22:41,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:41,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:41,909 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:41,912 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:41,912 INFO L85 PathProgramCache]: Analyzing trace with hash 3111237, now seen corresponding path program 1 times [2025-04-26 16:22:41,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:41,912 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706201195] [2025-04-26 16:22:41,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:41,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:41,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:22:41,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:22:41,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:41,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:41,922 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:41,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:22:41,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:22:41,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:41,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:41,930 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:41,931 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:41,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1484352219, now seen corresponding path program 1 times [2025-04-26 16:22:41,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:41,931 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692723129] [2025-04-26 16:22:41,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:41,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:41,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:22:41,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:22:41,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:41,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:41,939 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:41,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:22:41,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:22:41,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:41,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:41,943 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:42,023 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:42,023 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:42,023 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:42,023 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:42,023 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:22:42,023 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:42,024 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:42,024 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:42,024 INFO L132 ssoRankerPreferences]: Filename of dumped script: misc-4.wvr.bpl_petrified1_Iteration1_Loop [2025-04-26 16:22:42,024 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:42,024 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:42,037 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:42,046 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:42,053 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:42,105 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:42,105 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:22:42,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:42,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:42,109 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:22:42,110 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:22:42,112 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:22:42,112 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:22:42,134 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:22:42,135 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep(ite v_assert 1 0)_1=1} Honda state: {v_rep(ite v_assert 1 0)_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:22:42,141 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:22:42,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:42,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:42,143 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:22:42,145 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:22:42,146 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:22:42,146 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:22:42,164 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:22:42,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:42,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:42,166 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:22:42,168 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:22:42,168 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:22:42,168 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:22:42,194 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:22:42,194 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {pos=0} Honda state: {pos=0} Generalized eigenvectors: [{pos=-3}, {pos=2}, {pos=2}] Lambdas: [1, 0, 1] Nus: [0, 1] [2025-04-26 16:22:42,200 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:22:42,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:42,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:42,202 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:22:42,202 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:22:42,203 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:22:42,203 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:22:42,221 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:22:42,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:42,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:42,223 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:22:42,223 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:22:42,225 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:22:42,225 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:22:42,249 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:22:42,253 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:22:42,253 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:42,253 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:42,253 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:42,254 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:42,254 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:42,254 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:42,254 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:42,254 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:42,254 INFO L132 ssoRankerPreferences]: Filename of dumped script: misc-4.wvr.bpl_petrified1_Iteration1_Loop [2025-04-26 16:22:42,254 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:42,254 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:42,255 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:42,257 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:42,261 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:42,298 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:42,301 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:42,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:42,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:42,308 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:22:42,309 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:22:42,311 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:22:42,322 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:42,322 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:42,323 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:42,323 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:42,323 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:42,325 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:22:42,325 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:42,327 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:42,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:42,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:42,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:42,336 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:22:42,337 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:22:42,338 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:22:42,348 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:42,348 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:42,349 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:42,349 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:42,349 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:42,349 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:22:42,349 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:42,373 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:42,379 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:22:42,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:42,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:42,381 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:22:42,382 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:22:42,384 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:22:42,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:42,394 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:42,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:42,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:42,394 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:42,395 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:22:42,395 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:42,397 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:42,401 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:22:42,401 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:22:42,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:42,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:42,404 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:22:42,406 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:22:42,407 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:42,410 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:22:42,410 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:22:42,411 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:42,411 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(ite d1 1 0)_2) = 1*v_rep(ite d1 1 0)_2 Supporting invariants [] [2025-04-26 16:22:42,416 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:22:42,419 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:22:42,437 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:42,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:22:42,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:22:42,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:42,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:42,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:22:42,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:42,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:22:42,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:22:42,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:42,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:42,461 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:22:42,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:42,521 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:22:42,554 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:22:42,556 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 232 states, but on-demand construction may add more states Second operand has 4 states, 4 states have (on average 1.5) internal successors, (in total 6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:22:42,673 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 232 states, but on-demand construction may add more states. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (in total 6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 863 states and 2665 transitions. Complement of second has 8 states. [2025-04-26 16:22:42,675 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:22:42,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (in total 6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:22:42,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2025-04-26 16:22:42,685 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 16:22:42,686 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:42,686 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 6 letters. Loop has 4 letters. [2025-04-26 16:22:42,687 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:42,687 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 54 transitions. Stem has 2 letters. Loop has 8 letters. [2025-04-26 16:22:42,687 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:42,687 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 863 states and 2665 transitions. [2025-04-26 16:22:42,703 INFO L131 ngComponentsAnalysis]: Automaton has 59 accepting balls. 375 [2025-04-26 16:22:42,718 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 863 states to 639 states and 2010 transitions. [2025-04-26 16:22:42,719 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 417 [2025-04-26 16:22:42,724 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 495 [2025-04-26 16:22:42,724 INFO L74 IsDeterministic]: Start isDeterministic. Operand 639 states and 2010 transitions. [2025-04-26 16:22:42,725 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:42,725 INFO L218 hiAutomatonCegarLoop]: Abstraction has 639 states and 2010 transitions. [2025-04-26 16:22:42,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states and 2010 transitions. [2025-04-26 16:22:42,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 448. [2025-04-26 16:22:42,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 448 states have (on average 3.2120535714285716) internal successors, (in total 1439), 447 states have internal predecessors, (1439), 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:22:42,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 1439 transitions. [2025-04-26 16:22:42,766 INFO L240 hiAutomatonCegarLoop]: Abstraction has 448 states and 1439 transitions. [2025-04-26 16:22:42,766 INFO L438 stractBuchiCegarLoop]: Abstraction has 448 states and 1439 transitions. [2025-04-26 16:22:42,766 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:22:42,766 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 448 states and 1439 transitions. [2025-04-26 16:22:42,769 INFO L131 ngComponentsAnalysis]: Automaton has 40 accepting balls. 280 [2025-04-26 16:22:42,769 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:42,769 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:42,769 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:22:42,769 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:22:42,770 INFO L752 eck$LassoCheckResult]: Stem: "[64] $Ultimate##0-->L56: Formula: (and (or (and v_d2_5 v_d1_5) (and (not v_d2_5) (not v_d1_5))) v_d1_5 (= v_pos_9 0) v_v_assert_5) InVars {pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} OutVars{pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} AuxVars[] AssignedVars[]" "[96] L56-->L17: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0]" "[90] L56-1-->L33: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" [2025-04-26 16:22:42,770 INFO L754 eck$LassoCheckResult]: Loop: "[79] L33-->L34: Formula: v_v_assert_3 InVars {v_assert=v_v_assert_3} OutVars{v_assert=v_v_assert_3} AuxVars[] AssignedVars[]" "[82] L34-->L39: Formula: (not v_d2_2) InVars {d2=v_d2_2} OutVars{d2=v_d2_2} AuxVars[] AssignedVars[]" "[84] L39-->L34-2: Formula: (= v_pos_8 (+ 2 v_pos_7)) InVars {pos=v_pos_8} OutVars{pos=v_pos_7} AuxVars[] AssignedVars[pos]" "[85] L34-2-->L33: Formula: (or (and v_d2_3 (not v_d2_4)) (and v_d2_4 (not v_d2_3))) InVars {d2=v_d2_4} OutVars{d2=v_d2_3} AuxVars[] AssignedVars[d2]" [2025-04-26 16:22:42,770 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:42,770 INFO L85 PathProgramCache]: Analyzing trace with hash 94361, now seen corresponding path program 1 times [2025-04-26 16:22:42,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:42,770 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556552958] [2025-04-26 16:22:42,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:42,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:42,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:22:42,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:22:42,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:42,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:42,774 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:42,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:22:42,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:22:42,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:42,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:42,776 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:42,777 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:42,777 INFO L85 PathProgramCache]: Analyzing trace with hash 3358501, now seen corresponding path program 1 times [2025-04-26 16:22:42,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:42,777 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307805118] [2025-04-26 16:22:42,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:42,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:42,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:22:42,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:22:42,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:42,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:42,780 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:42,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:22:42,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:22:42,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:42,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:42,782 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:42,782 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:42,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1247454141, now seen corresponding path program 1 times [2025-04-26 16:22:42,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:42,783 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526067079] [2025-04-26 16:22:42,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:42,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:42,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:22:42,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:22:42,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:42,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:42,813 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:22:42,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:22:42,814 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526067079] [2025-04-26 16:22:42,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526067079] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:22:42,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:22:42,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:22:42,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15207029] [2025-04-26 16:22:42,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:22:42,864 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:42,865 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:42,865 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:42,865 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:42,865 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:22:42,865 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:42,865 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:42,865 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:42,865 INFO L132 ssoRankerPreferences]: Filename of dumped script: misc-4.wvr.bpl_petrified1_Iteration2_Loop [2025-04-26 16:22:42,865 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:42,865 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:42,865 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:42,873 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:42,875 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:42,900 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:42,901 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:22:42,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:42,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:42,903 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:22:42,903 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:22:42,904 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:22:42,904 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:22:42,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 16:22:42,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:42,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:42,922 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:22:42,923 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:22:42,924 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:22:42,924 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:22:42,947 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:22:42,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 16:22:42,954 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:42,954 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:42,954 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:42,954 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:42,954 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:42,954 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:42,954 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:42,954 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:42,954 INFO L132 ssoRankerPreferences]: Filename of dumped script: misc-4.wvr.bpl_petrified1_Iteration2_Loop [2025-04-26 16:22:42,954 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:42,954 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:42,956 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:42,960 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:42,963 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:42,986 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:42,986 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:42,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:42,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:42,988 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:22:42,990 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:22:42,991 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:22:43,001 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:43,001 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:43,001 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:43,001 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:43,001 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:43,002 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:22:43,002 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:43,004 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:43,006 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:22:43,006 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:22:43,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:43,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:43,008 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:22:43,009 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:22:43,010 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:43,013 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:22:43,013 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:22:43,013 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:43,013 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(ite d2 1 0)_2) = -2*v_rep(ite d2 1 0)_2 + 1 Supporting invariants [] [2025-04-26 16:22:43,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:43,019 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:22:43,034 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:43,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:22:43,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:22:43,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:43,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:43,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:22:43,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:43,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:22:43,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:22:43,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:43,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:43,051 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:22:43,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:43,093 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:22:43,094 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:22:43,094 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 448 states and 1439 transitions. cyclomatic complexity: 1044 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (in total 7), 4 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:22:43,163 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 448 states and 1439 transitions. cyclomatic complexity: 1044. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (in total 7), 4 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 1725 states and 5765 transitions. Complement of second has 7 states. [2025-04-26 16:22:43,166 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:22:43,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (in total 7), 4 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:22:43,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2025-04-26 16:22:43,167 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 57 transitions. Stem has 3 letters. Loop has 4 letters. [2025-04-26 16:22:43,167 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:43,167 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 57 transitions. Stem has 7 letters. Loop has 4 letters. [2025-04-26 16:22:43,167 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:43,167 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 57 transitions. Stem has 3 letters. Loop has 8 letters. [2025-04-26 16:22:43,167 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:43,167 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1725 states and 5765 transitions. [2025-04-26 16:22:43,184 INFO L131 ngComponentsAnalysis]: Automaton has 72 accepting balls. 440 [2025-04-26 16:22:43,196 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1725 states to 1417 states and 4741 transitions. [2025-04-26 16:22:43,196 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 664 [2025-04-26 16:22:43,198 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 785 [2025-04-26 16:22:43,198 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1417 states and 4741 transitions. [2025-04-26 16:22:43,198 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:43,198 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1417 states and 4741 transitions. [2025-04-26 16:22:43,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1417 states and 4741 transitions. [2025-04-26 16:22:43,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1417 to 1066. [2025-04-26 16:22:43,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1066 states, 1066 states have (on average 3.451219512195122) internal successors, (in total 3679), 1065 states have internal predecessors, (3679), 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:22:43,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1066 states to 1066 states and 3679 transitions. [2025-04-26 16:22:43,241 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1066 states and 3679 transitions. [2025-04-26 16:22:43,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:22:43,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:22:43,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:22:43,244 INFO L87 Difference]: Start difference. First operand 1066 states and 3679 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 2 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:22:43,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:22:43,271 INFO L93 Difference]: Finished difference Result 913 states and 2852 transitions. [2025-04-26 16:22:43,272 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 913 states and 2852 transitions. [2025-04-26 16:22:43,279 INFO L131 ngComponentsAnalysis]: Automaton has 56 accepting balls. 407 [2025-04-26 16:22:43,284 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 913 states to 758 states and 2403 transitions. [2025-04-26 16:22:43,284 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 511 [2025-04-26 16:22:43,285 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 511 [2025-04-26 16:22:43,285 INFO L74 IsDeterministic]: Start isDeterministic. Operand 758 states and 2403 transitions. [2025-04-26 16:22:43,285 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:43,285 INFO L218 hiAutomatonCegarLoop]: Abstraction has 758 states and 2403 transitions. [2025-04-26 16:22:43,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states and 2403 transitions. [2025-04-26 16:22:43,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 582. [2025-04-26 16:22:43,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 582 states have (on average 3.2731958762886597) internal successors, (in total 1905), 581 states have internal predecessors, (1905), 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:22:43,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 1905 transitions. [2025-04-26 16:22:43,298 INFO L240 hiAutomatonCegarLoop]: Abstraction has 582 states and 1905 transitions. [2025-04-26 16:22:43,298 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:22:43,299 INFO L438 stractBuchiCegarLoop]: Abstraction has 582 states and 1905 transitions. [2025-04-26 16:22:43,299 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:22:43,299 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 582 states and 1905 transitions. [2025-04-26 16:22:43,302 INFO L131 ngComponentsAnalysis]: Automaton has 48 accepting balls. 320 [2025-04-26 16:22:43,302 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:43,302 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:43,303 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:22:43,303 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:22:43,303 INFO L752 eck$LassoCheckResult]: Stem: "[64] $Ultimate##0-->L56: Formula: (and (or (and v_d2_5 v_d1_5) (and (not v_d2_5) (not v_d1_5))) v_d1_5 (= v_pos_9 0) v_v_assert_5) InVars {pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} OutVars{pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} AuxVars[] AssignedVars[]" "[96] L56-->L17: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0]" "[71] L17-->L18: Formula: v_v_assert_1 InVars {v_assert=v_v_assert_1} OutVars{v_assert=v_v_assert_1} AuxVars[] AssignedVars[]" "[74] L18-->L23: Formula: (not v_d1_2) InVars {d1=v_d1_2} OutVars{d1=v_d1_2} AuxVars[] AssignedVars[]" [2025-04-26 16:22:43,303 INFO L754 eck$LassoCheckResult]: Loop: "[76] L23-->L18-2: Formula: (= v_pos_4 (+ v_pos_3 1)) InVars {pos=v_pos_4} OutVars{pos=v_pos_3} AuxVars[] AssignedVars[pos]" "[77] L18-2-->L17: Formula: (or (and v_d1_3 (not v_d1_4)) (and (not v_d1_3) v_d1_4)) InVars {d1=v_d1_4} OutVars{d1=v_d1_3} AuxVars[] AssignedVars[d1]" "[71] L17-->L18: Formula: v_v_assert_1 InVars {v_assert=v_v_assert_1} OutVars{v_assert=v_v_assert_1} AuxVars[] AssignedVars[]" "[74] L18-->L23: Formula: (not v_d1_2) InVars {d1=v_d1_2} OutVars{d1=v_d1_2} AuxVars[] AssignedVars[]" [2025-04-26 16:22:43,303 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:43,304 INFO L85 PathProgramCache]: Analyzing trace with hash 2924676, now seen corresponding path program 1 times [2025-04-26 16:22:43,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:43,304 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505387375] [2025-04-26 16:22:43,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:43,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:43,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:22:43,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:22:43,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:43,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:43,320 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:22:43,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:22:43,321 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505387375] [2025-04-26 16:22:43,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505387375] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:22:43,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:22:43,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-26 16:22:43,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222497631] [2025-04-26 16:22:43,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:22:43,321 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:22:43,321 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:43,321 INFO L85 PathProgramCache]: Analyzing trace with hash 3263909, now seen corresponding path program 1 times [2025-04-26 16:22:43,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:43,321 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041004104] [2025-04-26 16:22:43,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:43,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:43,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:22:43,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:22:43,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:43,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:43,325 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:43,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:22:43,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:22:43,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:43,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:43,327 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:43,371 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:43,371 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:43,371 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:43,371 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:43,371 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:22:43,371 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:43,371 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:43,371 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:43,372 INFO L132 ssoRankerPreferences]: Filename of dumped script: misc-4.wvr.bpl_petrified1_Iteration3_Loop [2025-04-26 16:22:43,372 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:43,372 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:43,372 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:43,374 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:43,378 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:43,398 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:43,399 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:22:43,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:43,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:43,401 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:22:43,402 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:22:43,403 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:22:43,403 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:22:43,422 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:22:43,422 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep(ite v_assert 1 0)_5=1} Honda state: {v_rep(ite v_assert 1 0)_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:22:43,430 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:22:43,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:43,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:43,432 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:22:43,434 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:22:43,435 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:22:43,435 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:22:43,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 16:22:43,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:43,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:43,454 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:22:43,455 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:22:43,457 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:22:43,457 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:22:43,480 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:22:43,484 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:22:43,484 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:43,484 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:43,484 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:43,484 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:43,485 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:43,485 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:43,485 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:43,485 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:43,485 INFO L132 ssoRankerPreferences]: Filename of dumped script: misc-4.wvr.bpl_petrified1_Iteration3_Loop [2025-04-26 16:22:43,485 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:43,485 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:43,485 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:43,489 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:43,492 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:43,520 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:43,521 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:43,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:43,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:43,523 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:22:43,524 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:22:43,525 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:22:43,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:43,535 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:43,535 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:43,535 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:43,536 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:43,536 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:22:43,536 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:43,537 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:43,543 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-04-26 16:22:43,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:43,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:43,545 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:22:43,546 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:22:43,547 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:22:43,558 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:43,558 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:43,558 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:43,558 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:43,558 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:43,559 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:22:43,559 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:43,560 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:43,562 INFO L436 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-04-26 16:22:43,562 INFO L437 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:22:43,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:43,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:43,563 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:22:43,565 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:22:43,566 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:43,569 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:22:43,569 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:22:43,569 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:43,569 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(ite d1 1 0)_4) = 1*v_rep(ite d1 1 0)_4 Supporting invariants [] [2025-04-26 16:22:43,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-04-26 16:22:43,576 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:22:43,588 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:43,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:22:43,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:22:43,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:43,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:43,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:22:43,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:43,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:22:43,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:22:43,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:43,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:43,599 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:22:43,600 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:43,680 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:22:43,681 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:22:43,681 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 582 states and 1905 transitions. cyclomatic complexity: 1392 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (in total 8), 4 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:22:43,752 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 582 states and 1905 transitions. cyclomatic complexity: 1392. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (in total 8), 4 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 1906 states and 6060 transitions. Complement of second has 8 states. [2025-04-26 16:22:43,753 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-04-26 16:22:43,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (in total 8), 4 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:22:43,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 95 transitions. [2025-04-26 16:22:43,753 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 95 transitions. Stem has 4 letters. Loop has 4 letters. [2025-04-26 16:22:43,753 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:43,753 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 95 transitions. Stem has 8 letters. Loop has 4 letters. [2025-04-26 16:22:43,754 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:43,754 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 95 transitions. Stem has 4 letters. Loop has 8 letters. [2025-04-26 16:22:43,754 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:43,754 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1906 states and 6060 transitions. [2025-04-26 16:22:43,768 INFO L131 ngComponentsAnalysis]: Automaton has 102 accepting balls. 744 [2025-04-26 16:22:43,779 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1906 states to 1669 states and 5385 transitions. [2025-04-26 16:22:43,779 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 931 [2025-04-26 16:22:43,781 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1004 [2025-04-26 16:22:43,781 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1669 states and 5385 transitions. [2025-04-26 16:22:43,781 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:43,781 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1669 states and 5385 transitions. [2025-04-26 16:22:43,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1669 states and 5385 transitions. [2025-04-26 16:22:43,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1669 to 1359. [2025-04-26 16:22:43,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1359 states, 1359 states have (on average 3.370860927152318) internal successors, (in total 4581), 1358 states have internal predecessors, (4581), 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:22:43,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1359 states to 1359 states and 4581 transitions. [2025-04-26 16:22:43,821 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1359 states and 4581 transitions. [2025-04-26 16:22:43,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:22:43,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:22:43,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:22:43,822 INFO L87 Difference]: Start difference. First operand 1359 states and 4581 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (in total 4), 2 states have internal predecessors, (4), 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:22:43,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:22:43,847 INFO L93 Difference]: Finished difference Result 1584 states and 5229 transitions. [2025-04-26 16:22:43,847 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1584 states and 5229 transitions. [2025-04-26 16:22:43,858 INFO L131 ngComponentsAnalysis]: Automaton has 88 accepting balls. 674 [2025-04-26 16:22:43,869 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1584 states to 1568 states and 5185 transitions. [2025-04-26 16:22:43,870 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 830 [2025-04-26 16:22:43,871 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 830 [2025-04-26 16:22:43,871 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1568 states and 5185 transitions. [2025-04-26 16:22:43,871 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:43,871 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1568 states and 5185 transitions. [2025-04-26 16:22:43,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1568 states and 5185 transitions. [2025-04-26 16:22:43,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1568 to 1416. [2025-04-26 16:22:43,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1416 states, 1416 states have (on average 3.3707627118644066) internal successors, (in total 4773), 1415 states have internal predecessors, (4773), 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:22:43,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 4773 transitions. [2025-04-26 16:22:43,923 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1416 states and 4773 transitions. [2025-04-26 16:22:43,924 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:22:43,924 INFO L438 stractBuchiCegarLoop]: Abstraction has 1416 states and 4773 transitions. [2025-04-26 16:22:43,924 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:22:43,924 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1416 states and 4773 transitions. [2025-04-26 16:22:43,931 INFO L131 ngComponentsAnalysis]: Automaton has 77 accepting balls. 619 [2025-04-26 16:22:43,931 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:43,931 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:43,932 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:22:43,932 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:22:43,932 INFO L752 eck$LassoCheckResult]: Stem: "[64] $Ultimate##0-->L56: Formula: (and (or (and v_d2_5 v_d1_5) (and (not v_d2_5) (not v_d1_5))) v_d1_5 (= v_pos_9 0) v_v_assert_5) InVars {pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} OutVars{pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} AuxVars[] AssignedVars[]" "[96] L56-->L17: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0]" "[90] L56-1-->L33: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" "[79] L33-->L34: Formula: v_v_assert_3 InVars {v_assert=v_v_assert_3} OutVars{v_assert=v_v_assert_3} AuxVars[] AssignedVars[]" "[81] L34-->L35: Formula: v_d2_1 InVars {d2=v_d2_1} OutVars{d2=v_d2_1} AuxVars[] AssignedVars[]" [2025-04-26 16:22:43,932 INFO L754 eck$LassoCheckResult]: Loop: "[83] L35-->L34-2: Formula: (= (+ 2 v_pos_6) v_pos_5) InVars {pos=v_pos_6} OutVars{pos=v_pos_5} AuxVars[] AssignedVars[pos]" "[85] L34-2-->L33: Formula: (or (and v_d2_3 (not v_d2_4)) (and v_d2_4 (not v_d2_3))) InVars {d2=v_d2_4} OutVars{d2=v_d2_3} AuxVars[] AssignedVars[d2]" "[79] L33-->L34: Formula: v_v_assert_3 InVars {v_assert=v_v_assert_3} OutVars{v_assert=v_v_assert_3} AuxVars[] AssignedVars[]" "[81] L34-->L35: Formula: v_d2_1 InVars {d2=v_d2_1} OutVars{d2=v_d2_1} AuxVars[] AssignedVars[]" [2025-04-26 16:22:43,933 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:43,933 INFO L85 PathProgramCache]: Analyzing trace with hash 90683451, now seen corresponding path program 1 times [2025-04-26 16:22:43,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:43,933 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819204407] [2025-04-26 16:22:43,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:43,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:43,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:22:43,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:22:43,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:43,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:43,936 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:43,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:22:43,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:22:43,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:43,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:43,938 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:43,939 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:43,939 INFO L85 PathProgramCache]: Analyzing trace with hash 3480389, now seen corresponding path program 1 times [2025-04-26 16:22:43,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:43,939 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951298824] [2025-04-26 16:22:43,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:43,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:43,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:22:43,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:22:43,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:43,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:43,943 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:43,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:22:43,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:22:43,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:43,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:43,946 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:43,947 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:43,947 INFO L85 PathProgramCache]: Analyzing trace with hash 506603135, now seen corresponding path program 1 times [2025-04-26 16:22:43,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:43,947 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389843205] [2025-04-26 16:22:43,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:43,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:43,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:22:43,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:22:43,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:43,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:43,986 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:22:43,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:22:43,986 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389843205] [2025-04-26 16:22:43,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389843205] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-26 16:22:43,986 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [278311451] [2025-04-26 16:22:43,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:43,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 16:22:43,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:43,988 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-26 16:22:43,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-04-26 16:22:44,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:22:44,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:22:44,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:44,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:44,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-26 16:22:44,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:44,020 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:22:44,020 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-26 16:22:44,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [278311451] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:22:44,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-26 16:22:44,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [2] total 3 [2025-04-26 16:22:44,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794544488] [2025-04-26 16:22:44,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:22:44,045 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:44,045 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:44,045 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:44,045 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:44,045 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:22:44,045 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:44,045 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:44,045 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:44,045 INFO L132 ssoRankerPreferences]: Filename of dumped script: misc-4.wvr.bpl_petrified1_Iteration4_Loop [2025-04-26 16:22:44,045 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:44,045 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:44,045 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:44,048 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:44,051 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:44,072 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:44,072 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:22:44,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:44,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:44,074 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:22:44,076 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:22:44,077 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:22:44,077 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:22:44,096 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 16:22:44,096 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep(ite v_assert 1 0)_7=1} Honda state: {v_rep(ite v_assert 1 0)_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 16:22:44,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-04-26 16:22:44,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:44,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:44,103 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:22:44,104 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:22:44,105 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:22:44,105 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:22:44,122 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:22:44,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:44,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:44,124 INFO L229 MonitoredProcess]: Starting monitored process 24 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:22:44,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-04-26 16:22:44,126 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:22:44,126 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:22:44,147 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:22:44,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-04-26 16:22:44,151 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:22:44,151 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:22:44,151 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:22:44,151 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:22:44,151 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:22:44,151 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:44,151 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:22:44,151 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:22:44,152 INFO L132 ssoRankerPreferences]: Filename of dumped script: misc-4.wvr.bpl_petrified1_Iteration4_Loop [2025-04-26 16:22:44,152 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:22:44,152 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:22:44,152 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:44,168 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:44,171 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:22:44,196 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:22:44,196 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:22:44,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:44,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:44,198 INFO L229 MonitoredProcess]: Starting monitored process 25 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:22:44,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-04-26 16:22:44,200 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:22:44,210 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:44,210 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:44,210 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:44,210 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:44,210 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:44,210 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:22:44,210 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:44,211 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:22:44,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-04-26 16:22:44,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:44,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:44,219 INFO L229 MonitoredProcess]: Starting monitored process 26 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:22:44,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-04-26 16:22:44,220 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:22:44,231 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:22:44,231 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:22:44,231 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:22:44,231 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:22:44,231 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:22:44,232 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:22:44,232 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:22:44,233 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:22:44,235 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:22:44,235 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:22:44,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:22:44,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:22:44,238 INFO L229 MonitoredProcess]: Starting monitored process 27 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:22:44,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-04-26 16:22:44,239 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:22:44,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2025-04-26 16:22:44,242 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:22:44,242 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:22:44,242 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(ite d2 1 0)_4) = -2*v_rep(ite d2 1 0)_4 + 1 Supporting invariants [] [2025-04-26 16:22:44,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-04-26 16:22:44,248 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:22:44,265 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:44,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:22:44,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:22:44,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:44,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:44,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:22:44,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:44,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:22:44,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:22:44,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:44,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:22:44,287 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:22:44,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:22:44,349 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:22:44,350 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:22:44,350 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1416 states and 4773 transitions. cyclomatic complexity: 3476 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (in total 9), 4 states have internal predecessors, (9), 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:22:44,443 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1416 states and 4773 transitions. cyclomatic complexity: 3476. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (in total 9), 4 states have internal predecessors, (9), 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 7839 states and 26412 transitions. Complement of second has 8 states. [2025-04-26 16:22:44,444 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-04-26 16:22:44,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (in total 9), 4 states have internal predecessors, (9), 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:22:44,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2025-04-26 16:22:44,444 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 89 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 16:22:44,445 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:44,445 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 89 transitions. Stem has 9 letters. Loop has 4 letters. [2025-04-26 16:22:44,445 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:44,445 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 89 transitions. Stem has 5 letters. Loop has 8 letters. [2025-04-26 16:22:44,445 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:22:44,445 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7839 states and 26412 transitions. [2025-04-26 16:22:44,537 INFO L131 ngComponentsAnalysis]: Automaton has 168 accepting balls. 1488 [2025-04-26 16:22:44,593 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7839 states to 6639 states and 22680 transitions. [2025-04-26 16:22:44,593 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2043 [2025-04-26 16:22:44,597 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2207 [2025-04-26 16:22:44,597 INFO L74 IsDeterministic]: Start isDeterministic. Operand 6639 states and 22680 transitions. [2025-04-26 16:22:44,597 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:44,597 INFO L218 hiAutomatonCegarLoop]: Abstraction has 6639 states and 22680 transitions. [2025-04-26 16:22:44,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6639 states and 22680 transitions. [2025-04-26 16:22:44,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6639 to 5531. [2025-04-26 16:22:44,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5531 states, 5531 states have (on average 3.531368649430483) internal successors, (in total 19532), 5530 states have internal predecessors, (19532), 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:22:44,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5531 states to 5531 states and 19532 transitions. [2025-04-26 16:22:44,740 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5531 states and 19532 transitions. [2025-04-26 16:22:44,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:22:44,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 16:22:44,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-26 16:22:44,741 INFO L87 Difference]: Start difference. First operand 5531 states and 19532 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (in total 9), 4 states have internal predecessors, (9), 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:22:44,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:22:44,791 INFO L93 Difference]: Finished difference Result 4120 states and 13520 transitions. [2025-04-26 16:22:44,791 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4120 states and 13520 transitions. [2025-04-26 16:22:44,855 INFO L131 ngComponentsAnalysis]: Automaton has 93 accepting balls. 964 [2025-04-26 16:22:44,880 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4120 states to 2304 states and 7380 transitions. [2025-04-26 16:22:44,881 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1215 [2025-04-26 16:22:44,882 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1215 [2025-04-26 16:22:44,883 INFO L74 IsDeterministic]: Start isDeterministic. Operand 2304 states and 7380 transitions. [2025-04-26 16:22:44,883 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:22:44,883 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2304 states and 7380 transitions. [2025-04-26 16:22:44,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2304 states and 7380 transitions. [2025-04-26 16:22:44,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2304 to 1635. [2025-04-26 16:22:44,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1635 states, 1635 states have (on average 3.2752293577981653) internal successors, (in total 5355), 1634 states have internal predecessors, (5355), 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:22:44,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1635 states to 1635 states and 5355 transitions. [2025-04-26 16:22:44,925 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1635 states and 5355 transitions. [2025-04-26 16:22:44,926 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 16:22:44,927 INFO L438 stractBuchiCegarLoop]: Abstraction has 1635 states and 5355 transitions. [2025-04-26 16:22:44,927 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:22:44,928 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1635 states and 5355 transitions. [2025-04-26 16:22:44,937 INFO L131 ngComponentsAnalysis]: Automaton has 61 accepting balls. 772 [2025-04-26 16:22:44,937 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:22:44,937 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:22:44,937 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:22:44,937 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1] [2025-04-26 16:22:44,938 INFO L752 eck$LassoCheckResult]: Stem: "[64] $Ultimate##0-->L56: Formula: (and (or (and v_d2_5 v_d1_5) (and (not v_d2_5) (not v_d1_5))) v_d1_5 (= v_pos_9 0) v_v_assert_5) InVars {pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} OutVars{pos=v_pos_9, d2=v_d2_5, v_assert=v_v_assert_5, d1=v_d1_5} AuxVars[] AssignedVars[]" "[96] L56-->L17: Formula: (= 1 v_thread1Thread1of1ForFork2_thidvar0_2) InVars {} OutVars{thread1Thread1of1ForFork2_thidvar0=v_thread1Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_thidvar0]" "[90] L56-1-->L33: Formula: (and (= 2 v_thread2Thread1of1ForFork0_thidvar0_2) (= 2 v_thread2Thread1of1ForFork0_thidvar1_2)) InVars {} OutVars{thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0]" [2025-04-26 16:22:44,938 INFO L754 eck$LassoCheckResult]: Loop: "[79] L33-->L34: Formula: v_v_assert_3 InVars {v_assert=v_v_assert_3} OutVars{v_assert=v_v_assert_3} AuxVars[] AssignedVars[]" "[81] L34-->L35: Formula: v_d2_1 InVars {d2=v_d2_1} OutVars{d2=v_d2_1} AuxVars[] AssignedVars[]" "[83] L35-->L34-2: Formula: (= (+ 2 v_pos_6) v_pos_5) InVars {pos=v_pos_6} OutVars{pos=v_pos_5} AuxVars[] AssignedVars[pos]" "[85] L34-2-->L33: Formula: (or (and v_d2_3 (not v_d2_4)) (and v_d2_4 (not v_d2_3))) InVars {d2=v_d2_4} OutVars{d2=v_d2_3} AuxVars[] AssignedVars[d2]" "[79] L33-->L34: Formula: v_v_assert_3 InVars {v_assert=v_v_assert_3} OutVars{v_assert=v_v_assert_3} AuxVars[] AssignedVars[]" "[82] L34-->L39: Formula: (not v_d2_2) InVars {d2=v_d2_2} OutVars{d2=v_d2_2} AuxVars[] AssignedVars[]" "[84] L39-->L34-2: Formula: (= v_pos_8 (+ 2 v_pos_7)) InVars {pos=v_pos_8} OutVars{pos=v_pos_7} AuxVars[] AssignedVars[pos]" "[85] L34-2-->L33: Formula: (or (and v_d2_3 (not v_d2_4)) (and v_d2_4 (not v_d2_3))) InVars {d2=v_d2_4} OutVars{d2=v_d2_3} AuxVars[] AssignedVars[d2]" [2025-04-26 16:22:44,948 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:44,949 INFO L85 PathProgramCache]: Analyzing trace with hash 94361, now seen corresponding path program 2 times [2025-04-26 16:22:44,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:44,949 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439148639] [2025-04-26 16:22:44,949 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:22:44,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:44,956 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:22:44,957 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:22:44,957 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:22:44,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:44,957 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:44,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:22:44,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:22:44,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:44,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:44,964 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:44,964 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:44,964 INFO L85 PathProgramCache]: Analyzing trace with hash -233883543, now seen corresponding path program 1 times [2025-04-26 16:22:44,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:44,964 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838500144] [2025-04-26 16:22:44,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:44,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:44,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:44,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:44,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:44,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:44,972 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:44,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:22:44,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:22:44,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:44,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:44,979 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:44,979 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:22:44,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1514311937, now seen corresponding path program 1 times [2025-04-26 16:22:44,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:22:44,979 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077811516] [2025-04-26 16:22:44,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:22:44,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:22:44,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:22:44,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:22:44,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:44,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:44,983 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:44,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:22:44,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:22:44,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:44,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:44,994 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:22:45,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:22:45,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:22:45,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:45,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:45,098 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:22:45,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:22:45,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:22:45,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:22:45,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:22:45,122 INFO L201 PluginConnector]: Adding new model misc-4.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:22:45 BoogieIcfgContainer [2025-04-26 16:22:45,123 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:22:45,123 INFO L158 Benchmark]: Toolchain (without parser) took 3770.06ms. Allocated memory was 159.4MB in the beginning and 297.8MB in the end (delta: 138.4MB). Free memory was 86.2MB in the beginning and 155.4MB in the end (delta: -69.2MB). Peak memory consumption was 73.1MB. Max. memory is 8.0GB. [2025-04-26 16:22:45,125 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.19ms. Allocated memory is still 159.4MB. Free memory is still 87.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:22:45,126 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.28ms. Allocated memory is still 159.4MB. Free memory was 86.2MB in the beginning and 84.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:22:45,126 INFO L158 Benchmark]: Boogie Preprocessor took 23.88ms. Allocated memory is still 159.4MB. Free memory was 84.2MB in the beginning and 83.3MB in the end (delta: 943.9kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:22:45,126 INFO L158 Benchmark]: RCFGBuilder took 163.20ms. Allocated memory is still 159.4MB. Free memory was 83.2MB in the beginning and 74.1MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:22:45,126 INFO L158 Benchmark]: BuchiAutomizer took 3545.89ms. Allocated memory was 159.4MB in the beginning and 297.8MB in the end (delta: 138.4MB). Free memory was 73.9MB in the beginning and 155.4MB in the end (delta: -81.5MB). Peak memory consumption was 60.5MB. Max. memory is 8.0GB. [2025-04-26 16:22:45,127 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.19ms. Allocated memory is still 159.4MB. Free memory is still 87.1MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.28ms. Allocated memory is still 159.4MB. Free memory was 86.2MB in the beginning and 84.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 23.88ms. Allocated memory is still 159.4MB. Free memory was 84.2MB in the beginning and 83.3MB in the end (delta: 943.9kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 163.20ms. Allocated memory is still 159.4MB. Free memory was 83.2MB in the beginning and 74.1MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 3545.89ms. Allocated memory was 159.4MB in the beginning and 297.8MB in the end (delta: 138.4MB). Free memory was 73.9MB in the beginning and 155.4MB in the end (delta: -81.5MB). Peak memory consumption was 60.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.4s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 1.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 7. Automata minimization 0.4s AutomataMinimizationTime, 7 MinimizatonAttempts, 2957 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.3s 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, 262 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 258 mSDsluCounter, 523 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 276 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 173 IncrementalHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 247 mSDtfsCounter, 173 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT1 conc0 concLT2 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital11 mio100 ax100 hnf100 lsp54 ukn100 mio100 lsp100 div100 bol133 ite100 ukn100 eq150 hnf100 smp100 dnf100 smp100 tf116 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 25ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 3 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (3 trivial, 4 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function (if d1 then 1 else 0) and consists of 5 locations. One deterministic module has affine ranking function -2 * (if d2 then 1 else 0) + 1 and consists of 4 locations. One deterministic module has affine ranking function (if d1 then 1 else 0) and consists of 5 locations. One deterministic module has affine ranking function -2 * (if d2 then 1 else 0) + 1 and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 1635 locations. - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 33]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L55] 0 assume pos == 0 && (d1 == d2 && d1 == true) && v_assert == true; VAL [d1=true, d2=true, pos=0, v_assert=true] [L56] FORK 0 fork 1 thread1(); VAL [d1=true, d2=true, pos=0, v_assert=true] [L57] FORK 0 fork 2, 2 thread2(); VAL [d1=true, d2=true, pos=0, v_assert=true] Loop: [L33] COND TRUE v_assert [L34] COND TRUE d2 [L35] pos := pos + 2; [L42] d2 := !d2; [L33] COND TRUE v_assert [L34] COND FALSE !(d2) [L39] pos := pos - 2; [L42] d2 := !d2; End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 33]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L55] 0 assume pos == 0 && (d1 == d2 && d1 == true) && v_assert == true; VAL [d1=true, d2=true, pos=0, v_assert=true] [L56] FORK 0 fork 1 thread1(); VAL [d1=true, d2=true, pos=0, v_assert=true] [L57] FORK 0 fork 2, 2 thread2(); VAL [d1=true, d2=true, pos=0, v_assert=true] Loop: [L33] COND TRUE v_assert [L34] COND TRUE d2 [L35] pos := pos + 2; [L42] d2 := !d2; [L33] COND TRUE v_assert [L34] COND FALSE !(d2) [L39] pos := pos - 2; [L42] d2 := !d2; End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-04-26 16:22:45,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-04-26 16:22:45,342 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...