/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/popl20-more/parray-copy.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:41:19,573 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:41:19,623 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:41:19,627 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:41:19,628 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:41:19,628 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:41:19,628 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:41:19,651 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:41:19,651 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:41:19,651 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:41:19,651 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:41:19,652 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:41:19,652 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:41:19,652 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:41:19,652 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:41:19,652 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:41:19,652 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:41:19,652 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:41:19,652 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:41:19,652 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:41:19,652 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:41:19,652 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:41:19,652 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:41:19,652 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:41:19,652 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:41:19,652 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:41:19,652 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:41:19,653 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:41:19,653 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:41:19,653 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:41:19,653 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:41:19,653 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:41:19,653 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:41:19,653 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:41:19,653 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:41:19,653 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:41:19,653 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:41:19,653 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:41:19,653 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:41:19,653 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:41:19,653 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:41:19,654 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:41:19,655 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:41:19,854 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:41:19,859 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:41:19,861 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:41:19,862 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:41:19,862 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:41:19,864 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/parray-copy.wvr.bpl [2025-04-26 18:41:19,866 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/parray-copy.wvr.bpl' [2025-04-26 18:41:19,885 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:41:19,886 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:41:19,886 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:41:19,886 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:41:19,886 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:41:19,894 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "parray-copy.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:19" (1/1) ... [2025-04-26 18:41:19,912 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "parray-copy.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:19" (1/1) ... [2025-04-26 18:41:19,917 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:41:19,918 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:41:19,919 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:41:19,919 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:41:19,919 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:41:19,923 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "parray-copy.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:19" (1/1) ... [2025-04-26 18:41:19,923 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "parray-copy.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:19" (1/1) ... [2025-04-26 18:41:19,924 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "parray-copy.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:19" (1/1) ... [2025-04-26 18:41:19,924 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "parray-copy.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:19" (1/1) ... [2025-04-26 18:41:19,928 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "parray-copy.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:19" (1/1) ... [2025-04-26 18:41:19,929 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "parray-copy.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:19" (1/1) ... [2025-04-26 18:41:19,932 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "parray-copy.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:19" (1/1) ... [2025-04-26 18:41:19,932 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "parray-copy.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:19" (1/1) ... [2025-04-26 18:41:19,932 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "parray-copy.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:19" (1/1) ... [2025-04-26 18:41:19,942 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:41:19,943 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:41:19,943 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:41:19,943 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:41:19,944 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "parray-copy.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:19" (1/1) ... [2025-04-26 18:41:19,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:41:19,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:19,969 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:19,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 18:41:19,991 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:41:19,992 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:41:19,992 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:41:19,992 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:41:19,992 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:41:19,992 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:41:19,992 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:41:19,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:41:19,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:41:19,992 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 18:41:19,992 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 18:41:19,992 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 18:41:19,993 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 18:41:20,031 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:41:20,033 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:41:20,126 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:41:20,126 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:41:20,143 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:41:20,143 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:41:20,144 INFO L201 PluginConnector]: Adding new model parray-copy.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:41:20 BoogieIcfgContainer [2025-04-26 18:41:20,144 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:41:20,144 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:41:20,144 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:41:20,149 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:41:20,149 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:41:20,149 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "parray-copy.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:19" (1/2) ... [2025-04-26 18:41:20,150 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4fd08ff and model type parray-copy.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:41:20, skipping insertion in model container [2025-04-26 18:41:20,150 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:41:20,150 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "parray-copy.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:41:20" (2/2) ... [2025-04-26 18:41:20,151 INFO L376 chiAutomizerObserver]: Analyzing ICFG parray-copy.wvr.bpl [2025-04-26 18:41:20,196 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 18:41:20,232 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:41:20,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:41:20,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:20,234 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:20,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 18:41:20,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 38 places, 34 transitions, 89 flow [2025-04-26 18:41:20,293 INFO L116 PetriNetUnfolderBase]: 3/28 cut-off events. [2025-04-26 18:41:20,294 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 18:41:20,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41 conditions, 28 events. 3/28 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 36 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 20. Up to 2 conditions per place. [2025-04-26 18:41:20,297 INFO L82 GeneralOperation]: Start removeDead. Operand has 38 places, 34 transitions, 89 flow [2025-04-26 18:41:20,299 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 28 transitions, 74 flow [2025-04-26 18:41:20,299 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 35 places, 28 transitions, 74 flow [2025-04-26 18:41:20,299 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 28 transitions, 74 flow [2025-04-26 18:41:20,317 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 116 states, 114 states have (on average 2.7719298245614037) internal successors, (in total 316), 115 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:20,317 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 116 states, 114 states have (on average 2.7719298245614037) internal successors, (in total 316), 115 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:20,319 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:41:20,393 WARN L140 AmpleReduction]: Number of pruned transitions: 87 [2025-04-26 18:41:20,393 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:41:20,393 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 39 [2025-04-26 18:41:20,393 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:25 [2025-04-26 18:41:20,393 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:51 [2025-04-26 18:41:20,393 WARN L145 AmpleReduction]: Times succ was already a loop node:66 [2025-04-26 18:41:20,393 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:7 [2025-04-26 18:41:20,393 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:41:20,394 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 116 states, 114 states have (on average 2.008771929824561) internal successors, (in total 229), 115 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:20,399 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:41:20,399 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:41:20,399 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:41:20,399 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:41:20,399 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:41:20,399 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:41:20,399 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:41:20,399 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:41:20,401 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 116 states, 114 states have (on average 2.008771929824561) internal successors, (in total 229), 115 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:20,411 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 84 [2025-04-26 18:41:20,411 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:20,411 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:20,414 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:20,414 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:20,414 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:41:20,414 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 116 states, 114 states have (on average 2.008771929824561) internal successors, (in total 229), 115 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:20,417 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 84 [2025-04-26 18:41:20,417 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:20,417 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:20,418 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:20,418 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:20,421 INFO L752 eck$LassoCheckResult]: Stem: "[67] $Ultimate##0-->L55: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[61] L55-->L56: Formula: (< v_M_4 v_N_3) InVars {M=v_M_4, N=v_N_3} OutVars{M=v_M_4, N=v_N_3} AuxVars[] AssignedVars[]" "[47] L56-->L57: Formula: (and (= v_i_6 0) (= v_j_6 v_i_6)) InVars {i=v_i_6, j=v_j_6} OutVars{i=v_i_6, j=v_j_6} AuxVars[] AssignedVars[]" "[68] L57-->L58: Formula: (= v_M_5 v_k_1) InVars {M=v_M_5, k=v_k_1} OutVars{M=v_M_5, k=v_k_1} AuxVars[] AssignedVars[]" "[48] L58-->L59: Formula: (<= 0 v_l_1) InVars {l=v_l_1} OutVars{l=v_l_1} AuxVars[] AssignedVars[]" "[44] L59-->L60: Formula: (< v_l_2 v_N_4) InVars {l=v_l_2, N=v_N_4} OutVars{l=v_l_2, N=v_N_4} AuxVars[] AssignedVars[]" "[85] L60-->L22-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 18:41:20,421 INFO L754 eck$LassoCheckResult]: Loop: "[72] L22-1-->L22: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[74] L22-->L22-1: Formula: (and (= (store v_B_9 v_i_8 (select v_A_5 v_i_8)) v_B_8) (= (+ v_i_8 1) v_i_7)) InVars {A=v_A_5, i=v_i_8, B=v_B_9} OutVars{A=v_A_5, i=v_i_7, B=v_B_8} AuxVars[] AssignedVars[i, B]" [2025-04-26 18:41:20,424 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:20,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1427095415, now seen corresponding path program 1 times [2025-04-26 18:41:20,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:20,429 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801611049] [2025-04-26 18:41:20,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:20,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:20,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:41:20,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:41:20,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:20,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:20,476 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:20,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:41:20,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:41:20,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:20,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:20,493 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:20,494 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:20,495 INFO L85 PathProgramCache]: Analyzing trace with hash 3267, now seen corresponding path program 1 times [2025-04-26 18:41:20,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:20,495 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326668586] [2025-04-26 18:41:20,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:20,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:20,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:20,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:20,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:20,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:20,502 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:20,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:20,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:20,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:20,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:20,509 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:20,510 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:20,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1344124085, now seen corresponding path program 1 times [2025-04-26 18:41:20,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:20,511 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388734529] [2025-04-26 18:41:20,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:20,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:20,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:41:20,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:41:20,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:20,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:20,524 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:20,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:41:20,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:41:20,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:20,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:20,533 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:20,674 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:20,675 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:20,675 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:20,675 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:20,675 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:20,675 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:20,675 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:20,675 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:20,675 INFO L132 ssoRankerPreferences]: Filename of dumped script: parray-copy.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 18:41:20,675 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:20,675 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:20,720 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:20,729 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:20,759 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:20,833 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:20,853 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:20,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:20,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:20,858 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:20,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 18:41:20,861 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:20,872 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:20,873 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:20,873 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:20,873 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:20,880 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:20,880 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:20,885 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:20,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:20,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:20,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:20,894 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:20,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 18:41:20,897 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:20,907 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:20,908 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:20,908 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:20,908 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:20,914 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:20,914 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:20,925 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:20,949 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 18:41:20,950 INFO L437 ModelExtractionUtils]: 5 out of 19 variables were initially zero. Simplification set additionally 11 variables to zero. [2025-04-26 18:41:20,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:20,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:20,954 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:20,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 18:41:20,956 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:20,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 18:41:20,976 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:41:20,976 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:20,977 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, N) = -1*i + 1*N Supporting invariants [] [2025-04-26 18:41:20,984 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:20,986 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:41:21,007 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:21,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:41:21,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:41:21,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:21,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:21,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:21,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:21,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:21,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:21,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:21,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:21,087 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:21,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:21,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:21,122 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:41:21,124 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 116 states, 114 states have (on average 2.008771929824561) internal successors, (in total 229), 115 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:21,198 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 116 states, 114 states have (on average 2.008771929824561) internal successors, (in total 229), 115 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 262 states and 531 transitions. Complement of second has 7 states. [2025-04-26 18:41:21,200 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:41:21,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:21,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2025-04-26 18:41:21,209 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 49 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 18:41:21,209 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:21,210 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 49 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 18:41:21,210 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:21,210 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 49 transitions. Stem has 7 letters. Loop has 4 letters. [2025-04-26 18:41:21,210 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:21,210 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 262 states and 531 transitions. [2025-04-26 18:41:21,219 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 42 [2025-04-26 18:41:21,222 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 262 states to 121 states and 243 transitions. [2025-04-26 18:41:21,222 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2025-04-26 18:41:21,223 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 79 [2025-04-26 18:41:21,223 INFO L74 IsDeterministic]: Start isDeterministic. Operand 121 states and 243 transitions. [2025-04-26 18:41:21,223 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:21,223 INFO L218 hiAutomatonCegarLoop]: Abstraction has 121 states and 243 transitions. [2025-04-26 18:41:21,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states and 243 transitions. [2025-04-26 18:41:21,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 106. [2025-04-26 18:41:21,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 106 states have (on average 2.0) internal successors, (in total 212), 105 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:21,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 212 transitions. [2025-04-26 18:41:21,249 INFO L240 hiAutomatonCegarLoop]: Abstraction has 106 states and 212 transitions. [2025-04-26 18:41:21,249 INFO L438 stractBuchiCegarLoop]: Abstraction has 106 states and 212 transitions. [2025-04-26 18:41:21,249 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:41:21,249 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 212 transitions. [2025-04-26 18:41:21,252 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 42 [2025-04-26 18:41:21,252 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:21,252 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:21,252 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:21,252 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:21,253 INFO L752 eck$LassoCheckResult]: Stem: "[67] $Ultimate##0-->L55: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[61] L55-->L56: Formula: (< v_M_4 v_N_3) InVars {M=v_M_4, N=v_N_3} OutVars{M=v_M_4, N=v_N_3} AuxVars[] AssignedVars[]" "[47] L56-->L57: Formula: (and (= v_i_6 0) (= v_j_6 v_i_6)) InVars {i=v_i_6, j=v_j_6} OutVars{i=v_i_6, j=v_j_6} AuxVars[] AssignedVars[]" "[68] L57-->L58: Formula: (= v_M_5 v_k_1) InVars {M=v_M_5, k=v_k_1} OutVars{M=v_M_5, k=v_k_1} AuxVars[] AssignedVars[]" "[48] L58-->L59: Formula: (<= 0 v_l_1) InVars {l=v_l_1} OutVars{l=v_l_1} AuxVars[] AssignedVars[]" "[44] L59-->L60: Formula: (< v_l_2 v_N_4) InVars {l=v_l_2, N=v_N_4} OutVars{l=v_l_2, N=v_N_4} AuxVars[] AssignedVars[]" "[85] L60-->L22-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[71] L22-1-->thread1FINAL: Formula: (<= v_N_2 v_i_5) InVars {i=v_i_5, N=v_N_2} OutVars{i=v_i_5, N=v_N_2} AuxVars[] AssignedVars[]" "[73] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[88] L60-1-->L33-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-04-26 18:41:21,253 INFO L754 eck$LassoCheckResult]: Loop: "[76] L33-1-->L33: Formula: (< v_j_1 v_M_1) InVars {M=v_M_1, j=v_j_1} OutVars{M=v_M_1, j=v_j_1} AuxVars[] AssignedVars[]" "[78] L33-->L33-1: Formula: (and (= (+ v_j_8 1) v_j_7) (= (store v_B_13 v_j_8 (select v_A_7 v_j_8)) v_B_12)) InVars {A=v_A_7, j=v_j_8, B=v_B_13} OutVars{A=v_A_7, j=v_j_7, B=v_B_12} AuxVars[] AssignedVars[j, B]" [2025-04-26 18:41:21,253 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:21,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1281825421, now seen corresponding path program 1 times [2025-04-26 18:41:21,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:21,253 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577737966] [2025-04-26 18:41:21,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:21,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:21,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:41:21,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:41:21,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:21,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:21,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:21,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:41:21,348 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577737966] [2025-04-26 18:41:21,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577737966] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:41:21,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:41:21,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-26 18:41:21,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366837644] [2025-04-26 18:41:21,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:41:21,352 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:41:21,353 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:21,353 INFO L85 PathProgramCache]: Analyzing trace with hash 3395, now seen corresponding path program 1 times [2025-04-26 18:41:21,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:21,353 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338325596] [2025-04-26 18:41:21,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:21,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:21,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:21,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:21,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:21,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:21,359 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:21,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:21,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:21,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:21,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:21,366 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:21,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:41:21,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 18:41:21,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-26 18:41:21,388 INFO L87 Difference]: Start difference. First operand 106 states and 212 transitions. cyclomatic complexity: 133 Second operand has 5 states, 5 states have (on average 2.0) internal successors, (in total 10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:21,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:41:21,437 INFO L93 Difference]: Finished difference Result 108 states and 214 transitions. [2025-04-26 18:41:21,437 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 108 states and 214 transitions. [2025-04-26 18:41:21,439 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 42 [2025-04-26 18:41:21,439 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 108 states to 108 states and 214 transitions. [2025-04-26 18:41:21,439 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 [2025-04-26 18:41:21,440 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 64 [2025-04-26 18:41:21,440 INFO L74 IsDeterministic]: Start isDeterministic. Operand 108 states and 214 transitions. [2025-04-26 18:41:21,440 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:21,440 INFO L218 hiAutomatonCegarLoop]: Abstraction has 108 states and 214 transitions. [2025-04-26 18:41:21,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states and 214 transitions. [2025-04-26 18:41:21,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2025-04-26 18:41:21,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 106 states have (on average 1.990566037735849) internal successors, (in total 211), 105 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:21,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 211 transitions. [2025-04-26 18:41:21,444 INFO L240 hiAutomatonCegarLoop]: Abstraction has 106 states and 211 transitions. [2025-04-26 18:41:21,444 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 18:41:21,444 INFO L438 stractBuchiCegarLoop]: Abstraction has 106 states and 211 transitions. [2025-04-26 18:41:21,445 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:41:21,445 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 211 transitions. [2025-04-26 18:41:21,445 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 42 [2025-04-26 18:41:21,445 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:21,445 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:21,446 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:21,446 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:21,446 INFO L752 eck$LassoCheckResult]: Stem: "[67] $Ultimate##0-->L55: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[61] L55-->L56: Formula: (< v_M_4 v_N_3) InVars {M=v_M_4, N=v_N_3} OutVars{M=v_M_4, N=v_N_3} AuxVars[] AssignedVars[]" "[47] L56-->L57: Formula: (and (= v_i_6 0) (= v_j_6 v_i_6)) InVars {i=v_i_6, j=v_j_6} OutVars{i=v_i_6, j=v_j_6} AuxVars[] AssignedVars[]" "[68] L57-->L58: Formula: (= v_M_5 v_k_1) InVars {M=v_M_5, k=v_k_1} OutVars{M=v_M_5, k=v_k_1} AuxVars[] AssignedVars[]" "[48] L58-->L59: Formula: (<= 0 v_l_1) InVars {l=v_l_1} OutVars{l=v_l_1} AuxVars[] AssignedVars[]" "[44] L59-->L60: Formula: (< v_l_2 v_N_4) InVars {l=v_l_2, N=v_N_4} OutVars{l=v_l_2, N=v_N_4} AuxVars[] AssignedVars[]" "[85] L60-->L22-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[72] L22-1-->L22: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[88] L60-1-->L33-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[74] L22-->L22-1: Formula: (and (= (store v_B_9 v_i_8 (select v_A_5 v_i_8)) v_B_8) (= (+ v_i_8 1) v_i_7)) InVars {A=v_A_5, i=v_i_8, B=v_B_9} OutVars{A=v_A_5, i=v_i_7, B=v_B_8} AuxVars[] AssignedVars[i, B]" "[71] L22-1-->thread1FINAL: Formula: (<= v_N_2 v_i_5) InVars {i=v_i_5, N=v_N_2} OutVars{i=v_i_5, N=v_N_2} AuxVars[] AssignedVars[]" [2025-04-26 18:41:21,446 INFO L754 eck$LassoCheckResult]: Loop: "[76] L33-1-->L33: Formula: (< v_j_1 v_M_1) InVars {M=v_M_1, j=v_j_1} OutVars{M=v_M_1, j=v_j_1} AuxVars[] AssignedVars[]" "[78] L33-->L33-1: Formula: (and (= (+ v_j_8 1) v_j_7) (= (store v_B_13 v_j_8 (select v_A_7 v_j_8)) v_B_12)) InVars {A=v_A_7, j=v_j_8, B=v_B_13} OutVars{A=v_A_7, j=v_j_7, B=v_B_12} AuxVars[] AssignedVars[j, B]" [2025-04-26 18:41:21,446 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:21,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1081926230, now seen corresponding path program 1 times [2025-04-26 18:41:21,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:21,446 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861217784] [2025-04-26 18:41:21,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:21,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:21,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:41:21,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:41:21,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:21,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:21,454 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:21,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:41:21,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:41:21,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:21,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:21,459 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:21,459 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:21,459 INFO L85 PathProgramCache]: Analyzing trace with hash 3395, now seen corresponding path program 2 times [2025-04-26 18:41:21,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:21,459 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246102008] [2025-04-26 18:41:21,460 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:41:21,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:21,462 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:21,463 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:21,463 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:41:21,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:21,463 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:21,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:21,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:21,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:21,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:21,465 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:21,466 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:21,466 INFO L85 PathProgramCache]: Analyzing trace with hash 349023832, now seen corresponding path program 1 times [2025-04-26 18:41:21,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:21,466 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935751097] [2025-04-26 18:41:21,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:21,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:21,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:41:21,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:41:21,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:21,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:21,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:21,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:41:21,538 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935751097] [2025-04-26 18:41:21,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935751097] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:41:21,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:41:21,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-26 18:41:21,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568401252] [2025-04-26 18:41:21,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:41:21,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:41:21,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-26 18:41:21,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-26 18:41:21,555 INFO L87 Difference]: Start difference. First operand 106 states and 211 transitions. cyclomatic complexity: 132 Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (in total 13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:21,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:41:21,659 INFO L93 Difference]: Finished difference Result 156 states and 292 transitions. [2025-04-26 18:41:21,659 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 156 states and 292 transitions. [2025-04-26 18:41:21,660 INFO L131 ngComponentsAnalysis]: Automaton has 25 accepting balls. 56 [2025-04-26 18:41:21,664 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 156 states to 154 states and 290 transitions. [2025-04-26 18:41:21,664 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 97 [2025-04-26 18:41:21,665 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 97 [2025-04-26 18:41:21,665 INFO L74 IsDeterministic]: Start isDeterministic. Operand 154 states and 290 transitions. [2025-04-26 18:41:21,665 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:21,665 INFO L218 hiAutomatonCegarLoop]: Abstraction has 154 states and 290 transitions. [2025-04-26 18:41:21,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states and 290 transitions. [2025-04-26 18:41:21,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 125. [2025-04-26 18:41:21,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 125 states have (on average 1.968) internal successors, (in total 246), 124 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:21,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 246 transitions. [2025-04-26 18:41:21,672 INFO L240 hiAutomatonCegarLoop]: Abstraction has 125 states and 246 transitions. [2025-04-26 18:41:21,674 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-26 18:41:21,675 INFO L438 stractBuchiCegarLoop]: Abstraction has 125 states and 246 transitions. [2025-04-26 18:41:21,675 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:41:21,675 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 125 states and 246 transitions. [2025-04-26 18:41:21,676 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 42 [2025-04-26 18:41:21,677 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:21,677 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:21,677 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:21,677 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:21,677 INFO L752 eck$LassoCheckResult]: Stem: "[67] $Ultimate##0-->L55: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[61] L55-->L56: Formula: (< v_M_4 v_N_3) InVars {M=v_M_4, N=v_N_3} OutVars{M=v_M_4, N=v_N_3} AuxVars[] AssignedVars[]" "[47] L56-->L57: Formula: (and (= v_i_6 0) (= v_j_6 v_i_6)) InVars {i=v_i_6, j=v_j_6} OutVars{i=v_i_6, j=v_j_6} AuxVars[] AssignedVars[]" "[68] L57-->L58: Formula: (= v_M_5 v_k_1) InVars {M=v_M_5, k=v_k_1} OutVars{M=v_M_5, k=v_k_1} AuxVars[] AssignedVars[]" "[48] L58-->L59: Formula: (<= 0 v_l_1) InVars {l=v_l_1} OutVars{l=v_l_1} AuxVars[] AssignedVars[]" "[44] L59-->L60: Formula: (< v_l_2 v_N_4) InVars {l=v_l_2, N=v_N_4} OutVars{l=v_l_2, N=v_N_4} AuxVars[] AssignedVars[]" "[85] L60-->L22-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[72] L22-1-->L22: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[88] L60-1-->L33-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[74] L22-->L22-1: Formula: (and (= (store v_B_9 v_i_8 (select v_A_5 v_i_8)) v_B_8) (= (+ v_i_8 1) v_i_7)) InVars {A=v_A_5, i=v_i_8, B=v_B_9} OutVars{A=v_A_5, i=v_i_7, B=v_B_8} AuxVars[] AssignedVars[i, B]" "[72] L22-1-->L22: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[74] L22-->L22-1: Formula: (and (= (store v_B_9 v_i_8 (select v_A_5 v_i_8)) v_B_8) (= (+ v_i_8 1) v_i_7)) InVars {A=v_A_5, i=v_i_8, B=v_B_9} OutVars{A=v_A_5, i=v_i_7, B=v_B_8} AuxVars[] AssignedVars[i, B]" "[71] L22-1-->thread1FINAL: Formula: (<= v_N_2 v_i_5) InVars {i=v_i_5, N=v_N_2} OutVars{i=v_i_5, N=v_N_2} AuxVars[] AssignedVars[]" [2025-04-26 18:41:21,678 INFO L754 eck$LassoCheckResult]: Loop: "[76] L33-1-->L33: Formula: (< v_j_1 v_M_1) InVars {M=v_M_1, j=v_j_1} OutVars{M=v_M_1, j=v_j_1} AuxVars[] AssignedVars[]" "[78] L33-->L33-1: Formula: (and (= (+ v_j_8 1) v_j_7) (= (store v_B_13 v_j_8 (select v_A_7 v_j_8)) v_B_12)) InVars {A=v_A_7, j=v_j_8, B=v_B_13} OutVars{A=v_A_7, j=v_j_7, B=v_B_12} AuxVars[] AssignedVars[j, B]" [2025-04-26 18:41:21,678 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:21,678 INFO L85 PathProgramCache]: Analyzing trace with hash 349024724, now seen corresponding path program 2 times [2025-04-26 18:41:21,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:21,678 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184993307] [2025-04-26 18:41:21,678 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:41:21,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:21,683 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-04-26 18:41:21,692 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:41:21,692 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 18:41:21,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:21,692 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:21,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:41:21,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:41:21,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:21,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:21,699 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:21,701 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:21,701 INFO L85 PathProgramCache]: Analyzing trace with hash 3395, now seen corresponding path program 3 times [2025-04-26 18:41:21,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:21,701 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104407391] [2025-04-26 18:41:21,701 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 18:41:21,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:21,705 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:21,706 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:21,706 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 18:41:21,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:21,706 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:21,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:21,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:21,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:21,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:21,710 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:21,711 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:21,711 INFO L85 PathProgramCache]: Analyzing trace with hash 405313110, now seen corresponding path program 2 times [2025-04-26 18:41:21,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:21,711 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493340945] [2025-04-26 18:41:21,711 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:41:21,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:21,716 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-26 18:41:21,724 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:41:21,724 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 18:41:21,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:21,724 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:21,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:41:21,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:41:21,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:21,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:21,737 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:21,880 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:21,880 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:21,880 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:21,880 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:21,881 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:21,881 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:21,881 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:21,881 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:21,881 INFO L132 ssoRankerPreferences]: Filename of dumped script: parray-copy.wvr.bpl_petrified1_Iteration4_Lasso [2025-04-26 18:41:21,881 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:21,881 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:21,882 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:21,887 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:21,890 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:21,936 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:21,941 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:21,943 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:21,947 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:22,051 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:22,051 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:22,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:22,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:22,053 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:22,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 18:41:22,055 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:22,065 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:22,065 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:22,065 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:22,065 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:22,067 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:22,067 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:22,069 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:22,075 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:41:22,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:22,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:22,077 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:22,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 18:41:22,078 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:22,088 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:22,088 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:22,088 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:22,088 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:22,089 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:22,089 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:22,092 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:22,098 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:41:22,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:22,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:22,100 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:22,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 18:41:22,102 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:22,112 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:22,112 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:22,112 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:22,112 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:22,114 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:22,114 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:22,118 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:22,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 18:41:22,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:22,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:22,126 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:22,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 18:41:22,128 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:22,138 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:22,138 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:22,138 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:22,138 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:22,140 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:22,140 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:22,145 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:22,154 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 18:41:22,154 INFO L437 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 18:41:22,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:22,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:22,156 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:22,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 18:41:22,159 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:22,176 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:41:22,176 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:41:22,176 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:22,176 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(M, j) = 1*M - 1*j Supporting invariants [] [2025-04-26 18:41:22,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 18:41:22,185 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 18:41:22,199 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:22,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:41:22,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:41:22,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:22,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:22,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:22,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:22,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:22,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:22,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:22,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:22,222 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:22,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:22,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:22,237 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:41:22,237 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 125 states and 246 transitions. cyclomatic complexity: 148 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:22,298 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 125 states and 246 transitions. cyclomatic complexity: 148. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 269 states and 559 transitions. Complement of second has 6 states. [2025-04-26 18:41:22,299 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:41:22,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:22,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2025-04-26 18:41:22,300 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 52 transitions. Stem has 13 letters. Loop has 2 letters. [2025-04-26 18:41:22,300 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:22,300 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 52 transitions. Stem has 15 letters. Loop has 2 letters. [2025-04-26 18:41:22,300 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:22,300 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 52 transitions. Stem has 13 letters. Loop has 4 letters. [2025-04-26 18:41:22,300 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:22,300 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 269 states and 559 transitions. [2025-04-26 18:41:22,302 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 14 [2025-04-26 18:41:22,304 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 269 states to 160 states and 312 transitions. [2025-04-26 18:41:22,304 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 66 [2025-04-26 18:41:22,304 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 94 [2025-04-26 18:41:22,304 INFO L74 IsDeterministic]: Start isDeterministic. Operand 160 states and 312 transitions. [2025-04-26 18:41:22,304 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:22,304 INFO L218 hiAutomatonCegarLoop]: Abstraction has 160 states and 312 transitions. [2025-04-26 18:41:22,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states and 312 transitions. [2025-04-26 18:41:22,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 123. [2025-04-26 18:41:22,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 123 states have (on average 2.0569105691056913) internal successors, (in total 253), 122 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:22,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 253 transitions. [2025-04-26 18:41:22,310 INFO L240 hiAutomatonCegarLoop]: Abstraction has 123 states and 253 transitions. [2025-04-26 18:41:22,310 INFO L438 stractBuchiCegarLoop]: Abstraction has 123 states and 253 transitions. [2025-04-26 18:41:22,310 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:41:22,311 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 123 states and 253 transitions. [2025-04-26 18:41:22,311 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 14 [2025-04-26 18:41:22,311 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:22,311 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:22,312 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:22,312 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:22,312 INFO L752 eck$LassoCheckResult]: Stem: "[67] $Ultimate##0-->L55: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[61] L55-->L56: Formula: (< v_M_4 v_N_3) InVars {M=v_M_4, N=v_N_3} OutVars{M=v_M_4, N=v_N_3} AuxVars[] AssignedVars[]" "[47] L56-->L57: Formula: (and (= v_i_6 0) (= v_j_6 v_i_6)) InVars {i=v_i_6, j=v_j_6} OutVars{i=v_i_6, j=v_j_6} AuxVars[] AssignedVars[]" "[68] L57-->L58: Formula: (= v_M_5 v_k_1) InVars {M=v_M_5, k=v_k_1} OutVars{M=v_M_5, k=v_k_1} AuxVars[] AssignedVars[]" "[48] L58-->L59: Formula: (<= 0 v_l_1) InVars {l=v_l_1} OutVars{l=v_l_1} AuxVars[] AssignedVars[]" "[44] L59-->L60: Formula: (< v_l_2 v_N_4) InVars {l=v_l_2, N=v_N_4} OutVars{l=v_l_2, N=v_N_4} AuxVars[] AssignedVars[]" "[85] L60-->L22-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[72] L22-1-->L22: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[88] L60-1-->L33-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[74] L22-->L22-1: Formula: (and (= (store v_B_9 v_i_8 (select v_A_5 v_i_8)) v_B_8) (= (+ v_i_8 1) v_i_7)) InVars {A=v_A_5, i=v_i_8, B=v_B_9} OutVars{A=v_A_5, i=v_i_7, B=v_B_8} AuxVars[] AssignedVars[i, B]" "[91] L61-->L44-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" "[71] L22-1-->thread1FINAL: Formula: (<= v_N_2 v_i_5) InVars {i=v_i_5, N=v_N_2} OutVars{i=v_i_5, N=v_N_2} AuxVars[] AssignedVars[]" "[75] L33-1-->thread2FINAL: Formula: (<= v_M_2 v_j_5) InVars {M=v_M_2, j=v_j_5} OutVars{M=v_M_2, j=v_j_5} AuxVars[] AssignedVars[]" [2025-04-26 18:41:22,312 INFO L754 eck$LassoCheckResult]: Loop: "[80] L44-1-->L44: Formula: (< v_k_2 v_N_5) InVars {k=v_k_2, N=v_N_5} OutVars{k=v_k_2, N=v_N_5} AuxVars[] AssignedVars[]" "[82] L44-->L44-1: Formula: (and (= (+ v_k_8 1) v_k_7) (= (store v_B_17 v_k_8 (select v_A_9 v_k_8)) v_B_16)) InVars {A=v_A_9, k=v_k_8, B=v_B_17} OutVars{A=v_A_9, k=v_k_7, B=v_B_16} AuxVars[] AssignedVars[k, B]" [2025-04-26 18:41:22,313 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:22,313 INFO L85 PathProgramCache]: Analyzing trace with hash 349042894, now seen corresponding path program 1 times [2025-04-26 18:41:22,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:22,313 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472368315] [2025-04-26 18:41:22,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:22,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:22,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:41:22,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:41:22,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:22,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:22,324 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:22,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:41:22,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:41:22,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:22,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:22,332 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:22,333 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:22,333 INFO L85 PathProgramCache]: Analyzing trace with hash 3523, now seen corresponding path program 1 times [2025-04-26 18:41:22,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:22,333 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462277667] [2025-04-26 18:41:22,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:22,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:22,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:22,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:22,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:22,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:22,336 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:22,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:22,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:22,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:22,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:22,338 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:22,338 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:22,338 INFO L85 PathProgramCache]: Analyzing trace with hash 422774608, now seen corresponding path program 1 times [2025-04-26 18:41:22,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:22,338 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620835031] [2025-04-26 18:41:22,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:22,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:22,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:41:22,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:41:22,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:22,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:22,344 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:22,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:41:22,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:41:22,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:22,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:22,355 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:22,492 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:22,492 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:22,492 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:22,492 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:22,492 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:22,492 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:22,492 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:22,492 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:22,493 INFO L132 ssoRankerPreferences]: Filename of dumped script: parray-copy.wvr.bpl_petrified1_Iteration5_Lasso [2025-04-26 18:41:22,493 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:22,493 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:22,494 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:22,500 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:22,503 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:22,505 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:22,506 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:22,508 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:22,513 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:22,551 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:22,554 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:22,653 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:22,654 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:22,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:22,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:22,656 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:22,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 18:41:22,658 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:22,672 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:22,672 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:22,672 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:22,672 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:22,673 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:22,673 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:22,676 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:22,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:22,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:22,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:22,709 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:22,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 18:41:22,710 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:22,720 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:22,720 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:22,720 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:22,720 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:22,723 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:22,723 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:22,725 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:22,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 18:41:22,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:22,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:22,733 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:22,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 18:41:22,737 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:22,747 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:22,748 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:22,748 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:22,748 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:22,749 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:22,749 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:22,751 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:22,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2025-04-26 18:41:22,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:22,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:22,759 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:22,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 18:41:22,760 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:22,770 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:22,770 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:22,770 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:22,770 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:22,771 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:22,772 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:22,774 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:22,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 18:41:22,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:22,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:22,782 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:22,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 18:41:22,784 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:22,794 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:22,794 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:22,794 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:22,794 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:22,797 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:22,797 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:22,801 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:22,807 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:41:22,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:22,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:22,809 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:22,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 18:41:22,811 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:22,820 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:22,820 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:22,820 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:22,820 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:22,822 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:22,822 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:22,825 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:22,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 18:41:22,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:22,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:22,832 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:41:22,834 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:41:22,834 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:22,844 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:22,844 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:22,844 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:22,844 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:22,847 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:22,847 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:22,851 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:22,861 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 18:41:22,862 INFO L437 ModelExtractionUtils]: 2 out of 16 variables were initially zero. Simplification set additionally 11 variables to zero. [2025-04-26 18:41:22,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:22,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:22,864 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:22,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 18:41:22,866 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:22,882 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:41:22,882 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:41:22,882 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:22,882 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, k) = 1*N - 1*k Supporting invariants [] [2025-04-26 18:41:22,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-04-26 18:41:22,889 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:41:22,900 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:22,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:41:22,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:41:22,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:22,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:22,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:22,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:22,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:22,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:22,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:22,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:22,926 WARN L254 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:22,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:22,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:22,938 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 18:41:22,938 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 123 states and 253 transitions. cyclomatic complexity: 149 Second operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:22,982 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 123 states and 253 transitions. cyclomatic complexity: 149. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 226 states and 444 transitions. Complement of second has 6 states. [2025-04-26 18:41:22,983 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:41:22,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (in total 15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:22,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 45 transitions. [2025-04-26 18:41:22,983 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 13 letters. Loop has 2 letters. [2025-04-26 18:41:22,983 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:22,983 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 15 letters. Loop has 2 letters. [2025-04-26 18:41:22,984 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:22,984 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 45 transitions. Stem has 13 letters. Loop has 4 letters. [2025-04-26 18:41:22,984 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:22,984 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 226 states and 444 transitions. [2025-04-26 18:41:22,985 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:41:22,985 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 226 states to 0 states and 0 transitions. [2025-04-26 18:41:22,985 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:41:22,986 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:41:22,986 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:41:22,986 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:41:22,986 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:22,986 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:22,986 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:22,986 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 18:41:22,986 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:41:22,986 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:41:22,986 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:41:22,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 18:41:22,998 INFO L201 PluginConnector]: Adding new model parray-copy.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:41:22 BoogieIcfgContainer [2025-04-26 18:41:22,998 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:41:22,999 INFO L158 Benchmark]: Toolchain (without parser) took 3113.22ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 86.0MB in the beginning and 51.7MB in the end (delta: 34.2MB). Peak memory consumption was 35.7MB. Max. memory is 8.0GB. [2025-04-26 18:41:22,999 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.78ms. 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:41:22,999 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.19ms. Allocated memory is still 159.4MB. Free memory was 86.0MB in the beginning and 84.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:23,000 INFO L158 Benchmark]: Boogie Preprocessor took 22.98ms. Allocated memory is still 159.4MB. Free memory was 84.1MB in the beginning and 83.1MB in the end (delta: 995.3kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:41:23,000 INFO L158 Benchmark]: RCFGBuilder took 200.80ms. Allocated memory is still 159.4MB. Free memory was 83.1MB in the beginning and 73.4MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 18:41:23,000 INFO L158 Benchmark]: BuchiAutomizer took 2854.24ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 73.2MB in the beginning and 51.7MB in the end (delta: 21.5MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2025-04-26 18:41:23,001 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.78ms. 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 32.19ms. Allocated memory is still 159.4MB. Free memory was 86.0MB in the beginning and 84.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 22.98ms. Allocated memory is still 159.4MB. Free memory was 84.1MB in the beginning and 83.1MB in the end (delta: 995.3kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 200.80ms. Allocated memory is still 159.4MB. Free memory was 83.1MB in the beginning and 73.4MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 2854.24ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 73.2MB in the beginning and 51.7MB in the end (delta: 21.5MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.7s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 1.9s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 83 StatesRemovedByMinimization, 4 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, 236 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 233 mSDsluCounter, 118 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 50 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 234 IncrementalHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 68 mSDtfsCounter, 234 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital64 mio100 ax100 hnf100 lsp72 ukn86 mio100 lsp78 div100 bol100 ite100 ukn100 eq142 hnf93 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 31ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 166, Number of transitions in reduction automaton: 229, Number of states in reduction automaton: 116, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 5 locations. One deterministic module has affine ranking function M + -1 * j and consists of 4 locations. One deterministic module has affine ranking function -1 * k + N and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 6 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 18:41:23,013 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...