./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-dietlibc/strrchr.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-dietlibc/strrchr.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 64bit --witnessprinter.graph.data.programhash b850f5453e922b3972aa9b5b79a1b07337c08d581cc5e6a2a56803408dc479cf --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 08:06:21,577 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 08:06:21,621 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-17 08:06:21,625 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 08:06:21,625 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 08:06:21,625 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2024-11-17 08:06:21,649 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 08:06:21,650 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 08:06:21,650 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 08:06:21,653 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 08:06:21,653 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 08:06:21,654 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 08:06:21,654 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 08:06:21,654 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 08:06:21,655 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-17 08:06:21,655 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-17 08:06:21,656 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-17 08:06:21,656 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-17 08:06:21,656 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-17 08:06:21,656 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-17 08:06:21,657 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 08:06:21,657 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-17 08:06:21,657 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 08:06:21,657 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 08:06:21,657 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-17 08:06:21,658 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-17 08:06:21,658 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-17 08:06:21,658 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 08:06:21,658 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 08:06:21,658 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 08:06:21,659 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-17 08:06:21,659 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 08:06:21,659 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 08:06:21,659 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 08:06:21,660 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 08:06:21,660 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 08:06:21,660 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-17 08:06:21,660 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b850f5453e922b3972aa9b5b79a1b07337c08d581cc5e6a2a56803408dc479cf [2024-11-17 08:06:21,850 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 08:06:21,870 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 08:06:21,873 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 08:06:21,874 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 08:06:21,875 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 08:06:21,876 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-dietlibc/strrchr.i [2024-11-17 08:06:23,109 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 08:06:23,289 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 08:06:23,290 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-dietlibc/strrchr.i [2024-11-17 08:06:23,302 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0da957894/6913af7bf92e47b599b3c6cf74300123/FLAGb5c61706a [2024-11-17 08:06:23,313 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0da957894/6913af7bf92e47b599b3c6cf74300123 [2024-11-17 08:06:23,319 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 08:06:23,320 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 08:06:23,324 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 08:06:23,325 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 08:06:23,331 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 08:06:23,332 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 08:06:23" (1/1) ... [2024-11-17 08:06:23,332 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ce23e41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:06:23, skipping insertion in model container [2024-11-17 08:06:23,332 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 08:06:23" (1/1) ... [2024-11-17 08:06:23,360 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 08:06:23,612 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 08:06:23,620 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 08:06:23,649 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 08:06:23,676 INFO L204 MainTranslator]: Completed translation [2024-11-17 08:06:23,677 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:06:23 WrapperNode [2024-11-17 08:06:23,677 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 08:06:23,678 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 08:06:23,678 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 08:06:23,678 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 08:06:23,683 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:06:23" (1/1) ... [2024-11-17 08:06:23,695 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:06:23" (1/1) ... [2024-11-17 08:06:23,713 INFO L138 Inliner]: procedures = 114, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 100 [2024-11-17 08:06:23,713 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 08:06:23,714 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 08:06:23,714 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 08:06:23,714 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 08:06:23,721 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:06:23" (1/1) ... [2024-11-17 08:06:23,721 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:06:23" (1/1) ... [2024-11-17 08:06:23,724 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:06:23" (1/1) ... [2024-11-17 08:06:23,738 INFO L175 MemorySlicer]: Split 10 memory accesses to 1 slices as follows [10]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 2 writes are split as follows [2]. [2024-11-17 08:06:23,738 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:06:23" (1/1) ... [2024-11-17 08:06:23,738 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:06:23" (1/1) ... [2024-11-17 08:06:23,742 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:06:23" (1/1) ... [2024-11-17 08:06:23,742 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:06:23" (1/1) ... [2024-11-17 08:06:23,743 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:06:23" (1/1) ... [2024-11-17 08:06:23,743 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:06:23" (1/1) ... [2024-11-17 08:06:23,745 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 08:06:23,745 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 08:06:23,746 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 08:06:23,746 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 08:06:23,746 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:06:23" (1/1) ... [2024-11-17 08:06:23,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:06:23,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:06:23,772 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:06:23,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-17 08:06:23,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-17 08:06:23,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-17 08:06:23,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-17 08:06:23,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 08:06:23,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 08:06:23,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 08:06:23,870 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 08:06:23,871 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 08:06:23,987 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L529: havoc main_#t~ret19#1.base, main_#t~ret19#1.offset;call ULTIMATE.dealloc(main_#t~malloc15#1.base, main_#t~malloc15#1.offset);havoc main_#t~malloc15#1.base, main_#t~malloc15#1.offset; [2024-11-17 08:06:23,998 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-11-17 08:06:24,002 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 08:06:24,012 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 08:06:24,012 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 08:06:24,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:06:24 BoogieIcfgContainer [2024-11-17 08:06:24,013 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 08:06:24,014 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-17 08:06:24,014 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-17 08:06:24,016 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-17 08:06:24,018 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:06:24,019 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.11 08:06:23" (1/3) ... [2024-11-17 08:06:24,020 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1dce721e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.11 08:06:24, skipping insertion in model container [2024-11-17 08:06:24,020 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:06:24,020 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:06:23" (2/3) ... [2024-11-17 08:06:24,020 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1dce721e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.11 08:06:24, skipping insertion in model container [2024-11-17 08:06:24,020 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:06:24,021 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:06:24" (3/3) ... [2024-11-17 08:06:24,022 INFO L332 chiAutomizerObserver]: Analyzing ICFG strrchr.i [2024-11-17 08:06:24,065 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-17 08:06:24,066 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-17 08:06:24,066 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-17 08:06:24,066 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-17 08:06:24,066 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-17 08:06:24,066 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-17 08:06:24,066 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-17 08:06:24,066 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-17 08:06:24,069 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 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) [2024-11-17 08:06:24,081 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2024-11-17 08:06:24,081 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:06:24,081 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:06:24,085 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-17 08:06:24,085 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-17 08:06:24,085 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-17 08:06:24,085 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 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) [2024-11-17 08:06:24,086 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2024-11-17 08:06:24,086 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:06:24,086 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:06:24,087 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-17 08:06:24,087 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-11-17 08:06:24,090 INFO L745 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 19#ULTIMATE.init_returnLabel#1true assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~nondet16#1, main_#t~post17#1, main_~i~0#1, main_#t~nondet18#1, main_#t~ret19#1.base, main_#t~ret19#1.offset, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset, main_~the_int~0#1;havoc main_#t~nondet14#1;main_~in_len~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 23#L521-1true assume !(main_~in_len~0#1 < 1);call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;main_~i~0#1 := 0; 17#L523-1true [2024-11-17 08:06:24,090 INFO L747 eck$LassoCheckResult]: Loop: 17#L523-1true assume true; 22#L523-2true assume !!(main_~i~0#1 < main_~in_len~0#1 - 1);havoc main_#t~nondet16#1;call write~int#0(main_#t~nondet16#1, main_~in~0#1.base, main_~in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1;main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; 17#L523-1true [2024-11-17 08:06:24,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:06:24,094 INFO L85 PathProgramCache]: Analyzing trace with hash 82387, now seen corresponding path program 1 times [2024-11-17 08:06:24,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:06:24,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473862680] [2024-11-17 08:06:24,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:06:24,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:06:24,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:06:24,185 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:06:24,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:06:24,208 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:06:24,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:06:24,210 INFO L85 PathProgramCache]: Analyzing trace with hash 2400, now seen corresponding path program 1 times [2024-11-17 08:06:24,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:06:24,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982257614] [2024-11-17 08:06:24,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:06:24,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:06:24,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:06:24,220 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:06:24,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:06:24,230 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:06:24,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:06:24,232 INFO L85 PathProgramCache]: Analyzing trace with hash 79175346, now seen corresponding path program 1 times [2024-11-17 08:06:24,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:06:24,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454977911] [2024-11-17 08:06:24,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:06:24,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:06:24,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:06:24,254 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:06:24,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:06:24,268 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:06:24,455 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:06:24,455 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:06:24,456 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:06:24,456 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:06:24,456 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:06:24,456 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:06:24,456 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:06:24,456 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:06:24,456 INFO L132 ssoRankerPreferences]: Filename of dumped script: strrchr.i_Iteration1_Lasso [2024-11-17 08:06:24,456 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:06:24,457 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:06:24,490 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:24,512 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:24,514 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:24,517 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:24,518 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:24,520 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:24,635 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:24,637 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:24,640 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:24,642 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:24,819 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:06:24,822 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:06:24,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:06:24,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:06:24,825 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:06:24,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-17 08:06:24,828 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 [2024-11-17 08:06:24,838 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:06:24,839 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:06:24,839 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:06:24,839 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:06:24,839 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:06:24,841 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:06:24,841 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:06:24,842 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:06:24,853 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-11-17 08:06:24,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:06:24,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:06:24,856 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:06:24,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-17 08:06:24,858 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 [2024-11-17 08:06:24,869 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:06:24,869 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:06:24,869 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:06:24,870 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:06:24,870 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:06:24,870 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:06:24,870 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:06:24,871 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:06:24,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-11-17 08:06:24,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:06:24,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:06:24,883 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:06:24,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-17 08:06:24,888 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 [2024-11-17 08:06:24,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:06:24,898 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:06:24,898 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:06:24,898 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:06:24,898 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:06:24,899 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:06:24,899 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:06:24,900 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:06:24,913 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-11-17 08:06:24,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:06:24,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:06:24,915 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:06:24,917 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-17 08:06:24,918 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 [2024-11-17 08:06:24,928 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:06:24,928 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:06:24,928 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:06:24,928 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:06:24,928 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:06:24,930 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:06:24,930 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:06:24,931 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:06:24,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-11-17 08:06:24,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:06:24,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:06:24,945 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:06:24,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-17 08:06:24,947 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 [2024-11-17 08:06:24,957 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:06:24,957 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:06:24,957 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:06:24,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:06:24,957 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:06:24,958 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:06:24,958 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:06:24,959 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:06:24,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-11-17 08:06:24,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:06:24,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:06:24,971 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:06:24,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-17 08:06:24,973 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 [2024-11-17 08:06:24,982 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:06:24,983 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:06:24,983 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:06:24,983 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:06:24,988 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:06:24,988 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:06:24,993 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:06:25,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-11-17 08:06:25,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:06:25,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:06:25,005 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:06:25,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-17 08:06:25,007 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 [2024-11-17 08:06:25,016 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:06:25,017 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:06:25,017 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:06:25,017 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:06:25,017 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:06:25,017 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:06:25,017 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:06:25,019 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:06:25,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-11-17 08:06:25,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:06:25,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:06:25,030 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:06:25,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-17 08:06:25,032 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 [2024-11-17 08:06:25,043 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:06:25,043 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:06:25,043 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:06:25,043 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:06:25,047 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:06:25,048 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:06:25,050 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:06:25,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-11-17 08:06:25,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:06:25,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:06:25,066 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:06:25,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-11-17 08:06:25,068 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 [2024-11-17 08:06:25,079 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:06:25,079 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:06:25,079 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:06:25,079 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:06:25,086 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:06:25,086 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:06:25,091 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:06:25,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-11-17 08:06:25,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:06:25,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:06:25,109 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:06:25,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-11-17 08:06:25,113 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 [2024-11-17 08:06:25,122 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:06:25,123 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:06:25,123 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:06:25,123 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:06:25,129 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:06:25,129 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:06:25,138 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:06:25,169 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2024-11-17 08:06:25,169 INFO L444 ModelExtractionUtils]: 2 out of 19 variables were initially zero. Simplification set additionally 14 variables to zero. [2024-11-17 08:06:25,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:06:25,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:06:25,195 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:06:25,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-11-17 08:06:25,196 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:06:25,207 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-17 08:06:25,207 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:06:25,208 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~in_len~0#1) = -1*ULTIMATE.start_main_~i~0#1 + 1*ULTIMATE.start_main_~in_len~0#1 Supporting invariants [] [2024-11-17 08:06:25,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-11-17 08:06:25,232 INFO L156 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2024-11-17 08:06:25,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:06:25,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:06:25,263 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:06:25,263 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:06:25,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:06:25,274 INFO L255 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 08:06:25,275 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:06:25,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:06:25,297 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 [2024-11-17 08:06:25,298 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 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 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) [2024-11-17 08:06:25,323 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 24 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 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 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 48 states and 68 transitions. Complement of second has 6 states. [2024-11-17 08:06:25,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-17 08:06:25,329 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) [2024-11-17 08:06:25,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 36 transitions. [2024-11-17 08:06:25,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 3 letters. Loop has 2 letters. [2024-11-17 08:06:25,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:06:25,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 5 letters. Loop has 2 letters. [2024-11-17 08:06:25,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:06:25,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 36 transitions. Stem has 3 letters. Loop has 4 letters. [2024-11-17 08:06:25,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:06:25,333 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 68 transitions. [2024-11-17 08:06:25,336 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2024-11-17 08:06:25,339 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 21 states and 27 transitions. [2024-11-17 08:06:25,339 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2024-11-17 08:06:25,340 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2024-11-17 08:06:25,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 27 transitions. [2024-11-17 08:06:25,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:06:25,341 INFO L218 hiAutomatonCegarLoop]: Abstraction has 21 states and 27 transitions. [2024-11-17 08:06:25,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 27 transitions. [2024-11-17 08:06:25,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2024-11-17 08:06:25,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 20 states have internal predecessors, (27), 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) [2024-11-17 08:06:25,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2024-11-17 08:06:25,362 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 27 transitions. [2024-11-17 08:06:25,362 INFO L425 stractBuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2024-11-17 08:06:25,362 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-17 08:06:25,362 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. [2024-11-17 08:06:25,363 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2024-11-17 08:06:25,363 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:06:25,363 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:06:25,363 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-11-17 08:06:25,363 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:06:25,363 INFO L745 eck$LassoCheckResult]: Stem: 122#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 123#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~nondet16#1, main_#t~post17#1, main_~i~0#1, main_#t~nondet18#1, main_#t~ret19#1.base, main_#t~ret19#1.offset, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset, main_~the_int~0#1;havoc main_#t~nondet14#1;main_~in_len~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 141#L521-1 assume !(main_~in_len~0#1 < 1);call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;main_~i~0#1 := 0; 136#L523-1 assume true; 138#L523-2 assume !(main_~i~0#1 < main_~in_len~0#1 - 1); 142#L523 havoc main_~i~0#1;call write~int#0(0, main_~in~0#1.base, main_~in~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet18#1;main_~the_int~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume { :begin_inline_strrchr } true;strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1 := main_~in~0#1.base, main_~in~0#1.offset, main_~the_int~0#1;havoc strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_#t~mem5#1, strrchr_#t~mem6#1, strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset, strrchr_#t~mem8#1, strrchr_#t~mem9#1, strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset, strrchr_#t~mem11#1, strrchr_#t~mem12#1, strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_#in~t#1.base, strrchr_#in~t#1.offset;strrchr_~c#1 := strrchr_#in~c#1;havoc strrchr_~ch~0#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := 0, 0;strrchr_~ch~0#1 := (if strrchr_~c#1 % 256 <= 127 then strrchr_~c#1 % 256 else strrchr_~c#1 % 256 - 256); 124#L511 [2024-11-17 08:06:25,364 INFO L747 eck$LassoCheckResult]: Loop: 124#L511 assume true;call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 125#L512-4 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 126#L512-3 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 127#L512-2 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset;call strrchr_#t~mem5#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 128#L513-4 assume strrchr_#t~mem5#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem5#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 131#L513-3 call strrchr_#t~mem6#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 140#L513-2 assume !(0 == strrchr_#t~mem6#1);havoc strrchr_#t~mem6#1;strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset;call strrchr_#t~mem8#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 135#L514-4 assume strrchr_#t~mem8#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem8#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 133#L514-3 call strrchr_#t~mem9#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 134#L514-2 assume !(0 == strrchr_#t~mem9#1);havoc strrchr_#t~mem9#1;strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset;call strrchr_#t~mem11#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 132#L515-4 assume strrchr_#t~mem11#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem11#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 129#L515-3 call strrchr_#t~mem12#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 130#L515-2 assume !(0 == strrchr_#t~mem12#1);havoc strrchr_#t~mem12#1;strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset; 124#L511 [2024-11-17 08:06:25,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:06:25,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1840531592, now seen corresponding path program 1 times [2024-11-17 08:06:25,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:06:25,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632079921] [2024-11-17 08:06:25,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:06:25,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:06:25,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:06:25,386 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:06:25,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:06:25,406 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:06:25,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:06:25,406 INFO L85 PathProgramCache]: Analyzing trace with hash -635149067, now seen corresponding path program 1 times [2024-11-17 08:06:25,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:06:25,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653221559] [2024-11-17 08:06:25,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:06:25,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:06:25,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:06:25,433 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:06:25,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:06:25,457 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:06:25,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:06:25,459 INFO L85 PathProgramCache]: Analyzing trace with hash 586335966, now seen corresponding path program 1 times [2024-11-17 08:06:25,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:06:25,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006707117] [2024-11-17 08:06:25,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:06:25,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:06:25,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:06:25,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-11-17 08:06:25,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:06:25,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:06:25,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006707117] [2024-11-17 08:06:25,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006707117] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:06:25,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:06:25,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 08:06:25,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246572435] [2024-11-17 08:06:25,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:06:26,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:06:26,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 08:06:26,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-17 08:06:26,092 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. cyclomatic complexity: 8 Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 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) [2024-11-17 08:06:26,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:06:26,159 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2024-11-17 08:06:26,159 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 34 transitions. [2024-11-17 08:06:26,160 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2024-11-17 08:06:26,160 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 22 states and 27 transitions. [2024-11-17 08:06:26,160 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-11-17 08:06:26,160 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2024-11-17 08:06:26,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 27 transitions. [2024-11-17 08:06:26,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:06:26,160 INFO L218 hiAutomatonCegarLoop]: Abstraction has 22 states and 27 transitions. [2024-11-17 08:06:26,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 27 transitions. [2024-11-17 08:06:26,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2024-11-17 08:06:26,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 20 states have internal predecessors, (26), 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) [2024-11-17 08:06:26,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 26 transitions. [2024-11-17 08:06:26,162 INFO L240 hiAutomatonCegarLoop]: Abstraction has 21 states and 26 transitions. [2024-11-17 08:06:26,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 08:06:26,162 INFO L425 stractBuchiCegarLoop]: Abstraction has 21 states and 26 transitions. [2024-11-17 08:06:26,163 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-17 08:06:26,163 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 26 transitions. [2024-11-17 08:06:26,163 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2024-11-17 08:06:26,163 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:06:26,163 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:06:26,163 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-17 08:06:26,163 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:06:26,164 INFO L745 eck$LassoCheckResult]: Stem: 183#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 184#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~nondet16#1, main_#t~post17#1, main_~i~0#1, main_#t~nondet18#1, main_#t~ret19#1.base, main_#t~ret19#1.offset, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset, main_~the_int~0#1;havoc main_#t~nondet14#1;main_~in_len~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 203#L521-1 assume !(main_~in_len~0#1 < 1);call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;main_~i~0#1 := 0; 197#L523-1 assume true; 198#L523-2 assume !!(main_~i~0#1 < main_~in_len~0#1 - 1);havoc main_#t~nondet16#1;call write~int#0(main_#t~nondet16#1, main_~in~0#1.base, main_~in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1;main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; 199#L523-1 assume true; 200#L523-2 assume !(main_~i~0#1 < main_~in_len~0#1 - 1); 202#L523 havoc main_~i~0#1;call write~int#0(0, main_~in~0#1.base, main_~in~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet18#1;main_~the_int~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume { :begin_inline_strrchr } true;strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1 := main_~in~0#1.base, main_~in~0#1.offset, main_~the_int~0#1;havoc strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_#t~mem5#1, strrchr_#t~mem6#1, strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset, strrchr_#t~mem8#1, strrchr_#t~mem9#1, strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset, strrchr_#t~mem11#1, strrchr_#t~mem12#1, strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_#in~t#1.base, strrchr_#in~t#1.offset;strrchr_~c#1 := strrchr_#in~c#1;havoc strrchr_~ch~0#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := 0, 0;strrchr_~ch~0#1 := (if strrchr_~c#1 % 256 <= 127 then strrchr_~c#1 % 256 else strrchr_~c#1 % 256 - 256); 185#L511 [2024-11-17 08:06:26,164 INFO L747 eck$LassoCheckResult]: Loop: 185#L511 assume true;call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 186#L512-4 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 187#L512-3 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 188#L512-2 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset;call strrchr_#t~mem5#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 189#L513-4 assume strrchr_#t~mem5#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem5#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 192#L513-3 call strrchr_#t~mem6#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 201#L513-2 assume !(0 == strrchr_#t~mem6#1);havoc strrchr_#t~mem6#1;strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset;call strrchr_#t~mem8#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 196#L514-4 assume strrchr_#t~mem8#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem8#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 194#L514-3 call strrchr_#t~mem9#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 195#L514-2 assume !(0 == strrchr_#t~mem9#1);havoc strrchr_#t~mem9#1;strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset;call strrchr_#t~mem11#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 193#L515-4 assume strrchr_#t~mem11#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem11#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 190#L515-3 call strrchr_#t~mem12#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 191#L515-2 assume !(0 == strrchr_#t~mem12#1);havoc strrchr_#t~mem12#1;strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset; 185#L511 [2024-11-17 08:06:26,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:06:26,164 INFO L85 PathProgramCache]: Analyzing trace with hash 775731769, now seen corresponding path program 1 times [2024-11-17 08:06:26,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:06:26,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119557829] [2024-11-17 08:06:26,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:06:26,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:06:26,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:06:26,172 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:06:26,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:06:26,178 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:06:26,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:06:26,178 INFO L85 PathProgramCache]: Analyzing trace with hash -635149067, now seen corresponding path program 2 times [2024-11-17 08:06:26,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:06:26,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995184063] [2024-11-17 08:06:26,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:06:26,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:06:26,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:06:26,188 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:06:26,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:06:26,195 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:06:26,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:06:26,195 INFO L85 PathProgramCache]: Analyzing trace with hash 980026813, now seen corresponding path program 1 times [2024-11-17 08:06:26,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:06:26,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286835886] [2024-11-17 08:06:26,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:06:26,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:06:26,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:06:26,449 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:06:26,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:06:26,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286835886] [2024-11-17 08:06:26,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286835886] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:06:26,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708757061] [2024-11-17 08:06:26,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:06:26,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:06:26,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:06:26,452 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:06:26,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-17 08:06:26,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:06:26,514 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-17 08:06:26,515 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:06:26,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-17 08:06:26,673 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:06:26,674 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:06:26,917 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 08:06:26,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 134 treesize of output 128 [2024-11-17 08:06:26,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2024-11-17 08:06:26,958 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 08:06:26,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 123 treesize of output 113 [2024-11-17 08:06:27,068 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:06:27,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [708757061] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:06:27,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:06:27,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 12] total 26 [2024-11-17 08:06:27,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211794774] [2024-11-17 08:06:27,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:06:27,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:06:27,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-17 08:06:27,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=577, Unknown=0, NotChecked=0, Total=650 [2024-11-17 08:06:27,309 INFO L87 Difference]: Start difference. First operand 21 states and 26 transitions. cyclomatic complexity: 7 Second operand has 26 states, 26 states have (on average 2.076923076923077) internal successors, (54), 26 states have internal predecessors, (54), 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) [2024-11-17 08:06:27,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:06:27,687 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2024-11-17 08:06:27,688 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 43 transitions. [2024-11-17 08:06:27,688 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2024-11-17 08:06:27,689 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 24 states and 29 transitions. [2024-11-17 08:06:27,689 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-11-17 08:06:27,689 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2024-11-17 08:06:27,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 29 transitions. [2024-11-17 08:06:27,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:06:27,689 INFO L218 hiAutomatonCegarLoop]: Abstraction has 24 states and 29 transitions. [2024-11-17 08:06:27,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 29 transitions. [2024-11-17 08:06:27,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2024-11-17 08:06:27,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 22 states have internal predecessors, (28), 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) [2024-11-17 08:06:27,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2024-11-17 08:06:27,691 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23 states and 28 transitions. [2024-11-17 08:06:27,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-17 08:06:27,691 INFO L425 stractBuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2024-11-17 08:06:27,692 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-17 08:06:27,692 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 28 transitions. [2024-11-17 08:06:27,692 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2024-11-17 08:06:27,692 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:06:27,692 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:06:27,692 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1] [2024-11-17 08:06:27,693 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:06:27,693 INFO L745 eck$LassoCheckResult]: Stem: 409#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 410#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~nondet16#1, main_#t~post17#1, main_~i~0#1, main_#t~nondet18#1, main_#t~ret19#1.base, main_#t~ret19#1.offset, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset, main_~the_int~0#1;havoc main_#t~nondet14#1;main_~in_len~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 428#L521-1 assume !(main_~in_len~0#1 < 1);call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;main_~i~0#1 := 0; 423#L523-1 assume true; 424#L523-2 assume !!(main_~i~0#1 < main_~in_len~0#1 - 1);havoc main_#t~nondet16#1;call write~int#0(main_#t~nondet16#1, main_~in~0#1.base, main_~in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1;main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; 425#L523-1 assume true; 426#L523-2 assume !!(main_~i~0#1 < main_~in_len~0#1 - 1);havoc main_#t~nondet16#1;call write~int#0(main_#t~nondet16#1, main_~in~0#1.base, main_~in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1;main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; 431#L523-1 assume true; 430#L523-2 assume !(main_~i~0#1 < main_~in_len~0#1 - 1); 429#L523 havoc main_~i~0#1;call write~int#0(0, main_~in~0#1.base, main_~in~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet18#1;main_~the_int~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume { :begin_inline_strrchr } true;strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1 := main_~in~0#1.base, main_~in~0#1.offset, main_~the_int~0#1;havoc strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_#t~mem5#1, strrchr_#t~mem6#1, strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset, strrchr_#t~mem8#1, strrchr_#t~mem9#1, strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset, strrchr_#t~mem11#1, strrchr_#t~mem12#1, strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_#in~t#1.base, strrchr_#in~t#1.offset;strrchr_~c#1 := strrchr_#in~c#1;havoc strrchr_~ch~0#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := 0, 0;strrchr_~ch~0#1 := (if strrchr_~c#1 % 256 <= 127 then strrchr_~c#1 % 256 else strrchr_~c#1 % 256 - 256); 413#L511 [2024-11-17 08:06:27,693 INFO L747 eck$LassoCheckResult]: Loop: 413#L511 assume true;call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 414#L512-4 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 411#L512-3 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 412#L512-2 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset;call strrchr_#t~mem5#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 415#L513-4 assume strrchr_#t~mem5#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem5#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 418#L513-3 call strrchr_#t~mem6#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 427#L513-2 assume !(0 == strrchr_#t~mem6#1);havoc strrchr_#t~mem6#1;strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset;call strrchr_#t~mem8#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 422#L514-4 assume strrchr_#t~mem8#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem8#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 420#L514-3 call strrchr_#t~mem9#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 421#L514-2 assume !(0 == strrchr_#t~mem9#1);havoc strrchr_#t~mem9#1;strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset;call strrchr_#t~mem11#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 419#L515-4 assume strrchr_#t~mem11#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem11#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 416#L515-3 call strrchr_#t~mem12#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 417#L515-2 assume !(0 == strrchr_#t~mem12#1);havoc strrchr_#t~mem12#1;strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset; 413#L511 [2024-11-17 08:06:27,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:06:27,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1846013766, now seen corresponding path program 2 times [2024-11-17 08:06:27,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:06:27,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382346872] [2024-11-17 08:06:27,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:06:27,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:06:27,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:06:27,701 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:06:27,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:06:27,713 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:06:27,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:06:27,716 INFO L85 PathProgramCache]: Analyzing trace with hash -635149067, now seen corresponding path program 3 times [2024-11-17 08:06:27,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:06:27,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488258126] [2024-11-17 08:06:27,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:06:27,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:06:27,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:06:27,724 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:06:27,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:06:27,730 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:06:27,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:06:27,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1359808732, now seen corresponding path program 2 times [2024-11-17 08:06:27,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:06:27,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040076704] [2024-11-17 08:06:27,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:06:27,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:06:27,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:06:28,004 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:06:28,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:06:28,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040076704] [2024-11-17 08:06:28,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040076704] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:06:28,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138852492] [2024-11-17 08:06:28,005 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 08:06:28,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:06:28,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:06:28,007 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:06:28,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-17 08:06:28,072 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 08:06:28,073 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:06:28,074 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-17 08:06:28,076 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:06:28,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-17 08:06:28,273 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:06:28,274 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:06:28,529 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 08:06:28,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 98 [2024-11-17 08:06:28,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2024-11-17 08:06:28,563 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 08:06:28,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 53 [2024-11-17 08:06:28,681 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:06:28,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138852492] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:06:28,681 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:06:28,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 14] total 31 [2024-11-17 08:06:28,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124393773] [2024-11-17 08:06:28,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:06:28,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:06:28,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-17 08:06:28,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=844, Unknown=0, NotChecked=0, Total=930 [2024-11-17 08:06:28,882 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. cyclomatic complexity: 7 Second operand has 31 states, 31 states have (on average 1.935483870967742) internal successors, (60), 31 states have internal predecessors, (60), 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) [2024-11-17 08:06:29,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:06:29,341 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2024-11-17 08:06:29,341 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 54 transitions. [2024-11-17 08:06:29,342 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2024-11-17 08:06:29,342 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 26 states and 31 transitions. [2024-11-17 08:06:29,342 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-11-17 08:06:29,342 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2024-11-17 08:06:29,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 31 transitions. [2024-11-17 08:06:29,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:06:29,343 INFO L218 hiAutomatonCegarLoop]: Abstraction has 26 states and 31 transitions. [2024-11-17 08:06:29,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 31 transitions. [2024-11-17 08:06:29,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2024-11-17 08:06:29,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.2) internal successors, (30), 24 states have internal predecessors, (30), 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) [2024-11-17 08:06:29,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2024-11-17 08:06:29,344 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 30 transitions. [2024-11-17 08:06:29,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-17 08:06:29,345 INFO L425 stractBuchiCegarLoop]: Abstraction has 25 states and 30 transitions. [2024-11-17 08:06:29,345 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-17 08:06:29,345 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 30 transitions. [2024-11-17 08:06:29,345 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2024-11-17 08:06:29,345 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:06:29,345 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:06:29,346 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 1, 1, 1, 1, 1] [2024-11-17 08:06:29,346 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:06:29,346 INFO L745 eck$LassoCheckResult]: Stem: 668#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 669#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~nondet16#1, main_#t~post17#1, main_~i~0#1, main_#t~nondet18#1, main_#t~ret19#1.base, main_#t~ret19#1.offset, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset, main_~the_int~0#1;havoc main_#t~nondet14#1;main_~in_len~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 687#L521-1 assume !(main_~in_len~0#1 < 1);call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;main_~i~0#1 := 0; 682#L523-1 assume true; 683#L523-2 assume !!(main_~i~0#1 < main_~in_len~0#1 - 1);havoc main_#t~nondet16#1;call write~int#0(main_#t~nondet16#1, main_~in~0#1.base, main_~in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1;main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; 684#L523-1 assume true; 685#L523-2 assume !!(main_~i~0#1 < main_~in_len~0#1 - 1);havoc main_#t~nondet16#1;call write~int#0(main_#t~nondet16#1, main_~in~0#1.base, main_~in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1;main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; 690#L523-1 assume true; 692#L523-2 assume !!(main_~i~0#1 < main_~in_len~0#1 - 1);havoc main_#t~nondet16#1;call write~int#0(main_#t~nondet16#1, main_~in~0#1.base, main_~in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1;main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; 691#L523-1 assume true; 689#L523-2 assume !(main_~i~0#1 < main_~in_len~0#1 - 1); 688#L523 havoc main_~i~0#1;call write~int#0(0, main_~in~0#1.base, main_~in~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet18#1;main_~the_int~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume { :begin_inline_strrchr } true;strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1 := main_~in~0#1.base, main_~in~0#1.offset, main_~the_int~0#1;havoc strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_#t~mem5#1, strrchr_#t~mem6#1, strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset, strrchr_#t~mem8#1, strrchr_#t~mem9#1, strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset, strrchr_#t~mem11#1, strrchr_#t~mem12#1, strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_#in~t#1.base, strrchr_#in~t#1.offset;strrchr_~c#1 := strrchr_#in~c#1;havoc strrchr_~ch~0#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := 0, 0;strrchr_~ch~0#1 := (if strrchr_~c#1 % 256 <= 127 then strrchr_~c#1 % 256 else strrchr_~c#1 % 256 - 256); 670#L511 [2024-11-17 08:06:29,346 INFO L747 eck$LassoCheckResult]: Loop: 670#L511 assume true;call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 671#L512-4 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 672#L512-3 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 673#L512-2 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset;call strrchr_#t~mem5#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 674#L513-4 assume strrchr_#t~mem5#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem5#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 677#L513-3 call strrchr_#t~mem6#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 686#L513-2 assume !(0 == strrchr_#t~mem6#1);havoc strrchr_#t~mem6#1;strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset;call strrchr_#t~mem8#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 681#L514-4 assume strrchr_#t~mem8#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem8#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 679#L514-3 call strrchr_#t~mem9#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 680#L514-2 assume !(0 == strrchr_#t~mem9#1);havoc strrchr_#t~mem9#1;strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset;call strrchr_#t~mem11#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 678#L515-4 assume strrchr_#t~mem11#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem11#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 675#L515-3 call strrchr_#t~mem12#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 676#L515-2 assume !(0 == strrchr_#t~mem12#1);havoc strrchr_#t~mem12#1;strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset; 670#L511 [2024-11-17 08:06:29,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:06:29,346 INFO L85 PathProgramCache]: Analyzing trace with hash -197670149, now seen corresponding path program 3 times [2024-11-17 08:06:29,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:06:29,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337334871] [2024-11-17 08:06:29,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:06:29,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:06:29,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:06:29,354 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:06:29,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:06:29,359 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:06:29,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:06:29,360 INFO L85 PathProgramCache]: Analyzing trace with hash -635149067, now seen corresponding path program 4 times [2024-11-17 08:06:29,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:06:29,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41216039] [2024-11-17 08:06:29,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:06:29,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:06:29,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:06:29,364 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:06:29,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:06:29,367 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:06:29,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:06:29,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1258012731, now seen corresponding path program 3 times [2024-11-17 08:06:29,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:06:29,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565212371] [2024-11-17 08:06:29,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:06:29,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:06:29,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:06:29,707 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:06:29,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:06:29,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565212371] [2024-11-17 08:06:29,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565212371] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:06:29,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345491372] [2024-11-17 08:06:29,708 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-17 08:06:29,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:06:29,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:06:29,710 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:06:29,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-17 08:06:29,772 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-17 08:06:29,772 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 08:06:29,773 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-17 08:06:29,775 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:06:29,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-17 08:06:29,999 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:06:29,999 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:06:30,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2024-11-17 08:06:30,097 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 08:06:30,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 53 [2024-11-17 08:06:30,219 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:06:30,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345491372] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:06:30,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:06:30,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 35 [2024-11-17 08:06:30,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137396798] [2024-11-17 08:06:30,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:06:30,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:06:30,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-17 08:06:30,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1071, Unknown=0, NotChecked=0, Total=1190 [2024-11-17 08:06:30,383 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. cyclomatic complexity: 7 Second operand has 35 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 35 states have internal predecessors, (60), 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) [2024-11-17 08:06:30,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:06:30,703 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2024-11-17 08:06:30,704 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 54 transitions. [2024-11-17 08:06:30,704 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2024-11-17 08:06:30,705 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 54 transitions. [2024-11-17 08:06:30,705 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2024-11-17 08:06:30,705 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2024-11-17 08:06:30,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 54 transitions. [2024-11-17 08:06:30,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:06:30,705 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 54 transitions. [2024-11-17 08:06:30,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 54 transitions. [2024-11-17 08:06:30,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2024-11-17 08:06:30,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.225) internal successors, (49), 39 states have internal predecessors, (49), 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) [2024-11-17 08:06:30,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2024-11-17 08:06:30,708 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 49 transitions. [2024-11-17 08:06:30,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-17 08:06:30,709 INFO L425 stractBuchiCegarLoop]: Abstraction has 40 states and 49 transitions. [2024-11-17 08:06:30,709 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-11-17 08:06:30,709 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 49 transitions. [2024-11-17 08:06:30,710 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2024-11-17 08:06:30,710 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:06:30,710 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:06:30,710 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:06:30,710 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:06:30,710 INFO L745 eck$LassoCheckResult]: Stem: 928#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 929#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~nondet16#1, main_#t~post17#1, main_~i~0#1, main_#t~nondet18#1, main_#t~ret19#1.base, main_#t~ret19#1.offset, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset, main_~the_int~0#1;havoc main_#t~nondet14#1;main_~in_len~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 950#L521-1 assume !(main_~in_len~0#1 < 1);call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;main_~i~0#1 := 0; 944#L523-1 assume true; 945#L523-2 assume !!(main_~i~0#1 < main_~in_len~0#1 - 1);havoc main_#t~nondet16#1;call write~int#0(main_#t~nondet16#1, main_~in~0#1.base, main_~in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1;main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; 958#L523-1 assume true; 959#L523-2 assume !!(main_~i~0#1 < main_~in_len~0#1 - 1);havoc main_#t~nondet16#1;call write~int#0(main_#t~nondet16#1, main_~in~0#1.base, main_~in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1;main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; 946#L523-1 assume true; 947#L523-2 assume !!(main_~i~0#1 < main_~in_len~0#1 - 1);havoc main_#t~nondet16#1;call write~int#0(main_#t~nondet16#1, main_~in~0#1.base, main_~in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1;main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; 953#L523-1 assume true; 951#L523-2 assume !(main_~i~0#1 < main_~in_len~0#1 - 1); 952#L523 havoc main_~i~0#1;call write~int#0(0, main_~in~0#1.base, main_~in~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet18#1;main_~the_int~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume { :begin_inline_strrchr } true;strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1 := main_~in~0#1.base, main_~in~0#1.offset, main_~the_int~0#1;havoc strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_#t~mem5#1, strrchr_#t~mem6#1, strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset, strrchr_#t~mem8#1, strrchr_#t~mem9#1, strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset, strrchr_#t~mem11#1, strrchr_#t~mem12#1, strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_#in~t#1.base, strrchr_#in~t#1.offset;strrchr_~c#1 := strrchr_#in~c#1;havoc strrchr_~ch~0#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := 0, 0;strrchr_~ch~0#1 := (if strrchr_~c#1 % 256 <= 127 then strrchr_~c#1 % 256 else strrchr_~c#1 % 256 - 256); 932#L511 assume true;call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 933#L512-4 assume !(strrchr_#t~mem2#1 == strrchr_~ch~0#1);havoc strrchr_#t~mem2#1; 930#L512-3 [2024-11-17 08:06:30,711 INFO L747 eck$LassoCheckResult]: Loop: 930#L512-3 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 931#L512-2 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset;call strrchr_#t~mem5#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 934#L513-4 assume strrchr_#t~mem5#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem5#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 939#L513-3 call strrchr_#t~mem6#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 948#L513-2 assume !(0 == strrchr_#t~mem6#1);havoc strrchr_#t~mem6#1;strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset;call strrchr_#t~mem8#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 943#L514-4 assume strrchr_#t~mem8#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem8#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 941#L514-3 call strrchr_#t~mem9#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 942#L514-2 assume !(0 == strrchr_#t~mem9#1);havoc strrchr_#t~mem9#1;strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset;call strrchr_#t~mem11#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 954#L515-4 assume strrchr_#t~mem11#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem11#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 936#L515-3 call strrchr_#t~mem12#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 937#L515-2 assume !(0 == strrchr_#t~mem12#1);havoc strrchr_#t~mem12#1;strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset; 938#L511 assume true;call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 935#L512-4 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 930#L512-3 [2024-11-17 08:06:30,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:06:30,711 INFO L85 PathProgramCache]: Analyzing trace with hash -982450950, now seen corresponding path program 1 times [2024-11-17 08:06:30,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:06:30,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107146232] [2024-11-17 08:06:30,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:06:30,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:06:30,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:06:30,725 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:06:30,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:06:30,737 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:06:30,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:06:30,737 INFO L85 PathProgramCache]: Analyzing trace with hash -920073167, now seen corresponding path program 5 times [2024-11-17 08:06:30,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:06:30,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873819602] [2024-11-17 08:06:30,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:06:30,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:06:30,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:06:30,743 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:06:30,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:06:30,750 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:06:30,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:06:30,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1558866904, now seen corresponding path program 1 times [2024-11-17 08:06:30,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:06:30,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081850141] [2024-11-17 08:06:30,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:06:30,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:06:30,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:06:31,004 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:06:31,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:06:31,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081850141] [2024-11-17 08:06:31,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081850141] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 08:06:31,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593960323] [2024-11-17 08:06:31,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:06:31,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 08:06:31,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:06:31,007 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 08:06:31,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-17 08:06:31,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:06:31,073 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-17 08:06:31,075 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:06:31,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-17 08:06:31,226 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:06:31,226 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 08:06:31,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-11-17 08:06:31,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2024-11-17 08:06:31,289 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:06:31,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593960323] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 08:06:31,289 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 08:06:31,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2024-11-17 08:06:31,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826338995] [2024-11-17 08:06:31,289 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 08:06:31,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:06:31,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-17 08:06:31,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=454, Unknown=0, NotChecked=0, Total=506 [2024-11-17 08:06:31,496 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. cyclomatic complexity: 11 Second operand has 23 states, 23 states have (on average 2.347826086956522) internal successors, (54), 23 states have internal predecessors, (54), 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) [2024-11-17 08:06:31,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:06:31,829 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2024-11-17 08:06:31,829 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 52 states and 63 transitions. [2024-11-17 08:06:31,830 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2024-11-17 08:06:31,830 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 52 states to 28 states and 33 transitions. [2024-11-17 08:06:31,830 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-11-17 08:06:31,830 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2024-11-17 08:06:31,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 33 transitions. [2024-11-17 08:06:31,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:06:31,831 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 33 transitions. [2024-11-17 08:06:31,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 33 transitions. [2024-11-17 08:06:31,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2024-11-17 08:06:31,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 26 states have internal predecessors, (32), 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) [2024-11-17 08:06:31,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2024-11-17 08:06:31,832 INFO L240 hiAutomatonCegarLoop]: Abstraction has 27 states and 32 transitions. [2024-11-17 08:06:31,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 08:06:31,833 INFO L425 stractBuchiCegarLoop]: Abstraction has 27 states and 32 transitions. [2024-11-17 08:06:31,833 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-11-17 08:06:31,833 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 32 transitions. [2024-11-17 08:06:31,836 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2024-11-17 08:06:31,836 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:06:31,836 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:06:31,839 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [5, 4, 1, 1, 1, 1, 1] [2024-11-17 08:06:31,839 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 08:06:31,839 INFO L745 eck$LassoCheckResult]: Stem: 1224#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 1225#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet14#1, main_#t~malloc15#1.base, main_#t~malloc15#1.offset, main_#t~nondet16#1, main_#t~post17#1, main_~i~0#1, main_#t~nondet18#1, main_#t~ret19#1.base, main_#t~ret19#1.offset, main_~in_len~0#1, main_~in~0#1.base, main_~in~0#1.offset, main_~the_int~0#1;havoc main_#t~nondet14#1;main_~in_len~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1; 1243#L521-1 assume !(main_~in_len~0#1 < 1);call main_#t~malloc15#1.base, main_#t~malloc15#1.offset := #Ultimate.allocOnStack(main_~in_len~0#1 % 18446744073709551616);main_~in~0#1.base, main_~in~0#1.offset := main_#t~malloc15#1.base, main_#t~malloc15#1.offset;main_~i~0#1 := 0; 1238#L523-1 assume true; 1239#L523-2 assume !!(main_~i~0#1 < main_~in_len~0#1 - 1);havoc main_#t~nondet16#1;call write~int#0(main_#t~nondet16#1, main_~in~0#1.base, main_~in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1;main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; 1240#L523-1 assume true; 1241#L523-2 assume !!(main_~i~0#1 < main_~in_len~0#1 - 1);havoc main_#t~nondet16#1;call write~int#0(main_#t~nondet16#1, main_~in~0#1.base, main_~in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1;main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; 1246#L523-1 assume true; 1250#L523-2 assume !!(main_~i~0#1 < main_~in_len~0#1 - 1);havoc main_#t~nondet16#1;call write~int#0(main_#t~nondet16#1, main_~in~0#1.base, main_~in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1;main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; 1249#L523-1 assume true; 1248#L523-2 assume !!(main_~i~0#1 < main_~in_len~0#1 - 1);havoc main_#t~nondet16#1;call write~int#0(main_#t~nondet16#1, main_~in~0#1.base, main_~in~0#1.offset + main_~i~0#1, 1);havoc main_#t~nondet16#1;main_#t~post17#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post17#1;havoc main_#t~post17#1; 1247#L523-1 assume true; 1245#L523-2 assume !(main_~i~0#1 < main_~in_len~0#1 - 1); 1244#L523 havoc main_~i~0#1;call write~int#0(0, main_~in~0#1.base, main_~in~0#1.offset + (main_~in_len~0#1 - 1), 1);havoc main_#t~nondet18#1;main_~the_int~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume { :begin_inline_strrchr } true;strrchr_#in~t#1.base, strrchr_#in~t#1.offset, strrchr_#in~c#1 := main_~in~0#1.base, main_~in~0#1.offset, main_~the_int~0#1;havoc strrchr_#res#1.base, strrchr_#res#1.offset;havoc strrchr_#t~mem2#1, strrchr_#t~mem3#1, strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset, strrchr_#t~mem5#1, strrchr_#t~mem6#1, strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset, strrchr_#t~mem8#1, strrchr_#t~mem9#1, strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset, strrchr_#t~mem11#1, strrchr_#t~mem12#1, strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset, strrchr_~t#1.base, strrchr_~t#1.offset, strrchr_~c#1, strrchr_~ch~0#1, strrchr_~l~0#1.base, strrchr_~l~0#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_#in~t#1.base, strrchr_#in~t#1.offset;strrchr_~c#1 := strrchr_#in~c#1;havoc strrchr_~ch~0#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := 0, 0;strrchr_~ch~0#1 := (if strrchr_~c#1 % 256 <= 127 then strrchr_~c#1 % 256 else strrchr_~c#1 % 256 - 256); 1226#L511 [2024-11-17 08:06:31,839 INFO L747 eck$LassoCheckResult]: Loop: 1226#L511 assume true;call strrchr_#t~mem2#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 1227#L512-4 assume strrchr_#t~mem2#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem2#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 1228#L512-3 call strrchr_#t~mem3#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 1229#L512-2 assume !(0 == strrchr_#t~mem3#1);havoc strrchr_#t~mem3#1;strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre4#1.base, strrchr_#t~pre4#1.offset;call strrchr_#t~mem5#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 1230#L513-4 assume strrchr_#t~mem5#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem5#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 1233#L513-3 call strrchr_#t~mem6#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 1242#L513-2 assume !(0 == strrchr_#t~mem6#1);havoc strrchr_#t~mem6#1;strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre7#1.base, strrchr_#t~pre7#1.offset;call strrchr_#t~mem8#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 1237#L514-4 assume strrchr_#t~mem8#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem8#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 1235#L514-3 call strrchr_#t~mem9#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 1236#L514-2 assume !(0 == strrchr_#t~mem9#1);havoc strrchr_#t~mem9#1;strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre10#1.base, strrchr_#t~pre10#1.offset;call strrchr_#t~mem11#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 1234#L515-4 assume strrchr_#t~mem11#1 == strrchr_~ch~0#1;havoc strrchr_#t~mem11#1;strrchr_~l~0#1.base, strrchr_~l~0#1.offset := strrchr_~t#1.base, strrchr_~t#1.offset; 1231#L515-3 call strrchr_#t~mem12#1 := read~int#0(strrchr_~t#1.base, strrchr_~t#1.offset, 1); 1232#L515-2 assume !(0 == strrchr_#t~mem12#1);havoc strrchr_#t~mem12#1;strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;strrchr_~t#1.base, strrchr_~t#1.offset := strrchr_~t#1.base, 1 + strrchr_~t#1.offset;havoc strrchr_#t~pre13#1.base, strrchr_#t~pre13#1.offset; 1226#L511 [2024-11-17 08:06:31,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:06:31,840 INFO L85 PathProgramCache]: Analyzing trace with hash -982386436, now seen corresponding path program 4 times [2024-11-17 08:06:31,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:06:31,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58980908] [2024-11-17 08:06:31,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:06:31,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:06:31,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:06:31,849 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:06:31,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:06:31,853 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:06:31,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:06:31,854 INFO L85 PathProgramCache]: Analyzing trace with hash -635149067, now seen corresponding path program 6 times [2024-11-17 08:06:31,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:06:31,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249045542] [2024-11-17 08:06:31,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:06:31,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:06:31,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:06:31,857 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:06:31,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:06:31,861 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:06:31,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:06:31,861 INFO L85 PathProgramCache]: Analyzing trace with hash -2078663718, now seen corresponding path program 4 times [2024-11-17 08:06:31,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:06:31,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699690785] [2024-11-17 08:06:31,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:06:31,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:06:31,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:06:31,871 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:06:31,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:06:31,880 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:06:32,543 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:06:32,543 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:06:32,543 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:06:32,543 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:06:32,543 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:06:32,543 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:06:32,543 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:06:32,543 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:06:32,543 INFO L132 ssoRankerPreferences]: Filename of dumped script: strrchr.i_Iteration7_Lasso [2024-11-17 08:06:32,543 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:06:32,543 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:06:32,546 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:32,547 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:32,814 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:32,817 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:32,819 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:32,825 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:32,827 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:32,828 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:32,829 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:32,831 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:32,832 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:32,833 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:32,835 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:32,837 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:32,840 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:32,842 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:32,843 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:32,846 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:32,848 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:32,850 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:32,852 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:32,854 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:32,855 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:32,856 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:32,858 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:32,859 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:32,861 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:32,862 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:32,864 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:32,865 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:32,866 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:32,868 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:06:33,091 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:06:33,091 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:06:33,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:06:33,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:06:33,093 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:06:33,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-11-17 08:06:33,095 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 [2024-11-17 08:06:33,105 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:06:33,105 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:06:33,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:06:33,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:06:33,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:06:33,105 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:06:33,105 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:06:33,107 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:06:33,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-11-17 08:06:33,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:06:33,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:06:33,117 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:06:33,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-11-17 08:06:33,119 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 [2024-11-17 08:06:33,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:06:33,129 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:06:33,130 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:06:33,130 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:06:33,130 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:06:33,130 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:06:33,130 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:06:33,131 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:06:33,141 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-11-17 08:06:33,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:06:33,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:06:33,143 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:06:33,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-11-17 08:06:33,144 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 [2024-11-17 08:06:33,154 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:06:33,154 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:06:33,154 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:06:33,154 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:06:33,158 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:06:33,158 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:06:33,164 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:06:33,179 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2024-11-17 08:06:33,179 INFO L444 ModelExtractionUtils]: 3 out of 16 variables were initially zero. Simplification set additionally 10 variables to zero. [2024-11-17 08:06:33,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:06:33,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:06:33,181 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:06:33,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-11-17 08:06:33,183 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:06:33,193 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-11-17 08:06:33,193 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:06:33,193 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_strrchr_~t#1.base)_1, ULTIMATE.start_strrchr_~t#1.offset) = 1*v_rep(select #length ULTIMATE.start_strrchr_~t#1.base)_1 - 1*ULTIMATE.start_strrchr_~t#1.offset Supporting invariants [] [2024-11-17 08:06:33,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-11-17 08:06:33,218 INFO L156 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2024-11-17 08:06:33,219 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #length [2024-11-17 08:06:33,220 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#length,GLOBAL] [2024-11-17 08:06:33,220 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~t!offset [2024-11-17 08:06:33,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:06:33,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:06:33,248 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:06:33,249 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:06:33,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:06:33,280 INFO L255 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-17 08:06:33,281 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:06:33,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:06:33,348 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2024-11-17 08:06:33,348 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 32 transitions. cyclomatic complexity: 7 Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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) [2024-11-17 08:06:33,383 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 32 transitions. cyclomatic complexity: 7. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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 37 states and 47 transitions. Complement of second has 6 states. [2024-11-17 08:06:33,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-11-17 08:06:33,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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) [2024-11-17 08:06:33,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2024-11-17 08:06:33,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 14 letters. Loop has 13 letters. [2024-11-17 08:06:33,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:06:33,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 27 letters. Loop has 13 letters. [2024-11-17 08:06:33,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:06:33,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 24 transitions. Stem has 14 letters. Loop has 26 letters. [2024-11-17 08:06:33,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:06:33,386 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 47 transitions. [2024-11-17 08:06:33,387 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-17 08:06:33,387 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 0 states and 0 transitions. [2024-11-17 08:06:33,387 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-11-17 08:06:33,387 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-11-17 08:06:33,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-11-17 08:06:33,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-17 08:06:33,387 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-17 08:06:33,387 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-17 08:06:33,387 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-17 08:06:33,387 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-11-17 08:06:33,387 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-11-17 08:06:33,387 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-11-17 08:06:33,387 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-11-17 08:06:33,392 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.11 08:06:33 BoogieIcfgContainer [2024-11-17 08:06:33,392 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-17 08:06:33,393 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 08:06:33,393 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 08:06:33,393 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 08:06:33,393 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:06:24" (3/4) ... [2024-11-17 08:06:33,395 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-17 08:06:33,395 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 08:06:33,396 INFO L158 Benchmark]: Toolchain (without parser) took 10076.18ms. Allocated memory was 138.4MB in the beginning and 285.2MB in the end (delta: 146.8MB). Free memory was 65.1MB in the beginning and 122.1MB in the end (delta: -57.1MB). Peak memory consumption was 91.4MB. Max. memory is 16.1GB. [2024-11-17 08:06:33,396 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 138.4MB. Free memory is still 88.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 08:06:33,396 INFO L158 Benchmark]: CACSL2BoogieTranslator took 352.59ms. Allocated memory was 138.4MB in the beginning and 197.1MB in the end (delta: 58.7MB). Free memory was 64.9MB in the beginning and 157.9MB in the end (delta: -92.9MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. [2024-11-17 08:06:33,396 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.81ms. Allocated memory is still 197.1MB. Free memory was 157.9MB in the beginning and 155.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 08:06:33,396 INFO L158 Benchmark]: Boogie Preprocessor took 30.95ms. Allocated memory is still 197.1MB. Free memory was 155.7MB in the beginning and 153.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 08:06:33,397 INFO L158 Benchmark]: IcfgBuilder took 267.42ms. Allocated memory is still 197.1MB. Free memory was 153.7MB in the beginning and 137.9MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-17 08:06:33,397 INFO L158 Benchmark]: BuchiAutomizer took 9378.65ms. Allocated memory was 197.1MB in the beginning and 285.2MB in the end (delta: 88.1MB). Free memory was 137.9MB in the beginning and 123.2MB in the end (delta: 14.8MB). Peak memory consumption was 102.8MB. Max. memory is 16.1GB. [2024-11-17 08:06:33,397 INFO L158 Benchmark]: Witness Printer took 2.85ms. Allocated memory is still 285.2MB. Free memory was 123.2MB in the beginning and 122.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 08:06:33,398 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.10ms. Allocated memory is still 138.4MB. Free memory is still 88.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 352.59ms. Allocated memory was 138.4MB in the beginning and 197.1MB in the end (delta: 58.7MB). Free memory was 64.9MB in the beginning and 157.9MB in the end (delta: -92.9MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.81ms. Allocated memory is still 197.1MB. Free memory was 157.9MB in the beginning and 155.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.95ms. Allocated memory is still 197.1MB. Free memory was 155.7MB in the beginning and 153.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 267.42ms. Allocated memory is still 197.1MB. Free memory was 153.7MB in the beginning and 137.9MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 9378.65ms. Allocated memory was 197.1MB in the beginning and 285.2MB in the end (delta: 88.1MB). Free memory was 137.9MB in the beginning and 123.2MB in the end (delta: 14.8MB). Peak memory consumption was 102.8MB. Max. memory is 16.1GB. * Witness Printer took 2.85ms. Allocated memory is still 285.2MB. Free memory was 123.2MB in the beginning and 122.1MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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: ~t!offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (5 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function (((long) -1 * i) + in_len) and consists of 4 locations. One deterministic module has affine ranking function null and consists of 4 locations. 5 modules have a trivial ranking function, the largest among these consists of 35 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.3s and 8 iterations. TraceHistogramMax:5. Analysis of lassos took 7.4s. Construction of modules took 0.7s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 9 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, 113 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 111 mSDsluCounter, 704 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 623 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1712 IncrementalHoareTripleChecker+Invalid, 1752 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 81 mSDtfsCounter, 1712 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc5 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital134 mio100 ax100 hnf100 lsp104 ukn75 mio100 lsp43 div138 bol100 ite100 ukn100 eq173 hnf91 smp85 dnf118 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 22ms VariablesStem: 3 VariablesLoop: 2 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! [2024-11-17 08:06:33,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2024-11-17 08:06:33,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-11-17 08:06:33,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-17 08:06:34,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-17 08:06:34,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-17 08:06:34,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE