./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bec73cbd355af8995620266d1bb50e13212a1740ed8bd583620b6985b8fd569c --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 19:12:39,215 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 19:12:39,290 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-02-06 19:12:39,297 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 19:12:39,297 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 19:12:39,297 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-02-06 19:12:39,322 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 19:12:39,322 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 19:12:39,323 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 19:12:39,323 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 19:12:39,323 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 19:12:39,323 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 19:12:39,323 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 19:12:39,323 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 19:12:39,323 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-02-06 19:12:39,323 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-02-06 19:12:39,323 INFO L153 SettingsManager]: * Use old map elimination=false [2025-02-06 19:12:39,323 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-02-06 19:12:39,323 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-02-06 19:12:39,323 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-02-06 19:12:39,323 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 19:12:39,323 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-02-06 19:12:39,324 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 19:12:39,324 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 19:12:39,324 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 19:12:39,324 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 19:12:39,324 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-02-06 19:12:39,324 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-02-06 19:12:39,324 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-02-06 19:12:39,324 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 19:12:39,324 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 19:12:39,324 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 19:12:39,324 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-02-06 19:12:39,324 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 19:12:39,324 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 19:12:39,324 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 19:12:39,324 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 19:12:39,324 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 19:12:39,324 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 19:12:39,327 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-02-06 19:12:39,327 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bec73cbd355af8995620266d1bb50e13212a1740ed8bd583620b6985b8fd569c [2025-02-06 19:12:39,570 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 19:12:39,574 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 19:12:39,576 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 19:12:39,576 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 19:12:39,576 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 19:12:39,577 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c [2025-02-06 19:12:40,700 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f61476d64/96c06a9fb64042cdb4fc209fbcb66a3d/FLAG4f3388abd [2025-02-06 19:12:40,949 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 19:12:40,949 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/bitvector-loops/verisec_sendmail_tTflag_arr_one_loop.c [2025-02-06 19:12:40,967 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f61476d64/96c06a9fb64042cdb4fc209fbcb66a3d/FLAG4f3388abd [2025-02-06 19:12:40,984 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f61476d64/96c06a9fb64042cdb4fc209fbcb66a3d [2025-02-06 19:12:40,986 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 19:12:40,987 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 19:12:40,988 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 19:12:40,988 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 19:12:40,991 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 19:12:40,992 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 07:12:40" (1/1) ... [2025-02-06 19:12:40,992 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ab1b04e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:12:40, skipping insertion in model container [2025-02-06 19:12:40,992 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 07:12:40" (1/1) ... [2025-02-06 19:12:41,003 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 19:12:41,104 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 19:12:41,111 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 19:12:41,121 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 19:12:41,129 INFO L204 MainTranslator]: Completed translation [2025-02-06 19:12:41,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:12:41 WrapperNode [2025-02-06 19:12:41,130 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 19:12:41,130 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 19:12:41,130 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 19:12:41,130 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 19:12:41,134 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:12:41" (1/1) ... [2025-02-06 19:12:41,139 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:12:41" (1/1) ... [2025-02-06 19:12:41,148 INFO L138 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 52 [2025-02-06 19:12:41,148 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 19:12:41,148 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 19:12:41,149 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 19:12:41,149 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 19:12:41,153 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:12:41" (1/1) ... [2025-02-06 19:12:41,153 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:12:41" (1/1) ... [2025-02-06 19:12:41,154 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:12:41" (1/1) ... [2025-02-06 19:12:41,162 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-02-06 19:12:41,162 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:12:41" (1/1) ... [2025-02-06 19:12:41,162 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:12:41" (1/1) ... [2025-02-06 19:12:41,165 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:12:41" (1/1) ... [2025-02-06 19:12:41,165 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:12:41" (1/1) ... [2025-02-06 19:12:41,166 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:12:41" (1/1) ... [2025-02-06 19:12:41,166 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:12:41" (1/1) ... [2025-02-06 19:12:41,167 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 19:12:41,168 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 19:12:41,168 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 19:12:41,168 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 19:12:41,169 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:12:41" (1/1) ... [2025-02-06 19:12:41,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:41,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:41,191 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:41,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-02-06 19:12:41,210 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 19:12:41,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 19:12:41,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 19:12:41,211 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 19:12:41,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 19:12:41,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 19:12:41,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 19:12:41,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 19:12:41,211 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 19:12:41,211 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 19:12:41,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 19:12:41,262 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 19:12:41,263 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 19:12:41,348 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L16: call ULTIMATE.dealloc(main_~#in~0#1.base, main_~#in~0#1.offset);havoc main_~#in~0#1.base, main_~#in~0#1.offset; [2025-02-06 19:12:41,356 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-02-06 19:12:41,356 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 19:12:41,362 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 19:12:41,362 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 19:12:41,362 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:12:41 BoogieIcfgContainer [2025-02-06 19:12:41,362 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 19:12:41,363 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-02-06 19:12:41,363 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-02-06 19:12:41,367 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-02-06 19:12:41,367 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:12:41,367 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 06.02 07:12:40" (1/3) ... [2025-02-06 19:12:41,368 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@432acd7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.02 07:12:41, skipping insertion in model container [2025-02-06 19:12:41,368 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:12:41,368 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 07:12:41" (2/3) ... [2025-02-06 19:12:41,368 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@432acd7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 06.02 07:12:41, skipping insertion in model container [2025-02-06 19:12:41,368 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-02-06 19:12:41,369 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:12:41" (3/3) ... [2025-02-06 19:12:41,369 INFO L363 chiAutomizerObserver]: Analyzing ICFG verisec_sendmail_tTflag_arr_one_loop.c [2025-02-06 19:12:41,404 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-02-06 19:12:41,404 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-02-06 19:12:41,404 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-02-06 19:12:41,405 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-02-06 19:12:41,405 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-02-06 19:12:41,405 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-02-06 19:12:41,405 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-02-06 19:12:41,405 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-02-06 19:12:41,408 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:41,417 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2025-02-06 19:12:41,418 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:12:41,418 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:12:41,421 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-06 19:12:41,421 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-06 19:12:41,422 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-02-06 19:12:41,422 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:41,423 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2025-02-06 19:12:41,423 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:12:41,423 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:12:41,423 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-02-06 19:12:41,423 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-06 19:12:41,427 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(39, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem8#1, main_~#in~0#1.base, main_~#in~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~c~0#1, main_~i~0#1, main_~j~0#1, main_~idx_in~0#1;call main_~#in~0#1.base, main_~#in~0#1.offset := #Ultimate.allocOnStack(11);havoc main_~s~0#1.base, main_~s~0#1.offset;havoc main_~c~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~idx_in~0#1;main_~i~0#1 := 0;" [2025-02-06 19:12:41,428 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 < 11;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" [2025-02-06 19:12:41,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:41,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1408, now seen corresponding path program 1 times [2025-02-06 19:12:41,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:41,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300423194] [2025-02-06 19:12:41,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:12:41,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:41,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:12:41,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:12:41,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:41,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:41,500 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:12:41,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:12:41,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:12:41,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:41,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:41,515 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:12:41,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:41,517 INFO L85 PathProgramCache]: Analyzing trace with hash 43, now seen corresponding path program 1 times [2025-02-06 19:12:41,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:41,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046602123] [2025-02-06 19:12:41,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:12:41,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:41,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:12:41,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:12:41,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:41,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:41,525 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:12:41,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:12:41,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:12:41,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:41,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:41,531 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:12:41,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:41,533 INFO L85 PathProgramCache]: Analyzing trace with hash 43660, now seen corresponding path program 1 times [2025-02-06 19:12:41,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:41,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158890875] [2025-02-06 19:12:41,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:12:41,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:41,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:12:41,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:12:41,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:41,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:41,550 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:12:41,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:12:41,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:12:41,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:41,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:41,562 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:12:41,800 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:12:41,800 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:12:41,801 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:12:41,801 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:12:41,801 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:12:41,801 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:41,801 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:12:41,801 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:12:41,801 INFO L132 ssoRankerPreferences]: Filename of dumped script: verisec_sendmail_tTflag_arr_one_loop.c_Iteration1_Lasso [2025-02-06 19:12:41,801 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:12:41,802 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:12:41,812 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:41,817 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:41,819 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:41,821 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:41,834 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:42,000 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:42,002 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:42,004 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:42,006 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:42,008 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:42,010 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:42,012 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:42,013 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:42,186 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:12:42,188 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:12:42,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:42,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:42,191 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:42,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-02-06 19:12:42,198 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-02-06 19:12:42,210 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:42,210 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:42,211 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:42,211 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:42,211 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:12:42,214 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:12:42,214 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:42,216 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:42,222 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-02-06 19:12:42,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:42,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:42,225 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:42,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-02-06 19:12:42,227 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-02-06 19:12:42,239 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:42,239 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:42,239 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:42,239 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:42,239 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:12:42,240 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:12:42,240 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:42,244 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:42,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:42,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:42,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:42,258 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:42,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-02-06 19:12:42,263 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-02-06 19:12:42,275 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:42,275 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:42,275 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:42,275 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:42,275 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:12:42,276 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:12:42,276 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:42,278 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:42,287 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-02-06 19:12:42,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:42,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:42,289 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:42,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-02-06 19:12:42,298 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-02-06 19:12:42,308 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:42,309 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:42,309 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:42,309 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:12:42,312 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:12:42,312 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:12:42,315 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:42,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-02-06 19:12:42,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:42,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:42,325 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:42,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-02-06 19:12:42,328 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-02-06 19:12:42,338 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:42,339 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:42,339 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:42,339 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:12:42,343 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:12:42,343 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:12:42,348 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:42,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:42,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:42,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:42,356 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:42,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-02-06 19:12:42,380 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-02-06 19:12:42,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:42,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:42,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:42,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:12:42,396 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:12:42,397 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:12:42,400 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:42,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:42,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:42,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:42,411 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:42,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-02-06 19:12:42,414 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-02-06 19:12:42,424 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:42,424 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:42,424 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:42,424 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:42,424 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:12:42,424 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:12:42,425 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:42,427 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:42,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:42,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:42,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:42,435 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:42,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-02-06 19:12:42,438 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-02-06 19:12:42,447 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:42,448 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:42,448 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:42,448 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:12:42,452 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:12:42,452 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:12:42,455 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:42,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:42,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:42,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:42,464 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:42,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-02-06 19:12:42,470 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-02-06 19:12:42,480 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:42,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:42,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:42,480 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:12:42,486 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:12:42,486 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:12:42,492 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:12:42,517 INFO L443 ModelExtractionUtils]: Simplification made 16 calls to the SMT solver. [2025-02-06 19:12:42,519 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2025-02-06 19:12:42,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:42,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:42,523 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:42,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-02-06 19:12:42,529 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:12:42,541 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-02-06 19:12:42,541 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:12:42,541 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, v_rep(select #length ULTIMATE.start_main_~#in~0#1.base)_1) = -2*ULTIMATE.start_main_~i~0#1 + 21*v_rep(select #length ULTIMATE.start_main_~#in~0#1.base)_1 Supporting invariants [] [2025-02-06 19:12:42,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:42,562 INFO L156 tatePredicateManager]: 5 out of 5 supporting invariants were superfluous and have been removed [2025-02-06 19:12:42,570 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-02-06 19:12:42,570 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-02-06 19:12:42,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:42,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 19:12:42,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 19:12:42,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:42,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:42,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-06 19:12:42,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:12:42,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:12:42,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:12:42,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:42,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:42,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 19:12:42,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:12:42,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:12:42,632 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-02-06 19:12:42,634 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:42,656 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 11 states, 10 states have (on average 1.3) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 13 states and 17 transitions. Complement of second has 3 states. [2025-02-06 19:12:42,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 2 states 1 stem states 0 non-accepting loop states 1 accepting loop states [2025-02-06 19:12:42,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:42,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3 transitions. [2025-02-06 19:12:42,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 2 letters. Loop has 1 letters. [2025-02-06 19:12:42,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:12:42,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 3 letters. Loop has 1 letters. [2025-02-06 19:12:42,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:12:42,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states and 3 transitions. Stem has 2 letters. Loop has 2 letters. [2025-02-06 19:12:42,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:12:42,666 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 17 transitions. [2025-02-06 19:12:42,667 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-02-06 19:12:42,668 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 6 states and 8 transitions. [2025-02-06 19:12:42,668 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2025-02-06 19:12:42,668 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2025-02-06 19:12:42,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 8 transitions. [2025-02-06 19:12:42,669 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:12:42,669 INFO L218 hiAutomatonCegarLoop]: Abstraction has 6 states and 8 transitions. [2025-02-06 19:12:42,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states and 8 transitions. [2025-02-06 19:12:42,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 5. [2025-02-06 19:12:42,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:42,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7 transitions. [2025-02-06 19:12:42,684 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5 states and 7 transitions. [2025-02-06 19:12:42,684 INFO L432 stractBuchiCegarLoop]: Abstraction has 5 states and 7 transitions. [2025-02-06 19:12:42,685 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-02-06 19:12:42,685 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 7 transitions. [2025-02-06 19:12:42,685 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-02-06 19:12:42,685 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:12:42,685 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:12:42,685 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-02-06 19:12:42,685 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-06 19:12:42,686 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(39, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem8#1, main_~#in~0#1.base, main_~#in~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~c~0#1, main_~i~0#1, main_~j~0#1, main_~idx_in~0#1;call main_~#in~0#1.base, main_~#in~0#1.offset := #Ultimate.allocOnStack(11);havoc main_~s~0#1.base, main_~s~0#1.offset;havoc main_~c~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~idx_in~0#1;main_~i~0#1 := 0;" "assume !(main_~i~0#1 < 11);call write~int#1(0, main_~#in~0#1.base, 10 + main_~#in~0#1.offset, 1);main_~idx_in~0#1 := 0;main_~s~0#1.base, main_~s~0#1.offset := main_~#in~0#1.base, main_~#in~0#1.offset;main_~i~0#1 := 0;call main_#t~mem6#1 := read~int#1(main_~#in~0#1.base, main_~#in~0#1.offset + main_~idx_in~0#1, 1);main_~c~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1;" [2025-02-06 19:12:42,686 INFO L754 eck$LassoCheckResult]: Loop: "assume 48 <= (if main_~c~0#1 % 256 % 4294967296 <= 2147483647 then main_~c~0#1 % 256 % 4294967296 else main_~c~0#1 % 256 % 4294967296 - 4294967296) && (if main_~c~0#1 % 256 % 4294967296 <= 2147483647 then main_~c~0#1 % 256 % 4294967296 else main_~c~0#1 % 256 % 4294967296 - 4294967296) <= 57;main_~j~0#1 := (if main_~c~0#1 % 256 % 4294967296 <= 2147483647 then main_~c~0#1 % 256 % 4294967296 else main_~c~0#1 % 256 % 4294967296 - 4294967296) - 48;main_~i~0#1 := (if (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 else (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 - 4294967296);main_#t~post7#1 := main_~idx_in~0#1;main_~idx_in~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;call main_#t~mem8#1 := read~int#1(main_~#in~0#1.base, main_~#in~0#1.offset + main_~idx_in~0#1, 1);main_~c~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;" [2025-02-06 19:12:42,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:42,686 INFO L85 PathProgramCache]: Analyzing trace with hash 43659, now seen corresponding path program 1 times [2025-02-06 19:12:42,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:42,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922702924] [2025-02-06 19:12:42,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:12:42,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:42,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 19:12:42,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 19:12:42,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:42,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:42,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:12:42,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:12:42,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922702924] [2025-02-06 19:12:42,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922702924] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 19:12:42,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 19:12:42,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 19:12:42,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267086235] [2025-02-06 19:12:42,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 19:12:42,742 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:12:42,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:42,742 INFO L85 PathProgramCache]: Analyzing trace with hash 41, now seen corresponding path program 1 times [2025-02-06 19:12:42,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:42,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510906138] [2025-02-06 19:12:42,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:12:42,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:42,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:12:42,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:12:42,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:42,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:42,751 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:12:42,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:12:42,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:12:42,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:42,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:42,760 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:12:42,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:12:42,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 19:12:42,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 19:12:42,861 INFO L87 Difference]: Start difference. First operand 5 states and 7 transitions. cyclomatic complexity: 4 Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:42,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:12:42,869 INFO L93 Difference]: Finished difference Result 6 states and 7 transitions. [2025-02-06 19:12:42,869 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6 states and 7 transitions. [2025-02-06 19:12:42,870 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-02-06 19:12:42,870 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6 states to 6 states and 7 transitions. [2025-02-06 19:12:42,870 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2025-02-06 19:12:42,870 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2025-02-06 19:12:42,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 7 transitions. [2025-02-06 19:12:42,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:12:42,871 INFO L218 hiAutomatonCegarLoop]: Abstraction has 6 states and 7 transitions. [2025-02-06 19:12:42,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states and 7 transitions. [2025-02-06 19:12:42,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 5. [2025-02-06 19:12:42,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:42,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 6 transitions. [2025-02-06 19:12:42,871 INFO L240 hiAutomatonCegarLoop]: Abstraction has 5 states and 6 transitions. [2025-02-06 19:12:42,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 19:12:42,872 INFO L432 stractBuchiCegarLoop]: Abstraction has 5 states and 6 transitions. [2025-02-06 19:12:42,872 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-02-06 19:12:42,872 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 6 transitions. [2025-02-06 19:12:42,873 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-02-06 19:12:42,873 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:12:42,873 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:12:42,873 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-02-06 19:12:42,873 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-06 19:12:42,873 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(39, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem8#1, main_~#in~0#1.base, main_~#in~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~c~0#1, main_~i~0#1, main_~j~0#1, main_~idx_in~0#1;call main_~#in~0#1.base, main_~#in~0#1.offset := #Ultimate.allocOnStack(11);havoc main_~s~0#1.base, main_~s~0#1.offset;havoc main_~c~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~idx_in~0#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 11;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < 11);call write~int#1(0, main_~#in~0#1.base, 10 + main_~#in~0#1.offset, 1);main_~idx_in~0#1 := 0;main_~s~0#1.base, main_~s~0#1.offset := main_~#in~0#1.base, main_~#in~0#1.offset;main_~i~0#1 := 0;call main_#t~mem6#1 := read~int#1(main_~#in~0#1.base, main_~#in~0#1.offset + main_~idx_in~0#1, 1);main_~c~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1;" [2025-02-06 19:12:42,873 INFO L754 eck$LassoCheckResult]: Loop: "assume 48 <= (if main_~c~0#1 % 256 % 4294967296 <= 2147483647 then main_~c~0#1 % 256 % 4294967296 else main_~c~0#1 % 256 % 4294967296 - 4294967296) && (if main_~c~0#1 % 256 % 4294967296 <= 2147483647 then main_~c~0#1 % 256 % 4294967296 else main_~c~0#1 % 256 % 4294967296 - 4294967296) <= 57;main_~j~0#1 := (if main_~c~0#1 % 256 % 4294967296 <= 2147483647 then main_~c~0#1 % 256 % 4294967296 else main_~c~0#1 % 256 % 4294967296 - 4294967296) - 48;main_~i~0#1 := (if (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 else (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 - 4294967296);main_#t~post7#1 := main_~idx_in~0#1;main_~idx_in~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;call main_#t~mem8#1 := read~int#1(main_~#in~0#1.base, main_~#in~0#1.offset + main_~idx_in~0#1, 1);main_~c~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;" [2025-02-06 19:12:42,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:42,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1353471, now seen corresponding path program 1 times [2025-02-06 19:12:42,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:42,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173639736] [2025-02-06 19:12:42,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:12:42,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:42,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:12:42,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:12:42,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:42,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:42,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:12:42,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:12:42,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173639736] [2025-02-06 19:12:42,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173639736] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:12:42,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143240730] [2025-02-06 19:12:42,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:12:42,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:12:42,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:42,921 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:12:42,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-06 19:12:42,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 19:12:42,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 19:12:42,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:42,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:42,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 19:12:42,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:12:42,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:12:42,982 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:12:42,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:12:42,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143240730] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:12:42,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:12:42,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-02-06 19:12:42,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308613652] [2025-02-06 19:12:42,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:12:42,995 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:12:42,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:42,996 INFO L85 PathProgramCache]: Analyzing trace with hash 41, now seen corresponding path program 2 times [2025-02-06 19:12:42,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:42,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456087000] [2025-02-06 19:12:42,996 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:12:42,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:42,999 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:12:43,003 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:12:43,003 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:12:43,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:43,003 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:12:43,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:12:43,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:12:43,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:43,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:43,009 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:12:43,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:12:43,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 19:12:43,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 19:12:43,089 INFO L87 Difference]: Start difference. First operand 5 states and 6 transitions. cyclomatic complexity: 3 Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:43,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:12:43,104 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2025-02-06 19:12:43,104 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 11 transitions. [2025-02-06 19:12:43,104 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-02-06 19:12:43,104 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 11 transitions. [2025-02-06 19:12:43,105 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2025-02-06 19:12:43,105 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2025-02-06 19:12:43,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 11 transitions. [2025-02-06 19:12:43,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:12:43,105 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 11 transitions. [2025-02-06 19:12:43,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 11 transitions. [2025-02-06 19:12:43,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 8. [2025-02-06 19:12:43,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.125) internal successors, (9), 7 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:43,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2025-02-06 19:12:43,106 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8 states and 9 transitions. [2025-02-06 19:12:43,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 19:12:43,106 INFO L432 stractBuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2025-02-06 19:12:43,106 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-02-06 19:12:43,107 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 9 transitions. [2025-02-06 19:12:43,107 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-02-06 19:12:43,107 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:12:43,107 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:12:43,107 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 1, 1, 1] [2025-02-06 19:12:43,107 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-06 19:12:43,107 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(39, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem8#1, main_~#in~0#1.base, main_~#in~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~c~0#1, main_~i~0#1, main_~j~0#1, main_~idx_in~0#1;call main_~#in~0#1.base, main_~#in~0#1.offset := #Ultimate.allocOnStack(11);havoc main_~s~0#1.base, main_~s~0#1.offset;havoc main_~c~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~idx_in~0#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 11;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 11;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 11;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 11;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < 11);call write~int#1(0, main_~#in~0#1.base, 10 + main_~#in~0#1.offset, 1);main_~idx_in~0#1 := 0;main_~s~0#1.base, main_~s~0#1.offset := main_~#in~0#1.base, main_~#in~0#1.offset;main_~i~0#1 := 0;call main_#t~mem6#1 := read~int#1(main_~#in~0#1.base, main_~#in~0#1.offset + main_~idx_in~0#1, 1);main_~c~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1;" [2025-02-06 19:12:43,107 INFO L754 eck$LassoCheckResult]: Loop: "assume 48 <= (if main_~c~0#1 % 256 % 4294967296 <= 2147483647 then main_~c~0#1 % 256 % 4294967296 else main_~c~0#1 % 256 % 4294967296 - 4294967296) && (if main_~c~0#1 % 256 % 4294967296 <= 2147483647 then main_~c~0#1 % 256 % 4294967296 else main_~c~0#1 % 256 % 4294967296 - 4294967296) <= 57;main_~j~0#1 := (if main_~c~0#1 % 256 % 4294967296 <= 2147483647 then main_~c~0#1 % 256 % 4294967296 else main_~c~0#1 % 256 % 4294967296 - 4294967296) - 48;main_~i~0#1 := (if (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 else (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 - 4294967296);main_#t~post7#1 := main_~idx_in~0#1;main_~idx_in~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;call main_#t~mem8#1 := read~int#1(main_~#in~0#1.base, main_~#in~0#1.offset + main_~idx_in~0#1, 1);main_~c~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;" [2025-02-06 19:12:43,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:43,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1666590603, now seen corresponding path program 2 times [2025-02-06 19:12:43,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:43,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924450854] [2025-02-06 19:12:43,108 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:12:43,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:43,113 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 2 equivalence classes. [2025-02-06 19:12:43,120 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:12:43,120 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:12:43,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:43,191 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:12:43,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:12:43,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924450854] [2025-02-06 19:12:43,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924450854] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:12:43,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636746568] [2025-02-06 19:12:43,191 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 19:12:43,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:12:43,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:43,197 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:12:43,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-06 19:12:43,225 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 7 statements into 2 equivalence classes. [2025-02-06 19:12:43,238 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 19:12:43,239 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 19:12:43,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:43,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 19:12:43,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:12:43,253 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:12:43,253 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:12:43,294 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:12:43,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636746568] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:12:43,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:12:43,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-02-06 19:12:43,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757234131] [2025-02-06 19:12:43,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:12:43,295 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:12:43,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:43,295 INFO L85 PathProgramCache]: Analyzing trace with hash 41, now seen corresponding path program 3 times [2025-02-06 19:12:43,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:43,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982601146] [2025-02-06 19:12:43,295 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:12:43,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:43,298 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:12:43,302 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:12:43,302 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-02-06 19:12:43,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:43,302 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:12:43,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:12:43,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:12:43,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:43,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:43,307 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:12:43,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:12:43,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 19:12:43,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-02-06 19:12:43,378 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. cyclomatic complexity: 3 Second operand has 13 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:43,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:12:43,397 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2025-02-06 19:12:43,398 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 17 transitions. [2025-02-06 19:12:43,398 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-02-06 19:12:43,398 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 17 transitions. [2025-02-06 19:12:43,398 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2025-02-06 19:12:43,398 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2025-02-06 19:12:43,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 17 transitions. [2025-02-06 19:12:43,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:12:43,399 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 17 transitions. [2025-02-06 19:12:43,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 17 transitions. [2025-02-06 19:12:43,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2025-02-06 19:12:43,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:43,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2025-02-06 19:12:43,401 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 15 transitions. [2025-02-06 19:12:43,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 19:12:43,402 INFO L432 stractBuchiCegarLoop]: Abstraction has 14 states and 15 transitions. [2025-02-06 19:12:43,402 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-02-06 19:12:43,402 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 15 transitions. [2025-02-06 19:12:43,404 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-02-06 19:12:43,404 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:12:43,404 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:12:43,405 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 1, 1, 1] [2025-02-06 19:12:43,405 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-06 19:12:43,405 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(39, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem8#1, main_~#in~0#1.base, main_~#in~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~c~0#1, main_~i~0#1, main_~j~0#1, main_~idx_in~0#1;call main_~#in~0#1.base, main_~#in~0#1.offset := #Ultimate.allocOnStack(11);havoc main_~s~0#1.base, main_~s~0#1.offset;havoc main_~c~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~idx_in~0#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 11;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 11;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 11;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 11;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 11;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 11;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 11;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 11;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 11;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 11;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < 11);call write~int#1(0, main_~#in~0#1.base, 10 + main_~#in~0#1.offset, 1);main_~idx_in~0#1 := 0;main_~s~0#1.base, main_~s~0#1.offset := main_~#in~0#1.base, main_~#in~0#1.offset;main_~i~0#1 := 0;call main_#t~mem6#1 := read~int#1(main_~#in~0#1.base, main_~#in~0#1.offset + main_~idx_in~0#1, 1);main_~c~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1;" [2025-02-06 19:12:43,405 INFO L754 eck$LassoCheckResult]: Loop: "assume 48 <= (if main_~c~0#1 % 256 % 4294967296 <= 2147483647 then main_~c~0#1 % 256 % 4294967296 else main_~c~0#1 % 256 % 4294967296 - 4294967296) && (if main_~c~0#1 % 256 % 4294967296 <= 2147483647 then main_~c~0#1 % 256 % 4294967296 else main_~c~0#1 % 256 % 4294967296 - 4294967296) <= 57;main_~j~0#1 := (if main_~c~0#1 % 256 % 4294967296 <= 2147483647 then main_~c~0#1 % 256 % 4294967296 else main_~c~0#1 % 256 % 4294967296 - 4294967296) - 48;main_~i~0#1 := (if (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 else (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 - 4294967296);main_#t~post7#1 := main_~idx_in~0#1;main_~idx_in~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;call main_#t~mem8#1 := read~int#1(main_~#in~0#1.base, main_~#in~0#1.offset + main_~idx_in~0#1, 1);main_~c~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;" [2025-02-06 19:12:43,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:43,405 INFO L85 PathProgramCache]: Analyzing trace with hash 552481547, now seen corresponding path program 3 times [2025-02-06 19:12:43,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:43,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842533449] [2025-02-06 19:12:43,406 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:12:43,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:43,415 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 13 statements into 6 equivalence classes. [2025-02-06 19:12:43,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:43,471 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 19:12:43,471 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-02-06 19:12:43,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:43,663 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:12:43,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 19:12:43,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842533449] [2025-02-06 19:12:43,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842533449] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 19:12:43,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124105407] [2025-02-06 19:12:43,663 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 19:12:43,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 19:12:43,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:43,665 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 19:12:43,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-06 19:12:43,701 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 13 statements into 6 equivalence classes. [2025-02-06 19:12:43,730 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 19:12:43,730 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-02-06 19:12:43,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:43,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 19:12:43,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:12:43,761 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:12:43,761 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 19:12:43,833 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:12:43,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124105407] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 19:12:43,834 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 19:12:43,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 14 [2025-02-06 19:12:43,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864784557] [2025-02-06 19:12:43,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 19:12:43,834 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-02-06 19:12:43,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:43,834 INFO L85 PathProgramCache]: Analyzing trace with hash 41, now seen corresponding path program 4 times [2025-02-06 19:12:43,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:43,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163616104] [2025-02-06 19:12:43,834 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:12:43,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:43,837 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 1 statements into 2 equivalence classes. [2025-02-06 19:12:43,840 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:12:43,840 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 19:12:43,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:43,840 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:12:43,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:12:43,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:12:43,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:43,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:43,844 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:12:43,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 19:12:43,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 19:12:43,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=106, Unknown=0, NotChecked=0, Total=210 [2025-02-06 19:12:43,914 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. cyclomatic complexity: 3 Second operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:43,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 19:12:43,933 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2025-02-06 19:12:43,933 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 18 transitions. [2025-02-06 19:12:43,933 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-02-06 19:12:43,934 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 18 transitions. [2025-02-06 19:12:43,934 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2025-02-06 19:12:43,934 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2025-02-06 19:12:43,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 18 transitions. [2025-02-06 19:12:43,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:12:43,934 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 18 transitions. [2025-02-06 19:12:43,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 18 transitions. [2025-02-06 19:12:43,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2025-02-06 19:12:43,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:43,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2025-02-06 19:12:43,935 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 16 transitions. [2025-02-06 19:12:43,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 19:12:43,935 INFO L432 stractBuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2025-02-06 19:12:43,935 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-02-06 19:12:43,936 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2025-02-06 19:12:43,936 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-02-06 19:12:43,936 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-02-06 19:12:43,936 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-02-06 19:12:43,936 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [11, 1, 1, 1] [2025-02-06 19:12:43,936 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-02-06 19:12:43,936 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(39, 2);call #Ultimate.allocInit(12, 3);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post5#1, main_#t~mem6#1, main_#t~post7#1, main_#t~mem8#1, main_~#in~0#1.base, main_~#in~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~c~0#1, main_~i~0#1, main_~j~0#1, main_~idx_in~0#1;call main_~#in~0#1.base, main_~#in~0#1.offset := #Ultimate.allocOnStack(11);havoc main_~s~0#1.base, main_~s~0#1.offset;havoc main_~c~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~idx_in~0#1;main_~i~0#1 := 0;" "assume main_~i~0#1 < 11;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 11;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 11;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 11;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 11;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 11;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 11;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 11;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 11;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 11;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume main_~i~0#1 < 11;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~#in~0#1.base, main_~#in~0#1.offset + main_~i~0#1, 1);main_#t~post5#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;" "assume !(main_~i~0#1 < 11);call write~int#1(0, main_~#in~0#1.base, 10 + main_~#in~0#1.offset, 1);main_~idx_in~0#1 := 0;main_~s~0#1.base, main_~s~0#1.offset := main_~#in~0#1.base, main_~#in~0#1.offset;main_~i~0#1 := 0;call main_#t~mem6#1 := read~int#1(main_~#in~0#1.base, main_~#in~0#1.offset + main_~idx_in~0#1, 1);main_~c~0#1 := main_#t~mem6#1;havoc main_#t~mem6#1;" [2025-02-06 19:12:43,936 INFO L754 eck$LassoCheckResult]: Loop: "assume 48 <= (if main_~c~0#1 % 256 % 4294967296 <= 2147483647 then main_~c~0#1 % 256 % 4294967296 else main_~c~0#1 % 256 % 4294967296 - 4294967296) && (if main_~c~0#1 % 256 % 4294967296 <= 2147483647 then main_~c~0#1 % 256 % 4294967296 else main_~c~0#1 % 256 % 4294967296 - 4294967296) <= 57;main_~j~0#1 := (if main_~c~0#1 % 256 % 4294967296 <= 2147483647 then main_~c~0#1 % 256 % 4294967296 else main_~c~0#1 % 256 % 4294967296 - 4294967296) - 48;main_~i~0#1 := (if (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 <= 2147483647 then (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 else (10 * main_~i~0#1 + main_~j~0#1) % 4294967296 % 4294967296 - 4294967296);main_#t~post7#1 := main_~idx_in~0#1;main_~idx_in~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1;call main_#t~mem8#1 := read~int#1(main_~#in~0#1.base, main_~#in~0#1.offset + main_~idx_in~0#1, 1);main_~c~0#1 := main_#t~mem8#1;havoc main_#t~mem8#1;" [2025-02-06 19:12:43,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:43,937 INFO L85 PathProgramCache]: Analyzing trace with hash -52941185, now seen corresponding path program 4 times [2025-02-06 19:12:43,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:43,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124483580] [2025-02-06 19:12:43,937 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 19:12:43,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:43,944 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 14 statements into 2 equivalence classes. [2025-02-06 19:12:43,953 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 19:12:43,953 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-06 19:12:43,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:43,953 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:12:43,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 19:12:43,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 19:12:43,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:43,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:43,966 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:12:43,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:43,966 INFO L85 PathProgramCache]: Analyzing trace with hash 41, now seen corresponding path program 5 times [2025-02-06 19:12:43,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:43,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034659928] [2025-02-06 19:12:43,966 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 19:12:43,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:43,969 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:12:43,971 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:12:43,971 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 19:12:43,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:43,971 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:12:43,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:12:43,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:12:43,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:43,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:43,975 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:12:43,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:43,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1641176725, now seen corresponding path program 1 times [2025-02-06 19:12:43,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 19:12:43,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003626881] [2025-02-06 19:12:43,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 19:12:43,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 19:12:43,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 19:12:43,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 19:12:43,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:43,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:43,997 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-06 19:12:43,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-06 19:12:44,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-06 19:12:44,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:44,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-06 19:12:44,014 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-06 19:12:50,715 WARN L286 SmtUtils]: Spent 6.63s on a formula simplification. DAG size of input: 234 DAG size of output: 180 (called from [L 276] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2025-02-06 19:12:51,422 INFO L204 LassoAnalysis]: Preferences: [2025-02-06 19:12:51,422 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-02-06 19:12:51,422 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-02-06 19:12:51,422 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-02-06 19:12:51,422 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-02-06 19:12:51,422 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:51,422 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-02-06 19:12:51,422 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-02-06 19:12:51,422 INFO L132 ssoRankerPreferences]: Filename of dumped script: verisec_sendmail_tTflag_arr_one_loop.c_Iteration6_Lasso [2025-02-06 19:12:51,422 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-02-06 19:12:51,422 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-02-06 19:12:51,424 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:51,427 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:51,429 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:51,438 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:51,439 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:51,441 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:51,442 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:51,942 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:51,945 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:51,946 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:51,948 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-02-06 19:12:52,290 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-02-06 19:12:52,290 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-02-06 19:12:52,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:52,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:52,293 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:52,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-02-06 19:12:52,296 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-02-06 19:12:52,306 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:52,307 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:52,307 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:52,307 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:52,307 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:12:52,307 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:12:52,308 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:52,310 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:52,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:52,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:52,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:52,320 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:52,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-02-06 19:12:52,322 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-02-06 19:12:52,332 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:52,332 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:52,333 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:52,333 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:52,333 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:12:52,333 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:12:52,333 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:52,334 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:52,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-02-06 19:12:52,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:52,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:52,347 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:52,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-02-06 19:12:52,351 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-02-06 19:12:52,362 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:52,362 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:52,362 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:52,362 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:12:52,364 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:12:52,364 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:12:52,366 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:52,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:52,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:52,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:52,380 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:52,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-02-06 19:12:52,382 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-02-06 19:12:52,392 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:52,392 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:52,392 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:52,392 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:12:52,393 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:12:52,393 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:12:52,397 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:52,403 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-02-06 19:12:52,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:52,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:52,406 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:52,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-02-06 19:12:52,408 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-02-06 19:12:52,418 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:52,419 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:52,419 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:52,419 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:52,419 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:12:52,419 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:12:52,419 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:52,422 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:52,430 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:52,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:52,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:52,435 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:52,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-02-06 19:12:52,439 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-02-06 19:12:52,449 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:52,449 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:52,449 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:52,449 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:52,449 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:12:52,450 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:12:52,450 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:52,451 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:52,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:52,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:52,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:52,459 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:52,461 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-02-06 19:12:52,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-02-06 19:12:52,471 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:52,471 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:52,471 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:52,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:52,471 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:12:52,471 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:12:52,472 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:52,473 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:52,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:52,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:52,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:52,487 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:52,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-02-06 19:12:52,489 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-02-06 19:12:52,500 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:52,500 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:52,500 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:52,500 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:12:52,502 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:12:52,502 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:12:52,505 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:52,510 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:52,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:52,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:52,513 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:52,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-02-06 19:12:52,515 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-02-06 19:12:52,525 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:52,525 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:52,525 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:52,525 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:12:52,527 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:12:52,527 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:12:52,530 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:52,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:52,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:52,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:52,539 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:52,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-02-06 19:12:52,542 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-02-06 19:12:52,551 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:52,551 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-02-06 19:12:52,551 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:52,552 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:52,552 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:12:52,552 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-02-06 19:12:52,552 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-02-06 19:12:52,553 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:52,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:52,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:52,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:52,561 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:52,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-02-06 19:12:52,563 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-02-06 19:12:52,575 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:52,575 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:52,575 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:52,575 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:12:52,577 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:12:52,577 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:12:52,579 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-02-06 19:12:52,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-02-06 19:12:52,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:52,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:52,591 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:52,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-02-06 19:12:52,593 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-02-06 19:12:52,603 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-02-06 19:12:52,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-02-06 19:12:52,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-02-06 19:12:52,604 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-02-06 19:12:52,613 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-02-06 19:12:52,613 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-02-06 19:12:52,623 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-02-06 19:12:52,640 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-02-06 19:12:52,640 INFO L444 ModelExtractionUtils]: 4 out of 13 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-02-06 19:12:52,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-02-06 19:12:52,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 19:12:52,643 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-02-06 19:12:52,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-02-06 19:12:52,646 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-02-06 19:12:52,656 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-02-06 19:12:52,657 INFO L474 LassoAnalysis]: Proved termination. [2025-02-06 19:12:52,657 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~idx_in~0#1, v_rep(select #length ULTIMATE.start_main_~#in~0#1.base)_2) = -1*ULTIMATE.start_main_~idx_in~0#1 + 1*v_rep(select #length ULTIMATE.start_main_~#in~0#1.base)_2 Supporting invariants [1*ULTIMATE.start_main_~#in~0#1.offset >= 0] [2025-02-06 19:12:52,662 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-02-06 19:12:52,677 INFO L156 tatePredicateManager]: 5 out of 6 supporting invariants were superfluous and have been removed [2025-02-06 19:12:52,682 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2025-02-06 19:12:52,682 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2025-02-06 19:12:52,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 19:12:52,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 19:12:52,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 19:12:52,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:52,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:52,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-06 19:12:52,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:12:52,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-02-06 19:12:52,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-02-06 19:12:52,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 19:12:52,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 19:12:52,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 19:12:52,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 19:12:52,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 19:12:52,809 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2025-02-06 19:12:52,809 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states and 16 transitions. cyclomatic complexity: 3 Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:52,830 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states and 16 transitions. cyclomatic complexity: 3. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 16 states and 17 transitions. Complement of second has 3 states. [2025-02-06 19:12:52,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2025-02-06 19:12:52,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 19:12:52,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2025-02-06 19:12:52,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 14 letters. Loop has 1 letters. [2025-02-06 19:12:52,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:12:52,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 15 letters. Loop has 1 letters. [2025-02-06 19:12:52,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:12:52,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 14 letters. Loop has 2 letters. [2025-02-06 19:12:52,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-02-06 19:12:52,832 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 17 transitions. [2025-02-06 19:12:52,832 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-06 19:12:52,832 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 0 states and 0 transitions. [2025-02-06 19:12:52,832 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-02-06 19:12:52,832 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-02-06 19:12:52,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-02-06 19:12:52,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-02-06 19:12:52,832 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 19:12:52,832 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 19:12:52,832 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 19:12:52,832 INFO L338 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-02-06 19:12:52,832 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-02-06 19:12:52,832 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-02-06 19:12:52,832 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-02-06 19:12:52,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 06.02 07:12:52 BoogieIcfgContainer [2025-02-06 19:12:52,837 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-02-06 19:12:52,838 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 19:12:52,838 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 19:12:52,838 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 19:12:52,839 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 07:12:41" (3/4) ... [2025-02-06 19:12:52,840 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-02-06 19:12:52,840 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 19:12:52,841 INFO L158 Benchmark]: Toolchain (without parser) took 11853.81ms. Allocated memory is still 201.3MB. Free memory was 159.5MB in the beginning and 108.9MB in the end (delta: 50.6MB). Peak memory consumption was 53.4MB. Max. memory is 16.1GB. [2025-02-06 19:12:52,841 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 117.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 19:12:52,841 INFO L158 Benchmark]: CACSL2BoogieTranslator took 141.60ms. Allocated memory is still 201.3MB. Free memory was 159.5MB in the beginning and 148.7MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 19:12:52,841 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.82ms. Allocated memory is still 201.3MB. Free memory was 148.7MB in the beginning and 147.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 19:12:52,841 INFO L158 Benchmark]: Boogie Preprocessor took 18.91ms. Allocated memory is still 201.3MB. Free memory was 147.5MB in the beginning and 146.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 19:12:52,842 INFO L158 Benchmark]: IcfgBuilder took 194.58ms. Allocated memory is still 201.3MB. Free memory was 146.1MB in the beginning and 134.0MB in the end (delta: 12.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 19:12:52,842 INFO L158 Benchmark]: BuchiAutomizer took 11474.53ms. Allocated memory is still 201.3MB. Free memory was 133.7MB in the beginning and 108.9MB in the end (delta: 24.8MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. [2025-02-06 19:12:52,842 INFO L158 Benchmark]: Witness Printer took 2.50ms. Allocated memory is still 201.3MB. Free memory was 108.9MB in the beginning and 108.9MB in the end (delta: 36.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 19:12:52,843 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 117.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 141.60ms. Allocated memory is still 201.3MB. Free memory was 159.5MB in the beginning and 148.7MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 17.82ms. Allocated memory is still 201.3MB. Free memory was 148.7MB in the beginning and 147.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 18.91ms. Allocated memory is still 201.3MB. Free memory was 147.5MB in the beginning and 146.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 194.58ms. Allocated memory is still 201.3MB. Free memory was 146.1MB in the beginning and 134.0MB in the end (delta: 12.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 11474.53ms. Allocated memory is still 201.3MB. Free memory was 133.7MB in the beginning and 108.9MB in the end (delta: 24.8MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. * Witness Printer took 2.50ms. Allocated memory is still 201.3MB. Free memory was 108.9MB in the beginning and 108.9MB in the end (delta: 36.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #length - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (4 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function null and consists of 2 locations. One deterministic module has affine ranking function null and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 15 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 11.4s and 7 iterations. TraceHistogramMax:11. Analysis of lassos took 11.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 8 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7 mSDsluCounter, 25 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 55 IncrementalHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 16 mSDtfsCounter, 55 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU4 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital220 mio100 ax100 hnf100 lsp100 ukn60 mio100 lsp41 div131 bol100 ite100 ukn100 eq157 hnf93 smp77 dnf193 smp75 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 28ms 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.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-02-06 19:12:52,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:53,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:53,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-02-06 19:12:53,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-02-06 19:12:53,663 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE