/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/termination/concurrent_increment_nonterminating2.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:20:46,125 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:20:46,174 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-04-26 16:20:46,177 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:20:46,177 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:20:46,190 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:20:46,191 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:20:46,191 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:20:46,191 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:20:46,191 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:20:46,191 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:20:46,191 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:20:46,191 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:20:46,192 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:20:46,192 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:20:46,192 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:20:46,192 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:20:46,192 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:20:46,194 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:20:46,194 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:20:46,194 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:20:46,194 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:20:46,194 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:20:46,194 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:20:46,194 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:20:46,194 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:20:46,194 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:20:46,194 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:20:46,194 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:20:46,194 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:20:46,194 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:20:46,194 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:20:46,195 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:20:46,195 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:20:46,195 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:20:46,195 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:20:46,195 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:20:46,404 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:20:46,412 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:20:46,413 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:20:46,414 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:20:46,414 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:20:46,416 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/termination/concurrent_increment_nonterminating2.bpl [2025-04-26 16:20:46,417 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/termination/concurrent_increment_nonterminating2.bpl' [2025-04-26 16:20:46,430 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:20:46,431 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:20:46,431 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:20:46,431 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:20:46,432 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:20:46,439 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "concurrent_increment_nonterminating2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:46" (1/1) ... [2025-04-26 16:20:46,454 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "concurrent_increment_nonterminating2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:46" (1/1) ... [2025-04-26 16:20:46,459 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:20:46,462 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:20:46,463 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:20:46,463 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:20:46,463 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:20:46,468 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "concurrent_increment_nonterminating2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:46" (1/1) ... [2025-04-26 16:20:46,468 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "concurrent_increment_nonterminating2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:46" (1/1) ... [2025-04-26 16:20:46,468 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "concurrent_increment_nonterminating2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:46" (1/1) ... [2025-04-26 16:20:46,468 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "concurrent_increment_nonterminating2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:46" (1/1) ... [2025-04-26 16:20:46,469 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "concurrent_increment_nonterminating2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:46" (1/1) ... [2025-04-26 16:20:46,470 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "concurrent_increment_nonterminating2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:46" (1/1) ... [2025-04-26 16:20:46,472 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "concurrent_increment_nonterminating2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:46" (1/1) ... [2025-04-26 16:20:46,472 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "concurrent_increment_nonterminating2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:46" (1/1) ... [2025-04-26 16:20:46,473 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "concurrent_increment_nonterminating2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:46" (1/1) ... [2025-04-26 16:20:46,483 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:20:46,485 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:20:46,486 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:20:46,486 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:20:46,486 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "concurrent_increment_nonterminating2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:46" (1/1) ... [2025-04-26 16:20:46,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:46,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:46,514 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:46,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-04-26 16:20:46,541 INFO L124 BoogieDeclarations]: Specification and implementation of procedure dec given in one single declaration [2025-04-26 16:20:46,542 INFO L130 BoogieDeclarations]: Found specification of procedure dec [2025-04-26 16:20:46,542 INFO L138 BoogieDeclarations]: Found implementation of procedure dec [2025-04-26 16:20:46,542 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:20:46,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:20:46,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:20:46,542 INFO L124 BoogieDeclarations]: Specification and implementation of procedure inc given in one single declaration [2025-04-26 16:20:46,542 INFO L130 BoogieDeclarations]: Found specification of procedure inc [2025-04-26 16:20:46,543 INFO L138 BoogieDeclarations]: Found implementation of procedure inc [2025-04-26 16:20:46,543 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:20:46,575 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:20:46,578 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:20:46,644 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:20:46,645 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:20:46,654 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:20:46,654 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:20:46,656 INFO L201 PluginConnector]: Adding new model concurrent_increment_nonterminating2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:20:46 BoogieIcfgContainer [2025-04-26 16:20:46,656 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:20:46,657 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:20:46,657 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:20:46,662 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:20:46,663 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:20:46,663 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "concurrent_increment_nonterminating2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:46" (1/2) ... [2025-04-26 16:20:46,664 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4cfc2b3d and model type concurrent_increment_nonterminating2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:20:46, skipping insertion in model container [2025-04-26 16:20:46,664 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:20:46,664 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "concurrent_increment_nonterminating2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:20:46" (2/2) ... [2025-04-26 16:20:46,665 INFO L376 chiAutomizerObserver]: Analyzing ICFG concurrent_increment_nonterminating2.bpl [2025-04-26 16:20:46,708 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 16:20:46,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 21 places, 18 transitions, 50 flow [2025-04-26 16:20:46,757 INFO L116 PetriNetUnfolderBase]: 2/14 cut-off events. [2025-04-26 16:20:46,759 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 16:20:46,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23 conditions, 14 events. 2/14 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 13 event pairs, 0 based on Foata normal form. 0/12 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2025-04-26 16:20:46,762 INFO L82 GeneralOperation]: Start removeDead. Operand has 21 places, 18 transitions, 50 flow [2025-04-26 16:20:46,764 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 19 places, 14 transitions, 40 flow [2025-04-26 16:20:46,764 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 19 places, 14 transitions, 40 flow [2025-04-26 16:20:46,773 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:20:46,773 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:20:46,773 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:20:46,773 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:20:46,773 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:20:46,773 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:20:46,773 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:20:46,774 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:20:46,775 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:20:46,802 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 16 [2025-04-26 16:20:46,802 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:20:46,802 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:20:46,805 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:20:46,805 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:20:46,805 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:20:46,805 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 27 states, but on-demand construction may add more states [2025-04-26 16:20:46,806 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 16 [2025-04-26 16:20:46,806 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:20:46,806 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:20:46,807 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:20:46,807 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:20:46,811 INFO L752 eck$LassoCheckResult]: Stem: "[28] $Ultimate##0-->L15: Formula: (= (+ 2 v_x_5) 0) InVars {} OutVars{x=v_x_5} AuxVars[] AssignedVars[x]" "[44] L15-->L24: Formula: (= v_decThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{decThread1of1ForFork0_thidvar0=v_decThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[decThread1of1ForFork0_thidvar0]" [2025-04-26 16:20:46,811 INFO L754 eck$LassoCheckResult]: Loop: "[35] L24-->L25: Formula: (< 0 (+ v_x_1 1)) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[]" "[37] L25-->L24: Formula: (= v_x_3 (+ v_x_2 1)) InVars {x=v_x_3} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" [2025-04-26 16:20:46,814 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:46,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1873, now seen corresponding path program 1 times [2025-04-26 16:20:46,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:46,819 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784906486] [2025-04-26 16:20:46,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:46,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:46,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:46,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:20:46,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:46,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:46,862 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:46,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:46,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:20:46,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:46,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:46,873 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:46,878 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:46,878 INFO L85 PathProgramCache]: Analyzing trace with hash 2083, now seen corresponding path program 1 times [2025-04-26 16:20:46,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:46,878 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835700840] [2025-04-26 16:20:46,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:46,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:46,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:46,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:20:46,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:46,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:46,886 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:46,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:46,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:20:46,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:46,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:46,893 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:46,894 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:46,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1801075, now seen corresponding path program 1 times [2025-04-26 16:20:46,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:46,894 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829865416] [2025-04-26 16:20:46,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:46,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:46,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:20:46,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:20:46,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:46,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:46,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:20:46,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:20:46,949 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829865416] [2025-04-26 16:20:46,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829865416] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:20:46,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:20:46,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:20:46,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26048535] [2025-04-26 16:20:46,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:20:46,997 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:20:46,999 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:20:46,999 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:20:46,999 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:20:46,999 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:20:46,999 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:46,999 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:20:46,999 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:20:47,000 INFO L132 ssoRankerPreferences]: Filename of dumped script: concurrent_increment_nonterminating2.bpl_petrified1_Iteration1_Loop [2025-04-26 16:20:47,000 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:20:47,000 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:20:47,009 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:47,059 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:20:47,060 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:20:47,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:47,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:47,068 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:47,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-04-26 16:20:47,072 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:20:47,072 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:20:47,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-04-26 16:20:47,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:47,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:47,097 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:47,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:20:47,100 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:20:47,100 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:20:47,126 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:20:47,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 16:20:47,130 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:20:47,130 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:20:47,131 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:20:47,131 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:20:47,131 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:20:47,131 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:47,131 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:20:47,131 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:20:47,131 INFO L132 ssoRankerPreferences]: Filename of dumped script: concurrent_increment_nonterminating2.bpl_petrified1_Iteration1_Loop [2025-04-26 16:20:47,131 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:20:47,131 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:20:47,132 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:47,159 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:20:47,162 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:20:47,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:47,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:47,165 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:47,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:20:47,167 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:20:47,178 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:20:47,178 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:20:47,178 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:20:47,179 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:20:47,179 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:20:47,182 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:20:47,182 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:20:47,185 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:20:47,188 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:20:47,189 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:20:47,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:47,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:47,191 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:47,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:20:47,193 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:20:47,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 16:20:47,196 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:20:47,197 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:20:47,197 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = 2*x + 1 Supporting invariants [] [2025-04-26 16:20:47,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 16:20:47,204 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:20:47,220 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:47,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:47,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:20:47,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:47,228 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:20:47,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:20:47,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:47,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:20:47,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:47,255 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:20:47,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:20:47,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:20:47,308 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:20:47,318 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 27 states, but on-demand construction may add more states Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:47,427 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 27 states, but on-demand construction may add more states. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 130 states and 242 transitions. Complement of second has 8 states. [2025-04-26 16:20:47,430 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:20:47,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:47,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2025-04-26 16:20:47,444 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 16:20:47,445 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:47,445 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:20:47,445 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:47,445 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 16:20:47,445 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:47,447 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 130 states and 242 transitions. [2025-04-26 16:20:47,451 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 14 [2025-04-26 16:20:47,457 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 130 states to 41 states and 84 transitions. [2025-04-26 16:20:47,457 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2025-04-26 16:20:47,458 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2025-04-26 16:20:47,458 INFO L74 IsDeterministic]: Start isDeterministic. Operand 41 states and 84 transitions. [2025-04-26 16:20:47,458 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:20:47,458 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 84 transitions. [2025-04-26 16:20:47,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 84 transitions. [2025-04-26 16:20:47,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 30. [2025-04-26 16:20:47,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 2.066666666666667) internal successors, (in total 62), 29 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:47,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 62 transitions. [2025-04-26 16:20:47,475 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30 states and 62 transitions. [2025-04-26 16:20:47,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:20:47,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:20:47,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:20:47,477 INFO L87 Difference]: Start difference. First operand 30 states and 62 transitions. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (in total 4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:47,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:20:47,495 INFO L93 Difference]: Finished difference Result 29 states and 51 transitions. [2025-04-26 16:20:47,495 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 51 transitions. [2025-04-26 16:20:47,496 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 14 [2025-04-26 16:20:47,496 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 27 states and 49 transitions. [2025-04-26 16:20:47,496 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2025-04-26 16:20:47,497 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2025-04-26 16:20:47,497 INFO L74 IsDeterministic]: Start isDeterministic. Operand 27 states and 49 transitions. [2025-04-26 16:20:47,497 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:20:47,497 INFO L218 hiAutomatonCegarLoop]: Abstraction has 27 states and 49 transitions. [2025-04-26 16:20:47,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 49 transitions. [2025-04-26 16:20:47,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 21. [2025-04-26 16:20:47,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.8571428571428572) internal successors, (in total 39), 20 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:47,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 39 transitions. [2025-04-26 16:20:47,498 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 39 transitions. [2025-04-26 16:20:47,499 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:20:47,499 INFO L438 stractBuchiCegarLoop]: Abstraction has 21 states and 39 transitions. [2025-04-26 16:20:47,499 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:20:47,499 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 39 transitions. [2025-04-26 16:20:47,500 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 14 [2025-04-26 16:20:47,500 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:20:47,500 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:20:47,500 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:20:47,500 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:20:47,500 INFO L752 eck$LassoCheckResult]: Stem: "[28] $Ultimate##0-->L15: Formula: (= (+ 2 v_x_5) 0) InVars {} OutVars{x=v_x_5} AuxVars[] AssignedVars[x]" "[44] L15-->L24: Formula: (= v_decThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{decThread1of1ForFork0_thidvar0=v_decThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[decThread1of1ForFork0_thidvar0]" "[34] L24-->decFINAL: Formula: (<= (+ v_x_4 1) 0) InVars {x=v_x_4} OutVars{x=v_x_4} AuxVars[] AssignedVars[]" "[47] L15-1-->L32: Formula: (and (= 2 v_incThread1of1ForFork1_thidvar0_2) (= 2 v_incThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{incThread1of1ForFork1_thidvar0=v_incThread1of1ForFork1_thidvar0_2, incThread1of1ForFork1_thidvar1=v_incThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[incThread1of1ForFork1_thidvar0, incThread1of1ForFork1_thidvar1]" [2025-04-26 16:20:47,500 INFO L754 eck$LassoCheckResult]: Loop: "[39] L32-->L33: Formula: (< v_x_9 0) InVars {x=v_x_9} OutVars{x=v_x_9} AuxVars[] AssignedVars[]" "[41] L33-->L32: Formula: (= (+ v_x_7 1) v_x_6) InVars {x=v_x_7} OutVars{x=v_x_6} AuxVars[] AssignedVars[x]" [2025-04-26 16:20:47,501 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:47,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1801054, now seen corresponding path program 1 times [2025-04-26 16:20:47,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:47,501 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615988026] [2025-04-26 16:20:47,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:47,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:47,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:20:47,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:20:47,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:47,504 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:47,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:20:47,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:20:47,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:47,507 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:47,507 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:47,507 INFO L85 PathProgramCache]: Analyzing trace with hash 2211, now seen corresponding path program 1 times [2025-04-26 16:20:47,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:47,507 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223679701] [2025-04-26 16:20:47,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:47,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:47,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:47,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:20:47,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:47,511 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:47,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:47,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:20:47,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:47,513 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:47,513 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:47,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1730814144, now seen corresponding path program 1 times [2025-04-26 16:20:47,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:47,513 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759228443] [2025-04-26 16:20:47,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:47,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:47,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:20:47,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:20:47,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:47,517 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:47,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:20:47,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:20:47,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:47,520 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:47,531 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:20:47,531 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:20:47,531 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:20:47,531 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:20:47,531 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:20:47,531 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:47,531 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:20:47,532 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:20:47,532 INFO L132 ssoRankerPreferences]: Filename of dumped script: concurrent_increment_nonterminating2.bpl_petrified1_Iteration2_Loop [2025-04-26 16:20:47,532 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:20:47,532 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:20:47,532 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:47,546 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:20:47,547 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:20:47,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:47,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:47,549 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:47,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:20:47,554 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:20:47,554 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:20:47,570 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 16:20:47,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:47,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:47,573 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:47,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:20:47,574 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:20:47,574 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:20:47,601 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:20:47,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 16:20:47,605 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:20:47,605 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:20:47,605 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:20:47,605 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:20:47,605 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:20:47,605 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:47,605 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:20:47,605 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:20:47,605 INFO L132 ssoRankerPreferences]: Filename of dumped script: concurrent_increment_nonterminating2.bpl_petrified1_Iteration2_Loop [2025-04-26 16:20:47,605 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:20:47,605 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:20:47,606 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:47,625 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:20:47,625 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:20:47,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:47,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:47,627 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:47,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:20:47,629 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:20:47,638 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:20:47,639 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:20:47,639 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:20:47,639 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:20:47,639 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:20:47,640 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:20:47,640 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:20:47,642 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:20:47,645 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:20:47,645 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:20:47,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:47,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:47,647 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:47,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:20:47,649 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:20:47,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 16:20:47,652 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:20:47,652 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:20:47,653 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = -1*x Supporting invariants [] [2025-04-26 16:20:47,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 16:20:47,658 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:20:47,672 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:47,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:20:47,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:20:47,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:47,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:20:47,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:20:47,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:47,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:20:47,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:47,690 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:20:47,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:20:47,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:20:47,704 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:20:47,704 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 39 transitions. cyclomatic complexity: 24 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:47,741 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 39 transitions. cyclomatic complexity: 24. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 80 states and 155 transitions. Complement of second has 8 states. [2025-04-26 16:20:47,743 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:20:47,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:47,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2025-04-26 16:20:47,743 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:20:47,744 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:47,744 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 16:20:47,744 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:47,744 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 4 letters. Loop has 4 letters. [2025-04-26 16:20:47,744 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:47,744 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 155 transitions. [2025-04-26 16:20:47,745 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 14 [2025-04-26 16:20:47,746 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 33 states and 61 transitions. [2025-04-26 16:20:47,746 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2025-04-26 16:20:47,746 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2025-04-26 16:20:47,746 INFO L74 IsDeterministic]: Start isDeterministic. Operand 33 states and 61 transitions. [2025-04-26 16:20:47,746 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:20:47,746 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33 states and 61 transitions. [2025-04-26 16:20:47,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states and 61 transitions. [2025-04-26 16:20:47,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 25. [2025-04-26 16:20:47,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.88) internal successors, (in total 47), 24 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:47,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 47 transitions. [2025-04-26 16:20:47,748 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 47 transitions. [2025-04-26 16:20:47,748 INFO L438 stractBuchiCegarLoop]: Abstraction has 25 states and 47 transitions. [2025-04-26 16:20:47,748 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:20:47,748 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 47 transitions. [2025-04-26 16:20:47,748 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 14 [2025-04-26 16:20:47,748 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:20:47,748 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:20:47,748 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:20:47,748 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:20:47,749 INFO L752 eck$LassoCheckResult]: Stem: "[28] $Ultimate##0-->L15: Formula: (= (+ 2 v_x_5) 0) InVars {} OutVars{x=v_x_5} AuxVars[] AssignedVars[x]" "[44] L15-->L24: Formula: (= v_decThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{decThread1of1ForFork0_thidvar0=v_decThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[decThread1of1ForFork0_thidvar0]" "[47] L15-1-->L32: Formula: (and (= 2 v_incThread1of1ForFork1_thidvar0_2) (= 2 v_incThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{incThread1of1ForFork1_thidvar0=v_incThread1of1ForFork1_thidvar0_2, incThread1of1ForFork1_thidvar1=v_incThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[incThread1of1ForFork1_thidvar0, incThread1of1ForFork1_thidvar1]" "[39] L32-->L33: Formula: (< v_x_9 0) InVars {x=v_x_9} OutVars{x=v_x_9} AuxVars[] AssignedVars[]" "[41] L33-->L32: Formula: (= (+ v_x_7 1) v_x_6) InVars {x=v_x_7} OutVars{x=v_x_6} AuxVars[] AssignedVars[x]" "[38] L32-->incFINAL: Formula: (<= 0 v_x_8) InVars {x=v_x_8} OutVars{x=v_x_8} AuxVars[] AssignedVars[]" [2025-04-26 16:20:47,749 INFO L754 eck$LassoCheckResult]: Loop: "[35] L24-->L25: Formula: (< 0 (+ v_x_1 1)) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[]" "[37] L25-->L24: Formula: (= v_x_3 (+ v_x_2 1)) InVars {x=v_x_3} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" [2025-04-26 16:20:47,749 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:47,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1731193798, now seen corresponding path program 1 times [2025-04-26 16:20:47,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:47,749 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222280564] [2025-04-26 16:20:47,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:47,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:47,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:20:47,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:20:47,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:47,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:20:47,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:20:47,775 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222280564] [2025-04-26 16:20:47,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222280564] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-26 16:20:47,775 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344623814] [2025-04-26 16:20:47,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:47,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 16:20:47,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:47,777 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-26 16:20:47,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-26 16:20:47,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:20:47,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:20:47,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:47,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-26 16:20:47,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:20:47,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:20:47,816 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-26 16:20:47,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:20:47,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [344623814] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-26 16:20:47,834 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-26 16:20:47,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2025-04-26 16:20:47,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994640833] [2025-04-26 16:20:47,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-26 16:20:47,834 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:20:47,835 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:47,835 INFO L85 PathProgramCache]: Analyzing trace with hash 2083, now seen corresponding path program 2 times [2025-04-26 16:20:47,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:47,835 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871306577] [2025-04-26 16:20:47,835 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:20:47,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:47,837 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:47,840 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:20:47,840 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:20:47,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:47,840 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:47,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:47,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:20:47,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:47,844 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:47,858 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:20:47,858 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:20:47,858 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:20:47,858 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:20:47,859 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:20:47,859 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:47,859 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:20:47,859 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:20:47,859 INFO L132 ssoRankerPreferences]: Filename of dumped script: concurrent_increment_nonterminating2.bpl_petrified1_Iteration3_Loop [2025-04-26 16:20:47,859 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:20:47,859 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:20:47,859 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:47,875 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:20:47,876 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:20:47,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:47,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:47,879 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:47,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 16:20:47,881 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:20:47,881 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:20:47,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 16:20:47,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:47,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:47,899 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:47,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 16:20:47,901 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:20:47,901 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:20:47,925 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:20:47,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 16:20:47,929 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:20:47,929 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:20:47,929 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:20:47,929 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:20:47,930 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:20:47,930 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:47,930 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:20:47,930 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:20:47,930 INFO L132 ssoRankerPreferences]: Filename of dumped script: concurrent_increment_nonterminating2.bpl_petrified1_Iteration3_Loop [2025-04-26 16:20:47,930 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:20:47,930 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:20:47,930 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:47,949 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:20:47,950 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:20:47,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:47,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:47,951 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:47,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 16:20:47,953 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:20:47,963 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:20:47,963 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:20:47,963 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:20:47,963 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:20:47,963 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:20:47,964 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:20:47,964 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:20:47,965 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:20:47,968 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:20:47,968 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:20:47,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:47,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:47,972 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:47,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 16:20:47,973 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:20:47,976 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-04-26 16:20:47,977 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:20:47,977 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:20:47,977 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = 2*x + 1 Supporting invariants [] [2025-04-26 16:20:47,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 16:20:47,984 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:20:47,997 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:48,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:20:48,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:20:48,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:48,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:48,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:20:48,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:20:48,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:48,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:20:48,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:48,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:48,016 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:20:48,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:20:48,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:20:48,032 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:20:48,032 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 47 transitions. cyclomatic complexity: 30 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:48,048 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 47 transitions. cyclomatic complexity: 30. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 38 states and 69 transitions. Complement of second has 6 states. [2025-04-26 16:20:48,049 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:20:48,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:48,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 19 transitions. [2025-04-26 16:20:48,049 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 16:20:48,049 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:48,049 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 16:20:48,050 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:48,050 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 19 transitions. Stem has 6 letters. Loop has 4 letters. [2025-04-26 16:20:48,050 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:48,050 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 69 transitions. [2025-04-26 16:20:48,050 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10 [2025-04-26 16:20:48,051 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 21 states and 36 transitions. [2025-04-26 16:20:48,051 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2025-04-26 16:20:48,051 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2025-04-26 16:20:48,051 INFO L74 IsDeterministic]: Start isDeterministic. Operand 21 states and 36 transitions. [2025-04-26 16:20:48,051 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:20:48,051 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 36 transitions. [2025-04-26 16:20:48,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 36 transitions. [2025-04-26 16:20:48,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-04-26 16:20:48,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.7142857142857142) internal successors, (in total 36), 20 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:48,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 36 transitions. [2025-04-26 16:20:48,052 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 36 transitions. [2025-04-26 16:20:48,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:20:48,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 16:20:48,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-26 16:20:48,053 INFO L87 Difference]: Start difference. First operand 21 states and 36 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (in total 6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:48,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:20:48,075 INFO L93 Difference]: Finished difference Result 31 states and 51 transitions. [2025-04-26 16:20:48,075 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 51 transitions. [2025-04-26 16:20:48,075 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2025-04-26 16:20:48,076 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 51 transitions. [2025-04-26 16:20:48,076 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2025-04-26 16:20:48,076 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2025-04-26 16:20:48,076 INFO L74 IsDeterministic]: Start isDeterministic. Operand 31 states and 51 transitions. [2025-04-26 16:20:48,076 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:20:48,076 INFO L218 hiAutomatonCegarLoop]: Abstraction has 31 states and 51 transitions. [2025-04-26 16:20:48,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 51 transitions. [2025-04-26 16:20:48,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 25. [2025-04-26 16:20:48,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.64) internal successors, (in total 41), 24 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:48,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 41 transitions. [2025-04-26 16:20:48,077 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 41 transitions. [2025-04-26 16:20:48,078 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 16:20:48,078 INFO L438 stractBuchiCegarLoop]: Abstraction has 25 states and 41 transitions. [2025-04-26 16:20:48,078 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:20:48,078 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 41 transitions. [2025-04-26 16:20:48,079 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2025-04-26 16:20:48,079 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:20:48,079 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:20:48,079 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2025-04-26 16:20:48,079 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:20:48,079 INFO L752 eck$LassoCheckResult]: Stem: "[28] $Ultimate##0-->L15: Formula: (= (+ 2 v_x_5) 0) InVars {} OutVars{x=v_x_5} AuxVars[] AssignedVars[x]" "[44] L15-->L24: Formula: (= v_decThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{decThread1of1ForFork0_thidvar0=v_decThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[decThread1of1ForFork0_thidvar0]" "[47] L15-1-->L32: Formula: (and (= 2 v_incThread1of1ForFork1_thidvar0_2) (= 2 v_incThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{incThread1of1ForFork1_thidvar0=v_incThread1of1ForFork1_thidvar0_2, incThread1of1ForFork1_thidvar1=v_incThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[incThread1of1ForFork1_thidvar0, incThread1of1ForFork1_thidvar1]" "[39] L32-->L33: Formula: (< v_x_9 0) InVars {x=v_x_9} OutVars{x=v_x_9} AuxVars[] AssignedVars[]" "[41] L33-->L32: Formula: (= (+ v_x_7 1) v_x_6) InVars {x=v_x_7} OutVars{x=v_x_6} AuxVars[] AssignedVars[x]" "[39] L32-->L33: Formula: (< v_x_9 0) InVars {x=v_x_9} OutVars{x=v_x_9} AuxVars[] AssignedVars[]" "[41] L33-->L32: Formula: (= (+ v_x_7 1) v_x_6) InVars {x=v_x_7} OutVars{x=v_x_6} AuxVars[] AssignedVars[x]" "[35] L24-->L25: Formula: (< 0 (+ v_x_1 1)) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[]" "[37] L25-->L24: Formula: (= v_x_3 (+ v_x_2 1)) InVars {x=v_x_3} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" [2025-04-26 16:20:48,079 INFO L754 eck$LassoCheckResult]: Loop: "[35] L24-->L25: Formula: (< 0 (+ v_x_1 1)) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[]" "[37] L25-->L24: Formula: (= v_x_3 (+ v_x_2 1)) InVars {x=v_x_3} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" [2025-04-26 16:20:48,079 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:48,080 INFO L85 PathProgramCache]: Analyzing trace with hash 27216164, now seen corresponding path program 1 times [2025-04-26 16:20:48,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:48,080 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404592909] [2025-04-26 16:20:48,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:48,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:48,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:20:48,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:20:48,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:48,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:48,084 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:48,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:20:48,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:20:48,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:48,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:48,091 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:48,092 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:48,092 INFO L85 PathProgramCache]: Analyzing trace with hash 2083, now seen corresponding path program 3 times [2025-04-26 16:20:48,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:48,092 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371994425] [2025-04-26 16:20:48,092 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:20:48,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:48,094 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:48,094 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:20:48,095 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:20:48,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:48,095 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:48,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:48,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:20:48,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:48,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:48,096 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:48,096 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:48,096 INFO L85 PathProgramCache]: Analyzing trace with hash 384930950, now seen corresponding path program 2 times [2025-04-26 16:20:48,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:48,097 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026176817] [2025-04-26 16:20:48,097 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:20:48,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:48,099 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-04-26 16:20:48,102 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:20:48,102 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:20:48,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:48,137 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-26 16:20:48,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:20:48,137 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026176817] [2025-04-26 16:20:48,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026176817] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:20:48,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:20:48,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-26 16:20:48,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277132426] [2025-04-26 16:20:48,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:20:48,147 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:20:48,147 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:20:48,147 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:20:48,147 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:20:48,147 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:20:48,147 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:48,147 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:20:48,147 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:20:48,147 INFO L132 ssoRankerPreferences]: Filename of dumped script: concurrent_increment_nonterminating2.bpl_petrified1_Iteration4_Loop [2025-04-26 16:20:48,147 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:20:48,147 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:20:48,148 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:48,164 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:20:48,164 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:20:48,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:48,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:48,166 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:48,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 16:20:48,170 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:20:48,170 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:20:48,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 16:20:48,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:48,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:48,188 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:48,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 16:20:48,191 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:20:48,191 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:20:48,212 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:20:48,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-04-26 16:20:48,216 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:20:48,216 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:20:48,216 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:20:48,216 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:20:48,216 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:20:48,216 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:48,216 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:20:48,216 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:20:48,216 INFO L132 ssoRankerPreferences]: Filename of dumped script: concurrent_increment_nonterminating2.bpl_petrified1_Iteration4_Loop [2025-04-26 16:20:48,216 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:20:48,216 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:20:48,217 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:48,232 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:20:48,232 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:20:48,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:48,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:48,234 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:48,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 16:20:48,237 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:20:48,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:20:48,247 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:20:48,247 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:20:48,247 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:20:48,247 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:20:48,248 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:20:48,248 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:20:48,250 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:20:48,251 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:20:48,251 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:20:48,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:48,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:48,253 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:48,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 16:20:48,254 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:20:48,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-04-26 16:20:48,257 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:20:48,257 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:20:48,257 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = 2*x + 1 Supporting invariants [] [2025-04-26 16:20:48,262 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-04-26 16:20:48,263 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:20:48,277 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:48,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:20:48,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:20:48,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:48,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:48,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:20:48,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:20:48,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:48,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:20:48,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:48,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:48,305 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:20:48,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:20:48,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-04-26 16:20:48,316 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:20:48,316 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 41 transitions. cyclomatic complexity: 22 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:48,342 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 41 transitions. cyclomatic complexity: 22. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 58 states and 105 transitions. Complement of second has 8 states. [2025-04-26 16:20:48,343 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:20:48,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:48,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2025-04-26 16:20:48,344 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 16:20:48,344 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:48,344 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 16:20:48,344 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:48,344 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 9 letters. Loop has 4 letters. [2025-04-26 16:20:48,344 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:48,344 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 105 transitions. [2025-04-26 16:20:48,345 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2025-04-26 16:20:48,345 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 38 states and 66 transitions. [2025-04-26 16:20:48,346 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2025-04-26 16:20:48,346 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2025-04-26 16:20:48,346 INFO L74 IsDeterministic]: Start isDeterministic. Operand 38 states and 66 transitions. [2025-04-26 16:20:48,346 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:20:48,346 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 66 transitions. [2025-04-26 16:20:48,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 66 transitions. [2025-04-26 16:20:48,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2025-04-26 16:20:48,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.7142857142857142) internal successors, (in total 48), 27 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:48,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 48 transitions. [2025-04-26 16:20:48,350 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 48 transitions. [2025-04-26 16:20:48,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:20:48,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 16:20:48,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-26 16:20:48,351 INFO L87 Difference]: Start difference. First operand 28 states and 48 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (in total 11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:48,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:20:48,368 INFO L93 Difference]: Finished difference Result 30 states and 50 transitions. [2025-04-26 16:20:48,368 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 50 transitions. [2025-04-26 16:20:48,368 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 13 [2025-04-26 16:20:48,368 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 50 transitions. [2025-04-26 16:20:48,369 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2025-04-26 16:20:48,369 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2025-04-26 16:20:48,369 INFO L74 IsDeterministic]: Start isDeterministic. Operand 30 states and 50 transitions. [2025-04-26 16:20:48,369 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:20:48,369 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30 states and 50 transitions. [2025-04-26 16:20:48,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 50 transitions. [2025-04-26 16:20:48,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2025-04-26 16:20:48,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.64) internal successors, (in total 41), 24 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:48,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 41 transitions. [2025-04-26 16:20:48,370 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 41 transitions. [2025-04-26 16:20:48,370 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 16:20:48,371 INFO L438 stractBuchiCegarLoop]: Abstraction has 25 states and 41 transitions. [2025-04-26 16:20:48,371 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:20:48,371 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 41 transitions. [2025-04-26 16:20:48,371 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2025-04-26 16:20:48,371 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:20:48,371 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:20:48,371 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2025-04-26 16:20:48,372 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:20:48,372 INFO L752 eck$LassoCheckResult]: Stem: "[28] $Ultimate##0-->L15: Formula: (= (+ 2 v_x_5) 0) InVars {} OutVars{x=v_x_5} AuxVars[] AssignedVars[x]" "[44] L15-->L24: Formula: (= v_decThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{decThread1of1ForFork0_thidvar0=v_decThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[decThread1of1ForFork0_thidvar0]" "[47] L15-1-->L32: Formula: (and (= 2 v_incThread1of1ForFork1_thidvar0_2) (= 2 v_incThread1of1ForFork1_thidvar1_2)) InVars {} OutVars{incThread1of1ForFork1_thidvar0=v_incThread1of1ForFork1_thidvar0_2, incThread1of1ForFork1_thidvar1=v_incThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[incThread1of1ForFork1_thidvar0, incThread1of1ForFork1_thidvar1]" "[39] L32-->L33: Formula: (< v_x_9 0) InVars {x=v_x_9} OutVars{x=v_x_9} AuxVars[] AssignedVars[]" "[41] L33-->L32: Formula: (= (+ v_x_7 1) v_x_6) InVars {x=v_x_7} OutVars{x=v_x_6} AuxVars[] AssignedVars[x]" "[39] L32-->L33: Formula: (< v_x_9 0) InVars {x=v_x_9} OutVars{x=v_x_9} AuxVars[] AssignedVars[]" "[41] L33-->L32: Formula: (= (+ v_x_7 1) v_x_6) InVars {x=v_x_7} OutVars{x=v_x_6} AuxVars[] AssignedVars[x]" "[35] L24-->L25: Formula: (< 0 (+ v_x_1 1)) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[]" "[37] L25-->L24: Formula: (= v_x_3 (+ v_x_2 1)) InVars {x=v_x_3} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" [2025-04-26 16:20:48,372 INFO L754 eck$LassoCheckResult]: Loop: "[39] L32-->L33: Formula: (< v_x_9 0) InVars {x=v_x_9} OutVars{x=v_x_9} AuxVars[] AssignedVars[]" "[41] L33-->L32: Formula: (= (+ v_x_7 1) v_x_6) InVars {x=v_x_7} OutVars{x=v_x_6} AuxVars[] AssignedVars[x]" "[35] L24-->L25: Formula: (< 0 (+ v_x_1 1)) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[]" "[37] L25-->L24: Formula: (= v_x_3 (+ v_x_2 1)) InVars {x=v_x_3} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" [2025-04-26 16:20:48,372 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:48,372 INFO L85 PathProgramCache]: Analyzing trace with hash 27216164, now seen corresponding path program 3 times [2025-04-26 16:20:48,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:48,372 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620897370] [2025-04-26 16:20:48,372 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:20:48,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:48,374 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 9 statements into 3 equivalence classes. [2025-04-26 16:20:48,376 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:20:48,376 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-26 16:20:48,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:48,376 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:48,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:20:48,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:20:48,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:48,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:48,379 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:48,379 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:48,379 INFO L85 PathProgramCache]: Analyzing trace with hash 2125893, now seen corresponding path program 1 times [2025-04-26 16:20:48,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:48,379 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009546124] [2025-04-26 16:20:48,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:48,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:48,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:20:48,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:20:48,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:48,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:48,382 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:48,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:20:48,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:20:48,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:48,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:48,383 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:48,383 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:48,384 INFO L85 PathProgramCache]: Analyzing trace with hash 551579624, now seen corresponding path program 4 times [2025-04-26 16:20:48,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:48,384 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810476944] [2025-04-26 16:20:48,384 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-26 16:20:48,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:48,386 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 13 statements into 2 equivalence classes. [2025-04-26 16:20:48,388 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:20:48,388 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-26 16:20:48,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:48,388 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:48,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:20:48,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:20:48,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:48,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:48,391 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:48,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:20:48,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:20:48,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:48,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:48,463 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:48,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:20:48,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:20:48,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:48,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:48,481 INFO L201 PluginConnector]: Adding new model concurrent_increment_nonterminating2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:20:48 BoogieIcfgContainer [2025-04-26 16:20:48,481 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:20:48,482 INFO L158 Benchmark]: Toolchain (without parser) took 2050.88ms. Allocated memory was 159.4MB in the beginning and 167.8MB in the end (delta: 8.4MB). Free memory was 85.6MB in the beginning and 43.5MB in the end (delta: 42.2MB). Peak memory consumption was 54.9MB. Max. memory is 8.0GB. [2025-04-26 16:20:48,482 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.79ms. Allocated memory is still 159.4MB. Free memory is still 86.5MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:20:48,482 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.51ms. Allocated memory is still 159.4MB. Free memory was 85.6MB in the beginning and 83.3MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:20:48,482 INFO L158 Benchmark]: Boogie Preprocessor took 20.74ms. Allocated memory is still 159.4MB. Free memory was 83.1MB in the beginning and 82.2MB in the end (delta: 919.8kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:20:48,482 INFO L158 Benchmark]: RCFGBuilder took 170.83ms. Allocated memory is still 159.4MB. Free memory was 82.2MB in the beginning and 73.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:20:48,482 INFO L158 Benchmark]: BuchiAutomizer took 1824.14ms. Allocated memory was 159.4MB in the beginning and 167.8MB in the end (delta: 8.4MB). Free memory was 73.7MB in the beginning and 43.5MB in the end (delta: 30.3MB). Peak memory consumption was 42.3MB. Max. memory is 8.0GB. [2025-04-26 16:20:48,483 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.79ms. Allocated memory is still 159.4MB. Free memory is still 86.5MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.51ms. Allocated memory is still 159.4MB. Free memory was 85.6MB in the beginning and 83.3MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 20.74ms. Allocated memory is still 159.4MB. Free memory was 83.1MB in the beginning and 82.2MB in the end (delta: 919.8kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 170.83ms. Allocated memory is still 159.4MB. Free memory was 82.2MB in the beginning and 73.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1824.14ms. Allocated memory was 159.4MB in the beginning and 167.8MB in the end (delta: 8.4MB). Free memory was 73.7MB in the beginning and 43.5MB in the end (delta: 30.3MB). Peak memory consumption was 42.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.7s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 1.0s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 46 StatesRemovedByMinimization, 6 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, 75 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 71 mSDsluCounter, 63 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 139 IncrementalHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 41 mSDtfsCounter, 139 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT1 conc0 concLT2 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital10 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq157 hnf93 smp100 dnf100 smp100 tf112 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 33ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (3 trivial, 4 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function 2 * x + 1 and consists of 5 locations. One deterministic module has affine ranking function -1 * x and consists of 5 locations. One deterministic module has affine ranking function 2 * x + 1 and consists of 4 locations. One deterministic module has affine ranking function 2 * x + 1 and consists of 5 locations. 3 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 25 locations. - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 32]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L13] 0 x := -2; VAL [x=-2] [L15] FORK 0 fork 1 dec(); VAL [x=-2] [L16] FORK 0 fork 2, 2 inc(); VAL [x=-2] [L32] COND TRUE 2 x < 0 VAL [x=-2] [L33] 2 x := x + 1; VAL [x=-1] [L32] COND TRUE 2 x < 0 VAL [x=-1] [L33] 2 x := x + 1; VAL [x=0] [L24] COND TRUE 1 x > -1 VAL [x=0] [L25] 1 x := x - 1; VAL [x=-1] Loop: [L32] COND TRUE x < 0 [L33] x := x + 1; [L24] COND TRUE x > -1 [L25] x := x - 1; End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 32]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L13] 0 x := -2; VAL [x=-2] [L15] FORK 0 fork 1 dec(); VAL [x=-2] [L16] FORK 0 fork 2, 2 inc(); VAL [x=-2] [L32] COND TRUE 2 x < 0 VAL [x=-2] [L33] 2 x := x + 1; VAL [x=-1] [L32] COND TRUE 2 x < 0 VAL [x=-1] [L33] 2 x := x + 1; VAL [x=0] [L24] COND TRUE 1 x > -1 VAL [x=0] [L25] 1 x := x - 1; VAL [x=-1] Loop: [L32] COND TRUE x < 0 [L33] x := x + 1; [L24] COND TRUE x > -1 [L25] x := x - 1; End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-04-26 16:20:48,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-04-26 16:20:48,696 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...