/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_FiveToOne_nonterminating.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:20:45,196 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:20:45,243 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:45,249 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:20:45,249 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:20:45,273 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:20:45,273 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:20:45,273 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:20:45,275 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:20:45,275 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:20:45,275 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:20:45,276 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:20:45,276 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:20:45,276 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:20:45,276 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:20:45,276 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:20:45,276 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:20:45,276 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:20:45,276 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:20:45,276 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:20:45,276 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:20:45,277 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:20:45,277 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:20:45,277 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:20:45,277 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:20:45,277 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:20:45,277 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:20:45,277 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:20:45,277 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:20:45,277 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:20:45,277 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:20:45,277 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:20:45,277 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:20:45,277 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:20:45,278 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:20:45,278 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:20:45,278 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:20:45,490 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:20:45,496 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:20:45,497 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:20:45,498 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:20:45,498 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:20:45,499 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/termination/concurrent_FiveToOne_nonterminating.bpl [2025-04-26 16:20:45,500 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/termination/concurrent_FiveToOne_nonterminating.bpl' [2025-04-26 16:20:45,513 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:20:45,514 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:20:45,514 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:20:45,514 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:20:45,514 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:20:45,521 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:45" (1/1) ... [2025-04-26 16:20:45,540 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:45" (1/1) ... [2025-04-26 16:20:45,546 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:20:45,548 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:20:45,549 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:20:45,550 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:20:45,550 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:20:45,554 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:45" (1/1) ... [2025-04-26 16:20:45,554 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:45" (1/1) ... [2025-04-26 16:20:45,555 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:45" (1/1) ... [2025-04-26 16:20:45,555 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:45" (1/1) ... [2025-04-26 16:20:45,557 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:45" (1/1) ... [2025-04-26 16:20:45,558 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:45" (1/1) ... [2025-04-26 16:20:45,562 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:45" (1/1) ... [2025-04-26 16:20:45,563 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:45" (1/1) ... [2025-04-26 16:20:45,563 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:45" (1/1) ... [2025-04-26 16:20:45,573 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:20:45,574 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:20:45,574 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:20:45,574 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:20:45,576 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:45" (1/1) ... [2025-04-26 16:20:45,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:45,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:45,600 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:45,602 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:45,623 INFO L124 BoogieDeclarations]: Specification and implementation of procedure once given in one single declaration [2025-04-26 16:20:45,623 INFO L130 BoogieDeclarations]: Found specification of procedure once [2025-04-26 16:20:45,623 INFO L138 BoogieDeclarations]: Found implementation of procedure once [2025-04-26 16:20:45,623 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:20:45,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:20:45,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:20:45,623 INFO L124 BoogieDeclarations]: Specification and implementation of procedure five given in one single declaration [2025-04-26 16:20:45,623 INFO L130 BoogieDeclarations]: Found specification of procedure five [2025-04-26 16:20:45,624 INFO L138 BoogieDeclarations]: Found implementation of procedure five [2025-04-26 16:20:45,624 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:45,657 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:20:45,658 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:20:45,710 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:20:45,710 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:20:45,720 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:20:45,720 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:20:45,720 INFO L201 PluginConnector]: Adding new model concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:20:45 BoogieIcfgContainer [2025-04-26 16:20:45,720 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:20:45,721 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:20:45,721 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:20:45,726 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:20:45,727 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:20:45,727 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:45" (1/2) ... [2025-04-26 16:20:45,728 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5cd84323 and model type concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:20:45, skipping insertion in model container [2025-04-26 16:20:45,728 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:20:45,728 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:20:45" (2/2) ... [2025-04-26 16:20:45,729 INFO L376 chiAutomizerObserver]: Analyzing ICFG concurrent_FiveToOne_nonterminating.bpl [2025-04-26 16:20:45,771 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-26 16:20:45,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 21 places, 20 transitions, 60 flow [2025-04-26 16:20:45,829 INFO L116 PetriNetUnfolderBase]: 3/16 cut-off events. [2025-04-26 16:20:45,833 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-26 16:20:45,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 16 events. 3/16 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 16 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 13. Up to 3 conditions per place. [2025-04-26 16:20:45,839 INFO L82 GeneralOperation]: Start removeDead. Operand has 21 places, 20 transitions, 60 flow [2025-04-26 16:20:45,846 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 19 places, 16 transitions, 50 flow [2025-04-26 16:20:45,846 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 19 places, 16 transitions, 50 flow [2025-04-26 16:20:45,858 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:20:45,858 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:20:45,858 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:20:45,858 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:20:45,859 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:20:45,859 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:20:45,859 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:20:45,859 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:20:45,860 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:20:45,890 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 18 [2025-04-26 16:20:45,891 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:20:45,891 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:20:45,897 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:20:45,897 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:20:45,897 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:20:45,897 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 31 states, but on-demand construction may add more states [2025-04-26 16:20:45,899 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 18 [2025-04-26 16:20:45,899 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:20:45,899 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:20:45,899 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 16:20:45,899 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:20:45,905 INFO L752 eck$LassoCheckResult]: Stem: "[31] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x]" "[44] L8-->L17: Formula: (= v_fiveThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{fiveThread1of1ForFork0_thidvar0=v_fiveThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[fiveThread1of1ForFork0_thidvar0]" [2025-04-26 16:20:45,905 INFO L754 eck$LassoCheckResult]: Loop: "[39] L17-->L18: Formula: (< v_x_8 4) InVars {x=v_x_8} OutVars{x=v_x_8} AuxVars[] AssignedVars[]" "[41] L18-->L17: Formula: (= (+ v_x_6 1) v_x_5) InVars {x=v_x_6} OutVars{x=v_x_5} AuxVars[] AssignedVars[x]" [2025-04-26 16:20:45,909 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:45,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1966, now seen corresponding path program 1 times [2025-04-26 16:20:45,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:45,917 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864301113] [2025-04-26 16:20:45,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:45,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:45,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:45,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:20:45,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:45,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:45,970 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:45,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:45,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:20:45,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:45,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:45,985 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:45,988 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:45,988 INFO L85 PathProgramCache]: Analyzing trace with hash 2211, now seen corresponding path program 1 times [2025-04-26 16:20:45,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:45,989 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862854276] [2025-04-26 16:20:45,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:45,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:45,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:45,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:20:45,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:45,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:45,996 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:45,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:46,000 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,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:46,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:46,002 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:46,003 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:46,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1890576, now seen corresponding path program 1 times [2025-04-26 16:20:46,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:46,003 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106983719] [2025-04-26 16:20:46,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:46,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:46,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:20:46,013 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,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:46,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:46,013 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:46,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:20:46,016 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,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:46,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:46,017 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:46,067 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:20:46,068 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:20:46,068 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:20:46,068 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:20:46,069 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:20:46,069 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:46,069 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:20:46,069 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:20:46,070 INFO L132 ssoRankerPreferences]: Filename of dumped script: concurrent_FiveToOne_nonterminating.bpl_petrified1_Iteration1_Loop [2025-04-26 16:20:46,070 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:20:46,070 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:20:46,079 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:46,122 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:20:46,124 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:20:46,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:46,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:46,127 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:46,129 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:46,132 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:20:46,132 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:20:46,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 16:20:46,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:46,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:46,156 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:46,157 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:46,159 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:20:46,159 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:20:46,189 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:20:46,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 16:20:46,194 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:20:46,194 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:20:46,194 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:20:46,194 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:20:46,194 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:20:46,194 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:46,194 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:20:46,194 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:20:46,194 INFO L132 ssoRankerPreferences]: Filename of dumped script: concurrent_FiveToOne_nonterminating.bpl_petrified1_Iteration1_Loop [2025-04-26 16:20:46,194 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:20:46,194 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:20:46,196 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:46,222 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:20:46,226 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:20:46,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:46,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:46,230 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:46,231 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:46,232 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:46,243 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:20:46,243 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:20:46,243 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:20:46,244 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:20:46,244 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:20:46,250 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:20:46,251 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:20:46,254 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:20:46,259 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:20:46,259 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 16:20:46,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:46,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:46,264 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:46,265 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:46,266 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:20:46,269 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:46,270 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:20:46,270 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:20:46,270 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = -2*x + 7 Supporting invariants [] [2025-04-26 16:20:46,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 16:20:46,279 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:20:46,305 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:46,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:46,314 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,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:46,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:46,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:20:46,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:20:46,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:46,330 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,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:46,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:46,332 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:20:46,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:20:46,361 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,387 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:46,390 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 31 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:46,539 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 31 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 134 states and 274 transitions. Complement of second has 8 states. [2025-04-26 16:20:46,540 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:46,544 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:46,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2025-04-26 16:20:46,558 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 16:20:46,559 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:46,560 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:20:46,560 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:46,560 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 40 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 16:20:46,560 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:46,561 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 134 states and 274 transitions. [2025-04-26 16:20:46,568 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 16 [2025-04-26 16:20:46,573 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 134 states to 43 states and 88 transitions. [2025-04-26 16:20:46,574 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2025-04-26 16:20:46,574 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2025-04-26 16:20:46,575 INFO L74 IsDeterministic]: Start isDeterministic. Operand 43 states and 88 transitions. [2025-04-26 16:20:46,575 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:20:46,575 INFO L218 hiAutomatonCegarLoop]: Abstraction has 43 states and 88 transitions. [2025-04-26 16:20:46,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 88 transitions. [2025-04-26 16:20:46,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 32. [2025-04-26 16:20:46,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 2.0625) internal successors, (in total 66), 31 states have internal predecessors, (66), 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:46,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 66 transitions. [2025-04-26 16:20:46,638 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 66 transitions. [2025-04-26 16:20:46,638 INFO L438 stractBuchiCegarLoop]: Abstraction has 32 states and 66 transitions. [2025-04-26 16:20:46,638 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:20:46,639 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 66 transitions. [2025-04-26 16:20:46,641 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 16 [2025-04-26 16:20:46,641 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:20:46,641 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:20:46,642 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:20:46,642 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:20:46,642 INFO L752 eck$LassoCheckResult]: Stem: "[31] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x]" "[44] L8-->L17: Formula: (= v_fiveThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{fiveThread1of1ForFork0_thidvar0=v_fiveThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[fiveThread1of1ForFork0_thidvar0]" "[38] L17-->fiveFINAL: Formula: (<= 4 v_x_7) InVars {x=v_x_7} OutVars{x=v_x_7} AuxVars[] AssignedVars[]" "[47] L8-1-->L25: Formula: (= v_onceThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{onceThread1of1ForFork1_thidvar0=v_onceThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[onceThread1of1ForFork1_thidvar0]" [2025-04-26 16:20:46,642 INFO L754 eck$LassoCheckResult]: Loop: "[35] L25-->L26: Formula: (= v_x_1 4) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[]" "[37] L26-->L25: Formula: (= v_x_2 1) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" [2025-04-26 16:20:46,644 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:46,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1890551, now seen corresponding path program 1 times [2025-04-26 16:20:46,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:46,644 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484350332] [2025-04-26 16:20:46,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:46,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:46,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:20:46,650 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,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:46,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:46,676 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,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:20:46,679 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484350332] [2025-04-26 16:20:46,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484350332] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:20:46,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:20:46,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-26 16:20:46,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835095526] [2025-04-26 16:20:46,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:20:46,682 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:20:46,683 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:46,683 INFO L85 PathProgramCache]: Analyzing trace with hash 2083, now seen corresponding path program 1 times [2025-04-26 16:20:46,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:46,683 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409860655] [2025-04-26 16:20:46,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:46,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:46,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:46,685 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,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:46,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:46,686 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:46,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:20:46,686 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,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:46,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:46,687 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:46,699 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:20:46,699 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:20:46,699 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:20:46,699 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:20:46,699 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:20:46,699 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:46,699 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:20:46,699 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:20:46,699 INFO L132 ssoRankerPreferences]: Filename of dumped script: concurrent_FiveToOne_nonterminating.bpl_petrified1_Iteration2_Loop [2025-04-26 16:20:46,699 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:20:46,699 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:20:46,700 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:46,722 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:20:46,722 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:20:46,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:46,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:46,724 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:46,726 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:46,727 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:20:46,727 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:20:46,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 16:20:46,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:46,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:46,747 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:46,748 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:46,750 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:20:46,750 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:20:46,762 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:20:46,768 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:46,769 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:20:46,769 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:20:46,769 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:20:46,769 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:20:46,769 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:20:46,769 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:46,769 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:20:46,769 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:20:46,769 INFO L132 ssoRankerPreferences]: Filename of dumped script: concurrent_FiveToOne_nonterminating.bpl_petrified1_Iteration2_Loop [2025-04-26 16:20:46,769 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:20:46,769 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:20:46,770 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:46,790 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:20:46,790 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:20:46,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:46,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:46,793 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:46,794 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:46,795 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:46,805 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:20:46,805 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:20:46,805 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:20:46,805 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:20:46,805 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:20:46,808 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:20:46,808 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:20:46,813 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:20:46,816 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:20:46,817 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:20:46,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:46,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:46,819 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:46,820 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:46,821 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:20:46,824 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:46,824 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:20:46,824 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:20:46,825 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = 1*x Supporting invariants [] [2025-04-26 16:20:46,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 16:20:46,831 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:20:46,842 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:46,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:20:46,848 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,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:46,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:46,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:20:46,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:20:46,861 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 unsat [2025-04-26 16:20:46,862 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:20:46,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:20:46,885 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,886 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:46,886 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 66 transitions. cyclomatic complexity: 44 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:46,952 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 66 transitions. cyclomatic complexity: 44. 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 100 states and 191 transitions. Complement of second has 9 states. [2025-04-26 16:20:46,953 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2025-04-26 16:20:46,954 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:46,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2025-04-26 16:20:46,954 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 16:20:46,954 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:46,954 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 16:20:46,954 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:46,954 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 4 letters. Loop has 4 letters. [2025-04-26 16:20:46,955 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:46,955 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 100 states and 191 transitions. [2025-04-26 16:20:46,958 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 16 [2025-04-26 16:20:46,959 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 100 states to 54 states and 107 transitions. [2025-04-26 16:20:46,959 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2025-04-26 16:20:46,959 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2025-04-26 16:20:46,959 INFO L74 IsDeterministic]: Start isDeterministic. Operand 54 states and 107 transitions. [2025-04-26 16:20:46,959 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:20:46,959 INFO L218 hiAutomatonCegarLoop]: Abstraction has 54 states and 107 transitions. [2025-04-26 16:20:46,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 107 transitions. [2025-04-26 16:20:46,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 37. [2025-04-26 16:20:46,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 2.054054054054054) internal successors, (in total 76), 36 states have internal predecessors, (76), 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:46,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 76 transitions. [2025-04-26 16:20:46,966 INFO L240 hiAutomatonCegarLoop]: Abstraction has 37 states and 76 transitions. [2025-04-26 16:20:46,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:20:46,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-26 16:20:46,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-26 16:20:46,968 INFO L87 Difference]: Start difference. First operand 37 states and 76 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:46,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:20:46,987 INFO L93 Difference]: Finished difference Result 49 states and 87 transitions. [2025-04-26 16:20:46,987 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 87 transitions. [2025-04-26 16:20:46,988 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2025-04-26 16:20:46,989 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 38 states and 68 transitions. [2025-04-26 16:20:46,990 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2025-04-26 16:20:46,990 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2025-04-26 16:20:46,990 INFO L74 IsDeterministic]: Start isDeterministic. Operand 38 states and 68 transitions. [2025-04-26 16:20:46,990 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:20:46,990 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 68 transitions. [2025-04-26 16:20:46,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 68 transitions. [2025-04-26 16:20:46,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 27. [2025-04-26 16:20:46,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.8148148148148149) internal successors, (in total 49), 26 states have internal predecessors, (49), 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:46,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 49 transitions. [2025-04-26 16:20:46,992 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 49 transitions. [2025-04-26 16:20:46,993 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-26 16:20:46,994 INFO L438 stractBuchiCegarLoop]: Abstraction has 27 states and 49 transitions. [2025-04-26 16:20:46,994 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:20:46,994 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 49 transitions. [2025-04-26 16:20:46,994 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2025-04-26 16:20:46,994 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:20:46,994 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:20:46,995 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:20:46,995 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:20:46,995 INFO L752 eck$LassoCheckResult]: Stem: "[31] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x]" "[44] L8-->L17: Formula: (= v_fiveThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{fiveThread1of1ForFork0_thidvar0=v_fiveThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[fiveThread1of1ForFork0_thidvar0]" "[39] L17-->L18: Formula: (< v_x_8 4) InVars {x=v_x_8} OutVars{x=v_x_8} AuxVars[] AssignedVars[]" "[41] L18-->L17: Formula: (= (+ v_x_6 1) v_x_5) InVars {x=v_x_6} OutVars{x=v_x_5} AuxVars[] AssignedVars[x]" "[47] L8-1-->L25: Formula: (= v_onceThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{onceThread1of1ForFork1_thidvar0=v_onceThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[onceThread1of1ForFork1_thidvar0]" "[35] L25-->L26: Formula: (= v_x_1 4) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[]" "[37] L26-->L25: Formula: (= v_x_2 1) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" [2025-04-26 16:20:46,995 INFO L754 eck$LassoCheckResult]: Loop: "[39] L17-->L18: Formula: (< v_x_8 4) InVars {x=v_x_8} OutVars{x=v_x_8} AuxVars[] AssignedVars[]" "[41] L18-->L17: Formula: (= (+ v_x_6 1) v_x_5) InVars {x=v_x_6} OutVars{x=v_x_5} AuxVars[] AssignedVars[x]" "[35] L25-->L26: Formula: (= v_x_1 4) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[]" "[37] L26-->L25: Formula: (= v_x_2 1) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" [2025-04-26 16:20:46,995 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:46,995 INFO L85 PathProgramCache]: Analyzing trace with hash 487621057, now seen corresponding path program 1 times [2025-04-26 16:20:46,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:46,996 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425733651] [2025-04-26 16:20:46,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:46,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:46,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:20:47,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:20:47,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:47,023 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,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:20:47,023 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425733651] [2025-04-26 16:20:47,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425733651] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-26 16:20:47,023 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479073331] [2025-04-26 16:20:47,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:47,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 16:20:47,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:47,025 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,027 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,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:20:47,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:20:47,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:47,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-26 16:20:47,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:20:47,055 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,055 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-26 16:20:47,072 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,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479073331] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-26 16:20:47,072 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-26 16:20:47,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2025-04-26 16:20:47,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851275191] [2025-04-26 16:20:47,073 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-26 16:20:47,073 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:20:47,073 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:47,073 INFO L85 PathProgramCache]: Analyzing trace with hash 2125893, now seen corresponding path program 1 times [2025-04-26 16:20:47,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:47,073 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688336896] [2025-04-26 16:20:47,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:47,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:47,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:20:47,076 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,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:47,076 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:47,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:20:47,078 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,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:47,079 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:47,103 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:20:47,104 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:20:47,104 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:20:47,104 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:20:47,104 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 16:20:47,104 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:47,104 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:20:47,104 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:20:47,104 INFO L132 ssoRankerPreferences]: Filename of dumped script: concurrent_FiveToOne_nonterminating.bpl_petrified1_Iteration3_Loop [2025-04-26 16:20:47,104 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:20:47,104 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:20:47,104 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:47,122 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:20:47,122 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 16:20:47,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:47,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:47,124 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,125 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,127 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 16:20:47,127 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:20:47,148 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 16:20:47,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:47,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:47,150 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,151 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,152 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 16:20:47,152 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 16:20:47,164 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 16:20:47,170 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,171 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:20:47,171 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:20:47,171 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:20:47,171 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:20:47,171 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:20:47,171 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:47,171 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:20:47,171 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:20:47,171 INFO L132 ssoRankerPreferences]: Filename of dumped script: concurrent_FiveToOne_nonterminating.bpl_petrified1_Iteration3_Loop [2025-04-26 16:20:47,171 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:20:47,171 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:20:47,171 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:47,187 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:20:47,187 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:20:47,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:47,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:47,190 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,191 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,193 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,203 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:20:47,203 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:20:47,203 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:20:47,203 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:20:47,203 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:20:47,205 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:20:47,205 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:20:47,207 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:20:47,208 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 16:20:47,208 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 16:20:47,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:47,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:47,210 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,211 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,212 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:20:47,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-04-26 16:20:47,215 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 16:20:47,215 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:20:47,215 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(x) = 1*x Supporting invariants [] [2025-04-26 16:20:47,220 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,221 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:20:47,231 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:47,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:20:47,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:20:47,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:47,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:20:47,239 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:20:47,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 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 4 of 4 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,254 WARN L254 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 5 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,275 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:20:47,275 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 49 transitions. cyclomatic complexity: 29 Second operand has 5 states, 5 states have (on average 2.2) internal successors, (in total 11), 5 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:47,348 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 49 transitions. cyclomatic complexity: 29. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (in total 11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 71 states and 134 transitions. Complement of second has 13 states. [2025-04-26 16:20:47,350 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2025-04-26 16:20:47,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (in total 11), 5 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:47,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2025-04-26 16:20:47,351 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 7 states and 27 transitions. Stem has 7 letters. Loop has 4 letters. [2025-04-26 16:20:47,351 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:47,351 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 7 states and 27 transitions. Stem has 11 letters. Loop has 4 letters. [2025-04-26 16:20:47,351 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:47,351 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 7 states and 27 transitions. Stem has 7 letters. Loop has 8 letters. [2025-04-26 16:20:47,351 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:47,351 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 134 transitions. [2025-04-26 16:20:47,352 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 14 [2025-04-26 16:20:47,353 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 59 states and 110 transitions. [2025-04-26 16:20:47,353 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2025-04-26 16:20:47,353 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2025-04-26 16:20:47,353 INFO L74 IsDeterministic]: Start isDeterministic. Operand 59 states and 110 transitions. [2025-04-26 16:20:47,353 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:20:47,353 INFO L218 hiAutomatonCegarLoop]: Abstraction has 59 states and 110 transitions. [2025-04-26 16:20:47,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 110 transitions. [2025-04-26 16:20:47,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 41. [2025-04-26 16:20:47,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.9268292682926829) internal successors, (in total 79), 40 states have internal predecessors, (79), 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,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 79 transitions. [2025-04-26 16:20:47,358 INFO L240 hiAutomatonCegarLoop]: Abstraction has 41 states and 79 transitions. [2025-04-26 16:20:47,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:20:47,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 16:20:47,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-26 16:20:47,358 INFO L87 Difference]: Start difference. First operand 41 states and 79 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (in total 13), 4 states have internal predecessors, (13), 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,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:20:47,385 INFO L93 Difference]: Finished difference Result 65 states and 109 transitions. [2025-04-26 16:20:47,385 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 109 transitions. [2025-04-26 16:20:47,386 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 15 [2025-04-26 16:20:47,387 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 60 states and 103 transitions. [2025-04-26 16:20:47,387 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2025-04-26 16:20:47,387 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2025-04-26 16:20:47,387 INFO L74 IsDeterministic]: Start isDeterministic. Operand 60 states and 103 transitions. [2025-04-26 16:20:47,387 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:20:47,387 INFO L218 hiAutomatonCegarLoop]: Abstraction has 60 states and 103 transitions. [2025-04-26 16:20:47,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 103 transitions. [2025-04-26 16:20:47,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 38. [2025-04-26 16:20:47,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.736842105263158) internal successors, (in total 66), 37 states have internal predecessors, (66), 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,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 66 transitions. [2025-04-26 16:20:47,389 INFO L240 hiAutomatonCegarLoop]: Abstraction has 38 states and 66 transitions. [2025-04-26 16:20:47,390 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 16:20:47,390 INFO L438 stractBuchiCegarLoop]: Abstraction has 38 states and 66 transitions. [2025-04-26 16:20:47,390 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:20:47,390 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 66 transitions. [2025-04-26 16:20:47,391 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 15 [2025-04-26 16:20:47,391 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:20:47,391 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:20:47,391 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 3, 1, 1, 1, 1, 1] [2025-04-26 16:20:47,391 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [3, 3, 1, 1] [2025-04-26 16:20:47,391 INFO L752 eck$LassoCheckResult]: Stem: "[31] $Ultimate##0-->L8: Formula: (= v_x_4 1) InVars {} OutVars{x=v_x_4} AuxVars[] AssignedVars[x]" "[44] L8-->L17: Formula: (= v_fiveThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{fiveThread1of1ForFork0_thidvar0=v_fiveThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[fiveThread1of1ForFork0_thidvar0]" "[39] L17-->L18: Formula: (< v_x_8 4) InVars {x=v_x_8} OutVars{x=v_x_8} AuxVars[] AssignedVars[]" "[41] L18-->L17: Formula: (= (+ v_x_6 1) v_x_5) InVars {x=v_x_6} OutVars{x=v_x_5} AuxVars[] AssignedVars[x]" "[39] L17-->L18: Formula: (< v_x_8 4) InVars {x=v_x_8} OutVars{x=v_x_8} AuxVars[] AssignedVars[]" "[41] L18-->L17: Formula: (= (+ v_x_6 1) v_x_5) InVars {x=v_x_6} OutVars{x=v_x_5} AuxVars[] AssignedVars[x]" "[39] L17-->L18: Formula: (< v_x_8 4) InVars {x=v_x_8} OutVars{x=v_x_8} AuxVars[] AssignedVars[]" "[41] L18-->L17: Formula: (= (+ v_x_6 1) v_x_5) InVars {x=v_x_6} OutVars{x=v_x_5} AuxVars[] AssignedVars[x]" "[47] L8-1-->L25: Formula: (= v_onceThread1of1ForFork1_thidvar0_2 2) InVars {} OutVars{onceThread1of1ForFork1_thidvar0=v_onceThread1of1ForFork1_thidvar0_2} AuxVars[] AssignedVars[onceThread1of1ForFork1_thidvar0]" "[35] L25-->L26: Formula: (= v_x_1 4) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[]" "[37] L26-->L25: Formula: (= v_x_2 1) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" [2025-04-26 16:20:47,391 INFO L754 eck$LassoCheckResult]: Loop: "[39] L17-->L18: Formula: (< v_x_8 4) InVars {x=v_x_8} OutVars{x=v_x_8} AuxVars[] AssignedVars[]" "[41] L18-->L17: Formula: (= (+ v_x_6 1) v_x_5) InVars {x=v_x_6} OutVars{x=v_x_5} AuxVars[] AssignedVars[x]" "[39] L17-->L18: Formula: (< v_x_8 4) InVars {x=v_x_8} OutVars{x=v_x_8} AuxVars[] AssignedVars[]" "[41] L18-->L17: Formula: (= (+ v_x_6 1) v_x_5) InVars {x=v_x_6} OutVars{x=v_x_5} AuxVars[] AssignedVars[x]" "[39] L17-->L18: Formula: (< v_x_8 4) InVars {x=v_x_8} OutVars{x=v_x_8} AuxVars[] AssignedVars[]" "[41] L18-->L17: Formula: (= (+ v_x_6 1) v_x_5) InVars {x=v_x_6} OutVars{x=v_x_5} AuxVars[] AssignedVars[x]" "[35] L25-->L26: Formula: (= v_x_1 4) InVars {x=v_x_1} OutVars{x=v_x_1} AuxVars[] AssignedVars[]" "[37] L26-->L25: Formula: (= v_x_2 1) InVars {} OutVars{x=v_x_2} AuxVars[] AssignedVars[x]" [2025-04-26 16:20:47,392 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:47,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1664976387, now seen corresponding path program 2 times [2025-04-26 16:20:47,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:47,392 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077854414] [2025-04-26 16:20:47,392 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:20:47,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:47,395 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-04-26 16:20:47,397 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:47,398 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:20:47,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:47,398 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:47,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:20:47,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:20:47,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:47,403 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:47,403 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:47,403 INFO L85 PathProgramCache]: Analyzing trace with hash 626188041, now seen corresponding path program 2 times [2025-04-26 16:20:47,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:47,408 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623597404] [2025-04-26 16:20:47,408 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:20:47,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:47,412 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 8 statements into 2 equivalence classes. [2025-04-26 16:20:47,416 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:20:47,416 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 16:20:47,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:47,416 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:47,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:20:47,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:20:47,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:47,424 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:47,424 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:47,429 INFO L85 PathProgramCache]: Analyzing trace with hash 736730373, now seen corresponding path program 3 times [2025-04-26 16:20:47,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:47,429 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639087045] [2025-04-26 16:20:47,429 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:20:47,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:47,436 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 4 equivalence classes. [2025-04-26 16:20:47,440 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:20:47,440 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-26 16:20:47,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:47,440 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:47,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:20:47,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:20:47,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:47,453 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:47,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:20:47,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:20:47,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:47,534 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:47,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:20:47,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:20:47,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:47,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:47,555 INFO L201 PluginConnector]: Adding new model concurrent_FiveToOne_nonterminating.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:20:47 BoogieIcfgContainer [2025-04-26 16:20:47,556 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:20:47,556 INFO L158 Benchmark]: Toolchain (without parser) took 2042.54ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 86.7MB in the beginning and 54.5MB in the end (delta: 32.2MB). Peak memory consumption was 29.6MB. Max. memory is 8.0GB. [2025-04-26 16:20:47,556 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 87.5MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:20:47,557 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.20ms. Allocated memory is still 159.4MB. Free memory was 86.7MB in the beginning and 85.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:20:47,557 INFO L158 Benchmark]: Boogie Preprocessor took 24.17ms. Allocated memory is still 159.4MB. Free memory was 85.0MB in the beginning and 83.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:20:47,557 INFO L158 Benchmark]: RCFGBuilder took 146.08ms. Allocated memory is still 159.4MB. Free memory was 83.2MB in the beginning and 74.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:20:47,557 INFO L158 Benchmark]: BuchiAutomizer took 1834.64ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 74.5MB in the beginning and 54.5MB in the end (delta: 20.0MB). Peak memory consumption was 21.2MB. Max. memory is 8.0GB. [2025-04-26 16:20:47,559 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.18ms. Allocated memory is still 159.4MB. Free memory is still 87.5MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.20ms. Allocated memory is still 159.4MB. Free memory was 86.7MB in the beginning and 85.0MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 24.17ms. Allocated memory is still 159.4MB. Free memory was 85.0MB in the beginning and 83.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 146.08ms. Allocated memory is still 159.4MB. Free memory was 83.2MB in the beginning and 74.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1834.64ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 74.5MB in the beginning and 54.5MB in the end (delta: 20.0MB). Peak memory consumption was 21.2MB. 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 4 iterations. TraceHistogramMax:3. Analysis of lassos took 0.9s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 5. Automata minimization 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 79 StatesRemovedByMinimization, 5 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 [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 88 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 85 mSDsluCounter, 58 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 141 IncrementalHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 36 mSDtfsCounter, 141 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI0 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital8 mio100 ax100 hnf100 lsp100 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq186 hnf89 smp100 dnf100 smp100 tf113 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 43ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 3 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function 7 + -2 * x and consists of 5 locations. One deterministic module has affine ranking function x and consists of 5 locations. One deterministic module has affine ranking function x and consists of 7 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 38 locations. - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 17]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L6] 0 x := 1; VAL [x=1] [L8] FORK 0 fork 1 five(); VAL [x=1] [L17] COND TRUE 1 x < 4 VAL [x=1] [L18] 1 x := x + 1; VAL [x=2] [L17] COND TRUE 1 x < 4 VAL [x=2] [L18] 1 x := x + 1; VAL [x=3] [L17] COND TRUE 1 x < 4 VAL [x=3] [L18] 1 x := x + 1; VAL [x=4] [L9] FORK 0 fork 2 once(); VAL [x=4] [L25] COND TRUE 2 x == 4 VAL [x=4] [L26] 2 x := 1; VAL [x=1] Loop: [L17] COND TRUE x < 4 [L18] x := x + 1; [L17] COND TRUE x < 4 [L18] x := x + 1; [L17] COND TRUE x < 4 [L18] x := x + 1; [L25] COND TRUE x == 4 [L26] x := 1; End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 17]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] 0 x := 1; VAL [x=1] [L8] FORK 0 fork 1 five(); VAL [x=1] [L17] COND TRUE 1 x < 4 VAL [x=1] [L18] 1 x := x + 1; VAL [x=2] [L17] COND TRUE 1 x < 4 VAL [x=2] [L18] 1 x := x + 1; VAL [x=3] [L17] COND TRUE 1 x < 4 VAL [x=3] [L18] 1 x := x + 1; VAL [x=4] [L9] FORK 0 fork 2 once(); VAL [x=4] [L25] COND TRUE 2 x == 4 VAL [x=4] [L26] 2 x := 1; VAL [x=1] Loop: [L17] COND TRUE x < 4 [L18] x := x + 1; [L17] COND TRUE x < 4 [L18] x := x + 1; [L17] COND TRUE x < 4 [L18] x := x + 1; [L25] COND TRUE x == 4 [L26] x := 1; End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-04-26 16:20:47,573 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-26 16:20:47,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...