/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/gemcutter/Termination.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/test/hard1.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:41:54,997 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:41:55,036 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:41:55,039 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:41:55,039 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:41:55,039 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:41:55,039 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:41:55,057 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:41:55,058 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:41:55,058 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:41:55,058 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:41:55,058 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:41:55,058 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:41:55,058 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:41:55,058 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:41:55,059 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:41:55,059 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:41:55,059 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:41:55,059 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:41:55,059 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:41:55,059 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:41:55,059 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:41:55,059 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:41:55,059 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:41:55,059 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:41:55,059 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:41:55,059 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:41:55,059 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:41:55,059 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:41:55,059 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:41:55,059 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:41:55,060 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:41:55,060 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:41:55,060 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:41:55,060 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:41:55,060 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:41:55,060 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:41:55,060 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:41:55,060 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:41:55,060 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:41:55,060 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:41:55,060 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:41:55,060 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:41:55,268 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:41:55,276 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:41:55,281 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:41:55,282 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:41:55,283 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:41:55,284 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/test/hard1.wvr.bpl [2025-04-26 18:41:55,284 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/test/hard1.wvr.bpl' [2025-04-26 18:41:55,298 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:41:55,299 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:41:55,300 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:41:55,300 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:41:55,300 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:41:55,306 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "hard1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:55" (1/1) ... [2025-04-26 18:41:55,324 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "hard1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:55" (1/1) ... [2025-04-26 18:41:55,328 INFO L138 Inliner]: procedures = 5, calls = 4, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:41:55,328 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:41:55,329 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:41:55,329 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:41:55,329 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:41:55,334 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "hard1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:55" (1/1) ... [2025-04-26 18:41:55,334 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "hard1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:55" (1/1) ... [2025-04-26 18:41:55,337 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "hard1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:55" (1/1) ... [2025-04-26 18:41:55,337 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "hard1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:55" (1/1) ... [2025-04-26 18:41:55,343 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "hard1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:55" (1/1) ... [2025-04-26 18:41:55,344 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "hard1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:55" (1/1) ... [2025-04-26 18:41:55,347 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "hard1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:55" (1/1) ... [2025-04-26 18:41:55,347 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "hard1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:55" (1/1) ... [2025-04-26 18:41:55,347 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "hard1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:55" (1/1) ... [2025-04-26 18:41:55,360 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:41:55,361 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:41:55,361 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:41:55,361 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:41:55,363 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "hard1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:55" (1/1) ... [2025-04-26 18:41:55,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:41:55,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:55,391 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:55,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 18:41:55,417 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:41:55,417 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:41:55,418 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:41:55,418 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:41:55,418 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:41:55,418 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:41:55,418 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:41:55,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:41:55,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:41:55,418 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 18:41:55,418 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 18:41:55,418 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 18:41:55,418 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread4 given in one single declaration [2025-04-26 18:41:55,418 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-26 18:41:55,418 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-26 18:41:55,419 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 18:41:55,453 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:41:55,455 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:41:55,533 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:41:55,533 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:41:55,552 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:41:55,552 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:41:55,553 INFO L201 PluginConnector]: Adding new model hard1.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:41:55 BoogieIcfgContainer [2025-04-26 18:41:55,553 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:41:55,553 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:41:55,553 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:41:55,559 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:41:55,560 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:41:55,560 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "hard1.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:55" (1/2) ... [2025-04-26 18:41:55,562 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6852f579 and model type hard1.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:41:55, skipping insertion in model container [2025-04-26 18:41:55,562 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:41:55,563 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "hard1.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:41:55" (2/2) ... [2025-04-26 18:41:55,563 INFO L376 chiAutomizerObserver]: Analyzing ICFG hard1.wvr.bpl [2025-04-26 18:41:55,613 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-26 18:41:55,654 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:41:55,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:41:55,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:55,658 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:55,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 18:41:55,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 42 places, 37 transitions, 102 flow [2025-04-26 18:41:55,736 INFO L116 PetriNetUnfolderBase]: 4/29 cut-off events. [2025-04-26 18:41:55,737 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-26 18:41:55,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46 conditions, 29 events. 4/29 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 38 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2025-04-26 18:41:55,740 INFO L82 GeneralOperation]: Start removeDead. Operand has 42 places, 37 transitions, 102 flow [2025-04-26 18:41:55,742 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 29 transitions, 82 flow [2025-04-26 18:41:55,743 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 38 places, 29 transitions, 82 flow [2025-04-26 18:41:55,743 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 38 places, 29 transitions, 82 flow [2025-04-26 18:41:55,792 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 431 states, 429 states have (on average 3.8578088578088576) internal successors, (in total 1655), 430 states have internal predecessors, (1655), 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 18:41:55,794 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 431 states, 429 states have (on average 3.8578088578088576) internal successors, (in total 1655), 430 states have internal predecessors, (1655), 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 18:41:55,796 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:41:55,995 WARN L140 AmpleReduction]: Number of pruned transitions: 591 [2025-04-26 18:41:55,995 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:41:55,995 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 157 [2025-04-26 18:41:55,995 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:37 [2025-04-26 18:41:55,995 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:234 [2025-04-26 18:41:55,995 WARN L145 AmpleReduction]: Times succ was already a loop node:353 [2025-04-26 18:41:55,995 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:26 [2025-04-26 18:41:55,995 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:41:55,998 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 429 states, 427 states have (on average 2.468384074941452) internal successors, (in total 1054), 428 states have internal predecessors, (1054), 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 18:41:56,004 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:41:56,004 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:41:56,004 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:41:56,005 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:41:56,005 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:41:56,005 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:41:56,005 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:41:56,005 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:41:56,007 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 429 states, 427 states have (on average 2.468384074941452) internal successors, (in total 1054), 428 states have internal predecessors, (1054), 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 18:41:56,054 INFO L131 ngComponentsAnalysis]: Automaton has 102 accepting balls. 334 [2025-04-26 18:41:56,056 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:56,057 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:56,061 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:41:56,061 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:56,061 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:41:56,062 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 429 states, 427 states have (on average 2.468384074941452) internal successors, (in total 1054), 428 states have internal predecessors, (1054), 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 18:41:56,070 INFO L131 ngComponentsAnalysis]: Automaton has 102 accepting balls. 334 [2025-04-26 18:41:56,070 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:56,070 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:56,070 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:41:56,070 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:56,076 INFO L752 eck$LassoCheckResult]: Stem: "[71] $Ultimate##0-->L63: Formula: (and (= v_n2_1 v_n1_11) (= v_p1_5 v_p2_1)) InVars {p1=v_p1_5, n2=v_n2_1, p2=v_p2_1, n1=v_n1_11} OutVars{p1=v_p1_5, n2=v_n2_1, p2=v_p2_1, n1=v_n1_11} AuxVars[] AssignedVars[]" "[96] L63-->L19-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 18:41:56,077 INFO L754 eck$LassoCheckResult]: Loop: "[79] L19-1-->L19: Formula: (< 0 v_n1_1) InVars {n1=v_n1_1} OutVars{n1=v_n1_1} AuxVars[] AssignedVars[]" "[81] L19-->L19-1: Formula: (let ((.cse0 (< 0 v_n1_13))) (and (= v_p1_7 (ite .cse0 (+ v_p1_8 v_m_5) v_p1_8)) (= v_n1_12 (ite .cse0 (+ (- 1) v_n1_13) v_n1_13)))) InVars {m=v_m_5, p1=v_p1_8, n1=v_n1_13} OutVars{m=v_m_5, p1=v_p1_7, n1=v_n1_12} AuxVars[] AssignedVars[p1, n1]" [2025-04-26 18:41:56,081 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:56,081 INFO L85 PathProgramCache]: Analyzing trace with hash 3258, now seen corresponding path program 1 times [2025-04-26 18:41:56,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:56,086 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460019185] [2025-04-26 18:41:56,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:56,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:56,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:56,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:56,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:56,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:56,129 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:56,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:56,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:56,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:56,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:56,144 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:56,146 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:56,146 INFO L85 PathProgramCache]: Analyzing trace with hash 3491, now seen corresponding path program 1 times [2025-04-26 18:41:56,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:56,146 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251441087] [2025-04-26 18:41:56,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:56,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:56,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:56,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:56,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:56,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:56,155 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:56,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:56,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:56,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:56,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:56,159 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:56,160 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:56,160 INFO L85 PathProgramCache]: Analyzing trace with hash 3133468, now seen corresponding path program 1 times [2025-04-26 18:41:56,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:56,160 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631379920] [2025-04-26 18:41:56,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:56,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:56,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:56,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:41:56,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:56,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:56,164 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:56,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:41:56,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:41:56,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:56,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:56,169 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:56,241 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:56,242 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:56,242 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:56,242 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:56,242 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:41:56,242 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:56,242 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:56,242 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:56,242 INFO L132 ssoRankerPreferences]: Filename of dumped script: hard1.wvr.bpl_petrified1_Iteration1_Loop [2025-04-26 18:41:56,243 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:56,243 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:56,257 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:56,291 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:56,336 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:56,337 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:41:56,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:56,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:56,340 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 18:41:56,342 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 18:41:56,343 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:41:56,343 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:56,365 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 18:41:56,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:56,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:56,368 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 18:41:56,370 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 18:41:56,371 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:41:56,371 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:56,398 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:41:56,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 18:41:56,406 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:56,406 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:56,406 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:56,406 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:56,406 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:56,406 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:56,406 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:56,406 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:56,406 INFO L132 ssoRankerPreferences]: Filename of dumped script: hard1.wvr.bpl_petrified1_Iteration1_Loop [2025-04-26 18:41:56,406 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:56,406 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:56,407 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:56,414 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:56,446 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:56,449 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:56,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:56,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:56,452 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 18:41:56,454 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 18:41:56,455 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 18:41:56,467 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:56,467 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:41:56,467 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:56,467 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:56,467 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:56,473 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:41:56,473 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:41:56,475 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:56,481 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:41:56,482 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:41:56,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:56,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:56,485 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 18:41:56,487 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 18:41:56,487 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:56,490 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 18:41:56,491 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:41:56,491 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:56,491 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(n1) = 1*n1 Supporting invariants [] [2025-04-26 18:41:56,497 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 18:41:56,500 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:41:56,514 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:56,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:56,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:56,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:56,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:56,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:56,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:56,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:56,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:56,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:56,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:56,536 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:56,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:56,557 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 18:41:56,572 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 18:41:56,574 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 429 states, 427 states have (on average 2.468384074941452) internal successors, (in total 1054), 428 states have internal predecessors, (1054), 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) 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 18:41:56,701 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 429 states, 427 states have (on average 2.468384074941452) internal successors, (in total 1054), 428 states have internal predecessors, (1054), 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). 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 1510 states and 3807 transitions. Complement of second has 7 states. [2025-04-26 18:41:56,703 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 18:41:56,706 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 18:41:56,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2025-04-26 18:41:56,710 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 88 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 18:41:56,710 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:56,710 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 88 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 18:41:56,710 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:56,710 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 88 transitions. Stem has 2 letters. Loop has 4 letters. [2025-04-26 18:41:56,711 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:56,711 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1510 states and 3807 transitions. [2025-04-26 18:41:56,727 INFO L131 ngComponentsAnalysis]: Automaton has 79 accepting balls. 273 [2025-04-26 18:41:56,742 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1510 states to 815 states and 2103 transitions. [2025-04-26 18:41:56,743 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 420 [2025-04-26 18:41:56,744 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 551 [2025-04-26 18:41:56,744 INFO L74 IsDeterministic]: Start isDeterministic. Operand 815 states and 2103 transitions. [2025-04-26 18:41:56,745 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:56,745 INFO L218 hiAutomatonCegarLoop]: Abstraction has 815 states and 2103 transitions. [2025-04-26 18:41:56,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states and 2103 transitions. [2025-04-26 18:41:56,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 643. [2025-04-26 18:41:56,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 643 states have (on average 2.650077760497667) internal successors, (in total 1704), 642 states have internal predecessors, (1704), 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 18:41:56,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 1704 transitions. [2025-04-26 18:41:56,793 INFO L240 hiAutomatonCegarLoop]: Abstraction has 643 states and 1704 transitions. [2025-04-26 18:41:56,793 INFO L438 stractBuchiCegarLoop]: Abstraction has 643 states and 1704 transitions. [2025-04-26 18:41:56,794 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:41:56,794 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 643 states and 1704 transitions. [2025-04-26 18:41:56,797 INFO L131 ngComponentsAnalysis]: Automaton has 79 accepting balls. 273 [2025-04-26 18:41:56,797 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:56,797 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:56,797 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 18:41:56,797 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:56,797 INFO L752 eck$LassoCheckResult]: Stem: "[71] $Ultimate##0-->L63: Formula: (and (= v_n2_1 v_n1_11) (= v_p1_5 v_p2_1)) InVars {p1=v_p1_5, n2=v_n2_1, p2=v_p2_1, n1=v_n1_11} OutVars{p1=v_p1_5, n2=v_n2_1, p2=v_p2_1, n1=v_n1_11} AuxVars[] AssignedVars[]" "[96] L63-->L19-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[99] L63-1-->L30-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-04-26 18:41:56,797 INFO L754 eck$LassoCheckResult]: Loop: "[83] L30-1-->L30: Formula: (< 1 v_n1_6) InVars {n1=v_n1_6} OutVars{n1=v_n1_6} AuxVars[] AssignedVars[]" "[85] L30-->L30-1: Formula: (let ((.cse0 (< 1 v_n1_17))) (and (= v_n1_16 (ite .cse0 (+ (- 2) v_n1_17) v_n1_17)) (= (ite .cse0 (+ v_p1_12 (* 2 v_m_7)) v_p1_12) v_p1_11))) InVars {m=v_m_7, p1=v_p1_12, n1=v_n1_17} OutVars{m=v_m_7, p1=v_p1_11, n1=v_n1_16} AuxVars[] AssignedVars[p1, n1]" [2025-04-26 18:41:56,798 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:56,798 INFO L85 PathProgramCache]: Analyzing trace with hash 101097, now seen corresponding path program 1 times [2025-04-26 18:41:56,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:56,798 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921580547] [2025-04-26 18:41:56,798 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:56,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:56,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:56,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:56,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:56,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:56,802 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:56,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:56,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:56,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:56,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:56,805 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:56,805 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:56,805 INFO L85 PathProgramCache]: Analyzing trace with hash 3619, now seen corresponding path program 1 times [2025-04-26 18:41:56,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:56,805 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272183596] [2025-04-26 18:41:56,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:56,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:56,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:56,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:56,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:56,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:56,809 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:56,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:56,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:56,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:56,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:56,812 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:56,812 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:56,812 INFO L85 PathProgramCache]: Analyzing trace with hash 97156875, now seen corresponding path program 1 times [2025-04-26 18:41:56,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:56,812 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338749616] [2025-04-26 18:41:56,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:56,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:56,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:41:56,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:41:56,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:56,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:56,821 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:56,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:41:56,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:41:56,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:56,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:56,828 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:56,852 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:56,852 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:56,852 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:56,852 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:56,852 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:41:56,852 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:56,853 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:56,853 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:56,853 INFO L132 ssoRankerPreferences]: Filename of dumped script: hard1.wvr.bpl_petrified1_Iteration2_Loop [2025-04-26 18:41:56,853 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:56,853 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:56,853 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:56,857 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:56,882 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:56,882 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:41:56,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:56,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:56,885 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 18:41:56,886 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 18:41:56,888 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:41:56,888 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:56,899 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:41:56,900 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {m=0, p1=0} Honda state: {m=0, p1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:41:56,905 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 18:41:56,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:56,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:56,907 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 18:41:56,907 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 18:41:56,908 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:41:56,908 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:56,924 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 18:41:56,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:56,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:56,926 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 18:41:56,927 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 18:41:56,928 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:41:56,928 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:56,951 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:41:56,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 18:41:56,956 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:56,956 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:56,956 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:56,956 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:56,956 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:56,956 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:56,956 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:56,957 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:56,957 INFO L132 ssoRankerPreferences]: Filename of dumped script: hard1.wvr.bpl_petrified1_Iteration2_Loop [2025-04-26 18:41:56,957 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:56,957 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:56,957 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:56,963 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:56,988 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:56,988 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:56,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:56,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:56,991 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:56,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 18:41:56,994 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 18:41:57,004 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:57,004 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:41:57,004 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:57,005 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:57,005 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:57,005 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:41:57,005 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:41:57,007 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:57,013 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:57,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:57,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:57,015 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 18:41:57,017 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 18:41:57,018 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 18:41:57,028 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:57,028 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:41:57,028 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:57,028 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:57,028 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:57,031 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:41:57,031 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:41:57,033 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:57,035 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:41:57,035 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:41:57,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:57,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:57,037 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 18:41:57,038 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 18:41:57,039 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:57,042 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 18:41:57,043 ERROR L418 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Exception during sending of exit command (exit): Stream closed [2025-04-26 18:41:57,043 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:41:57,043 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:57,043 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(n1) = 1*n1 Supporting invariants [] [2025-04-26 18:41:57,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:57,049 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:41:57,059 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:57,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:57,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:57,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:57,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:57,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:57,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:57,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:57,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:57,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:57,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:57,077 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:57,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:57,088 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 18:41:57,088 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 18:41:57,088 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 643 states and 1704 transitions. cyclomatic complexity: 1168 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 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 18:41:57,163 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 643 states and 1704 transitions. cyclomatic complexity: 1168. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 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 1913 states and 5254 transitions. Complement of second has 6 states. [2025-04-26 18:41:57,163 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:41:57,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 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 18:41:57,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2025-04-26 18:41:57,164 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 61 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 18:41:57,164 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:57,164 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 61 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 18:41:57,164 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:57,164 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 61 transitions. Stem has 3 letters. Loop has 4 letters. [2025-04-26 18:41:57,164 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:57,164 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1913 states and 5254 transitions. [2025-04-26 18:41:57,178 INFO L131 ngComponentsAnalysis]: Automaton has 59 accepting balls. 120 [2025-04-26 18:41:57,187 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1913 states to 1218 states and 3364 transitions. [2025-04-26 18:41:57,187 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 398 [2025-04-26 18:41:57,188 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 532 [2025-04-26 18:41:57,188 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1218 states and 3364 transitions. [2025-04-26 18:41:57,188 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:57,188 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1218 states and 3364 transitions. [2025-04-26 18:41:57,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states and 3364 transitions. [2025-04-26 18:41:57,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 1083. [2025-04-26 18:41:57,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 1083 states have (on average 2.8337950138504153) internal successors, (in total 3069), 1082 states have internal predecessors, (3069), 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 18:41:57,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 3069 transitions. [2025-04-26 18:41:57,234 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1083 states and 3069 transitions. [2025-04-26 18:41:57,235 INFO L438 stractBuchiCegarLoop]: Abstraction has 1083 states and 3069 transitions. [2025-04-26 18:41:57,236 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:41:57,236 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1083 states and 3069 transitions. [2025-04-26 18:41:57,244 INFO L131 ngComponentsAnalysis]: Automaton has 59 accepting balls. 120 [2025-04-26 18:41:57,244 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:57,244 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:57,244 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:57,244 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:57,245 INFO L752 eck$LassoCheckResult]: Stem: "[71] $Ultimate##0-->L63: Formula: (and (= v_n2_1 v_n1_11) (= v_p1_5 v_p2_1)) InVars {p1=v_p1_5, n2=v_n2_1, p2=v_p2_1, n1=v_n1_11} OutVars{p1=v_p1_5, n2=v_n2_1, p2=v_p2_1, n1=v_n1_11} AuxVars[] AssignedVars[]" "[96] L63-->L19-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[99] L63-1-->L30-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[82] L30-1-->thread2FINAL: Formula: (<= v_n1_10 1) InVars {n1=v_n1_10} OutVars{n1=v_n1_10} AuxVars[] AssignedVars[]" "[78] L19-1-->thread1FINAL: Formula: (<= v_n1_5 0) InVars {n1=v_n1_5} OutVars{n1=v_n1_5} AuxVars[] AssignedVars[]" "[80] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[84] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[102] L64-->L41-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" [2025-04-26 18:41:57,245 INFO L754 eck$LassoCheckResult]: Loop: "[87] L41-1-->L41: Formula: (< 0 v_n2_6) InVars {n2=v_n2_6} OutVars{n2=v_n2_6} AuxVars[] AssignedVars[]" "[89] L41-->L41-1: Formula: (let ((.cse0 (< 0 v_n2_13))) (and (= v_n2_12 (ite .cse0 (+ (- 1) v_n2_13) v_n2_13)) (= (ite .cse0 (+ v_p2_8 v_m_9) v_p2_8) v_p2_7))) InVars {m=v_m_9, n2=v_n2_13, p2=v_p2_8} OutVars{m=v_m_9, n2=v_n2_12, p2=v_p2_7} AuxVars[] AssignedVars[n2, p2]" [2025-04-26 18:41:57,245 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:57,245 INFO L85 PathProgramCache]: Analyzing trace with hash -408546851, now seen corresponding path program 1 times [2025-04-26 18:41:57,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:57,246 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100123758] [2025-04-26 18:41:57,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:57,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:57,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:41:57,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:41:57,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:57,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:57,254 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:57,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:41:57,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:41:57,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:57,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:57,260 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:57,260 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:57,260 INFO L85 PathProgramCache]: Analyzing trace with hash 3747, now seen corresponding path program 1 times [2025-04-26 18:41:57,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:57,261 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618136733] [2025-04-26 18:41:57,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:57,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:57,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:57,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:57,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:57,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:57,266 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:57,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:57,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:57,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:57,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:57,269 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:57,269 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:57,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1771497089, now seen corresponding path program 1 times [2025-04-26 18:41:57,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:57,270 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416333720] [2025-04-26 18:41:57,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:57,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:57,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:41:57,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:41:57,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:57,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:57,342 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 18:41:57,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:41:57,342 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416333720] [2025-04-26 18:41:57,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416333720] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:41:57,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:41:57,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:41:57,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797488990] [2025-04-26 18:41:57,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:41:57,378 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:57,378 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:57,378 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:57,378 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:57,378 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:41:57,378 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:57,378 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:57,378 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:57,378 INFO L132 ssoRankerPreferences]: Filename of dumped script: hard1.wvr.bpl_petrified1_Iteration3_Loop [2025-04-26 18:41:57,378 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:57,378 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:57,379 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:57,385 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:57,417 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:57,417 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:41:57,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:57,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:57,419 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:57,419 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 18:41:57,420 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:41:57,420 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:57,436 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 18:41:57,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:57,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:57,438 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 18:41:57,438 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 18:41:57,440 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:41:57,440 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:57,461 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:41:57,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 18:41:57,464 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:57,464 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:57,465 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:57,465 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:57,465 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:57,465 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:57,465 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:57,465 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:57,465 INFO L132 ssoRankerPreferences]: Filename of dumped script: hard1.wvr.bpl_petrified1_Iteration3_Loop [2025-04-26 18:41:57,465 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:57,465 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:57,465 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:57,474 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:57,499 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:57,500 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:57,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:57,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:57,502 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:57,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 18:41:57,504 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 18:41:57,514 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:57,514 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:41:57,514 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:57,514 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:57,514 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:57,515 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:41:57,515 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:41:57,516 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:57,518 INFO L436 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2025-04-26 18:41:57,518 INFO L437 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-04-26 18:41:57,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:57,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:57,520 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:57,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 18:41:57,522 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:57,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:57,526 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:41:57,526 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:57,526 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(n2) = 1*n2 Supporting invariants [] [2025-04-26 18:41:57,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:57,532 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:41:57,543 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:57,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:41:57,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:41:57,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:57,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:57,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:57,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:57,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:57,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:57,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:57,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:57,560 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:57,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:57,570 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 18:41:57,570 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 18:41:57,570 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1083 states and 3069 transitions. cyclomatic complexity: 2131 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 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 18:41:57,648 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1083 states and 3069 transitions. cyclomatic complexity: 2131. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 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 3774 states and 10433 transitions. Complement of second has 7 states. [2025-04-26 18:41:57,648 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 18:41:57,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 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 18:41:57,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2025-04-26 18:41:57,650 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 83 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 18:41:57,650 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:57,650 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 83 transitions. Stem has 10 letters. Loop has 2 letters. [2025-04-26 18:41:57,650 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:57,650 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 83 transitions. Stem has 8 letters. Loop has 4 letters. [2025-04-26 18:41:57,650 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:57,650 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3774 states and 10433 transitions. [2025-04-26 18:41:57,675 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 63 [2025-04-26 18:41:57,688 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3774 states to 1943 states and 5788 transitions. [2025-04-26 18:41:57,688 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 558 [2025-04-26 18:41:57,689 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 593 [2025-04-26 18:41:57,689 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1943 states and 5788 transitions. [2025-04-26 18:41:57,690 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:57,690 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1943 states and 5788 transitions. [2025-04-26 18:41:57,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1943 states and 5788 transitions. [2025-04-26 18:41:57,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1943 to 1732. [2025-04-26 18:41:57,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1732 states, 1732 states have (on average 2.9601616628175518) internal successors, (in total 5127), 1731 states have internal predecessors, (5127), 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 18:41:57,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1732 states to 1732 states and 5127 transitions. [2025-04-26 18:41:57,723 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1732 states and 5127 transitions. [2025-04-26 18:41:57,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:41:57,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 18:41:57,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-26 18:41:57,725 INFO L87 Difference]: Start difference. First operand 1732 states and 5127 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (in total 10), 3 states have internal predecessors, (10), 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 18:41:57,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:41:57,829 INFO L93 Difference]: Finished difference Result 1911 states and 5275 transitions. [2025-04-26 18:41:57,829 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1911 states and 5275 transitions. [2025-04-26 18:41:57,840 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-04-26 18:41:57,848 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1911 states to 1462 states and 4355 transitions. [2025-04-26 18:41:57,848 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 376 [2025-04-26 18:41:57,849 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 376 [2025-04-26 18:41:57,849 INFO L74 IsDeterministic]: Start isDeterministic. Operand 1462 states and 4355 transitions. [2025-04-26 18:41:57,849 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:57,849 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1462 states and 4355 transitions. [2025-04-26 18:41:57,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states and 4355 transitions. [2025-04-26 18:41:57,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 1305. [2025-04-26 18:41:57,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1305 states, 1305 states have (on average 3.010727969348659) internal successors, (in total 3929), 1304 states have internal predecessors, (3929), 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 18:41:57,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1305 states to 1305 states and 3929 transitions. [2025-04-26 18:41:57,873 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1305 states and 3929 transitions. [2025-04-26 18:41:57,874 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 18:41:57,877 INFO L438 stractBuchiCegarLoop]: Abstraction has 1305 states and 3929 transitions. [2025-04-26 18:41:57,877 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:41:57,877 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1305 states and 3929 transitions. [2025-04-26 18:41:57,882 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2025-04-26 18:41:57,882 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:57,882 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:57,883 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:57,883 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:57,883 INFO L752 eck$LassoCheckResult]: Stem: "[71] $Ultimate##0-->L63: Formula: (and (= v_n2_1 v_n1_11) (= v_p1_5 v_p2_1)) InVars {p1=v_p1_5, n2=v_n2_1, p2=v_p2_1, n1=v_n1_11} OutVars{p1=v_p1_5, n2=v_n2_1, p2=v_p2_1, n1=v_n1_11} AuxVars[] AssignedVars[]" "[96] L63-->L19-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[99] L63-1-->L30-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[82] L30-1-->thread2FINAL: Formula: (<= v_n1_10 1) InVars {n1=v_n1_10} OutVars{n1=v_n1_10} AuxVars[] AssignedVars[]" "[79] L19-1-->L19: Formula: (< 0 v_n1_1) InVars {n1=v_n1_1} OutVars{n1=v_n1_1} AuxVars[] AssignedVars[]" "[81] L19-->L19-1: Formula: (let ((.cse0 (< 0 v_n1_13))) (and (= v_p1_7 (ite .cse0 (+ v_p1_8 v_m_5) v_p1_8)) (= v_n1_12 (ite .cse0 (+ (- 1) v_n1_13) v_n1_13)))) InVars {m=v_m_5, p1=v_p1_8, n1=v_n1_13} OutVars{m=v_m_5, p1=v_p1_7, n1=v_n1_12} AuxVars[] AssignedVars[p1, n1]" "[78] L19-1-->thread1FINAL: Formula: (<= v_n1_5 0) InVars {n1=v_n1_5} OutVars{n1=v_n1_5} AuxVars[] AssignedVars[]" "[80] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[84] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[102] L64-->L41-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[105] L65-->L52-1: Formula: (and (= v_thread4Thread1of1ForFork3_thidvar2_2 4) (= v_thread4Thread1of1ForFork3_thidvar3_2 4) (= v_thread4Thread1of1ForFork3_thidvar0_2 4) (= v_thread4Thread1of1ForFork3_thidvar1_2 4)) InVars {} OutVars{thread4Thread1of1ForFork3_thidvar1=v_thread4Thread1of1ForFork3_thidvar1_2, thread4Thread1of1ForFork3_thidvar0=v_thread4Thread1of1ForFork3_thidvar0_2, thread4Thread1of1ForFork3_thidvar3=v_thread4Thread1of1ForFork3_thidvar3_2, thread4Thread1of1ForFork3_thidvar2=v_thread4Thread1of1ForFork3_thidvar2_2} AuxVars[] AssignedVars[thread4Thread1of1ForFork3_thidvar1, thread4Thread1of1ForFork3_thidvar0, thread4Thread1of1ForFork3_thidvar3, thread4Thread1of1ForFork3_thidvar2]" "[106] thread1EXIT-->L67: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_4 1) InVars {thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4} AuxVars[] AssignedVars[]" "[107] thread2EXIT-->L68: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar0_4) (= 2 v_thread2Thread1of1ForFork1_thidvar1_4)) InVars {thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_4, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_4} AuxVars[] AssignedVars[]" [2025-04-26 18:41:57,884 INFO L754 eck$LassoCheckResult]: Loop: "[91] L52-1-->L52: Formula: (< 1 v_n2_7) InVars {n2=v_n2_7} OutVars{n2=v_n2_7} AuxVars[] AssignedVars[]" "[93] L52-->L52-1: Formula: (let ((.cse0 (< 1 v_n2_17))) (and (= v_n2_16 (ite .cse0 (+ (- 2) v_n2_17) v_n2_17)) (= v_p2_11 (ite .cse0 (+ (* v_m_11 2) v_p2_12) v_p2_12)))) InVars {m=v_m_11, n2=v_n2_17, p2=v_p2_12} OutVars{m=v_m_11, n2=v_n2_16, p2=v_p2_11} AuxVars[] AssignedVars[n2, p2]" [2025-04-26 18:41:57,884 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:57,884 INFO L85 PathProgramCache]: Analyzing trace with hash 161535627, now seen corresponding path program 1 times [2025-04-26 18:41:57,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:57,884 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953333100] [2025-04-26 18:41:57,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:57,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:57,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:41:57,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:41:57,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:57,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:57,893 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:57,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:41:57,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:41:57,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:57,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:57,901 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:57,901 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:57,901 INFO L85 PathProgramCache]: Analyzing trace with hash 3875, now seen corresponding path program 1 times [2025-04-26 18:41:57,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:57,901 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721497743] [2025-04-26 18:41:57,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:57,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:57,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:57,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:57,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:57,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:57,908 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:57,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:57,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:57,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:57,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:57,914 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:57,914 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:57,914 INFO L85 PathProgramCache]: Analyzing trace with hash 616917805, now seen corresponding path program 1 times [2025-04-26 18:41:57,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:57,915 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713239996] [2025-04-26 18:41:57,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:57,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:57,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:41:57,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:41:57,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:57,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:57,970 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 18:41:57,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:41:57,971 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713239996] [2025-04-26 18:41:57,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713239996] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-26 18:41:57,971 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707014332] [2025-04-26 18:41:57,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:57,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-26 18:41:57,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:57,973 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-26 18:41:57,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-04-26 18:41:57,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:41:58,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:41:58,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:58,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:58,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-26 18:41:58,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:58,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-26 18:41:58,040 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-26 18:41:58,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707014332] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:41:58,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-26 18:41:58,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-04-26 18:41:58,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835563876] [2025-04-26 18:41:58,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:41:58,057 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:58,057 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:58,057 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:58,057 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:58,057 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-04-26 18:41:58,057 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:58,057 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:58,057 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:58,057 INFO L132 ssoRankerPreferences]: Filename of dumped script: hard1.wvr.bpl_petrified1_Iteration4_Loop [2025-04-26 18:41:58,057 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:58,057 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:58,058 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:58,061 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:58,085 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:58,085 INFO L367 LassoAnalysis]: Checking for nontermination... [2025-04-26 18:41:58,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:58,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:58,087 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:58,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 18:41:58,089 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:41:58,089 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:58,100 INFO L400 LassoAnalysis]: Proved nontermination for one component. [2025-04-26 18:41:58,100 INFO L403 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {m=0, p2=0} Honda state: {m=0, p2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-04-26 18:41:58,105 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:58,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:58,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:58,107 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:58,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 18:41:58,108 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-04-26 18:41:58,108 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:58,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-04-26 18:41:58,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:58,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:58,126 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:58,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 18:41:58,127 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-04-26 18:41:58,127 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-04-26 18:41:58,151 INFO L407 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-04-26 18:41:58,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:58,155 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:58,155 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:58,155 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:58,155 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:58,155 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:58,155 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:58,155 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:58,155 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:58,155 INFO L132 ssoRankerPreferences]: Filename of dumped script: hard1.wvr.bpl_petrified1_Iteration4_Loop [2025-04-26 18:41:58,155 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:58,155 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:58,156 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:58,159 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:58,177 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:58,177 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:58,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:58,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:58,179 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:58,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 18:41:58,182 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 18:41:58,192 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:58,192 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:41:58,192 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:58,192 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:58,192 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:58,193 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:41:58,193 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:41:58,194 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:58,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-04-26 18:41:58,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:58,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:58,201 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:58,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 18:41:58,203 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 18:41:58,213 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:58,213 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:41:58,213 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:58,213 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:58,213 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:58,214 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:41:58,214 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:41:58,215 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:58,217 INFO L436 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-04-26 18:41:58,217 INFO L437 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2025-04-26 18:41:58,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:58,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:58,219 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:58,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 18:41:58,220 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:58,223 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-04-26 18:41:58,223 INFO L439 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-04-26 18:41:58,223 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:58,223 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(n2) = 1*n2 Supporting invariants [] [2025-04-26 18:41:58,228 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:58,229 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:41:58,236 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:58,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:41:58,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:41:58,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:58,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:58,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:58,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:58,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:58,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:58,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:58,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:58,276 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:58,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:58,288 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 18:41:58,288 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 18:41:58,289 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 1305 states and 3929 transitions. cyclomatic complexity: 2685 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 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 18:41:58,321 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 1305 states and 3929 transitions. cyclomatic complexity: 2685. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 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 1344 states and 4021 transitions. Complement of second has 6 states. [2025-04-26 18:41:58,322 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:41:58,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 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 18:41:58,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2025-04-26 18:41:58,322 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 13 letters. Loop has 2 letters. [2025-04-26 18:41:58,322 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:58,322 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 15 letters. Loop has 2 letters. [2025-04-26 18:41:58,322 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:58,323 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 13 letters. Loop has 4 letters. [2025-04-26 18:41:58,323 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:58,323 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1344 states and 4021 transitions. [2025-04-26 18:41:58,330 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:41:58,331 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1344 states to 0 states and 0 transitions. [2025-04-26 18:41:58,331 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:41:58,331 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:41:58,331 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:41:58,331 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:41:58,331 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:58,331 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:58,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:41:58,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 18:41:58,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-26 18:41:58,331 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (in total 15), 3 states have internal predecessors, (15), 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 18:41:58,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:41:58,331 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2025-04-26 18:41:58,331 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2025-04-26 18:41:58,331 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:41:58,332 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2025-04-26 18:41:58,332 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:41:58,332 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:41:58,332 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:41:58,332 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:41:58,332 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:58,332 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:58,332 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-26 18:41:58,332 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:58,332 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:41:58,332 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:41:58,332 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:41:58,332 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:41:58,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 18:41:58,343 INFO L201 PluginConnector]: Adding new model hard1.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:41:58 BoogieIcfgContainer [2025-04-26 18:41:58,343 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:41:58,344 INFO L158 Benchmark]: Toolchain (without parser) took 3044.61ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 85.3MB in the beginning and 45.9MB in the end (delta: 39.4MB). Peak memory consumption was 38.1MB. Max. memory is 8.0GB. [2025-04-26 18:41:58,344 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.17ms. Allocated memory is still 159.4MB. Free memory is still 86.3MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:58,344 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.07ms. Allocated memory is still 159.4MB. Free memory was 85.3MB in the beginning and 83.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:58,344 INFO L158 Benchmark]: Boogie Preprocessor took 31.08ms. Allocated memory is still 159.4MB. Free memory was 83.4MB in the beginning and 82.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:58,344 INFO L158 Benchmark]: RCFGBuilder took 192.12ms. Allocated memory is still 159.4MB. Free memory was 82.4MB in the beginning and 72.1MB in the end (delta: 10.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 18:41:58,345 INFO L158 Benchmark]: BuchiAutomizer took 2789.65ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 72.1MB in the beginning and 45.9MB in the end (delta: 26.2MB). Peak memory consumption was 25.5MB. Max. memory is 8.0GB. [2025-04-26 18:41:58,345 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.17ms. Allocated memory is still 159.4MB. Free memory is still 86.3MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.07ms. Allocated memory is still 159.4MB. Free memory was 85.3MB in the beginning and 83.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 31.08ms. Allocated memory is still 159.4MB. Free memory was 83.4MB in the beginning and 82.4MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 192.12ms. Allocated memory is still 159.4MB. Free memory was 82.4MB in the beginning and 72.1MB in the end (delta: 10.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 2789.65ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 72.1MB in the beginning and 45.9MB in the end (delta: 26.2MB). Peak memory consumption was 25.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.6s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.3s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 675 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 182 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 178 mSDsluCounter, 149 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 77 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 268 IncrementalHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 72 mSDtfsCounter, 268 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT2 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital16 mio100 ax100 hnf100 lsp62 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf96 smp100 dnf100 smp100 tf112 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 41ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s InitialAbstractionConstructionTime: 0.3s InitialAbstraction: Time to compute Ample Reduction [ms]: 344, Number of transitions in reduction automaton: 1054, Number of states in reduction automaton: 429, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (2 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function n1 and consists of 5 locations. One deterministic module has affine ranking function n1 and consists of 4 locations. One deterministic module has affine ranking function n2 and consists of 5 locations. One deterministic module has affine ranking function n2 and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 4 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 18:41:58,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:58,559 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...