/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/chl/nzb-file-subst.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:40:21,916 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:40:21,970 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:40:21,973 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:40:21,973 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:40:21,973 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:40:21,973 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:40:21,995 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:40:21,996 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:40:21,996 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:40:21,996 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:40:21,996 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:40:21,996 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:40:21,996 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:40:21,997 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:40:21,997 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:40:21,997 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:40:21,997 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:40:21,997 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:40:21,997 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:40:21,997 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:40:21,998 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:40:21,998 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:40:21,998 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:40:21,998 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:40:21,998 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:40:21,998 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:40:21,998 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:40:21,998 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:40:21,998 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:40:21,998 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:40:21,998 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:40:21,998 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:40:21,998 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:40:21,998 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:40:21,998 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:40:21,999 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:40:21,999 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:40:21,999 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:40:21,999 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:40:21,999 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:40:21,999 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:40:21,999 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:40:22,229 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:40:22,238 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:40:22,240 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:40:22,241 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:40:22,242 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:40:22,244 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/nzb-file-subst.wvr.bpl [2025-04-26 18:40:22,245 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/nzb-file-subst.wvr.bpl' [2025-04-26 18:40:22,271 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:40:22,272 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:40:22,273 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:40:22,273 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:40:22,273 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:40:22,280 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "nzb-file-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:22" (1/1) ... [2025-04-26 18:40:22,307 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "nzb-file-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:22" (1/1) ... [2025-04-26 18:40:22,311 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:40:22,312 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:40:22,314 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:40:22,314 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:40:22,314 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:40:22,319 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "nzb-file-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:22" (1/1) ... [2025-04-26 18:40:22,319 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "nzb-file-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:22" (1/1) ... [2025-04-26 18:40:22,321 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "nzb-file-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:22" (1/1) ... [2025-04-26 18:40:22,322 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "nzb-file-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:22" (1/1) ... [2025-04-26 18:40:22,326 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "nzb-file-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:22" (1/1) ... [2025-04-26 18:40:22,326 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "nzb-file-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:22" (1/1) ... [2025-04-26 18:40:22,332 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "nzb-file-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:22" (1/1) ... [2025-04-26 18:40:22,332 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "nzb-file-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:22" (1/1) ... [2025-04-26 18:40:22,333 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "nzb-file-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:22" (1/1) ... [2025-04-26 18:40:22,347 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:40:22,348 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:40:22,348 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:40:22,348 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:40:22,352 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "nzb-file-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:22" (1/1) ... [2025-04-26 18:40:22,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:40:22,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:22,386 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:40:22,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:40:22,417 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:40:22,418 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:40:22,418 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:40:22,418 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:40:22,418 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:40:22,418 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:40:22,418 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:40:22,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:40:22,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:40:22,418 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 18:40:22,418 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 18:40:22,418 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 18:40:22,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:40:22,467 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:40:22,468 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:40:22,610 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:40:22,610 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:40:22,678 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:40:22,679 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-04-26 18:40:22,679 INFO L201 PluginConnector]: Adding new model nzb-file-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:40:22 BoogieIcfgContainer [2025-04-26 18:40:22,679 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:40:22,683 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:40:22,683 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:40:22,687 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:40:22,687 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:40:22,688 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "nzb-file-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:22" (1/2) ... [2025-04-26 18:40:22,688 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1da66e9f and model type nzb-file-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:40:22, skipping insertion in model container [2025-04-26 18:40:22,689 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:40:22,689 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "nzb-file-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:40:22" (2/2) ... [2025-04-26 18:40:22,690 INFO L376 chiAutomizerObserver]: Analyzing ICFG nzb-file-subst.wvr.bpl [2025-04-26 18:40:22,737 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 18:40:22,769 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:40:22,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:40:22,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:22,772 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:40:22,773 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:40:22,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 31 transitions, 83 flow [2025-04-26 18:40:22,860 INFO L116 PetriNetUnfolderBase]: 6/25 cut-off events. [2025-04-26 18:40:22,864 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 18:40:22,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 25 events. 6/25 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 28 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2025-04-26 18:40:22,867 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 31 transitions, 83 flow [2025-04-26 18:40:22,871 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 25 transitions, 68 flow [2025-04-26 18:40:22,871 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 29 places, 25 transitions, 68 flow [2025-04-26 18:40:22,872 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 29 places, 25 transitions, 68 flow [2025-04-26 18:40:22,898 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 110 states, 108 states have (on average 3.4814814814814814) internal successors, (in total 376), 109 states have internal predecessors, (376), 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:40:22,899 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 110 states, 108 states have (on average 3.4814814814814814) internal successors, (in total 376), 109 states have internal predecessors, (376), 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:40:22,904 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:40:22,932 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 219#[thread2EXIT, thread1EXIT, L109, L138]true [2025-04-26 18:40:22,940 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 231#[L139, L109, thread2EXIT]true [2025-04-26 18:40:22,941 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 81#[L75, L137, thread1EXIT]true [2025-04-26 18:40:22,943 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 205#[thread3EXIT, thread1EXIT, L138, L75]true [2025-04-26 18:40:22,944 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 167#[thread1EXIT, L109, L75, L138]true [2025-04-26 18:40:22,944 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 203#[L75, L139, L109]true [2025-04-26 18:40:22,946 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 41#[L41, L136]true [2025-04-26 18:40:22,948 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 69#[L92, L137, L41]true [2025-04-26 18:40:22,949 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 105#[L41, L137, thread2EXIT]true [2025-04-26 18:40:22,950 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 197#[thread2EXIT, L41, L109, L138]true [2025-04-26 18:40:22,954 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 193#[L92, thread3EXIT, L41, L138]true [2025-04-26 18:40:22,955 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 151#[L92, L41, L109, L138]true [2025-04-26 18:40:22,955 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 65#[L75, L137, L41]true [2025-04-26 18:40:22,957 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 191#[thread3EXIT, L41, L138, L75]true [2025-04-26 18:40:22,958 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 145#[L41, L109, L75, L138]true [2025-04-26 18:40:22,958 WARN L140 AmpleReduction]: Number of pruned transitions: 59 [2025-04-26 18:40:22,958 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 15 [2025-04-26 18:40:22,958 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 15 [2025-04-26 18:40:22,958 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:16 [2025-04-26 18:40:22,958 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:38 [2025-04-26 18:40:22,958 WARN L145 AmpleReduction]: Times succ was already a loop node:0 [2025-04-26 18:40:22,958 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 18:40:22,958 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:40:22,959 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 55 states, 53 states have (on average 1.7924528301886793) internal successors, (in total 95), 54 states have internal predecessors, (95), 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:40:22,963 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:40:22,964 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:40:22,964 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:40:22,964 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:40:22,964 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:40:22,964 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:40:22,964 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:40:22,964 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:40:22,965 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 55 states, 53 states have (on average 1.7924528301886793) internal successors, (in total 95), 54 states have internal predecessors, (95), 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:40:22,975 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 18 [2025-04-26 18:40:22,975 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:22,975 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:22,979 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:40:22,979 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:40:22,979 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:40:22,980 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 55 states, 53 states have (on average 1.7924528301886793) internal successors, (in total 95), 54 states have internal predecessors, (95), 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:40:22,983 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 18 [2025-04-26 18:40:22,983 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:22,983 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:22,983 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:40:22,983 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:40:22,987 INFO L752 eck$LassoCheckResult]: Stem: "[157] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[141] $Ultimate##0-->L41: Formula: (and (not v_is_null_1_9) (not v_break_14_61) (= v_i_13_44 0) (not v_is_null_5_9)) InVars {is_null_1=v_is_null_1_9, is_null_5=v_is_null_5_9} OutVars{i_13=v_i_13_44, is_null_5=v_is_null_5_9, break_14=v_break_14_61, is_null_1=v_is_null_1_9} AuxVars[] AssignedVars[i_13, break_14]" [2025-04-26 18:40:22,987 INFO L754 eck$LassoCheckResult]: Loop: "[144] L41-->L41: Formula: (let ((.cse5 (not v_break_14_68)) (.cse8 (select v_ends_with_6_21 v_i_13_39)) (.cse1 (not v_break_14_67)) (.cse9 (select v_ends_with_2_17 v_i_13_39))) (let ((.cse0 (not v_break_14_52)) (.cse2 (not .cse9)) (.cse6 (and .cse9 .cse1)) (.cse4 (and .cse8 .cse9)) (.cse3 (not .cse8)) (.cse7 (and .cse8 .cse5))) (and (or (and .cse0 .cse1 (or .cse2 .cse3)) (and (or v_break_14_52 .cse4) v_break_14_67)) .cse0 (or (and (or .cse2 v_break_14_67) .cse1 .cse5) (and (or v_break_14_67 .cse6) v_break_14_68)) (< v_i_13_39 5) (= (+ v_i_13_39 1) v_i_13_38) (= v_result_12_41 (ite .cse7 (+ 1000 v_i_13_39) (ite .cse6 (+ v_i_13_39 (- 1000)) (ite .cse4 0 v_result_12_42)))) (or (and (or .cse3 v_break_14_68) (not v_break_14_51) .cse5) (and (or .cse7 v_break_14_68) v_break_14_51))))) InVars {result_12=v_result_12_42, i_13=v_i_13_39, ends_with_6=v_ends_with_6_21, break_14=v_break_14_52, ends_with_2=v_ends_with_2_17} OutVars{result_12=v_result_12_41, i_13=v_i_13_38, ends_with_6=v_ends_with_6_21, break_14=v_break_14_51, ends_with_2=v_ends_with_2_17} AuxVars[v_break_14_68, v_break_14_67] AssignedVars[result_12, i_13, break_14]" [2025-04-26 18:40:22,991 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:22,992 INFO L85 PathProgramCache]: Analyzing trace with hash 5969, now seen corresponding path program 1 times [2025-04-26 18:40:22,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:22,997 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929073121] [2025-04-26 18:40:22,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:22,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:23,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:23,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:23,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:23,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:23,040 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:23,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:23,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:23,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:23,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:23,059 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:23,062 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:23,062 INFO L85 PathProgramCache]: Analyzing trace with hash 175, now seen corresponding path program 1 times [2025-04-26 18:40:23,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:23,063 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112136359] [2025-04-26 18:40:23,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:23,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:23,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:40:23,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:40:23,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:23,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:23,082 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:23,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:40:23,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:40:23,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:23,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:23,097 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:23,098 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:23,098 INFO L85 PathProgramCache]: Analyzing trace with hash 185183, now seen corresponding path program 1 times [2025-04-26 18:40:23,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:23,098 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271789637] [2025-04-26 18:40:23,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:23,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:23,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:23,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:40:23,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:23,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:23,109 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:23,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:23,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:40:23,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:23,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:23,124 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:23,840 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:23,841 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:23,841 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:23,841 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:23,841 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:40:23,841 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:23,841 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:23,841 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:23,841 INFO L132 ssoRankerPreferences]: Filename of dumped script: nzb-file-subst.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 18:40:23,841 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:23,841 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:23,853 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:23,858 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:24,002 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:24,006 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:24,080 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2025-04-26 18:40:24,266 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:24,270 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:40:24,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:24,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:24,276 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:40:24,290 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:40:24,291 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:40:24,302 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:24,303 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:24,303 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:24,303 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:24,309 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:24,309 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:24,312 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:24,319 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 18:40:24,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:24,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:24,321 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:40:24,323 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:40:24,325 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:40:24,336 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:24,336 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:24,336 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2025-04-26 18:40:24,336 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:24,394 INFO L402 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2025-04-26 18:40:24,394 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2025-04-26 18:40:24,466 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:40:24,523 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 18:40:24,523 INFO L437 ModelExtractionUtils]: 43 out of 55 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-04-26 18:40:24,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:24,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:24,546 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:40:24,548 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:40:24,549 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:40:24,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:24,570 INFO L439 nArgumentSynthesizer]: Removed 8 redundant supporting invariants from a total of 8. [2025-04-26 18:40:24,572 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:40:24,573 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_13) = -2*i_13 + 9 Supporting invariants [] [2025-04-26 18:40:24,580 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:40:24,583 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:40:24,601 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:24,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:24,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:24,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:24,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:24,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:40:24,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:24,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:40:24,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:40:24,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:24,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:24,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:40:24,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:24,634 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:40:24,650 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 18:40:24,652 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 55 states, 53 states have (on average 1.7924528301886793) internal successors, (in total 95), 54 states have internal predecessors, (95), 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 2 states, 2 states have (on average 1.5) internal successors, (in total 3), 2 states have internal predecessors, (3), 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:40:24,728 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 55 states, 53 states have (on average 1.7924528301886793) internal successors, (in total 95), 54 states have internal predecessors, (95), 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 2 states, 2 states have (on average 1.5) internal successors, (in total 3), 2 states have internal predecessors, (3), 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 156 states and 291 transitions. Complement of second has 5 states. [2025-04-26 18:40:24,729 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 18:40:24,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (in total 3), 2 states have internal predecessors, (3), 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:40:24,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2025-04-26 18:40:24,736 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 51 transitions. Stem has 2 letters. Loop has 1 letters. [2025-04-26 18:40:24,737 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:24,737 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 51 transitions. Stem has 3 letters. Loop has 1 letters. [2025-04-26 18:40:24,737 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:24,737 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 51 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 18:40:24,737 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:24,738 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 156 states and 291 transitions. [2025-04-26 18:40:24,744 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 21 [2025-04-26 18:40:24,749 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 156 states to 77 states and 146 transitions. [2025-04-26 18:40:24,750 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2025-04-26 18:40:24,751 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 64 [2025-04-26 18:40:24,751 INFO L74 IsDeterministic]: Start isDeterministic. Operand 77 states and 146 transitions. [2025-04-26 18:40:24,751 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:40:24,752 INFO L218 hiAutomatonCegarLoop]: Abstraction has 77 states and 146 transitions. [2025-04-26 18:40:24,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 146 transitions. [2025-04-26 18:40:24,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 49. [2025-04-26 18:40:24,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 2.0408163265306123) internal successors, (in total 100), 48 states have internal predecessors, (100), 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:40:24,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 100 transitions. [2025-04-26 18:40:24,774 INFO L240 hiAutomatonCegarLoop]: Abstraction has 49 states and 100 transitions. [2025-04-26 18:40:24,774 INFO L438 stractBuchiCegarLoop]: Abstraction has 49 states and 100 transitions. [2025-04-26 18:40:24,774 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:40:24,774 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 100 transitions. [2025-04-26 18:40:24,775 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 13 [2025-04-26 18:40:24,775 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:24,775 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:24,776 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 18:40:24,776 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:40:24,776 INFO L752 eck$LassoCheckResult]: Stem: "[157] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[141] $Ultimate##0-->L41: Formula: (and (not v_is_null_1_9) (not v_break_14_61) (= v_i_13_44 0) (not v_is_null_5_9)) InVars {is_null_1=v_is_null_1_9, is_null_5=v_is_null_5_9} OutVars{i_13=v_i_13_44, is_null_5=v_is_null_5_9, break_14=v_break_14_61, is_null_1=v_is_null_1_9} AuxVars[] AssignedVars[i_13, break_14]" "[160] L136-->$Ultimate##0: 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]" "[146] $Ultimate##0-->L75: Formula: (and (= v_i_16_44 0) (not v_is_null_1_13) (not v_break_17_61) (not v_is_null_9_9)) InVars {is_null_1=v_is_null_1_13, is_null_9=v_is_null_9_9} OutVars{break_17=v_break_17_61, i_16=v_i_16_44, is_null_1=v_is_null_1_13, is_null_9=v_is_null_9_9} AuxVars[] AssignedVars[i_16, break_17]" [2025-04-26 18:40:24,776 INFO L754 eck$LassoCheckResult]: Loop: "[149] L75-->L75: Formula: (let ((.cse6 (not v_break_17_67)) (.cse8 (select v_ends_with_2_27 v_i_16_39)) (.cse3 (not v_break_17_68)) (.cse9 (select v_ends_with_10_21 v_i_16_39))) (let ((.cse0 (and .cse3 .cse9)) (.cse4 (not .cse9)) (.cse2 (and .cse9 .cse8)) (.cse7 (not v_break_17_52)) (.cse5 (not .cse8)) (.cse1 (and .cse6 .cse8))) (and (= v_result_15_41 (ite .cse0 (+ 1000 v_i_16_39) (ite .cse1 (+ v_i_16_39 (- 1000)) (ite .cse2 0 v_result_15_42)))) (or (and (or .cse0 v_break_17_68) v_break_17_51) (and .cse3 (or .cse4 v_break_17_68) (not v_break_17_51))) (< v_i_16_39 5) (or (and (or .cse5 .cse4) .cse6 .cse7) (and (or .cse2 v_break_17_52) v_break_17_67)) (= (+ v_i_16_39 1) v_i_16_38) .cse7 (or (and .cse3 (or .cse5 v_break_17_67) .cse6) (and (or .cse1 v_break_17_67) v_break_17_68))))) InVars {break_17=v_break_17_52, ends_with_10=v_ends_with_10_21, i_16=v_i_16_39, result_15=v_result_15_42, ends_with_2=v_ends_with_2_27} OutVars{break_17=v_break_17_51, ends_with_10=v_ends_with_10_21, i_16=v_i_16_38, result_15=v_result_15_41, ends_with_2=v_ends_with_2_27} AuxVars[v_break_17_67, v_break_17_68] AssignedVars[i_16, result_15, break_17]" [2025-04-26 18:40:24,776 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:24,777 INFO L85 PathProgramCache]: Analyzing trace with hash 5741315, now seen corresponding path program 1 times [2025-04-26 18:40:24,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:24,777 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214871287] [2025-04-26 18:40:24,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:24,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:24,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:40:24,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:40:24,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:24,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:24,780 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:24,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:40:24,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:40:24,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:24,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:24,783 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:24,783 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:24,784 INFO L85 PathProgramCache]: Analyzing trace with hash 180, now seen corresponding path program 1 times [2025-04-26 18:40:24,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:24,784 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621426113] [2025-04-26 18:40:24,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:24,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:24,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:40:24,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:40:24,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:24,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:24,790 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:24,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:40:24,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:40:24,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:24,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:24,795 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:24,796 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:24,796 INFO L85 PathProgramCache]: Analyzing trace with hash 177980914, now seen corresponding path program 1 times [2025-04-26 18:40:24,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:24,796 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45993759] [2025-04-26 18:40:24,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:24,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:24,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:40:24,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:40:24,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:24,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:24,804 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:24,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:40:24,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:40:24,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:24,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:24,811 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:25,112 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:25,112 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:25,112 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:25,112 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:25,112 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:40:25,112 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:25,112 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:25,112 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:25,112 INFO L132 ssoRankerPreferences]: Filename of dumped script: nzb-file-subst.wvr.bpl_petrified1_Iteration2_Lasso [2025-04-26 18:40:25,112 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:25,112 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:25,115 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:25,119 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:25,243 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:25,246 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:25,249 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:25,250 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:25,252 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:25,254 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:25,256 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:25,335 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2025-04-26 18:40:25,511 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:25,511 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:40:25,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:25,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:25,514 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:40:25,516 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:40:25,517 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:40:25,527 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:25,527 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:25,527 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:25,527 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:25,529 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:25,529 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:25,531 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:25,537 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 18:40:25,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:25,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:25,539 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:40:25,540 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:40:25,542 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:40:25,552 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:25,552 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:25,552 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2025-04-26 18:40:25,552 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:25,582 INFO L402 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2025-04-26 18:40:25,583 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2025-04-26 18:40:25,650 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:40:25,692 INFO L436 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-04-26 18:40:25,692 INFO L437 ModelExtractionUtils]: 42 out of 55 variables were initially zero. Simplification set additionally 10 variables to zero. [2025-04-26 18:40:25,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:25,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:25,694 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:40:25,694 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:40:25,695 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:40:25,716 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:40:25,717 INFO L439 nArgumentSynthesizer]: Removed 8 redundant supporting invariants from a total of 8. [2025-04-26 18:40:25,717 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:40:25,717 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_16) = -2*i_16 + 9 Supporting invariants [] [2025-04-26 18:40:25,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:25,726 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:40:25,737 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:25,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:40:25,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:40:25,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:25,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:25,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:40:25,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:25,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:40:25,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:40:25,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:25,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:25,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:40:25,758 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:25,758 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:40:25,758 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 18:40:25,759 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 100 transitions. cyclomatic complexity: 70 Second operand has 2 states, 2 states have (on average 2.5) internal successors, (in total 5), 2 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:40:25,806 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 100 transitions. cyclomatic complexity: 70. Second operand has 2 states, 2 states have (on average 2.5) internal successors, (in total 5), 2 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 129 states and 253 transitions. Complement of second has 4 states. [2025-04-26 18:40:25,806 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 18:40:25,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (in total 5), 2 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:40:25,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2025-04-26 18:40:25,807 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 35 transitions. Stem has 4 letters. Loop has 1 letters. [2025-04-26 18:40:25,807 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:25,807 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 35 transitions. Stem has 5 letters. Loop has 1 letters. [2025-04-26 18:40:25,807 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:25,807 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 35 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 18:40:25,808 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:25,808 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 129 states and 253 transitions. [2025-04-26 18:40:25,811 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 13 [2025-04-26 18:40:25,812 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 129 states to 67 states and 127 transitions. [2025-04-26 18:40:25,812 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2025-04-26 18:40:25,812 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2025-04-26 18:40:25,812 INFO L74 IsDeterministic]: Start isDeterministic. Operand 67 states and 127 transitions. [2025-04-26 18:40:25,812 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:40:25,812 INFO L218 hiAutomatonCegarLoop]: Abstraction has 67 states and 127 transitions. [2025-04-26 18:40:25,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 127 transitions. [2025-04-26 18:40:25,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 44. [2025-04-26 18:40:25,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 2.0454545454545454) internal successors, (in total 90), 43 states have internal predecessors, (90), 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:40:25,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 90 transitions. [2025-04-26 18:40:25,814 INFO L240 hiAutomatonCegarLoop]: Abstraction has 44 states and 90 transitions. [2025-04-26 18:40:25,814 INFO L438 stractBuchiCegarLoop]: Abstraction has 44 states and 90 transitions. [2025-04-26 18:40:25,814 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:40:25,814 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 90 transitions. [2025-04-26 18:40:25,815 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 8 [2025-04-26 18:40:25,815 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:25,815 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:25,815 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 18:40:25,815 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:40:25,815 INFO L752 eck$LassoCheckResult]: Stem: "[157] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[141] $Ultimate##0-->L41: Formula: (and (not v_is_null_1_9) (not v_break_14_61) (= v_i_13_44 0) (not v_is_null_5_9)) InVars {is_null_1=v_is_null_1_9, is_null_5=v_is_null_5_9} OutVars{i_13=v_i_13_44, is_null_5=v_is_null_5_9, break_14=v_break_14_61, is_null_1=v_is_null_1_9} AuxVars[] AssignedVars[i_13, break_14]" "[160] L136-->$Ultimate##0: 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]" "[145] $Ultimate##0-->L92: Formula: (and (or v_is_null_1_11 v_is_null_9_7) (= (ite (and (not v_is_null_1_11) v_is_null_9_7) (- 995) (ite (and v_is_null_1_11 (not v_is_null_9_7)) 1005 (+ v_get_subject_3_5 (* (- 1) v_get_subject_11_3)))) v_result_15_11)) InVars {get_subject_3=v_get_subject_3_5, is_null_1=v_is_null_1_11, get_subject_11=v_get_subject_11_3, is_null_9=v_is_null_9_7} OutVars{get_subject_3=v_get_subject_3_5, result_15=v_result_15_11, is_null_1=v_is_null_1_11, get_subject_11=v_get_subject_11_3, is_null_9=v_is_null_9_7} AuxVars[] AssignedVars[result_15]" "[163] L137-->$Ultimate##0: 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]" "[151] $Ultimate##0-->L109: Formula: (and (not v_is_null_5_13) (= v_i_19_44 0) (not v_break_20_61) (not v_is_null_9_13)) InVars {is_null_5=v_is_null_5_13, is_null_9=v_is_null_9_13} OutVars{break_20=v_break_20_61, i_19=v_i_19_44, is_null_5=v_is_null_5_13, is_null_9=v_is_null_9_13} AuxVars[] AssignedVars[break_20, i_19]" [2025-04-26 18:40:25,816 INFO L754 eck$LassoCheckResult]: Loop: "[154] L109-->L109: Formula: (let ((.cse3 (not v_break_20_67)) (.cse7 (not v_break_20_68)) (.cse9 (select v_ends_with_10_35 v_i_19_39)) (.cse8 (select v_ends_with_6_31 v_i_19_39))) (let ((.cse4 (and .cse9 .cse8)) (.cse5 (and .cse9 .cse7)) (.cse1 (not .cse9)) (.cse2 (not v_break_20_52)) (.cse6 (and .cse8 .cse3)) (.cse0 (not .cse8))) (and (< v_i_19_39 5) (or (and (or .cse0 .cse1) .cse2 .cse3) (and (or v_break_20_52 .cse4) v_break_20_67)) (= v_result_18_41 (ite .cse5 (+ 1000 v_i_19_39) (ite .cse6 (+ v_i_19_39 (- 1000)) (ite .cse4 0 v_result_18_42)))) (or (and (or .cse5 v_break_20_68) v_break_20_51) (and (or v_break_20_68 .cse1) (not v_break_20_51) .cse7)) (= (+ v_i_19_39 1) v_i_19_38) .cse2 (or (and (or .cse6 v_break_20_67) v_break_20_68) (and (or .cse0 v_break_20_67) .cse7 .cse3))))) InVars {i_19=v_i_19_39, break_20=v_break_20_52, ends_with_10=v_ends_with_10_35, ends_with_6=v_ends_with_6_31, result_18=v_result_18_42} OutVars{i_19=v_i_19_38, break_20=v_break_20_51, ends_with_10=v_ends_with_10_35, ends_with_6=v_ends_with_6_31, result_18=v_result_18_41} AuxVars[v_break_20_68, v_break_20_67] AssignedVars[i_19, break_20, result_18]" [2025-04-26 18:40:25,816 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:25,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1222440662, now seen corresponding path program 1 times [2025-04-26 18:40:25,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:25,816 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695932187] [2025-04-26 18:40:25,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:25,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:25,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:40:25,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:40:25,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:25,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:25,861 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:40:25,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:40:25,862 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695932187] [2025-04-26 18:40:25,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695932187] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:40:25,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:40:25,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:40:25,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319681053] [2025-04-26 18:40:25,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:40:25,867 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:40:25,867 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:25,867 INFO L85 PathProgramCache]: Analyzing trace with hash 185, now seen corresponding path program 1 times [2025-04-26 18:40:25,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:25,867 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875767680] [2025-04-26 18:40:25,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:25,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:25,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:40:25,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:40:25,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:25,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:25,879 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:25,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:40:25,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:40:25,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:25,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:25,886 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:26,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:40:26,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 18:40:26,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-26 18:40:26,108 INFO L87 Difference]: Start difference. First operand 44 states and 90 transitions. cyclomatic complexity: 61 Second operand has 4 states, 3 states have (on average 2.0) internal successors, (in total 6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:26,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:40:26,144 INFO L93 Difference]: Finished difference Result 66 states and 122 transitions. [2025-04-26 18:40:26,145 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 122 transitions. [2025-04-26 18:40:26,145 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 11 [2025-04-26 18:40:26,146 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 53 states and 99 transitions. [2025-04-26 18:40:26,146 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2025-04-26 18:40:26,146 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2025-04-26 18:40:26,146 INFO L74 IsDeterministic]: Start isDeterministic. Operand 53 states and 99 transitions. [2025-04-26 18:40:26,146 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:40:26,146 INFO L218 hiAutomatonCegarLoop]: Abstraction has 53 states and 99 transitions. [2025-04-26 18:40:26,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 99 transitions. [2025-04-26 18:40:26,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 47. [2025-04-26 18:40:26,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 1.9361702127659575) internal successors, (in total 91), 46 states have internal predecessors, (91), 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:40:26,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 91 transitions. [2025-04-26 18:40:26,148 INFO L240 hiAutomatonCegarLoop]: Abstraction has 47 states and 91 transitions. [2025-04-26 18:40:26,151 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 18:40:26,151 INFO L438 stractBuchiCegarLoop]: Abstraction has 47 states and 91 transitions. [2025-04-26 18:40:26,151 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:40:26,151 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 91 transitions. [2025-04-26 18:40:26,152 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 8 [2025-04-26 18:40:26,152 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:26,152 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:26,152 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 18:40:26,152 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:40:26,153 INFO L752 eck$LassoCheckResult]: Stem: "[157] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[141] $Ultimate##0-->L41: Formula: (and (not v_is_null_1_9) (not v_break_14_61) (= v_i_13_44 0) (not v_is_null_5_9)) InVars {is_null_1=v_is_null_1_9, is_null_5=v_is_null_5_9} OutVars{i_13=v_i_13_44, is_null_5=v_is_null_5_9, break_14=v_break_14_61, is_null_1=v_is_null_1_9} AuxVars[] AssignedVars[i_13, break_14]" "[160] L136-->$Ultimate##0: 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]" "[146] $Ultimate##0-->L75: Formula: (and (= v_i_16_44 0) (not v_is_null_1_13) (not v_break_17_61) (not v_is_null_9_9)) InVars {is_null_1=v_is_null_1_13, is_null_9=v_is_null_9_9} OutVars{break_17=v_break_17_61, i_16=v_i_16_44, is_null_1=v_is_null_1_13, is_null_9=v_is_null_9_9} AuxVars[] AssignedVars[i_16, break_17]" "[163] L137-->$Ultimate##0: 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]" "[151] $Ultimate##0-->L109: Formula: (and (not v_is_null_5_13) (= v_i_19_44 0) (not v_break_20_61) (not v_is_null_9_13)) InVars {is_null_5=v_is_null_5_13, is_null_9=v_is_null_9_13} OutVars{break_20=v_break_20_61, i_19=v_i_19_44, is_null_5=v_is_null_5_13, is_null_9=v_is_null_9_13} AuxVars[] AssignedVars[break_20, i_19]" [2025-04-26 18:40:26,153 INFO L754 eck$LassoCheckResult]: Loop: "[154] L109-->L109: Formula: (let ((.cse3 (not v_break_20_67)) (.cse7 (not v_break_20_68)) (.cse9 (select v_ends_with_10_35 v_i_19_39)) (.cse8 (select v_ends_with_6_31 v_i_19_39))) (let ((.cse4 (and .cse9 .cse8)) (.cse5 (and .cse9 .cse7)) (.cse1 (not .cse9)) (.cse2 (not v_break_20_52)) (.cse6 (and .cse8 .cse3)) (.cse0 (not .cse8))) (and (< v_i_19_39 5) (or (and (or .cse0 .cse1) .cse2 .cse3) (and (or v_break_20_52 .cse4) v_break_20_67)) (= v_result_18_41 (ite .cse5 (+ 1000 v_i_19_39) (ite .cse6 (+ v_i_19_39 (- 1000)) (ite .cse4 0 v_result_18_42)))) (or (and (or .cse5 v_break_20_68) v_break_20_51) (and (or v_break_20_68 .cse1) (not v_break_20_51) .cse7)) (= (+ v_i_19_39 1) v_i_19_38) .cse2 (or (and (or .cse6 v_break_20_67) v_break_20_68) (and (or .cse0 v_break_20_67) .cse7 .cse3))))) InVars {i_19=v_i_19_39, break_20=v_break_20_52, ends_with_10=v_ends_with_10_35, ends_with_6=v_ends_with_6_31, result_18=v_result_18_42} OutVars{i_19=v_i_19_38, break_20=v_break_20_51, ends_with_10=v_ends_with_10_35, ends_with_6=v_ends_with_6_31, result_18=v_result_18_41} AuxVars[v_break_20_68, v_break_20_67] AssignedVars[i_19, break_20, result_18]" [2025-04-26 18:40:26,153 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:26,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1222441623, now seen corresponding path program 1 times [2025-04-26 18:40:26,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:26,153 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926648931] [2025-04-26 18:40:26,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:26,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:26,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:40:26,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:40:26,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:26,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:26,156 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:26,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:40:26,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:40:26,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:26,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:26,159 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:26,159 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:26,159 INFO L85 PathProgramCache]: Analyzing trace with hash 185, now seen corresponding path program 2 times [2025-04-26 18:40:26,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:26,159 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126478892] [2025-04-26 18:40:26,159 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:40:26,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:26,162 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:40:26,167 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:40:26,168 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:40:26,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:26,168 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:26,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:40:26,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:40:26,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:26,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:26,172 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:26,173 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:26,173 INFO L85 PathProgramCache]: Analyzing trace with hash -759015197, now seen corresponding path program 1 times [2025-04-26 18:40:26,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:26,173 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573415019] [2025-04-26 18:40:26,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:26,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:26,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:40:26,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:40:26,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:26,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:26,185 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:26,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:40:26,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:40:26,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:26,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:26,194 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:26,505 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:26,505 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:26,506 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:26,506 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:26,506 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:40:26,506 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:26,506 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:26,506 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:26,506 INFO L132 ssoRankerPreferences]: Filename of dumped script: nzb-file-subst.wvr.bpl_petrified1_Iteration4_Lasso [2025-04-26 18:40:26,506 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:26,506 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:26,508 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:26,512 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:26,514 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:26,516 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:26,517 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:26,519 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:26,521 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:26,524 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:26,526 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:26,528 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:26,530 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:26,532 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:26,636 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:26,638 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:26,709 WARN L137 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2025-04-26 18:40:26,859 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:26,859 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:40:26,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:26,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:26,861 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:40:26,862 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:40:26,864 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:40:26,874 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:26,874 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:26,874 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:26,874 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:26,875 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:26,875 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:26,877 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:26,882 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:40:26,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:26,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:26,885 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:40:26,887 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:40:26,890 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:40:26,900 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:26,900 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:26,900 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:26,900 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:26,901 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:26,901 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:26,903 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:26,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 18:40:26,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:26,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:26,910 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:40:26,911 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:40:26,912 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:40:26,921 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:26,921 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:26,921 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:26,922 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:26,922 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:26,922 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:26,924 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:26,930 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 18:40:26,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:26,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:26,932 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:40:26,933 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:40:26,934 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:40:26,944 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:26,944 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:26,944 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:26,944 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:26,945 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:26,945 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:26,947 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:26,952 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:40:26,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:26,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:26,954 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:40:26,955 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:40:26,956 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:40:26,965 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:26,966 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:26,966 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:26,966 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:26,967 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:26,967 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:26,969 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:26,974 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:40:26,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:26,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:26,976 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:40:26,976 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:40:26,977 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:40:26,987 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:26,987 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:26,987 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:26,987 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:26,988 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:26,988 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:26,990 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:26,995 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:40:26,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:26,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:26,997 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:40:26,998 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:40:26,999 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:40:27,010 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:27,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:27,010 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:27,010 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:27,011 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:27,011 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:27,013 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:27,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 18:40:27,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:27,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:27,021 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:40:27,022 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:40:27,023 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:40:27,033 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:27,033 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:27,033 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:27,033 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:27,034 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:27,034 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:27,036 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:27,041 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:40:27,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:27,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:27,043 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:40:27,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 18:40:27,044 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:40:27,054 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:27,054 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:27,054 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:27,054 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:27,055 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:27,055 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:27,057 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:27,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:27,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:27,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:27,065 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:40:27,072 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:40:27,072 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:40:27,081 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:27,082 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:27,082 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:27,082 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:27,083 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:27,083 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:27,085 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:27,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-04-26 18:40:27,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:27,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:27,092 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:40:27,092 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:40:27,093 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:40:27,103 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:27,103 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:27,103 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:27,103 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:27,104 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:27,104 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:27,105 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:27,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:27,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:27,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:27,112 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:40:27,113 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:40:27,114 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:40:27,123 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:27,124 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:27,124 INFO L204 nArgumentSynthesizer]: 4 loop disjuncts [2025-04-26 18:40:27,124 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:27,145 INFO L402 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2025-04-26 18:40:27,145 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2025-04-26 18:40:27,201 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:40:27,238 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 18:40:27,238 INFO L437 ModelExtractionUtils]: 43 out of 55 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-04-26 18:40:27,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:27,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:27,240 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:40:27,240 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:40:27,241 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:40:27,262 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:40:27,262 INFO L439 nArgumentSynthesizer]: Removed 8 redundant supporting invariants from a total of 8. [2025-04-26 18:40:27,262 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:40:27,262 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_19) = -2*i_19 + 9 Supporting invariants [] [2025-04-26 18:40:27,271 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:40:27,271 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:40:27,280 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:27,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:40:27,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:40:27,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:27,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:27,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:40:27,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:27,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:40:27,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:40:27,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:27,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:27,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:40:27,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:27,297 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:40:27,298 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 18:40:27,298 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 47 states and 91 transitions. cyclomatic complexity: 59 Second operand has 2 states, 2 states have (on average 3.5) internal successors, (in total 7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:27,315 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 47 states and 91 transitions. cyclomatic complexity: 59. Second operand has 2 states, 2 states have (on average 3.5) internal successors, (in total 7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 59 states and 108 transitions. Complement of second has 4 states. [2025-04-26 18:40:27,315 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 18:40:27,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (in total 7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:27,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2025-04-26 18:40:27,315 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 6 letters. Loop has 1 letters. [2025-04-26 18:40:27,316 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:27,316 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 7 letters. Loop has 1 letters. [2025-04-26 18:40:27,316 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:27,316 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 19 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 18:40:27,316 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:27,316 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 108 transitions. [2025-04-26 18:40:27,318 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:40:27,318 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 0 states and 0 transitions. [2025-04-26 18:40:27,318 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:40:27,318 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:40:27,318 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:40:27,318 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:40:27,318 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:40:27,318 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:40:27,318 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:40:27,318 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:40:27,319 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:40:27,319 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:40:27,319 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:40:27,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:27,330 INFO L201 PluginConnector]: Adding new model nzb-file-subst.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:40:27 BoogieIcfgContainer [2025-04-26 18:40:27,330 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:40:27,331 INFO L158 Benchmark]: Toolchain (without parser) took 5058.82ms. Allocated memory was 159.4MB in the beginning and 151.0MB in the end (delta: -8.4MB). Free memory was 85.9MB in the beginning and 89.3MB in the end (delta: -3.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:27,331 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.85ms. Allocated memory is still 159.4MB. Free memory is still 87.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:27,331 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.73ms. Allocated memory is still 159.4MB. Free memory was 85.7MB in the beginning and 84.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:27,332 INFO L158 Benchmark]: Boogie Preprocessor took 33.36ms. Allocated memory is still 159.4MB. Free memory was 83.9MB in the beginning and 82.7MB in the end (delta: 1.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:40:27,332 INFO L158 Benchmark]: RCFGBuilder took 331.20ms. Allocated memory is still 159.4MB. Free memory was 82.7MB in the beginning and 64.2MB in the end (delta: 18.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 18:40:27,332 INFO L158 Benchmark]: BuchiAutomizer took 4647.80ms. Allocated memory was 159.4MB in the beginning and 151.0MB in the end (delta: -8.4MB). Free memory was 64.0MB in the beginning and 89.3MB in the end (delta: -25.2MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:27,333 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.85ms. Allocated memory is still 159.4MB. Free memory is still 87.1MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.73ms. Allocated memory is still 159.4MB. Free memory was 85.7MB in the beginning and 84.0MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 33.36ms. Allocated memory is still 159.4MB. Free memory was 83.9MB in the beginning and 82.7MB in the end (delta: 1.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 331.20ms. Allocated memory is still 159.4MB. Free memory was 82.7MB in the beginning and 64.2MB in the end (delta: 18.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 4647.80ms. Allocated memory was 159.4MB in the beginning and 151.0MB in the end (delta: -8.4MB). Free memory was 64.0MB in the beginning and 89.3MB in the end (delta: -25.2MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.5s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 3.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 57 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 103 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 100 mSDsluCounter, 35 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 139 IncrementalHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 21 mSDtfsCounter, 139 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital98 mio100 ax100 hnf100 lsp484 ukn13 mio100 lsp100 div100 bol135 ite100 ukn100 eq140 hnf98 smp100 dnf617 smp22 tf100 neg100 sie113 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 253ms VariablesStem: 2 VariablesLoop: 8 DisjunctsStem: 1 DisjunctsLoop: 4 SupportingInvariants: 8 MotzkinApplications: 48 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 193, Number of transitions in reduction automaton: 95, Number of states in reduction automaton: 55, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (1 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i_13 + 9 and consists of 4 locations. One deterministic module has affine ranking function 9 + -2 * i_16 and consists of 3 locations. One deterministic module has affine ranking function -2 * i_19 + 9 and consists of 3 locations. 1 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:40:27,344 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...