/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 --buchiautomizer.automaton.type.for.concurrent.programs PARTIAL_ORDER_BA -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i /storage/cav23-termute-examples/3_thr/complex_thr1_3.c.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-601be74-m [2025-02-17 22:48:57,288 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-17 22:48:57,345 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-02-17 22:48:57,350 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-17 22:48:57,350 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-17 22:48:57,371 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-17 22:48:57,371 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-17 22:48:57,371 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-17 22:48:57,372 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-17 22:48:57,372 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-17 22:48:57,373 INFO L153 SettingsManager]: * Use SBE=true [2025-02-17 22:48:57,373 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-17 22:48:57,373 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-17 22:48:57,373 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-17 22:48:57,374 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-17 22:48:57,374 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-17 22:48:57,374 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-17 22:48:57,374 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-17 22:48:57,374 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-17 22:48:57,374 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-17 22:48:57,374 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-17 22:48:57,374 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-17 22:48:57,374 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-17 22:48:57,374 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-17 22:48:57,374 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-17 22:48:57,374 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-17 22:48:57,374 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-17 22:48:57,374 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-17 22:48:57,374 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-17 22:48:57,374 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-17 22:48:57,375 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-17 22:48:57,375 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-02-17 22:48:57,375 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-17 22:48:57,375 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-17 22:48:57,375 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-17 22:48:57,375 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-17 22:48:57,375 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> PARTIAL_ORDER_BA [2025-02-17 22:48:57,581 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-17 22:48:57,587 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-17 22:48:57,588 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-17 22:48:57,589 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-02-17 22:48:57,590 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-02-17 22:48:57,592 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/cav23-termute-examples/3_thr/complex_thr1_3.c.bpl [2025-02-17 22:48:57,592 INFO L110 BoogieParser]: Parsing: '/storage/cav23-termute-examples/3_thr/complex_thr1_3.c.bpl' [2025-02-17 22:48:57,604 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-17 22:48:57,606 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-02-17 22:48:57,607 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-17 22:48:57,607 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-17 22:48:57,607 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-17 22:48:57,614 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "complex_thr1_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:57" (1/1) ... [2025-02-17 22:48:57,619 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "complex_thr1_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:57" (1/1) ... [2025-02-17 22:48:57,624 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-02-17 22:48:57,625 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-17 22:48:57,625 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-17 22:48:57,626 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-17 22:48:57,626 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-17 22:48:57,630 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "complex_thr1_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:57" (1/1) ... [2025-02-17 22:48:57,630 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "complex_thr1_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:57" (1/1) ... [2025-02-17 22:48:57,630 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "complex_thr1_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:57" (1/1) ... [2025-02-17 22:48:57,630 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "complex_thr1_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:57" (1/1) ... [2025-02-17 22:48:57,632 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "complex_thr1_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:57" (1/1) ... [2025-02-17 22:48:57,632 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "complex_thr1_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:57" (1/1) ... [2025-02-17 22:48:57,636 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "complex_thr1_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:57" (1/1) ... [2025-02-17 22:48:57,637 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "complex_thr1_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:57" (1/1) ... [2025-02-17 22:48:57,637 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "complex_thr1_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:57" (1/1) ... [2025-02-17 22:48:57,638 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-17 22:48:57,639 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-02-17 22:48:57,639 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-02-17 22:48:57,639 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-02-17 22:48:57,640 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "complex_thr1_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:57" (1/1) ... [2025-02-17 22:48:57,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:57,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:57,667 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-02-17 22:48:57,670 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-02-17 22:48:57,690 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-02-17 22:48:57,690 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-17 22:48:57,690 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-17 22:48:57,691 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-02-17 22:48:57,691 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-17 22:48:57,691 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-17 22:48:57,691 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-02-17 22:48:57,691 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-17 22:48:57,691 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-17 22:48:57,691 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-02-17 22:48:57,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-17 22:48:57,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-17 22:48:57,692 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-17 22:48:57,731 INFO L234 CfgBuilder]: Building ICFG [2025-02-17 22:48:57,732 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-17 22:48:57,830 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-17 22:48:57,830 INFO L283 CfgBuilder]: Performing block encoding [2025-02-17 22:48:57,840 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-17 22:48:57,841 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-17 22:48:57,841 INFO L201 PluginConnector]: Adding new model complex_thr1_3.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:48:57 BoogieIcfgContainer [2025-02-17 22:48:57,841 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-02-17 22:48:57,842 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-17 22:48:57,842 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-17 22:48:57,845 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-17 22:48:57,846 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:48:57,846 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "complex_thr1_3.c.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 17.02 10:48:57" (1/2) ... [2025-02-17 22:48:57,847 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@71c80822 and model type complex_thr1_3.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.02 10:48:57, skipping insertion in model container [2025-02-17 22:48:57,847 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-17 22:48:57,847 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "complex_thr1_3.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 10:48:57" (2/2) ... [2025-02-17 22:48:57,848 INFO L363 chiAutomizerObserver]: Analyzing ICFG complex_thr1_3.c.bpl [2025-02-17 22:48:57,919 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-17 22:48:57,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 34 transitions, 89 flow [2025-02-17 22:48:57,997 INFO L124 PetriNetUnfolderBase]: 5/28 cut-off events. [2025-02-17 22:48:58,002 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-17 22:48:58,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 28 events. 5/28 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 56 event pairs, 0 based on Foata normal form. 0/23 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2025-02-17 22:48:58,006 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 34 transitions, 89 flow [2025-02-17 22:48:58,009 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 28 transitions, 74 flow [2025-02-17 22:48:58,018 WARN L98 AmpleReduction]: Starting ample reduction [2025-02-17 22:48:58,274 INFO L100 AmpleReduction]: Finished ample reduction [2025-02-17 22:48:58,275 INFO L101 AmpleReduction]: Number of pruned transitions: 164, Number of non-trivial ample sets: 260 [2025-02-17 22:48:58,275 INFO L103 AmpleReduction]: Number of trivial ample sets caused by loops: 232 [2025-02-17 22:48:58,283 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-17 22:48:58,283 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-17 22:48:58,283 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-17 22:48:58,284 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-17 22:48:58,284 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-17 22:48:58,284 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-17 22:48:58,284 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-17 22:48:58,284 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-17 22:48:58,288 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 224 states, 223 states have (on average 2.3946188340807173) internal successors, (534), 223 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:58,306 INFO L131 ngComponentsAnalysis]: Automaton has 46 accepting balls. 174 [2025-02-17 22:48:58,306 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:58,306 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:58,311 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-17 22:48:58,312 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:48:58,312 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-17 22:48:58,314 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 224 states, 223 states have (on average 2.3946188340807173) internal successors, (534), 223 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:58,320 INFO L131 ngComponentsAnalysis]: Automaton has 46 accepting balls. 174 [2025-02-17 22:48:58,323 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:58,323 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:58,323 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-17 22:48:58,323 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:48:58,327 INFO L752 eck$LassoCheckResult]: Stem: "[97] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[74] $Ultimate##0-->L25: Formula: (= v_z_1 0) InVars {} OutVars{z=v_z_1} AuxVars[] AssignedVars[z]" "[100] L13-->L44: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-02-17 22:48:58,327 INFO L754 eck$LassoCheckResult]: Loop: "[88] L44-->L46: Formula: (< v_x_4 v_y_5) InVars {y=v_y_5, x=v_x_4} OutVars{y=v_y_5, x=v_x_4} AuxVars[] AssignedVars[]" "[90] L46-->L44: Formula: (= (+ v_x_6 1) v_x_5) InVars {x=v_x_6} OutVars{x=v_x_5} AuxVars[] AssignedVars[x]" [2025-02-17 22:48:58,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:58,331 INFO L85 PathProgramCache]: Analyzing trace with hash 125402, now seen corresponding path program 1 times [2025-02-17 22:48:58,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:58,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691388242] [2025-02-17 22:48:58,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:58,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:58,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:58,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:58,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:58,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:58,411 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:58,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:58,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:58,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:58,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:58,424 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:58,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:58,427 INFO L85 PathProgramCache]: Analyzing trace with hash 3779, now seen corresponding path program 1 times [2025-02-17 22:48:58,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:58,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344117504] [2025-02-17 22:48:58,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:58,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:58,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:58,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:58,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:58,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:58,434 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:58,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:58,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:58,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:58,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:58,438 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:58,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:58,439 INFO L85 PathProgramCache]: Analyzing trace with hash 120514140, now seen corresponding path program 1 times [2025-02-17 22:48:58,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:58,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488613793] [2025-02-17 22:48:58,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:58,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:58,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:48:58,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:48:58,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:58,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:58,444 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:58,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:48:58,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:48:58,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:58,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:58,449 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:58,481 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:58,481 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:58,481 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:58,481 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:58,482 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:48:58,482 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:58,482 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:58,482 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:58,482 INFO L132 ssoRankerPreferences]: Filename of dumped script: complex_thr1_3.c.bpl_petrified1_Iteration1_Loop [2025-02-17 22:48:58,482 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:58,482 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:58,493 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:58,529 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:58,530 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:48:58,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:58,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:58,535 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-02-17 22:48:58,536 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-02-17 22:48:58,538 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:58,538 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:58,560 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-02-17 22:48:58,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:58,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:58,562 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-02-17 22:48:58,563 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-02-17 22:48:58,567 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:48:58,567 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:58,638 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:48:58,643 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-02-17 22:48:58,643 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:58,643 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:58,643 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:58,643 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:58,643 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:48:58,643 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:58,643 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:58,644 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:58,644 INFO L132 ssoRankerPreferences]: Filename of dumped script: complex_thr1_3.c.bpl_petrified1_Iteration1_Loop [2025-02-17 22:48:58,644 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:58,644 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:58,644 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:58,669 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:58,671 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:48:58,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:58,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:58,674 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-02-17 22:48:58,676 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-02-17 22:48:58,676 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-02-17 22:48:58,687 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:58,687 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:48:58,688 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:58,688 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:58,688 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:58,691 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:48:58,691 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:48:58,694 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:48:58,698 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:48:58,699 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:48:58,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:58,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:58,701 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-02-17 22:48:58,703 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-02-17 22:48:58,704 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:48:58,704 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:48:58,705 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:48:58,705 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(y, x) = 1*y - 1*x Supporting invariants [] [2025-02-17 22:48:58,711 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-02-17 22:48:58,714 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:48:58,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:58,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:58,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:58,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:58,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:58,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:48:58,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:58,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-02-17 22:48:58,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:58,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:58,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:58,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:58,797 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:48:58,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:58,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:48:58,839 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-02-17 22:48:58,840 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 224 states, 223 states have (on average 2.3946188340807173) internal successors, (534), 223 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:58,972 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 224 states, 223 states have (on average 2.3946188340807173) internal successors, (534), 223 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 591 states and 1609 transitions. Complement of second has 6 states. [2025-02-17 22:48:58,974 INFO L141 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-02-17 22:48:58,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:58,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2025-02-17 22:48:58,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 77 transitions. Stem has 3 letters. Loop has 2 letters. [2025-02-17 22:48:58,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:58,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 77 transitions. Stem has 5 letters. Loop has 2 letters. [2025-02-17 22:48:58,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:58,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 77 transitions. Stem has 3 letters. Loop has 4 letters. [2025-02-17 22:48:58,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:58,984 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 591 states and 1609 transitions. [2025-02-17 22:48:58,993 INFO L131 ngComponentsAnalysis]: Automaton has 45 accepting balls. 148 [2025-02-17 22:48:59,006 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 591 states to 417 states and 1165 transitions. [2025-02-17 22:48:59,007 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 187 [2025-02-17 22:48:59,008 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 285 [2025-02-17 22:48:59,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 417 states and 1165 transitions. [2025-02-17 22:48:59,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:48:59,010 INFO L218 hiAutomatonCegarLoop]: Abstraction has 417 states and 1165 transitions. [2025-02-17 22:48:59,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states and 1165 transitions. [2025-02-17 22:48:59,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 323. [2025-02-17 22:48:59,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 323 states have (on average 2.8266253869969042) internal successors, (913), 322 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:59,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 913 transitions. [2025-02-17 22:48:59,044 INFO L240 hiAutomatonCegarLoop]: Abstraction has 323 states and 913 transitions. [2025-02-17 22:48:59,044 INFO L432 stractBuchiCegarLoop]: Abstraction has 323 states and 913 transitions. [2025-02-17 22:48:59,044 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-17 22:48:59,044 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 323 states and 913 transitions. [2025-02-17 22:48:59,047 INFO L131 ngComponentsAnalysis]: Automaton has 45 accepting balls. 148 [2025-02-17 22:48:59,047 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:59,047 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:59,047 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-02-17 22:48:59,047 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-02-17 22:48:59,049 INFO L752 eck$LassoCheckResult]: Stem: "[97] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[74] $Ultimate##0-->L25: Formula: (= v_z_1 0) InVars {} OutVars{z=v_z_1} AuxVars[] AssignedVars[z]" "[100] L13-->L44: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[103] L14-->L53: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" [2025-02-17 22:48:59,049 INFO L754 eck$LassoCheckResult]: Loop: "[92] L53-->L55: Formula: (< v_x2_1 v_y_7) InVars {y=v_y_7, x2=v_x2_1} OutVars{y=v_y_7, x2=v_x2_1} AuxVars[] AssignedVars[]" "[94] L55-->L53: Formula: (= v_x2_2 (+ v_x2_3 1)) InVars {x2=v_x2_3} OutVars{x2=v_x2_2} AuxVars[] AssignedVars[x2]" [2025-02-17 22:48:59,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:59,049 INFO L85 PathProgramCache]: Analyzing trace with hash 3887565, now seen corresponding path program 1 times [2025-02-17 22:48:59,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:59,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219999629] [2025-02-17 22:48:59,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:59,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:59,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:48:59,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:48:59,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:59,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:59,056 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:59,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:48:59,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:48:59,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:59,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:59,061 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:59,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:59,062 INFO L85 PathProgramCache]: Analyzing trace with hash 3907, now seen corresponding path program 1 times [2025-02-17 22:48:59,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:59,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640686040] [2025-02-17 22:48:59,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:59,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:59,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:59,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:59,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:59,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:59,066 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:59,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:59,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:59,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:59,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:59,070 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:59,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:59,070 INFO L85 PathProgramCache]: Analyzing trace with hash -559014385, now seen corresponding path program 1 times [2025-02-17 22:48:59,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:59,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510373130] [2025-02-17 22:48:59,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:59,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:59,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:48:59,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:48:59,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:59,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:59,074 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:59,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-17 22:48:59,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-17 22:48:59,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:59,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:59,080 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:59,100 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:59,101 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:59,101 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:59,101 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:59,101 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:48:59,101 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:59,101 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:59,101 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:59,101 INFO L132 ssoRankerPreferences]: Filename of dumped script: complex_thr1_3.c.bpl_petrified1_Iteration2_Loop [2025-02-17 22:48:59,101 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:59,101 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:59,101 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:59,117 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:59,117 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:48:59,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:59,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:59,119 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-02-17 22:48:59,120 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-02-17 22:48:59,120 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:59,120 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:59,140 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-02-17 22:48:59,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:59,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:59,142 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-02-17 22:48:59,143 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-02-17 22:48:59,144 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:48:59,144 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:59,209 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:48:59,214 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-02-17 22:48:59,214 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:59,214 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:59,214 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:59,214 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:59,214 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:48:59,214 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:59,214 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:59,214 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:59,214 INFO L132 ssoRankerPreferences]: Filename of dumped script: complex_thr1_3.c.bpl_petrified1_Iteration2_Loop [2025-02-17 22:48:59,214 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:59,214 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:59,215 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:59,236 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:59,236 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:48:59,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:59,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:59,238 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-02-17 22:48:59,240 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-02-17 22:48:59,241 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-02-17 22:48:59,251 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:59,252 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:48:59,252 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:59,252 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:59,252 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:59,253 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:48:59,254 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:48:59,257 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:48:59,262 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:48:59,262 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:48:59,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:59,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:59,264 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-02-17 22:48:59,265 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-02-17 22:48:59,266 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:48:59,266 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:48:59,266 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:48:59,266 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(y, x2) = 1*y - 1*x2 Supporting invariants [] [2025-02-17 22:48:59,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-02-17 22:48:59,273 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:48:59,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:59,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:48:59,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:48:59,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:59,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:59,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:48:59,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:59,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-17 22:48:59,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-17 22:48:59,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:59,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:59,298 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:48:59,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:59,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:48:59,315 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-02-17 22:48:59,316 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 323 states and 913 transitions. cyclomatic complexity: 654 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:59,390 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 323 states and 913 transitions. cyclomatic complexity: 654. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 790 states and 2403 transitions. Complement of second has 6 states. [2025-02-17 22:48:59,391 INFO L141 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-02-17 22:48:59,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:59,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2025-02-17 22:48:59,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 79 transitions. Stem has 4 letters. Loop has 2 letters. [2025-02-17 22:48:59,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:59,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 79 transitions. Stem has 6 letters. Loop has 2 letters. [2025-02-17 22:48:59,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:59,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 79 transitions. Stem has 4 letters. Loop has 4 letters. [2025-02-17 22:48:59,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:59,392 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 790 states and 2403 transitions. [2025-02-17 22:48:59,398 INFO L131 ngComponentsAnalysis]: Automaton has 42 accepting balls. 126 [2025-02-17 22:48:59,404 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 790 states to 529 states and 1668 transitions. [2025-02-17 22:48:59,404 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 216 [2025-02-17 22:48:59,407 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 277 [2025-02-17 22:48:59,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 529 states and 1668 transitions. [2025-02-17 22:48:59,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:48:59,407 INFO L218 hiAutomatonCegarLoop]: Abstraction has 529 states and 1668 transitions. [2025-02-17 22:48:59,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states and 1668 transitions. [2025-02-17 22:48:59,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 468. [2025-02-17 22:48:59,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 468 states have (on average 3.232905982905983) internal successors, (1513), 467 states have internal predecessors, (1513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:59,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 1513 transitions. [2025-02-17 22:48:59,431 INFO L240 hiAutomatonCegarLoop]: Abstraction has 468 states and 1513 transitions. [2025-02-17 22:48:59,431 INFO L432 stractBuchiCegarLoop]: Abstraction has 468 states and 1513 transitions. [2025-02-17 22:48:59,431 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-17 22:48:59,431 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 468 states and 1513 transitions. [2025-02-17 22:48:59,433 INFO L131 ngComponentsAnalysis]: Automaton has 42 accepting balls. 126 [2025-02-17 22:48:59,434 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:59,434 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:59,434 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-02-17 22:48:59,434 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-17 22:48:59,434 INFO L752 eck$LassoCheckResult]: Stem: "[97] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[74] $Ultimate##0-->L25: Formula: (= v_z_1 0) InVars {} OutVars{z=v_z_1} AuxVars[] AssignedVars[z]" "[75] L25-->L26: Formula: (= v_i_1 v_x_1) InVars {x=v_x_1} OutVars{i=v_i_1, x=v_x_1} AuxVars[] AssignedVars[i]" "[76] L26-->L28-1: Formula: (and (< 0 v_x_2) (< 0 v_y_1)) InVars {y=v_y_1, x=v_x_2} OutVars{y=v_y_1, x=v_x_2} AuxVars[] AssignedVars[]" [2025-02-17 22:48:59,434 INFO L754 eck$LassoCheckResult]: Loop: "[79] L28-1-->L30: Formula: (< 0 v_i_2) InVars {i=v_i_2} OutVars{i=v_i_2} AuxVars[] AssignedVars[]" "[83] L30-->L31: Formula: (= (+ v_i_3 1) v_i_4) InVars {i=v_i_4} OutVars{i=v_i_3} AuxVars[] AssignedVars[i]" "[85] L31-->L28-1: Formula: (= (+ v_z_3 1) v_z_2) InVars {z=v_z_3} OutVars{z=v_z_2} AuxVars[] AssignedVars[z]" [2025-02-17 22:48:59,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:59,435 INFO L85 PathProgramCache]: Analyzing trace with hash 3886763, now seen corresponding path program 1 times [2025-02-17 22:48:59,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:59,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008385637] [2025-02-17 22:48:59,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:59,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:59,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:48:59,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:48:59,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:59,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:59,441 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:59,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:48:59,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:48:59,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:59,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:59,445 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:59,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:59,445 INFO L85 PathProgramCache]: Analyzing trace with hash 108368, now seen corresponding path program 1 times [2025-02-17 22:48:59,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:59,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453824840] [2025-02-17 22:48:59,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:59,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:59,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:59,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:59,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:59,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:59,450 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:59,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:59,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:59,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:59,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:59,452 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:59,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:59,453 INFO L85 PathProgramCache]: Analyzing trace with hash -173481882, now seen corresponding path program 1 times [2025-02-17 22:48:59,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:59,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652566324] [2025-02-17 22:48:59,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:59,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:59,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-17 22:48:59,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-17 22:48:59,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:59,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:59,457 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:59,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-17 22:48:59,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-17 22:48:59,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:59,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:59,460 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:59,480 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:59,480 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:59,480 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:59,480 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:59,480 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:48:59,480 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:59,480 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:59,480 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:59,480 INFO L132 ssoRankerPreferences]: Filename of dumped script: complex_thr1_3.c.bpl_petrified1_Iteration3_Loop [2025-02-17 22:48:59,480 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:59,480 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:59,481 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:59,487 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:59,512 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:59,512 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:48:59,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:59,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:59,515 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-02-17 22:48:59,515 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-02-17 22:48:59,516 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:59,516 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:59,532 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-02-17 22:48:59,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:59,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:59,534 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-02-17 22:48:59,534 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-02-17 22:48:59,535 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:48:59,535 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:59,557 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:48:59,562 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-02-17 22:48:59,562 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:59,562 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:59,562 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:59,562 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:59,562 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:48:59,562 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:59,562 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:59,562 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:59,562 INFO L132 ssoRankerPreferences]: Filename of dumped script: complex_thr1_3.c.bpl_petrified1_Iteration3_Loop [2025-02-17 22:48:59,562 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:59,562 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:59,563 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:59,567 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:59,588 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:59,588 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:48:59,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:59,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:59,591 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-02-17 22:48:59,593 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-02-17 22:48:59,593 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-02-17 22:48:59,603 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:48:59,603 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:48:59,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:48:59,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:48:59,603 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:48:59,604 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:48:59,604 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:48:59,605 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:48:59,607 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-02-17 22:48:59,607 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-02-17 22:48:59,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:59,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:59,609 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-02-17 22:48:59,609 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-02-17 22:48:59,610 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:48:59,610 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:48:59,610 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:48:59,610 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(i) = 1*i Supporting invariants [] [2025-02-17 22:48:59,615 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-02-17 22:48:59,616 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:48:59,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:59,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-17 22:48:59,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-17 22:48:59,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:59,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:59,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:48:59,635 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:59,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:59,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:59,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:59,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:59,644 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:48:59,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:48:59,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:48:59,682 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-02-17 22:48:59,682 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 468 states and 1513 transitions. cyclomatic complexity: 1123 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:59,728 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-02-17 22:48:59,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-02-17 22:48:59,738 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 468 states and 1513 transitions. cyclomatic complexity: 1123. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 1303 states and 4228 transitions. Complement of second has 7 states. [2025-02-17 22:48:59,738 INFO L141 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-02-17 22:48:59,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:59,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2025-02-17 22:48:59,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 50 transitions. Stem has 4 letters. Loop has 3 letters. [2025-02-17 22:48:59,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:59,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 50 transitions. Stem has 7 letters. Loop has 3 letters. [2025-02-17 22:48:59,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:59,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 50 transitions. Stem has 4 letters. Loop has 6 letters. [2025-02-17 22:48:59,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:48:59,740 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1303 states and 4228 transitions. [2025-02-17 22:48:59,753 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 63 [2025-02-17 22:48:59,761 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1303 states to 1015 states and 3273 transitions. [2025-02-17 22:48:59,761 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 300 [2025-02-17 22:48:59,762 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 345 [2025-02-17 22:48:59,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1015 states and 3273 transitions. [2025-02-17 22:48:59,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-02-17 22:48:59,762 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1015 states and 3273 transitions. [2025-02-17 22:48:59,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states and 3273 transitions. [2025-02-17 22:48:59,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 780. [2025-02-17 22:48:59,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 780 states, 780 states have (on average 3.317948717948718) internal successors, (2588), 779 states have internal predecessors, (2588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:48:59,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 2588 transitions. [2025-02-17 22:48:59,783 INFO L240 hiAutomatonCegarLoop]: Abstraction has 780 states and 2588 transitions. [2025-02-17 22:48:59,783 INFO L432 stractBuchiCegarLoop]: Abstraction has 780 states and 2588 transitions. [2025-02-17 22:48:59,783 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-17 22:48:59,783 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 780 states and 2588 transitions. [2025-02-17 22:48:59,787 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 63 [2025-02-17 22:48:59,787 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-17 22:48:59,787 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-17 22:48:59,788 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-02-17 22:48:59,788 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-02-17 22:48:59,788 INFO L752 eck$LassoCheckResult]: Stem: "[97] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[74] $Ultimate##0-->L25: Formula: (= v_z_1 0) InVars {} OutVars{z=v_z_1} AuxVars[] AssignedVars[z]" "[75] L25-->L26: Formula: (= v_i_1 v_x_1) InVars {x=v_x_1} OutVars{i=v_i_1, x=v_x_1} AuxVars[] AssignedVars[i]" "[76] L26-->L28-1: Formula: (and (< 0 v_x_2) (< 0 v_y_1)) InVars {y=v_y_1, x=v_x_2} OutVars{y=v_y_1, x=v_x_2} AuxVars[] AssignedVars[]" "[78] L28-1-->L33-1: Formula: (<= v_i_5 0) InVars {i=v_i_5} OutVars{i=v_i_5} AuxVars[] AssignedVars[]" [2025-02-17 22:48:59,788 INFO L754 eck$LassoCheckResult]: Loop: "[82] L33-1-->L35: Formula: (< v_i_6 v_y_2) InVars {i=v_i_6, y=v_y_2} OutVars{i=v_i_6, y=v_y_2} AuxVars[] AssignedVars[]" "[84] L35-->L36: Formula: (= (+ v_i_8 1) v_i_7) InVars {i=v_i_8} OutVars{i=v_i_7} AuxVars[] AssignedVars[i]" "[86] L36-->L33-1: Formula: (= v_z_5 (+ v_z_4 1)) InVars {z=v_z_5} OutVars{z=v_z_4} AuxVars[] AssignedVars[z]" [2025-02-17 22:48:59,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:59,790 INFO L85 PathProgramCache]: Analyzing trace with hash 120489731, now seen corresponding path program 1 times [2025-02-17 22:48:59,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:59,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890102571] [2025-02-17 22:48:59,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:59,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:59,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:48:59,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:48:59,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:59,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:48:59,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:48:59,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-17 22:48:59,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890102571] [2025-02-17 22:48:59,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890102571] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-17 22:48:59,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-17 22:48:59,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-17 22:48:59,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138302780] [2025-02-17 22:48:59,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-17 22:48:59,851 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-17 22:48:59,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:48:59,852 INFO L85 PathProgramCache]: Analyzing trace with hash 111283, now seen corresponding path program 1 times [2025-02-17 22:48:59,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-17 22:48:59,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985941857] [2025-02-17 22:48:59,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-17 22:48:59,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-17 22:48:59,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:59,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:59,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:59,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:59,857 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-17 22:48:59,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:48:59,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:48:59,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:48:59,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-17 22:48:59,862 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-17 22:48:59,882 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:48:59,882 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:48:59,882 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:48:59,882 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:48:59,882 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-02-17 22:48:59,882 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:59,882 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:48:59,882 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:48:59,882 INFO L132 ssoRankerPreferences]: Filename of dumped script: complex_thr1_3.c.bpl_petrified1_Iteration4_Loop [2025-02-17 22:48:59,882 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:48:59,882 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:48:59,883 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:59,885 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:48:59,903 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:48:59,903 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-02-17 22:48:59,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:59,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:59,905 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-02-17 22:48:59,907 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-02-17 22:48:59,908 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:59,908 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:59,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-02-17 22:48:59,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:59,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:59,927 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-02-17 22:48:59,928 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-02-17 22:48:59,929 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:48:59,929 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:59,952 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-02-17 22:48:59,953 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {z=0} Honda state: {z=0} Generalized eigenvectors: [{z=-1}, {z=7}, {z=-7}] Lambdas: [8, 1, 1] Nus: [1, 0] [2025-02-17 22:48:59,958 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-02-17 22:48:59,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:59,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:59,960 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-02-17 22:48:59,961 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-02-17 22:48:59,962 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-02-17 22:48:59,962 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:48:59,979 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-02-17 22:48:59,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:48:59,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:48:59,981 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-02-17 22:48:59,982 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-02-17 22:48:59,983 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-02-17 22:48:59,983 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-02-17 22:49:00,049 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-02-17 22:49:00,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-02-17 22:49:00,055 INFO L204 LassoAnalysis]: Preferences: [2025-02-17 22:49:00,055 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-17 22:49:00,055 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-17 22:49:00,055 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-17 22:49:00,055 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-17 22:49:00,055 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:00,055 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-17 22:49:00,055 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-17 22:49:00,055 INFO L132 ssoRankerPreferences]: Filename of dumped script: complex_thr1_3.c.bpl_petrified1_Iteration4_Loop [2025-02-17 22:49:00,055 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-17 22:49:00,055 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-17 22:49:00,056 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:00,058 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-17 22:49:00,084 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-17 22:49:00,084 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-17 22:49:00,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:00,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:00,087 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-02-17 22:49:00,089 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-02-17 22:49:00,090 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-02-17 22:49:00,099 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:00,100 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:49:00,100 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:00,100 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:00,100 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:00,100 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:49:00,100 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:49:00,102 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-17 22:49:00,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-02-17 22:49:00,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:00,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:00,110 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-02-17 22:49:00,111 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-02-17 22:49:00,112 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-02-17 22:49:00,122 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-17 22:49:00,122 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-17 22:49:00,122 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-17 22:49:00,122 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-17 22:49:00,122 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-17 22:49:00,123 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-17 22:49:00,123 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-17 22:49:00,125 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-17 22:49:00,127 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-02-17 22:49:00,127 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-02-17 22:49:00,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-17 22:49:00,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-02-17 22:49:00,129 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-02-17 22:49:00,130 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-02-17 22:49:00,131 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-17 22:49:00,131 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-02-17 22:49:00,131 INFO L474 LassoAnalysis]: Proved termination. [2025-02-17 22:49:00,131 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(y, i) = 1*y - 1*i Supporting invariants [] [2025-02-17 22:49:00,137 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-02-17 22:49:00,138 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-02-17 22:49:00,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-17 22:49:00,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-17 22:49:00,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-17 22:49:00,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:00,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:00,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-17 22:49:00,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:00,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-17 22:49:00,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-17 22:49:00,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-17 22:49:00,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-17 22:49:00,164 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-17 22:49:00,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-17 22:49:00,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-17 22:49:00,192 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-02-17 22:49:00,192 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 780 states and 2588 transitions. cyclomatic complexity: 1910 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:00,246 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 780 states and 2588 transitions. cyclomatic complexity: 1910. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 1295 states and 4221 transitions. Complement of second has 6 states. [2025-02-17 22:49:00,246 INFO L141 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-02-17 22:49:00,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:00,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2025-02-17 22:49:00,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 51 transitions. Stem has 5 letters. Loop has 3 letters. [2025-02-17 22:49:00,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:00,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 51 transitions. Stem has 8 letters. Loop has 3 letters. [2025-02-17 22:49:00,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:00,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 51 transitions. Stem has 5 letters. Loop has 6 letters. [2025-02-17 22:49:00,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-17 22:49:00,248 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1295 states and 4221 transitions. [2025-02-17 22:49:00,257 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:49:00,258 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1295 states to 0 states and 0 transitions. [2025-02-17 22:49:00,258 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-17 22:49:00,258 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-17 22:49:00,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-17 22:49:00,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-17 22:49:00,258 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:49:00,258 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:49:00,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-17 22:49:00,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-17 22:49:00,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-17 22:49:00,261 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-17 22:49:00,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-17 22:49:00,263 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2025-02-17 22:49:00,263 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2025-02-17 22:49:00,263 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:49:00,263 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2025-02-17 22:49:00,263 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-17 22:49:00,263 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-17 22:49:00,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-17 22:49:00,263 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-17 22:49:00,263 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:49:00,263 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:49:00,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-17 22:49:00,263 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-17 22:49:00,264 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-17 22:49:00,264 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-02-17 22:49:00,264 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-17 22:49:00,264 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-02-17 22:49:00,268 INFO L201 PluginConnector]: Adding new model complex_thr1_3.c.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.02 10:49:00 BoogieIcfgContainer [2025-02-17 22:49:00,269 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-17 22:49:00,269 INFO L158 Benchmark]: Toolchain (without parser) took 2663.69ms. Allocated memory was 159.4MB in the beginning and 125.8MB in the end (delta: -33.6MB). Free memory was 84.7MB in the beginning and 31.1MB in the end (delta: 53.7MB). Peak memory consumption was 21.3MB. Max. memory is 8.0GB. [2025-02-17 22:49:00,269 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.28ms. Allocated memory is still 159.4MB. Free memory is still 85.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:49:00,270 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.52ms. Allocated memory is still 159.4MB. Free memory was 84.7MB in the beginning and 83.5MB in the end (delta: 1.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-02-17 22:49:00,270 INFO L158 Benchmark]: Boogie Preprocessor took 12.91ms. Allocated memory is still 159.4MB. Free memory was 83.5MB in the beginning and 82.8MB in the end (delta: 715.9kB). There was no memory consumed. Max. memory is 8.0GB. [2025-02-17 22:49:00,270 INFO L158 Benchmark]: RCFGBuilder took 202.01ms. Allocated memory is still 159.4MB. Free memory was 82.7MB in the beginning and 73.6MB in the end (delta: 9.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-02-17 22:49:00,270 INFO L158 Benchmark]: BuchiAutomizer took 2426.96ms. Allocated memory was 159.4MB in the beginning and 125.8MB in the end (delta: -33.6MB). Free memory was 73.5MB in the beginning and 31.1MB in the end (delta: 42.4MB). Peak memory consumption was 12.9MB. Max. memory is 8.0GB. [2025-02-17 22:49:00,271 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.28ms. Allocated memory is still 159.4MB. Free memory is still 85.6MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 18.52ms. Allocated memory is still 159.4MB. Free memory was 84.7MB in the beginning and 83.5MB in the end (delta: 1.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 12.91ms. Allocated memory is still 159.4MB. Free memory was 83.5MB in the beginning and 82.8MB in the end (delta: 715.9kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 202.01ms. Allocated memory is still 159.4MB. Free memory was 82.7MB in the beginning and 73.6MB in the end (delta: 9.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * BuchiAutomizer took 2426.96ms. Allocated memory was 159.4MB in the beginning and 125.8MB in the end (delta: -33.6MB). Free memory was 73.5MB in the beginning and 31.1MB in the end (delta: 42.4MB). Peak memory consumption was 12.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (1 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * x + y and consists of 4 locations. One deterministic module has affine ranking function y + -1 * x2 and consists of 4 locations. One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function y + -1 * i and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.3s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.1s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 390 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 190 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 186 mSDsluCounter, 221 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 101 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 166 IncrementalHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 120 mSDtfsCounter, 166 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT3 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital14 mio100 ax100 hnf100 lsp84 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq152 hnf94 smp100 dnf100 smp100 tf112 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 32ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 1 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s InitialAbstractionConstructionTime: 0.3s InitialAbstraction: Time to compute Ample Reduction [ms]: 318, Trivial Ample Sets caused by loops: 232, Number of non-trivial ample sets: 260, Number of pruned transitions: 164, Number of transitions in reduction automaton: 534, Number of states in reduction automaton: 224, Underlying: - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-02-17 22:49:00,282 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-02-17 22:49:00,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...