./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-numeric/Fibonacci01-2.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 6c24879c Calling Ultimate with: /usr/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-numeric/Fibonacci01-2.c -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.graphml --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 14cfbc3a2ba2bfe3a03d4d1ebff24b0baf1851f06dbbd2468b59e09322e4ce16 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-13 03:09:19,160 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 03:09:19,161 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 03:09:19,194 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 03:09:19,195 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 03:09:19,196 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 03:09:19,197 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 03:09:19,199 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 03:09:19,200 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 03:09:19,204 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 03:09:19,205 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 03:09:19,206 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 03:09:19,206 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 03:09:19,208 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 03:09:19,209 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 03:09:19,211 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 03:09:19,211 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 03:09:19,213 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 03:09:19,214 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 03:09:19,218 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 03:09:19,219 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 03:09:19,220 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 03:09:19,220 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 03:09:19,221 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 03:09:19,222 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 03:09:19,227 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 03:09:19,228 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 03:09:19,228 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 03:09:19,229 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 03:09:19,229 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 03:09:19,230 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 03:09:19,230 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 03:09:19,231 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 03:09:19,232 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 03:09:19,232 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 03:09:19,233 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 03:09:19,233 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 03:09:19,233 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 03:09:19,233 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 03:09:19,233 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 03:09:19,234 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 03:09:19,235 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 03:09:19,237 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-07-13 03:09:19,258 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 03:09:19,259 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 03:09:19,259 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 03:09:19,259 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 03:09:19,260 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 03:09:19,260 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 03:09:19,260 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 03:09:19,260 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-13 03:09:19,261 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-13 03:09:19,261 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-13 03:09:19,261 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-13 03:09:19,261 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-13 03:09:19,262 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-13 03:09:19,262 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 03:09:19,262 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 03:09:19,262 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 03:09:19,262 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 03:09:19,263 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-13 03:09:19,263 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-13 03:09:19,263 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-13 03:09:19,263 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 03:09:19,263 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-13 03:09:19,264 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 03:09:19,264 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-13 03:09:19,264 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 03:09:19,264 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 03:09:19,264 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 03:09:19,264 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 03:09:19,265 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-13 03:09:19,265 INFO L138 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.graphml 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 -> 14cfbc3a2ba2bfe3a03d4d1ebff24b0baf1851f06dbbd2468b59e09322e4ce16 [2022-07-13 03:09:19,455 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 03:09:19,477 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 03:09:19,478 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 03:09:19,479 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 03:09:19,480 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 03:09:19,481 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-numeric/Fibonacci01-2.c [2022-07-13 03:09:19,524 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71c5041b9/669963e0ad9e4a389cfec3842ecfb826/FLAGd69a67890 [2022-07-13 03:09:19,840 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 03:09:19,841 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-numeric/Fibonacci01-2.c [2022-07-13 03:09:19,845 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71c5041b9/669963e0ad9e4a389cfec3842ecfb826/FLAGd69a67890 [2022-07-13 03:09:19,852 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71c5041b9/669963e0ad9e4a389cfec3842ecfb826 [2022-07-13 03:09:19,854 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 03:09:19,855 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 03:09:19,856 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 03:09:19,856 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 03:09:19,858 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 03:09:19,859 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:09:19" (1/1) ... [2022-07-13 03:09:19,859 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@748f36c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:09:19, skipping insertion in model container [2022-07-13 03:09:19,860 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 03:09:19" (1/1) ... [2022-07-13 03:09:19,864 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 03:09:19,872 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 03:09:19,988 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-numeric/Fibonacci01-2.c[761,774] [2022-07-13 03:09:19,989 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 03:09:19,997 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 03:09:20,006 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-numeric/Fibonacci01-2.c[761,774] [2022-07-13 03:09:20,007 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 03:09:20,017 INFO L208 MainTranslator]: Completed translation [2022-07-13 03:09:20,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:09:20 WrapperNode [2022-07-13 03:09:20,018 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 03:09:20,019 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 03:09:20,019 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 03:09:20,019 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 03:09:20,024 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:09:20" (1/1) ... [2022-07-13 03:09:20,029 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:09:20" (1/1) ... [2022-07-13 03:09:20,041 INFO L137 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 24 [2022-07-13 03:09:20,041 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 03:09:20,042 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 03:09:20,042 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 03:09:20,042 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 03:09:20,047 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:09:20" (1/1) ... [2022-07-13 03:09:20,047 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:09:20" (1/1) ... [2022-07-13 03:09:20,048 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:09:20" (1/1) ... [2022-07-13 03:09:20,048 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:09:20" (1/1) ... [2022-07-13 03:09:20,050 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:09:20" (1/1) ... [2022-07-13 03:09:20,051 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:09:20" (1/1) ... [2022-07-13 03:09:20,054 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:09:20" (1/1) ... [2022-07-13 03:09:20,055 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 03:09:20,056 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 03:09:20,056 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 03:09:20,056 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 03:09:20,057 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:09:20" (1/1) ... [2022-07-13 03:09:20,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:09:20,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:09:20,080 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) [2022-07-13 03:09:20,097 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 [2022-07-13 03:09:20,108 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2022-07-13 03:09:20,109 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2022-07-13 03:09:20,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 03:09:20,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 03:09:20,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 03:09:20,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 03:09:20,166 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 03:09:20,167 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 03:09:20,229 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 03:09:20,232 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 03:09:20,233 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-13 03:09:20,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:09:20 BoogieIcfgContainer [2022-07-13 03:09:20,234 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 03:09:20,235 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-13 03:09:20,235 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-13 03:09:20,237 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-13 03:09:20,237 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:09:20,237 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.07 03:09:19" (1/3) ... [2022-07-13 03:09:20,238 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4b928d3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 03:09:20, skipping insertion in model container [2022-07-13 03:09:20,238 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:09:20,238 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 03:09:20" (2/3) ... [2022-07-13 03:09:20,239 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4b928d3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.07 03:09:20, skipping insertion in model container [2022-07-13 03:09:20,239 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-13 03:09:20,239 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:09:20" (3/3) ... [2022-07-13 03:09:20,240 INFO L354 chiAutomizerObserver]: Analyzing ICFG Fibonacci01-2.c [2022-07-13 03:09:20,271 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-13 03:09:20,272 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-13 03:09:20,272 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-13 03:09:20,272 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-13 03:09:20,272 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-13 03:09:20,272 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-13 03:09:20,272 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-13 03:09:20,273 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-13 03:09:20,275 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 03:09:20,286 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-13 03:09:20,286 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:09:20,286 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:09:20,290 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-13 03:09:20,290 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-13 03:09:20,290 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-13 03:09:20,291 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 03:09:20,292 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-13 03:09:20,292 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:09:20,292 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:09:20,293 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-13 03:09:20,293 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-13 03:09:20,297 INFO L752 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 12#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 9#L29true assume !(main_~x~0#1 < 1); 11#L31true call main_#t~ret7#1 := fibonacci(main_~x~0#1);< 4#fibonacciENTRYtrue [2022-07-13 03:09:20,297 INFO L754 eck$LassoCheckResult]: Loop: 4#fibonacciENTRYtrue ~n := #in~n; 5#L17true assume !(~n < 1); 17#L19true assume !(1 == ~n); 15#L22true call #t~ret4 := fibonacci(~n - 1);< 4#fibonacciENTRYtrue [2022-07-13 03:09:20,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:09:20,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1325876, now seen corresponding path program 1 times [2022-07-13 03:09:20,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:09:20,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631859041] [2022-07-13 03:09:20,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:09:20,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:09:20,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:09:20,362 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:09:20,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:09:20,390 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:09:20,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:09:20,393 INFO L85 PathProgramCache]: Analyzing trace with hash 927646, now seen corresponding path program 1 times [2022-07-13 03:09:20,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:09:20,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339256995] [2022-07-13 03:09:20,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:09:20,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:09:20,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:09:20,411 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:09:20,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:09:20,418 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:09:20,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:09:20,420 INFO L85 PathProgramCache]: Analyzing trace with hash 408654161, now seen corresponding path program 1 times [2022-07-13 03:09:20,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:09:20,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545574328] [2022-07-13 03:09:20,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:09:20,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:09:20,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:09:20,437 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:09:20,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:09:20,455 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:09:20,557 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:09:20,557 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:09:20,557 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:09:20,557 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:09:20,558 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-13 03:09:20,558 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:09:20,558 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:09:20,559 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:09:20,559 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci01-2.c_Iteration1_Loop [2022-07-13 03:09:20,559 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:09:20,559 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:09:20,571 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:09:20,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:09:20,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:09:20,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:09:20,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:09:20,656 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 03:09:20,657 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-13 03:09:20,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:09:20,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:09:20,675 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) [2022-07-13 03:09:20,686 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 03:09:20,686 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 03:09:20,687 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 [2022-07-13 03:09:20,708 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-13 03:09:20,708 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#res=0} Honda state: {fibonacci_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-13 03:09:20,737 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 [2022-07-13 03:09:20,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:09:20,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:09:20,752 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) [2022-07-13 03:09:20,758 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 [2022-07-13 03:09:20,759 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 03:09:20,759 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 03:09:20,766 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-13 03:09:20,766 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#t~ret5=0} Honda state: {fibonacci_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-13 03:09:20,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2022-07-13 03:09:20,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:09:20,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:09:20,791 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) [2022-07-13 03:09:20,804 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 03:09:20,804 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 03:09:20,810 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-13 03:09:20,810 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_~n=0} Honda state: {fibonacci_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-13 03:09:20,820 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 [2022-07-13 03:09:20,833 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 [2022-07-13 03:09:20,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:09:20,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:09:20,835 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) [2022-07-13 03:09:20,836 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 [2022-07-13 03:09:20,837 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 03:09:20,837 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 03:09:20,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2022-07-13 03:09:20,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:09:20,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:09:20,868 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) [2022-07-13 03:09:20,869 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 [2022-07-13 03:09:20,871 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-13 03:09:20,871 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 03:09:20,929 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-13 03:09:20,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-13 03:09:20,934 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:09:20,935 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:09:20,935 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:09:20,935 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:09:20,935 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 03:09:20,935 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:09:20,935 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:09:20,935 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:09:20,935 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci01-2.c_Iteration1_Loop [2022-07-13 03:09:20,935 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:09:20,935 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:09:20,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:09:20,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:09:20,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:09:20,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:09:20,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:09:20,995 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 03:09:20,998 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 03:09:20,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:09:20,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:09:21,014 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) [2022-07-13 03:09:21,015 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 [2022-07-13 03:09:21,018 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:09:21,024 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:09:21,025 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:09:21,025 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:09:21,025 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:09:21,025 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:09:21,027 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:09:21,027 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:09:21,036 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:09:21,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-07-13 03:09:21,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:09:21,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:09:21,053 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) [2022-07-13 03:09:21,054 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 [2022-07-13 03:09:21,055 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-13 03:09:21,061 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:09:21,061 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:09:21,061 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:09:21,061 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:09:21,061 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:09:21,062 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:09:21,062 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:09:21,069 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:09:21,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-07-13 03:09:21,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:09:21,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:09:21,096 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) [2022-07-13 03:09:21,097 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 [2022-07-13 03:09:21,099 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 [2022-07-13 03:09:21,104 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:09:21,104 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:09:21,104 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:09:21,104 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:09:21,104 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:09:21,105 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:09:21,105 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:09:21,121 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:09:21,136 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 [2022-07-13 03:09:21,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:09:21,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:09:21,138 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) [2022-07-13 03:09:21,139 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 [2022-07-13 03:09:21,140 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 [2022-07-13 03:09:21,146 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:09:21,146 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:09:21,146 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:09:21,146 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:09:21,146 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:09:21,147 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:09:21,147 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:09:21,159 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 03:09:21,162 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-13 03:09:21,162 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-13 03:09:21,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:09:21,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:09:21,165 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) [2022-07-13 03:09:21,165 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 [2022-07-13 03:09:21,166 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 03:09:21,166 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-13 03:09:21,166 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 03:09:21,167 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_#in~n) = 1*fibonacci_#in~n Supporting invariants [] [2022-07-13 03:09:21,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-07-13 03:09:21,187 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-13 03:09:21,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:09:21,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:09:21,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 03:09:21,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:09:21,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:09:21,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 03:09:21,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:09:21,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:09:21,276 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2022-07-13 03:09:21,277 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:09:21,381 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3). Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 51 states and 63 transitions. Complement of second has 12 states. [2022-07-13 03:09:21,382 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 [2022-07-13 03:09:21,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 03:09:21,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2022-07-13 03:09:21,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 4 letters. Loop has 4 letters. [2022-07-13 03:09:21,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:09:21,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 8 letters. Loop has 4 letters. [2022-07-13 03:09:21,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:09:21,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 4 letters. Loop has 8 letters. [2022-07-13 03:09:21,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:09:21,389 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 63 transitions. [2022-07-13 03:09:21,392 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-13 03:09:21,395 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 26 states and 35 transitions. [2022-07-13 03:09:21,395 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2022-07-13 03:09:21,396 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2022-07-13 03:09:21,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 35 transitions. [2022-07-13 03:09:21,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 03:09:21,396 INFO L369 hiAutomatonCegarLoop]: Abstraction has 26 states and 35 transitions. [2022-07-13 03:09:21,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 35 transitions. [2022-07-13 03:09:21,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2022-07-13 03:09:21,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-07-13 03:09:21,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2022-07-13 03:09:21,413 INFO L392 hiAutomatonCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-07-13 03:09:21,413 INFO L374 stractBuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-07-13 03:09:21,413 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-13 03:09:21,413 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. [2022-07-13 03:09:21,414 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-13 03:09:21,414 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:09:21,414 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:09:21,415 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:09:21,415 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:09:21,415 INFO L752 eck$LassoCheckResult]: Stem: 140#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 141#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 143#L29 assume !(main_~x~0#1 < 1); 131#L31 call main_#t~ret7#1 := fibonacci(main_~x~0#1);< 133#fibonacciENTRY ~n := #in~n; 134#L17 assume !(~n < 1); 139#L19 assume !(1 == ~n); 129#L22 call #t~ret4 := fibonacci(~n - 1);< 135#fibonacciENTRY ~n := #in~n; 136#L17 assume ~n < 1;#res := 0; 137#fibonacciFINAL assume true; 142#fibonacciEXIT >#34#return; 128#L22-1 [2022-07-13 03:09:21,415 INFO L754 eck$LassoCheckResult]: Loop: 128#L22-1 call #t~ret5 := fibonacci(~n - 2);< 132#fibonacciENTRY ~n := #in~n; 148#L17 assume !(~n < 1); 147#L19 assume !(1 == ~n); 130#L22 call #t~ret4 := fibonacci(~n - 1);< 132#fibonacciENTRY ~n := #in~n; 148#L17 assume ~n < 1;#res := 0; 145#fibonacciFINAL assume true; 146#fibonacciEXIT >#34#return; 128#L22-1 [2022-07-13 03:09:21,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:09:21,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1923124650, now seen corresponding path program 1 times [2022-07-13 03:09:21,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:09:21,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77638372] [2022-07-13 03:09:21,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:09:21,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:09:21,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:09:21,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 03:09:21,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:09:21,464 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 03:09:21,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:09:21,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77638372] [2022-07-13 03:09:21,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77638372] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:09:21,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:09:21,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 03:09:21,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217785306] [2022-07-13 03:09:21,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:09:21,467 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-13 03:09:21,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:09:21,467 INFO L85 PathProgramCache]: Analyzing trace with hash 481649848, now seen corresponding path program 1 times [2022-07-13 03:09:21,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:09:21,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887884861] [2022-07-13 03:09:21,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:09:21,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:09:21,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:09:21,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-13 03:09:21,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:09:21,506 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-13 03:09:21,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:09:21,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887884861] [2022-07-13 03:09:21,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887884861] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 03:09:21,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 03:09:21,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 03:09:21,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971620766] [2022-07-13 03:09:21,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 03:09:21,507 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-13 03:09:21,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:09:21,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 03:09:21,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-13 03:09:21,510 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. cyclomatic complexity: 8 Second operand has 6 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 03:09:21,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:09:21,549 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2022-07-13 03:09:21,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 03:09:21,550 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 33 transitions. [2022-07-13 03:09:21,551 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-13 03:09:21,552 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 25 states and 31 transitions. [2022-07-13 03:09:21,552 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2022-07-13 03:09:21,552 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2022-07-13 03:09:21,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 31 transitions. [2022-07-13 03:09:21,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 03:09:21,553 INFO L369 hiAutomatonCegarLoop]: Abstraction has 25 states and 31 transitions. [2022-07-13 03:09:21,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 31 transitions. [2022-07-13 03:09:21,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-07-13 03:09:21,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 19 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2022-07-13 03:09:21,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2022-07-13 03:09:21,555 INFO L392 hiAutomatonCegarLoop]: Abstraction has 25 states and 31 transitions. [2022-07-13 03:09:21,556 INFO L374 stractBuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2022-07-13 03:09:21,556 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-13 03:09:21,561 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. [2022-07-13 03:09:21,565 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-13 03:09:21,565 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:09:21,565 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:09:21,565 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:09:21,566 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2022-07-13 03:09:21,566 INFO L752 eck$LassoCheckResult]: Stem: 215#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 216#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 219#L29 assume !(main_~x~0#1 < 1); 204#L31 call main_#t~ret7#1 := fibonacci(main_~x~0#1);< 221#fibonacciENTRY ~n := #in~n; 210#L17 assume !(~n < 1); 214#L19 assume !(1 == ~n); 205#L22 call #t~ret4 := fibonacci(~n - 1);< 209#fibonacciENTRY ~n := #in~n; 211#L17 assume !(~n < 1); 227#L19 assume 1 == ~n;#res := 1; 226#fibonacciFINAL assume true; 225#fibonacciEXIT >#34#return; 203#L22-1 [2022-07-13 03:09:21,566 INFO L754 eck$LassoCheckResult]: Loop: 203#L22-1 call #t~ret5 := fibonacci(~n - 2);< 207#fibonacciENTRY ~n := #in~n; 208#L17 assume !(~n < 1); 213#L19 assume !(1 == ~n); 206#L22 call #t~ret4 := fibonacci(~n - 1);< 207#fibonacciENTRY ~n := #in~n; 208#L17 assume !(~n < 1); 213#L19 assume !(1 == ~n); 206#L22 call #t~ret4 := fibonacci(~n - 1);< 207#fibonacciENTRY ~n := #in~n; 208#L17 assume !(~n < 1); 213#L19 assume 1 == ~n;#res := 1; 222#fibonacciFINAL assume true; 223#fibonacciEXIT >#34#return; 203#L22-1 call #t~ret5 := fibonacci(~n - 2);< 207#fibonacciENTRY ~n := #in~n; 208#L17 assume ~n < 1;#res := 0; 212#fibonacciFINAL assume true; 217#fibonacciEXIT >#36#return; 218#L22-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 220#fibonacciFINAL assume true; 224#fibonacciEXIT >#34#return; 203#L22-1 [2022-07-13 03:09:21,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:09:21,566 INFO L85 PathProgramCache]: Analyzing trace with hash -512653656, now seen corresponding path program 1 times [2022-07-13 03:09:21,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:09:21,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305400380] [2022-07-13 03:09:21,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:09:21,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:09:21,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:09:21,573 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:09:21,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:09:21,578 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:09:21,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:09:21,579 INFO L85 PathProgramCache]: Analyzing trace with hash 319636608, now seen corresponding path program 1 times [2022-07-13 03:09:21,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:09:21,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816656728] [2022-07-13 03:09:21,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:09:21,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:09:21,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:09:21,590 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:09:21,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:09:21,597 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:09:21,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:09:21,597 INFO L85 PathProgramCache]: Analyzing trace with hash 911295463, now seen corresponding path program 1 times [2022-07-13 03:09:21,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:09:21,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460029134] [2022-07-13 03:09:21,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:09:21,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:09:21,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:09:21,608 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 [2022-07-13 03:09:21,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 03:09:21,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:09:21,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-13 03:09:21,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:09:21,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 03:09:21,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:09:21,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 03:09:21,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:09:21,687 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-13 03:09:21,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:09:21,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460029134] [2022-07-13 03:09:21,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460029134] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:09:21,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170011892] [2022-07-13 03:09:21,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:09:21,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:09:21,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:09:21,695 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 03:09:21,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-13 03:09:21,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:09:21,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 03:09:21,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:09:21,772 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 38 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-07-13 03:09:21,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 03:09:21,841 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-13 03:09:21,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1170011892] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 03:09:21,843 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 03:09:21,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2022-07-13 03:09:21,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693008949] [2022-07-13 03:09:21,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 03:09:22,052 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:09:22,052 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:09:22,052 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:09:22,052 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:09:22,053 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-13 03:09:22,053 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:09:22,053 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:09:22,053 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:09:22,053 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci01-2.c_Iteration3_Loop [2022-07-13 03:09:22,053 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:09:22,053 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:09:22,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:09:22,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:09:22,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:09:22,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:09:22,090 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 03:09:22,090 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-13 03:09:22,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:09:22,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:09:22,096 INFO L229 MonitoredProcess]: Starting monitored process 13 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) [2022-07-13 03:09:22,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-07-13 03:09:22,140 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 03:09:22,140 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 03:09:22,186 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2022-07-13 03:09:22,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:09:22,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:09:22,187 INFO L229 MonitoredProcess]: Starting monitored process 14 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) [2022-07-13 03:09:22,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-07-13 03:09:22,216 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-13 03:09:22,216 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 03:09:22,794 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-13 03:09:22,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-07-13 03:09:22,798 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:09:22,798 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:09:22,798 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:09:22,798 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:09:22,798 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 03:09:22,798 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:09:22,798 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:09:22,798 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:09:22,799 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci01-2.c_Iteration3_Loop [2022-07-13 03:09:22,799 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:09:22,799 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:09:22,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:09:22,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:09:22,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:09:22,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:09:22,861 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 03:09:22,861 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 03:09:22,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:09:22,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:09:22,864 INFO L229 MonitoredProcess]: Starting monitored process 15 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) [2022-07-13 03:09:22,893 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 [2022-07-13 03:09:22,899 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:09:22,899 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:09:22,899 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:09:22,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:09:22,899 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:09:22,900 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:09:22,900 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:09:22,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-07-13 03:09:22,911 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:09:22,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2022-07-13 03:09:22,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:09:22,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:09:22,936 INFO L229 MonitoredProcess]: Starting monitored process 16 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) [2022-07-13 03:09:22,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-07-13 03:09:22,938 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 [2022-07-13 03:09:22,942 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:09:22,943 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:09:22,943 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:09:22,943 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:09:22,943 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:09:22,944 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:09:22,944 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:09:22,960 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:09:22,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-07-13 03:09:22,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:09:22,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:09:22,975 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) [2022-07-13 03:09:22,976 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 [2022-07-13 03:09:22,978 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 [2022-07-13 03:09:22,983 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:09:22,984 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:09:22,984 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:09:22,984 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:09:22,984 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:09:22,985 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:09:22,985 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:09:22,988 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:09:23,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-07-13 03:09:23,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:09:23,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:09:23,006 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) [2022-07-13 03:09:23,007 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 [2022-07-13 03:09:23,008 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 [2022-07-13 03:09:23,013 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:09:23,013 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:09:23,013 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:09:23,013 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:09:23,013 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:09:23,014 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:09:23,014 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:09:23,030 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 03:09:23,033 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-13 03:09:23,033 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-13 03:09:23,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:09:23,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:09:23,034 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) [2022-07-13 03:09:23,035 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 [2022-07-13 03:09:23,036 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 03:09:23,036 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-13 03:09:23,036 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 03:09:23,036 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_~n) = 1*fibonacci_~n Supporting invariants [] [2022-07-13 03:09:23,053 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 [2022-07-13 03:09:23,053 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-13 03:09:23,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:09:23,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:09:23,116 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 03:09:23,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:09:23,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-07-13 03:09:23,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:09:23,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-13 03:09:23,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:09:23,338 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 03:09:23,339 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2022-07-13 03:09:23,339 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 8 Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-13 03:09:23,523 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 31 transitions. cyclomatic complexity: 8. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) Result 160 states and 216 transitions. Complement of second has 48 states. [2022-07-13 03:09:23,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 2 stem states 7 non-accepting loop states 1 accepting loop states [2022-07-13 03:09:23,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-13 03:09:23,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2022-07-13 03:09:23,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 42 transitions. Stem has 13 letters. Loop has 22 letters. [2022-07-13 03:09:23,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:09:23,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 42 transitions. Stem has 35 letters. Loop has 22 letters. [2022-07-13 03:09:23,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:09:23,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 42 transitions. Stem has 13 letters. Loop has 44 letters. [2022-07-13 03:09:23,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:09:23,537 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 160 states and 216 transitions. [2022-07-13 03:09:23,541 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2022-07-13 03:09:23,544 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 160 states to 129 states and 181 transitions. [2022-07-13 03:09:23,544 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 75 [2022-07-13 03:09:23,545 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 80 [2022-07-13 03:09:23,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 129 states and 181 transitions. [2022-07-13 03:09:23,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 03:09:23,545 INFO L369 hiAutomatonCegarLoop]: Abstraction has 129 states and 181 transitions. [2022-07-13 03:09:23,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states and 181 transitions. [2022-07-13 03:09:23,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 107. [2022-07-13 03:09:23,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 67 states have (on average 1.2238805970149254) internal successors, (82), 71 states have internal predecessors, (82), 25 states have call successors, (26), 13 states have call predecessors, (26), 15 states have return successors, (33), 22 states have call predecessors, (33), 23 states have call successors, (33) [2022-07-13 03:09:23,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 141 transitions. [2022-07-13 03:09:23,554 INFO L392 hiAutomatonCegarLoop]: Abstraction has 107 states and 141 transitions. [2022-07-13 03:09:23,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:09:23,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 03:09:23,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-07-13 03:09:23,555 INFO L87 Difference]: Start difference. First operand 107 states and 141 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-13 03:09:23,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:09:23,593 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2022-07-13 03:09:23,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 03:09:23,594 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 58 transitions. [2022-07-13 03:09:23,595 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-13 03:09:23,595 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 42 states and 54 transitions. [2022-07-13 03:09:23,596 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2022-07-13 03:09:23,596 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2022-07-13 03:09:23,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 54 transitions. [2022-07-13 03:09:23,596 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 03:09:23,602 INFO L369 hiAutomatonCegarLoop]: Abstraction has 42 states and 54 transitions. [2022-07-13 03:09:23,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 54 transitions. [2022-07-13 03:09:23,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2022-07-13 03:09:23,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 28 states have internal predecessors, (29), 7 states have call successors, (7), 5 states have call predecessors, (7), 6 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) [2022-07-13 03:09:23,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2022-07-13 03:09:23,607 INFO L392 hiAutomatonCegarLoop]: Abstraction has 39 states and 48 transitions. [2022-07-13 03:09:23,608 INFO L374 stractBuchiCegarLoop]: Abstraction has 39 states and 48 transitions. [2022-07-13 03:09:23,608 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-13 03:09:23,608 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 48 transitions. [2022-07-13 03:09:23,609 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-13 03:09:23,609 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:09:23,609 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:09:23,610 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 03:09:23,611 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2022-07-13 03:09:23,611 INFO L752 eck$LassoCheckResult]: Stem: 991#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 992#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 995#L29 assume !(main_~x~0#1 < 1); 981#L31 call main_#t~ret7#1 := fibonacci(main_~x~0#1);< 983#fibonacciENTRY ~n := #in~n; 984#L17 assume !(~n < 1); 990#L19 assume !(1 == ~n); 980#L22 call #t~ret4 := fibonacci(~n - 1);< 982#fibonacciENTRY ~n := #in~n; 986#L17 assume !(~n < 1); 1013#L19 assume !(1 == ~n); 985#L22 call #t~ret4 := fibonacci(~n - 1);< 982#fibonacciENTRY ~n := #in~n; 987#L17 assume !(~n < 1); 997#L19 assume 1 == ~n;#res := 1; 998#fibonacciFINAL assume true; 1012#fibonacciEXIT >#34#return; 1007#L22-1 call #t~ret5 := fibonacci(~n - 2);< 1008#fibonacciENTRY ~n := #in~n; 1011#L17 assume ~n < 1;#res := 0; 1009#fibonacciFINAL assume true; 1006#fibonacciEXIT >#36#return; 1005#L22-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 1004#fibonacciFINAL assume true; 1003#fibonacciEXIT >#34#return; 977#L22-1 [2022-07-13 03:09:23,611 INFO L754 eck$LassoCheckResult]: Loop: 977#L22-1 call #t~ret5 := fibonacci(~n - 2);< 979#fibonacciENTRY ~n := #in~n; 1002#L17 assume !(~n < 1); 1000#L19 assume !(1 == ~n); 976#L22 call #t~ret4 := fibonacci(~n - 1);< 979#fibonacciENTRY ~n := #in~n; 1002#L17 assume !(~n < 1); 1000#L19 assume !(1 == ~n); 976#L22 call #t~ret4 := fibonacci(~n - 1);< 979#fibonacciENTRY ~n := #in~n; 1002#L17 assume !(~n < 1); 1000#L19 assume 1 == ~n;#res := 1; 1001#fibonacciFINAL assume true; 1010#fibonacciEXIT >#34#return; 975#L22-1 call #t~ret5 := fibonacci(~n - 2);< 978#fibonacciENTRY ~n := #in~n; 988#L17 assume ~n < 1;#res := 0; 989#fibonacciFINAL assume true; 993#fibonacciEXIT >#36#return; 994#L22-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 996#fibonacciFINAL assume true; 999#fibonacciEXIT >#34#return; 977#L22-1 [2022-07-13 03:09:23,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:09:23,611 INFO L85 PathProgramCache]: Analyzing trace with hash 506180814, now seen corresponding path program 2 times [2022-07-13 03:09:23,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:09:23,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175496361] [2022-07-13 03:09:23,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:09:23,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:09:23,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:09:23,618 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:09:23,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:09:23,632 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:09:23,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:09:23,632 INFO L85 PathProgramCache]: Analyzing trace with hash 319636608, now seen corresponding path program 2 times [2022-07-13 03:09:23,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:09:23,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915988601] [2022-07-13 03:09:23,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:09:23,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:09:23,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:09:23,641 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:09:23,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:09:23,650 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:09:23,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:09:23,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1200508531, now seen corresponding path program 3 times [2022-07-13 03:09:23,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:09:23,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174856641] [2022-07-13 03:09:23,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:09:23,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:09:23,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:09:23,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 03:09:23,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:09:23,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 03:09:23,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:09:23,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 03:09:23,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:09:23,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-13 03:09:23,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:09:23,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 03:09:23,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:09:23,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 03:09:23,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:09:23,741 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 16 proven. 46 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-07-13 03:09:23,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:09:23,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174856641] [2022-07-13 03:09:23,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174856641] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:09:23,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537796605] [2022-07-13 03:09:23,741 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 03:09:23,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:09:23,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:09:23,742 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 03:09:23,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-07-13 03:09:23,774 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-07-13 03:09:23,775 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 03:09:23,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-13 03:09:23,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:09:23,859 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 35 proven. 47 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-13 03:09:23,859 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 03:09:24,076 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 35 proven. 49 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-13 03:09:24,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1537796605] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 03:09:24,076 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 03:09:24,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 12] total 21 [2022-07-13 03:09:24,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687328893] [2022-07-13 03:09:24,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 03:09:24,254 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:09:24,254 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:09:24,254 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:09:24,254 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:09:24,254 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-13 03:09:24,255 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:09:24,255 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:09:24,255 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:09:24,255 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci01-2.c_Iteration4_Loop [2022-07-13 03:09:24,255 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:09:24,256 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:09:24,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:09:24,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:09:24,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:09:24,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:09:24,304 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 03:09:24,304 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-13 03:09:24,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:09:24,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:09:24,311 INFO L229 MonitoredProcess]: Starting monitored process 21 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) [2022-07-13 03:09:24,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-07-13 03:09:24,344 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 03:09:24,344 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 03:09:24,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2022-07-13 03:09:24,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:09:24,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:09:24,396 INFO L229 MonitoredProcess]: Starting monitored process 22 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) [2022-07-13 03:09:24,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-07-13 03:09:24,399 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-13 03:09:24,399 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 03:09:24,976 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-13 03:09:24,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-07-13 03:09:24,982 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:09:24,982 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:09:24,982 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:09:24,982 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:09:24,982 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 03:09:24,982 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:09:24,982 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:09:24,982 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:09:24,982 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci01-2.c_Iteration4_Loop [2022-07-13 03:09:24,982 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:09:24,982 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:09:24,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:09:24,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:09:24,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:09:25,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:09:25,051 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 03:09:25,052 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 03:09:25,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:09:25,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:09:25,056 INFO L229 MonitoredProcess]: Starting monitored process 23 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) [2022-07-13 03:09:25,059 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 [2022-07-13 03:09:25,064 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:09:25,065 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:09:25,065 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:09:25,065 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:09:25,065 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:09:25,066 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:09:25,066 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:09:25,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-07-13 03:09:25,083 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 03:09:25,087 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-13 03:09:25,087 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-13 03:09:25,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:09:25,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:09:25,099 INFO L229 MonitoredProcess]: Starting monitored process 24 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) [2022-07-13 03:09:25,120 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 03:09:25,120 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-13 03:09:25,120 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 03:09:25,120 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_~n) = 1*fibonacci_~n Supporting invariants [] [2022-07-13 03:09:25,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-07-13 03:09:25,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2022-07-13 03:09:25,154 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-13 03:09:25,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:09:25,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:09:25,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 03:09:25,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:09:25,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2022-07-13 03:09:25,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:09:25,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-13 03:09:25,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:09:25,482 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 03:09:25,482 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2022-07-13 03:09:25,483 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 48 transitions. cyclomatic complexity: 11 Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-13 03:09:25,566 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 48 transitions. cyclomatic complexity: 11. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Result 46 states and 55 transitions. Complement of second has 11 states. [2022-07-13 03:09:25,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2022-07-13 03:09:25,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-13 03:09:25,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2022-07-13 03:09:25,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 25 letters. Loop has 22 letters. [2022-07-13 03:09:25,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:09:25,569 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-13 03:09:25,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:09:25,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:09:25,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 03:09:25,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:09:25,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:09:25,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-13 03:09:25,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:09:25,802 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 03:09:25,803 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 7 loop predicates [2022-07-13 03:09:25,803 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 48 transitions. cyclomatic complexity: 11 Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-13 03:09:25,866 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 48 transitions. cyclomatic complexity: 11. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Result 46 states and 55 transitions. Complement of second has 11 states. [2022-07-13 03:09:25,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2022-07-13 03:09:25,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-13 03:09:25,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2022-07-13 03:09:25,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 25 letters. Loop has 22 letters. [2022-07-13 03:09:25,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:09:25,868 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-13 03:09:25,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:09:25,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:09:25,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 03:09:25,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:09:26,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:09:26,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-13 03:09:26,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:09:26,106 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 03:09:26,106 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 7 loop predicates [2022-07-13 03:09:26,106 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 48 transitions. cyclomatic complexity: 11 Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-13 03:09:26,280 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 48 transitions. cyclomatic complexity: 11. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Result 345 states and 444 transitions. Complement of second has 125 states. [2022-07-13 03:09:26,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 2 stem states 7 non-accepting loop states 1 accepting loop states [2022-07-13 03:09:26,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 6 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-13 03:09:26,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 47 transitions. [2022-07-13 03:09:26,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 47 transitions. Stem has 25 letters. Loop has 22 letters. [2022-07-13 03:09:26,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:09:26,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 47 transitions. Stem has 47 letters. Loop has 22 letters. [2022-07-13 03:09:26,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:09:26,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 47 transitions. Stem has 25 letters. Loop has 44 letters. [2022-07-13 03:09:26,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:09:26,283 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 345 states and 444 transitions. [2022-07-13 03:09:26,287 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2022-07-13 03:09:26,290 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 345 states to 220 states and 297 transitions. [2022-07-13 03:09:26,290 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 99 [2022-07-13 03:09:26,290 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2022-07-13 03:09:26,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 220 states and 297 transitions. [2022-07-13 03:09:26,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 03:09:26,291 INFO L369 hiAutomatonCegarLoop]: Abstraction has 220 states and 297 transitions. [2022-07-13 03:09:26,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states and 297 transitions. [2022-07-13 03:09:26,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 172. [2022-07-13 03:09:26,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 107 states have (on average 1.1401869158878504) internal successors, (122), 112 states have internal predecessors, (122), 38 states have call successors, (42), 23 states have call predecessors, (42), 27 states have return successors, (59), 36 states have call predecessors, (59), 36 states have call successors, (59) [2022-07-13 03:09:26,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 223 transitions. [2022-07-13 03:09:26,301 INFO L392 hiAutomatonCegarLoop]: Abstraction has 172 states and 223 transitions. [2022-07-13 03:09:26,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:09:26,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-13 03:09:26,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2022-07-13 03:09:26,302 INFO L87 Difference]: Start difference. First operand 172 states and 223 transitions. Second operand has 21 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 18 states have internal predecessors, (50), 13 states have call successors, (17), 3 states have call predecessors, (17), 7 states have return successors, (16), 10 states have call predecessors, (16), 11 states have call successors, (16) [2022-07-13 03:09:26,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:09:26,508 INFO L93 Difference]: Finished difference Result 349 states and 503 transitions. [2022-07-13 03:09:26,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-13 03:09:26,510 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 349 states and 503 transitions. [2022-07-13 03:09:26,514 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2022-07-13 03:09:26,518 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 349 states to 339 states and 490 transitions. [2022-07-13 03:09:26,518 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 173 [2022-07-13 03:09:26,519 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 193 [2022-07-13 03:09:26,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 339 states and 490 transitions. [2022-07-13 03:09:26,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 03:09:26,519 INFO L369 hiAutomatonCegarLoop]: Abstraction has 339 states and 490 transitions. [2022-07-13 03:09:26,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states and 490 transitions. [2022-07-13 03:09:26,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 274. [2022-07-13 03:09:26,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 171 states have (on average 1.128654970760234) internal successors, (193), 174 states have internal predecessors, (193), 60 states have call successors, (72), 36 states have call predecessors, (72), 43 states have return successors, (136), 63 states have call predecessors, (136), 58 states have call successors, (136) [2022-07-13 03:09:26,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 401 transitions. [2022-07-13 03:09:26,533 INFO L392 hiAutomatonCegarLoop]: Abstraction has 274 states and 401 transitions. [2022-07-13 03:09:26,533 INFO L374 stractBuchiCegarLoop]: Abstraction has 274 states and 401 transitions. [2022-07-13 03:09:26,533 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-13 03:09:26,533 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 274 states and 401 transitions. [2022-07-13 03:09:26,534 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2022-07-13 03:09:26,534 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-13 03:09:26,534 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-13 03:09:26,535 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [12, 10, 9, 7, 7, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1] [2022-07-13 03:09:26,535 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-13 03:09:26,535 INFO L752 eck$LassoCheckResult]: Stem: 3005#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 3006#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet6#1, main_#t~ret7#1, main_~x~0#1, main_~result~0#1;main_~x~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1; 3010#L29 assume !(main_~x~0#1 < 1); 3011#L31 call main_#t~ret7#1 := fibonacci(main_~x~0#1);< 3015#fibonacciENTRY ~n := #in~n; 3048#L17 assume !(~n < 1); 3046#L19 assume !(1 == ~n); 3038#L22 call #t~ret4 := fibonacci(~n - 1);< 3041#fibonacciENTRY ~n := #in~n; 3047#L17 assume !(~n < 1); 3045#L19 assume !(1 == ~n); 3039#L22 call #t~ret4 := fibonacci(~n - 1);< 3041#fibonacciENTRY ~n := #in~n; 3047#L17 assume !(~n < 1); 3045#L19 assume !(1 == ~n); 3039#L22 call #t~ret4 := fibonacci(~n - 1);< 3041#fibonacciENTRY ~n := #in~n; 3047#L17 assume !(~n < 1); 3045#L19 assume !(1 == ~n); 3039#L22 call #t~ret4 := fibonacci(~n - 1);< 3041#fibonacciENTRY ~n := #in~n; 3049#L17 assume !(~n < 1); 3145#L19 assume 1 == ~n;#res := 1; 3144#fibonacciFINAL assume true; 3142#fibonacciEXIT >#34#return; 3135#L22-1 call #t~ret5 := fibonacci(~n - 2);< 3137#fibonacciENTRY ~n := #in~n; 3143#L17 assume ~n < 1;#res := 0; 3138#fibonacciFINAL assume true; 3134#fibonacciEXIT >#36#return; 3133#L22-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 3132#fibonacciFINAL assume true; 3129#fibonacciEXIT >#34#return; 3077#L22-1 call #t~ret5 := fibonacci(~n - 2);< 3079#fibonacciENTRY ~n := #in~n; 3127#L17 assume !(~n < 1); 3123#L19 assume 1 == ~n;#res := 1; 3026#fibonacciFINAL assume true; 3076#fibonacciEXIT >#36#return; 3072#L22-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 3064#fibonacciFINAL assume true; 3054#fibonacciEXIT >#34#return; 3053#L22-1 call #t~ret5 := fibonacci(~n - 2);< 3056#fibonacciENTRY ~n := #in~n; 3128#L17 assume !(~n < 1); 3124#L19 assume !(1 == ~n); 3125#L22 call #t~ret4 := fibonacci(~n - 1);< 3238#fibonacciENTRY ~n := #in~n; 3185#L17 assume !(~n < 1); 3186#L19 assume 1 == ~n;#res := 1; 3239#fibonacciFINAL assume true; 3236#fibonacciEXIT >#34#return; 3068#L22-1 call #t~ret5 := fibonacci(~n - 2);< 3071#fibonacciENTRY ~n := #in~n; 3130#L17 assume ~n < 1;#res := 0; 3081#fibonacciFINAL assume true; 3067#fibonacciEXIT >#36#return; 3070#L22-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 3063#fibonacciFINAL assume true; 3052#fibonacciEXIT >#36#return; 3040#L22-2 #res := #t~ret4 + #t~ret5;havoc #t~ret4;havoc #t~ret5; 3043#fibonacciFINAL assume true; 3037#fibonacciEXIT >#34#return; 3025#L22-1 call #t~ret5 := fibonacci(~n - 2);< 3031#fibonacciENTRY ~n := #in~n; 3032#L17 assume !(~n < 1); 3023#L19 assume !(1 == ~n); 2996#L22 call #t~ret4 := fibonacci(~n - 1);< 3235#fibonacciENTRY ~n := #in~n; 2994#L17 assume !(~n < 1); 2997#L19 assume !(1 == ~n); 3206#L22 call #t~ret4 := fibonacci(~n - 1);< 3207#fibonacciENTRY [2022-07-13 03:09:26,536 INFO L754 eck$LassoCheckResult]: Loop: 3207#fibonacciENTRY ~n := #in~n; 3218#L17 assume !(~n < 1); 3215#L19 assume !(1 == ~n); 3205#L22 call #t~ret4 := fibonacci(~n - 1);< 3207#fibonacciENTRY [2022-07-13 03:09:26,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:09:26,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1489009265, now seen corresponding path program 4 times [2022-07-13 03:09:26,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:09:26,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432331949] [2022-07-13 03:09:26,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:09:26,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:09:26,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:09:26,547 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:09:26,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:09:26,559 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:09:26,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:09:26,559 INFO L85 PathProgramCache]: Analyzing trace with hash 927646, now seen corresponding path program 2 times [2022-07-13 03:09:26,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:09:26,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787227362] [2022-07-13 03:09:26,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:09:26,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:09:26,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:09:26,560 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 03:09:26,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 03:09:26,561 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 03:09:26,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:09:26,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1238644268, now seen corresponding path program 5 times [2022-07-13 03:09:26,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 03:09:26,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789880006] [2022-07-13 03:09:26,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 03:09:26,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 03:09:26,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:09:26,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-13 03:09:26,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:09:26,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 03:09:26,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:09:26,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 03:09:26,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:09:26,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 03:09:26,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:09:26,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 03:09:26,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:09:26,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 03:09:26,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:09:26,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-13 03:09:26,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:09:26,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-13 03:09:26,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:09:26,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-13 03:09:26,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:09:26,703 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 110 proven. 115 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-07-13 03:09:26,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 03:09:26,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789880006] [2022-07-13 03:09:26,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789880006] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 03:09:26,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236117364] [2022-07-13 03:09:26,703 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-13 03:09:26,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 03:09:26,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:09:26,704 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 03:09:26,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-07-13 03:09:26,741 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2022-07-13 03:09:26,741 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 03:09:26,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-13 03:09:26,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:09:26,807 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 115 proven. 109 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-07-13 03:09:26,807 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 03:09:27,136 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 115 proven. 121 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-07-13 03:09:27,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236117364] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 03:09:27,136 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 03:09:27,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 16] total 21 [2022-07-13 03:09:27,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429827104] [2022-07-13 03:09:27,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 03:09:27,161 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:09:27,161 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:09:27,161 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:09:27,161 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:09:27,161 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-13 03:09:27,161 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:09:27,161 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:09:27,161 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:09:27,161 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci01-2.c_Iteration5_Loop [2022-07-13 03:09:27,161 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:09:27,161 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:09:27,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:09:27,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:09:27,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:09:27,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:09:27,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:09:27,190 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 03:09:27,191 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-13 03:09:27,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:09:27,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:09:27,192 INFO L229 MonitoredProcess]: Starting monitored process 26 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) [2022-07-13 03:09:27,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-07-13 03:09:27,194 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 03:09:27,194 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 03:09:27,215 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-13 03:09:27,215 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#t~ret4=0} Honda state: {fibonacci_#t~ret4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-13 03:09:27,230 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-07-13 03:09:27,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:09:27,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:09:27,232 INFO L229 MonitoredProcess]: Starting monitored process 27 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) [2022-07-13 03:09:27,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-07-13 03:09:27,235 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 03:09:27,235 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 03:09:27,255 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-13 03:09:27,255 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#res=0} Honda state: {fibonacci_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-13 03:09:27,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-07-13 03:09:27,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:09:27,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:09:27,274 INFO L229 MonitoredProcess]: Starting monitored process 28 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) [2022-07-13 03:09:27,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-07-13 03:09:27,276 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-13 03:09:27,276 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 03:09:27,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-07-13 03:09:27,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:09:27,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:09:27,314 INFO L229 MonitoredProcess]: Starting monitored process 29 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) [2022-07-13 03:09:27,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-07-13 03:09:27,316 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-13 03:09:27,316 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-13 03:09:27,345 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-13 03:09:27,349 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-07-13 03:09:27,349 INFO L210 LassoAnalysis]: Preferences: [2022-07-13 03:09:27,349 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-13 03:09:27,349 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-13 03:09:27,349 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-13 03:09:27,349 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-13 03:09:27,349 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:09:27,350 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-13 03:09:27,350 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-13 03:09:27,350 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci01-2.c_Iteration5_Loop [2022-07-13 03:09:27,350 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-13 03:09:27,350 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-13 03:09:27,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:09:27,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:09:27,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:09:27,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:09:27,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-13 03:09:27,387 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-13 03:09:27,387 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-13 03:09:27,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:09:27,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:09:27,388 INFO L229 MonitoredProcess]: Starting monitored process 30 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) [2022-07-13 03:09:27,403 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 [2022-07-13 03:09:27,410 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:09:27,410 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:09:27,410 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:09:27,410 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:09:27,410 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:09:27,411 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:09:27,411 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:09:27,414 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:09:27,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-07-13 03:09:27,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2022-07-13 03:09:27,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:09:27,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:09:27,430 INFO L229 MonitoredProcess]: Starting monitored process 31 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) [2022-07-13 03:09:27,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-07-13 03:09:27,433 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 [2022-07-13 03:09:27,437 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:09:27,438 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:09:27,438 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:09:27,438 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:09:27,438 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:09:27,438 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:09:27,438 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:09:27,445 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-13 03:09:27,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2022-07-13 03:09:27,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:09:27,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:09:27,463 INFO L229 MonitoredProcess]: Starting monitored process 32 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) [2022-07-13 03:09:27,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-07-13 03:09:27,467 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 [2022-07-13 03:09:27,472 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-13 03:09:27,472 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-13 03:09:27,473 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-13 03:09:27,473 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-13 03:09:27,473 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-13 03:09:27,473 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-13 03:09:27,473 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-13 03:09:27,475 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-13 03:09:27,476 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2022-07-13 03:09:27,477 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-13 03:09:27,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-13 03:09:27,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 03:09:27,482 INFO L229 MonitoredProcess]: Starting monitored process 33 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) [2022-07-13 03:09:27,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2022-07-13 03:09:27,490 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-13 03:09:27,490 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-13 03:09:27,490 INFO L513 LassoAnalysis]: Proved termination. [2022-07-13 03:09:27,490 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_#in~n) = 1*fibonacci_#in~n Supporting invariants [] [2022-07-13 03:09:27,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2022-07-13 03:09:27,506 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-13 03:09:27,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:09:27,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:09:27,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-13 03:09:27,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:09:27,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:09:27,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 03:09:27,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:09:27,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:09:27,980 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2022-07-13 03:09:27,980 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 274 states and 401 transitions. cyclomatic complexity: 131 Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 03:09:28,020 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 274 states and 401 transitions. cyclomatic complexity: 131. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Result 296 states and 427 transitions. Complement of second has 13 states. [2022-07-13 03:09:28,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-13 03:09:28,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 03:09:28,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2022-07-13 03:09:28,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 72 letters. Loop has 4 letters. [2022-07-13 03:09:28,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:09:28,021 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-13 03:09:28,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:09:28,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2022-07-13 03:09:28,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:09:28,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-13 03:09:28,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:09:28,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:09:28,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 03:09:28,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:09:28,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:09:28,425 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2022-07-13 03:09:28,426 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 274 states and 401 transitions. cyclomatic complexity: 131 Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 03:09:28,465 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 274 states and 401 transitions. cyclomatic complexity: 131. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Result 296 states and 427 transitions. Complement of second has 13 states. [2022-07-13 03:09:28,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-13 03:09:28,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 03:09:28,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2022-07-13 03:09:28,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 72 letters. Loop has 4 letters. [2022-07-13 03:09:28,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:09:28,466 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-13 03:09:28,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 03:09:28,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:09:28,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-13 03:09:28,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:09:28,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 03:09:28,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 03:09:28,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 03:09:28,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 03:09:28,873 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2022-07-13 03:09:28,873 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 274 states and 401 transitions. cyclomatic complexity: 131 Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 03:09:28,922 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 274 states and 401 transitions. cyclomatic complexity: 131. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Result 349 states and 484 transitions. Complement of second has 14 states. [2022-07-13 03:09:28,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-13 03:09:28,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 3 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-13 03:09:28,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2022-07-13 03:09:28,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 72 letters. Loop has 4 letters. [2022-07-13 03:09:28,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:09:28,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 76 letters. Loop has 4 letters. [2022-07-13 03:09:28,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:09:28,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 72 letters. Loop has 8 letters. [2022-07-13 03:09:28,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-13 03:09:28,924 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 349 states and 484 transitions. [2022-07-13 03:09:28,927 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2022-07-13 03:09:28,929 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 349 states to 288 states and 417 transitions. [2022-07-13 03:09:28,929 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 138 [2022-07-13 03:09:28,929 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 143 [2022-07-13 03:09:28,930 INFO L73 IsDeterministic]: Start isDeterministic. Operand 288 states and 417 transitions. [2022-07-13 03:09:28,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-13 03:09:28,930 INFO L369 hiAutomatonCegarLoop]: Abstraction has 288 states and 417 transitions. [2022-07-13 03:09:28,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states and 417 transitions. [2022-07-13 03:09:28,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 280. [2022-07-13 03:09:28,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 176 states have (on average 1.125) internal successors, (198), 179 states have internal predecessors, (198), 61 states have call successors, (73), 37 states have call predecessors, (73), 43 states have return successors, (138), 63 states have call predecessors, (138), 59 states have call successors, (138) [2022-07-13 03:09:28,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 409 transitions. [2022-07-13 03:09:28,940 INFO L392 hiAutomatonCegarLoop]: Abstraction has 280 states and 409 transitions. [2022-07-13 03:09:28,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 03:09:28,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-13 03:09:28,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2022-07-13 03:09:28,941 INFO L87 Difference]: Start difference. First operand 280 states and 409 transitions. Second operand has 21 states, 16 states have (on average 2.875) internal successors, (46), 17 states have internal predecessors, (46), 15 states have call successors, (19), 5 states have call predecessors, (19), 6 states have return successors, (19), 10 states have call predecessors, (19), 11 states have call successors, (19) [2022-07-13 03:09:29,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 03:09:29,053 INFO L93 Difference]: Finished difference Result 408 states and 601 transitions. [2022-07-13 03:09:29,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 03:09:29,054 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 408 states and 601 transitions. [2022-07-13 03:09:29,057 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-13 03:09:29,057 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 408 states to 0 states and 0 transitions. [2022-07-13 03:09:29,057 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-13 03:09:29,057 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-13 03:09:29,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-13 03:09:29,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-13 03:09:29,058 INFO L369 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-13 03:09:29,058 INFO L392 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-13 03:09:29,058 INFO L374 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-13 03:09:29,058 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-13 03:09:29,058 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-07-13 03:09:29,058 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-13 03:09:29,058 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-07-13 03:09:29,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.07 03:09:29 BoogieIcfgContainer [2022-07-13 03:09:29,062 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-13 03:09:29,062 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 03:09:29,062 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 03:09:29,063 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 03:09:29,063 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 03:09:20" (3/4) ... [2022-07-13 03:09:29,065 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-13 03:09:29,065 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 03:09:29,066 INFO L158 Benchmark]: Toolchain (without parser) took 9210.59ms. Allocated memory was 96.5MB in the beginning and 172.0MB in the end (delta: 75.5MB). Free memory was 64.3MB in the beginning and 49.5MB in the end (delta: 14.8MB). Peak memory consumption was 89.4MB. Max. memory is 16.1GB. [2022-07-13 03:09:29,066 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 96.5MB. Free memory is still 51.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 03:09:29,069 INFO L158 Benchmark]: CACSL2BoogieTranslator took 162.50ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 64.1MB in the beginning and 92.1MB in the end (delta: -28.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 03:09:29,069 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.48ms. Allocated memory is still 117.4MB. Free memory was 92.1MB in the beginning and 90.8MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 03:09:29,069 INFO L158 Benchmark]: Boogie Preprocessor took 13.15ms. Allocated memory is still 117.4MB. Free memory was 90.8MB in the beginning and 90.0MB in the end (delta: 837.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 03:09:29,070 INFO L158 Benchmark]: RCFGBuilder took 177.86ms. Allocated memory is still 117.4MB. Free memory was 90.0MB in the beginning and 81.2MB in the end (delta: 8.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 03:09:29,070 INFO L158 Benchmark]: BuchiAutomizer took 8827.50ms. Allocated memory was 117.4MB in the beginning and 172.0MB in the end (delta: 54.5MB). Free memory was 81.2MB in the beginning and 50.6MB in the end (delta: 30.7MB). Peak memory consumption was 88.4MB. Max. memory is 16.1GB. [2022-07-13 03:09:29,070 INFO L158 Benchmark]: Witness Printer took 2.67ms. Allocated memory is still 172.0MB. Free memory was 50.6MB in the beginning and 49.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 03:09:29,071 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 96.5MB. Free memory is still 51.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 162.50ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 64.1MB in the beginning and 92.1MB in the end (delta: -28.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.48ms. Allocated memory is still 117.4MB. Free memory was 92.1MB in the beginning and 90.8MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 13.15ms. Allocated memory is still 117.4MB. Free memory was 90.8MB in the beginning and 90.0MB in the end (delta: 837.3kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 177.86ms. Allocated memory is still 117.4MB. Free memory was 90.0MB in the beginning and 81.2MB in the end (delta: 8.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 8827.50ms. Allocated memory was 117.4MB in the beginning and 172.0MB in the end (delta: 54.5MB). Free memory was 81.2MB in the beginning and 50.6MB in the end (delta: 30.7MB). Peak memory consumption was 88.4MB. Max. memory is 16.1GB. * Witness Printer took 2.67ms. Allocated memory is still 172.0MB. Free memory was 50.6MB in the beginning and 49.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (4 trivial, 2 deterministic, 2 nondeterministic). One deterministic module has affine ranking function \old(n) and consists of 4 locations. One deterministic module has affine ranking function n and consists of 10 locations. One nondeterministic module has affine ranking function n and consists of 10 locations. One nondeterministic module has affine ranking function \old(n) and consists of 5 locations. 4 modules have a trivial ranking function, the largest among these consists of 21 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.7s and 6 iterations. TraceHistogramMax:12. Analysis of lassos took 4.9s. Construction of modules took 0.4s. Büchi inclusion checks took 3.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 7. Automata minimization 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 151 StatesRemovedByMinimization, 6 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, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 16/46 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 471 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 442 mSDsluCounter, 379 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 223 mSDsCounter, 318 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 716 IncrementalHoareTripleChecker+Invalid, 1034 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 318 mSolverCounterUnsat, 156 mSDtfsCounter, 716 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT3 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital20 mio100 ax100 hnf100 lsp93 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq179 hnf94 smp69 dnf100 smp100 tf110 neg96 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 37ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.6s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-07-13 03:09:29,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-07-13 03:09:29,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-07-13 03:09:29,523 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-07-13 03:09:29,748 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