./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 f4b24e32 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-?-f4b24e3 [2022-07-14 14:50:34,019 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 14:50:34,021 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 14:50:34,069 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 14:50:34,070 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 14:50:34,072 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 14:50:34,074 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 14:50:34,077 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 14:50:34,078 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 14:50:34,083 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 14:50:34,084 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 14:50:34,086 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 14:50:34,086 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 14:50:34,088 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 14:50:34,089 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 14:50:34,092 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 14:50:34,093 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 14:50:34,094 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 14:50:34,096 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 14:50:34,101 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 14:50:34,104 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 14:50:34,105 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 14:50:34,105 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 14:50:34,106 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 14:50:34,108 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 14:50:34,109 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 14:50:34,110 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 14:50:34,110 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 14:50:34,110 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 14:50:34,111 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 14:50:34,111 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 14:50:34,111 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 14:50:34,112 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 14:50:34,113 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 14:50:34,113 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 14:50:34,114 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 14:50:34,114 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 14:50:34,114 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 14:50:34,114 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 14:50:34,114 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 14:50:34,115 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 14:50:34,121 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 14:50:34,122 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-07-14 14:50:34,151 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 14:50:34,152 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 14:50:34,152 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 14:50:34,152 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 14:50:34,154 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 14:50:34,154 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 14:50:34,154 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 14:50:34,155 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-14 14:50:34,155 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-14 14:50:34,156 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-14 14:50:34,156 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-14 14:50:34,156 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-14 14:50:34,156 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-14 14:50:34,157 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 14:50:34,157 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 14:50:34,157 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 14:50:34,157 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 14:50:34,157 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-14 14:50:34,158 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-14 14:50:34,158 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-14 14:50:34,158 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 14:50:34,158 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-14 14:50:34,158 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 14:50:34,158 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-14 14:50:34,159 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 14:50:34,159 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 14:50:34,159 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 14:50:34,159 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 14:50:34,161 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-14 14:50:34,161 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-14 14:50:34,357 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 14:50:34,386 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 14:50:34,390 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 14:50:34,391 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 14:50:34,391 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 14:50:34,393 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-14 14:50:34,449 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c4e30364/b47a3e0886704eda81263a2bf27b22b2/FLAG157913efb [2022-07-14 14:50:34,793 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 14:50:34,794 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-numeric/Fibonacci01-2.c [2022-07-14 14:50:34,799 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c4e30364/b47a3e0886704eda81263a2bf27b22b2/FLAG157913efb [2022-07-14 14:50:35,226 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c4e30364/b47a3e0886704eda81263a2bf27b22b2 [2022-07-14 14:50:35,228 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 14:50:35,230 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 14:50:35,231 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 14:50:35,231 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 14:50:35,234 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 14:50:35,235 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 02:50:35" (1/1) ... [2022-07-14 14:50:35,236 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3501e11b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:50:35, skipping insertion in model container [2022-07-14 14:50:35,236 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 02:50:35" (1/1) ... [2022-07-14 14:50:35,242 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 14:50:35,251 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 14:50:35,447 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-14 14:50:35,447 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 14:50:35,463 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 14:50:35,477 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-14 14:50:35,478 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 14:50:35,491 INFO L208 MainTranslator]: Completed translation [2022-07-14 14:50:35,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:50:35 WrapperNode [2022-07-14 14:50:35,493 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 14:50:35,494 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 14:50:35,495 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 14:50:35,495 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 14:50:35,501 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:50:35" (1/1) ... [2022-07-14 14:50:35,507 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:50:35" (1/1) ... [2022-07-14 14:50:35,521 INFO L137 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 24 [2022-07-14 14:50:35,522 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 14:50:35,523 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 14:50:35,523 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 14:50:35,523 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 14:50:35,529 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:50:35" (1/1) ... [2022-07-14 14:50:35,529 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:50:35" (1/1) ... [2022-07-14 14:50:35,531 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:50:35" (1/1) ... [2022-07-14 14:50:35,531 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:50:35" (1/1) ... [2022-07-14 14:50:35,534 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:50:35" (1/1) ... [2022-07-14 14:50:35,536 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:50:35" (1/1) ... [2022-07-14 14:50:35,540 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:50:35" (1/1) ... [2022-07-14 14:50:35,542 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 14:50:35,544 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 14:50:35,544 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 14:50:35,544 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 14:50:35,545 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:50:35" (1/1) ... [2022-07-14 14:50:35,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:50:35,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:50:35,575 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-14 14:50:35,595 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-14 14:50:35,623 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2022-07-14 14:50:35,623 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2022-07-14 14:50:35,624 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 14:50:35,624 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 14:50:35,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 14:50:35,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 14:50:35,669 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 14:50:35,670 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 14:50:35,757 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 14:50:35,762 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 14:50:35,762 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-14 14:50:35,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 02:50:35 BoogieIcfgContainer [2022-07-14 14:50:35,764 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 14:50:35,765 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-14 14:50:35,765 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-14 14:50:35,768 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-14 14:50:35,768 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 14:50:35,768 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.07 02:50:35" (1/3) ... [2022-07-14 14:50:35,769 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1c8af8f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 02:50:35, skipping insertion in model container [2022-07-14 14:50:35,769 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 14:50:35,770 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 02:50:35" (2/3) ... [2022-07-14 14:50:35,770 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1c8af8f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.07 02:50:35, skipping insertion in model container [2022-07-14 14:50:35,770 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-14 14:50:35,770 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 02:50:35" (3/3) ... [2022-07-14 14:50:35,771 INFO L354 chiAutomizerObserver]: Analyzing ICFG Fibonacci01-2.c [2022-07-14 14:50:35,816 INFO L255 stractBuchiCegarLoop]: Interprodecural is true [2022-07-14 14:50:35,817 INFO L256 stractBuchiCegarLoop]: Hoare is false [2022-07-14 14:50:35,817 INFO L257 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-14 14:50:35,817 INFO L258 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-14 14:50:35,817 INFO L259 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-14 14:50:35,817 INFO L260 stractBuchiCegarLoop]: Difference is false [2022-07-14 14:50:35,817 INFO L261 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-14 14:50:35,817 INFO L265 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-14 14:50:35,821 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-14 14:50:35,837 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-14 14:50:35,837 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:50:35,837 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:50:35,843 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-14 14:50:35,844 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-14 14:50:35,844 INFO L287 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-14 14:50:35,844 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-14 14:50:35,847 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-14 14:50:35,847 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:50:35,847 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:50:35,847 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-14 14:50:35,848 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-14 14:50:35,853 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-14 14:50:35,853 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-14 14:50:35,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:50:35,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1325876, now seen corresponding path program 1 times [2022-07-14 14:50:35,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:50:35,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352007945] [2022-07-14 14:50:35,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:50:35,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:50:35,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:50:35,967 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:50:35,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:50:36,006 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:50:36,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:50:36,012 INFO L85 PathProgramCache]: Analyzing trace with hash 927646, now seen corresponding path program 1 times [2022-07-14 14:50:36,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:50:36,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670839767] [2022-07-14 14:50:36,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:50:36,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:50:36,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:50:36,037 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:50:36,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:50:36,047 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:50:36,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:50:36,051 INFO L85 PathProgramCache]: Analyzing trace with hash 408654161, now seen corresponding path program 1 times [2022-07-14 14:50:36,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:50:36,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206916496] [2022-07-14 14:50:36,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:50:36,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:50:36,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:50:36,073 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:50:36,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:50:36,092 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:50:36,247 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 14:50:36,247 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 14:50:36,248 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 14:50:36,248 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 14:50:36,248 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-14 14:50:36,248 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:50:36,248 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 14:50:36,248 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 14:50:36,249 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci01-2.c_Iteration1_Loop [2022-07-14 14:50:36,249 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 14:50:36,249 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 14:50:36,262 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-14 14:50:36,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-14 14:50:36,270 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-14 14:50:36,272 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-14 14:50:36,283 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-14 14:50:36,337 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 14:50:36,337 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-14 14:50:36,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:50:36,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:50:36,341 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-14 14:50:36,343 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-14 14:50:36,344 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 14:50:36,346 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 14:50:36,359 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-14 14:50:36,360 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#res=0} Honda state: {fibonacci_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-14 14:50:36,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-07-14 14:50:36,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:50:36,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:50:36,391 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-14 14:50:36,392 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-14 14:50:36,393 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 14:50:36,393 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 14:50:36,404 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-14 14:50:36,404 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-14 14:50:36,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-14 14:50:36,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:50:36,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:50:36,422 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-14 14:50:36,434 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 14:50:36,434 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 14:50:36,436 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-14 14:50:36,449 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-14 14:50:36,449 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_~n=0} Honda state: {fibonacci_~n=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-14 14:50:36,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-07-14 14:50:36,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:50:36,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:50:36,469 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-14 14:50:36,471 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-14 14:50:36,472 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 14:50:36,472 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 14:50:36,498 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-07-14 14:50:36,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:50:36,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:50:36,501 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-14 14:50:36,502 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-14 14:50:36,503 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-14 14:50:36,503 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 14:50:36,558 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-14 14:50:36,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2022-07-14 14:50:36,562 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 14:50:36,562 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 14:50:36,562 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 14:50:36,562 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 14:50:36,562 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 14:50:36,562 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:50:36,563 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 14:50:36,563 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 14:50:36,563 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci01-2.c_Iteration1_Loop [2022-07-14 14:50:36,563 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 14:50:36,563 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 14:50:36,565 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-14 14:50:36,567 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-14 14:50:36,570 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-14 14:50:36,572 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-14 14:50:36,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-14 14:50:36,619 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 14:50:36,623 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 14:50:36,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:50:36,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:50:36,626 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-14 14:50:36,634 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-14 14:50:36,635 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-14 14:50:36,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:50:36,642 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:50:36,643 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:50:36,643 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:50:36,643 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:50:36,645 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:50:36,645 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:50:36,660 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:50:36,687 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-14 14:50:36,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:50:36,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:50:36,690 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-14 14:50:36,690 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-14 14:50:36,692 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-14 14:50:36,697 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:50:36,697 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:50:36,697 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:50:36,697 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:50:36,697 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:50:36,698 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:50:36,698 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:50:36,711 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:50:36,726 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-14 14:50:36,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:50:36,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:50:36,728 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-14 14:50:36,729 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-14 14:50:36,730 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-14 14:50:36,735 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:50:36,735 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:50:36,735 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:50:36,735 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:50:36,735 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:50:36,736 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:50:36,736 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:50:36,739 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:50:36,755 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-14 14:50:36,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:50:36,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:50:36,757 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-14 14:50:36,757 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-14 14:50:36,758 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-14 14:50:36,763 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:50:36,763 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:50:36,764 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:50:36,764 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:50:36,764 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:50:36,765 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:50:36,765 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:50:36,786 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 14:50:36,789 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-14 14:50:36,789 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-14 14:50:36,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:50:36,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:50:36,792 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-14 14:50:36,792 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-14 14:50:36,793 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 14:50:36,793 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-14 14:50:36,793 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 14:50:36,794 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_#in~n) = 1*fibonacci_#in~n Supporting invariants [] [2022-07-14 14:50:36,811 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-14 14:50:36,814 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-14 14:50:36,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:50:36,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:50:36,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 14:50:36,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:50:36,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:50:36,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 14:50:36,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:50:36,908 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-14 14:50:36,930 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-14 14:50:36,931 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-14 14:50:37,009 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-14 14:50:37,011 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-14 14:50:37,015 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-14 14:50:37,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2022-07-14 14:50:37,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 4 letters. Loop has 4 letters. [2022-07-14 14:50:37,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:50:37,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 8 letters. Loop has 4 letters. [2022-07-14 14:50:37,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:50:37,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 4 letters. Loop has 8 letters. [2022-07-14 14:50:37,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:50:37,020 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 63 transitions. [2022-07-14 14:50:37,024 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-14 14:50:37,029 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 26 states and 35 transitions. [2022-07-14 14:50:37,029 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2022-07-14 14:50:37,030 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2022-07-14 14:50:37,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 35 transitions. [2022-07-14 14:50:37,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 14:50:37,031 INFO L369 hiAutomatonCegarLoop]: Abstraction has 26 states and 35 transitions. [2022-07-14 14:50:37,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 35 transitions. [2022-07-14 14:50:37,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2022-07-14 14:50:37,053 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-14 14:50:37,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2022-07-14 14:50:37,055 INFO L392 hiAutomatonCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-07-14 14:50:37,055 INFO L374 stractBuchiCegarLoop]: Abstraction has 21 states and 27 transitions. [2022-07-14 14:50:37,055 INFO L287 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-14 14:50:37,055 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 27 transitions. [2022-07-14 14:50:37,056 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-14 14:50:37,056 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:50:37,056 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:50:37,057 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:50:37,058 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:50:37,058 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-14 14:50:37,058 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-14 14:50:37,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:50:37,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1923124650, now seen corresponding path program 1 times [2022-07-14 14:50:37,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:50:37,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270691648] [2022-07-14 14:50:37,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:50:37,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:50:37,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:50:37,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 14:50:37,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:50:37,149 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-14 14:50:37,151 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-14 14:50:37,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:50:37,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270691648] [2022-07-14 14:50:37,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270691648] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:50:37,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:50:37,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 14:50:37,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070105547] [2022-07-14 14:50:37,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:50:37,154 INFO L757 eck$LassoCheckResult]: stem already infeasible [2022-07-14 14:50:37,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:50:37,154 INFO L85 PathProgramCache]: Analyzing trace with hash 481649848, now seen corresponding path program 1 times [2022-07-14 14:50:37,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:50:37,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294895494] [2022-07-14 14:50:37,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:50:37,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:50:37,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:50:37,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-14 14:50:37,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:50:37,192 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-14 14:50:37,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:50:37,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294895494] [2022-07-14 14:50:37,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294895494] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 14:50:37,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 14:50:37,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 14:50:37,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033247659] [2022-07-14 14:50:37,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 14:50:37,193 INFO L769 eck$LassoCheckResult]: loop already infeasible [2022-07-14 14:50:37,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:50:37,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 14:50:37,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-14 14:50:37,197 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-14 14:50:37,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:50:37,259 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2022-07-14 14:50:37,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 14:50:37,261 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 33 transitions. [2022-07-14 14:50:37,262 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-14 14:50:37,265 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 25 states and 31 transitions. [2022-07-14 14:50:37,266 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2022-07-14 14:50:37,267 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2022-07-14 14:50:37,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 31 transitions. [2022-07-14 14:50:37,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 14:50:37,268 INFO L369 hiAutomatonCegarLoop]: Abstraction has 25 states and 31 transitions. [2022-07-14 14:50:37,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 31 transitions. [2022-07-14 14:50:37,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-07-14 14:50:37,272 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-14 14:50:37,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2022-07-14 14:50:37,273 INFO L392 hiAutomatonCegarLoop]: Abstraction has 25 states and 31 transitions. [2022-07-14 14:50:37,274 INFO L374 stractBuchiCegarLoop]: Abstraction has 25 states and 31 transitions. [2022-07-14 14:50:37,274 INFO L287 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-14 14:50:37,274 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. [2022-07-14 14:50:37,275 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-14 14:50:37,275 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:50:37,275 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:50:37,276 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:50:37,276 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2022-07-14 14:50:37,277 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-14 14:50:37,277 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-14 14:50:37,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:50:37,278 INFO L85 PathProgramCache]: Analyzing trace with hash -512653656, now seen corresponding path program 1 times [2022-07-14 14:50:37,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:50:37,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632693599] [2022-07-14 14:50:37,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:50:37,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:50:37,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:50:37,287 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:50:37,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:50:37,296 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:50:37,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:50:37,297 INFO L85 PathProgramCache]: Analyzing trace with hash 319636608, now seen corresponding path program 1 times [2022-07-14 14:50:37,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:50:37,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400985573] [2022-07-14 14:50:37,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:50:37,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:50:37,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:50:37,307 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:50:37,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:50:37,316 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:50:37,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:50:37,317 INFO L85 PathProgramCache]: Analyzing trace with hash 911295463, now seen corresponding path program 1 times [2022-07-14 14:50:37,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:50:37,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871479321] [2022-07-14 14:50:37,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:50:37,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:50:37,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:50:37,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 14:50:37,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:50:37,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 14:50:37,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:50:37,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 14:50:37,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:50:37,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 14:50:37,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:50:37,386 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-14 14:50:37,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:50:37,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871479321] [2022-07-14 14:50:37,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871479321] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 14:50:37,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489822345] [2022-07-14 14:50:37,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:50:37,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:50:37,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:50:37,396 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-14 14:50:37,398 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-14 14:50:37,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:50:37,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 14:50:37,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:50:37,477 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-14 14:50:37,477 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 14:50:37,548 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-14 14:50:37,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1489822345] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 14:50:37,549 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 14:50:37,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2022-07-14 14:50:37,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188776328] [2022-07-14 14:50:37,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 14:50:37,748 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 14:50:37,748 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 14:50:37,748 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 14:50:37,748 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 14:50:37,748 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-14 14:50:37,749 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:50:37,749 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 14:50:37,749 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 14:50:37,749 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci01-2.c_Iteration3_Loop [2022-07-14 14:50:37,749 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 14:50:37,749 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 14:50:37,752 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-14 14:50:37,758 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-14 14:50:37,761 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-14 14:50:37,762 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-14 14:50:37,798 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 14:50:37,799 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-14 14:50:37,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:50:37,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:50:37,804 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-14 14:50:37,826 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 14:50:37,826 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 14:50:37,832 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-14 14:50:37,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-07-14 14:50:37,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:50:37,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:50:37,874 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-14 14:50:37,875 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-14 14:50:37,876 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-14 14:50:37,876 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 14:50:38,468 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-14 14:50:38,472 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-14 14:50:38,472 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 14:50:38,472 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 14:50:38,472 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 14:50:38,472 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 14:50:38,472 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 14:50:38,472 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:50:38,472 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 14:50:38,472 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 14:50:38,473 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci01-2.c_Iteration3_Loop [2022-07-14 14:50:38,473 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 14:50:38,473 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 14:50:38,473 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-14 14:50:38,485 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-14 14:50:38,488 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-14 14:50:38,491 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-14 14:50:38,537 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 14:50:38,537 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 14:50:38,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:50:38,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:50:38,539 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-14 14:50:38,551 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-14 14:50:38,558 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:50:38,558 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:50:38,558 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:50:38,558 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:50:38,558 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:50:38,559 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:50:38,559 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:50:38,562 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-14 14:50:38,571 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:50:38,595 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-07-14 14:50:38,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:50:38,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:50:38,597 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-14 14:50:38,602 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-14 14:50:38,608 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:50:38,608 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:50:38,608 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:50:38,608 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:50:38,609 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:50:38,611 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:50:38,611 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:50:38,615 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-14 14:50:38,618 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:50:38,634 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-14 14:50:38,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:50:38,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:50:38,636 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-14 14:50:38,636 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-14 14:50:38,638 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-14 14:50:38,643 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:50:38,643 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:50:38,643 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:50:38,643 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:50:38,643 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:50:38,645 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:50:38,645 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:50:38,646 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:50:38,661 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-14 14:50:38,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:50:38,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:50:38,663 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-14 14:50:38,663 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-14 14:50:38,692 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-14 14:50:38,698 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:50:38,699 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:50:38,699 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:50:38,699 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:50:38,699 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:50:38,701 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:50:38,701 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:50:38,713 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 14:50:38,718 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-14 14:50:38,718 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-14 14:50:38,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:50:38,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:50:38,721 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-14 14:50:38,723 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-14 14:50:38,723 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 14:50:38,723 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-14 14:50:38,723 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 14:50:38,724 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_~n) = 1*fibonacci_~n Supporting invariants [] [2022-07-14 14:50:38,743 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-14 14:50:38,744 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-14 14:50:38,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:50:38,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:50:38,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 14:50:38,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:50:38,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:50:38,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-14 14:50:38,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:50:38,954 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-14 14:50:39,008 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-14 14:50:39,009 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-14 14:50:39,009 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-14 14:50:39,224 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-14 14:50:39,225 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-14 14:50:39,225 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-14 14:50:39,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 42 transitions. [2022-07-14 14:50:39,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 42 transitions. Stem has 13 letters. Loop has 22 letters. [2022-07-14 14:50:39,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:50:39,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 42 transitions. Stem has 35 letters. Loop has 22 letters. [2022-07-14 14:50:39,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:50:39,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 42 transitions. Stem has 13 letters. Loop has 44 letters. [2022-07-14 14:50:39,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:50:39,230 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 160 states and 216 transitions. [2022-07-14 14:50:39,236 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2022-07-14 14:50:39,241 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 160 states to 129 states and 181 transitions. [2022-07-14 14:50:39,241 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 75 [2022-07-14 14:50:39,241 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 80 [2022-07-14 14:50:39,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 129 states and 181 transitions. [2022-07-14 14:50:39,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 14:50:39,242 INFO L369 hiAutomatonCegarLoop]: Abstraction has 129 states and 181 transitions. [2022-07-14 14:50:39,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states and 181 transitions. [2022-07-14 14:50:39,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 107. [2022-07-14 14:50:39,254 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-14 14:50:39,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 141 transitions. [2022-07-14 14:50:39,259 INFO L392 hiAutomatonCegarLoop]: Abstraction has 107 states and 141 transitions. [2022-07-14 14:50:39,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:50:39,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 14:50:39,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-07-14 14:50:39,259 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-14 14:50:39,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:50:39,310 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2022-07-14 14:50:39,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 14:50:39,311 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 58 transitions. [2022-07-14 14:50:39,313 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-14 14:50:39,314 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 42 states and 54 transitions. [2022-07-14 14:50:39,314 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2022-07-14 14:50:39,314 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2022-07-14 14:50:39,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 54 transitions. [2022-07-14 14:50:39,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 14:50:39,315 INFO L369 hiAutomatonCegarLoop]: Abstraction has 42 states and 54 transitions. [2022-07-14 14:50:39,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 54 transitions. [2022-07-14 14:50:39,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2022-07-14 14:50:39,319 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-14 14:50:39,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2022-07-14 14:50:39,320 INFO L392 hiAutomatonCegarLoop]: Abstraction has 39 states and 48 transitions. [2022-07-14 14:50:39,320 INFO L374 stractBuchiCegarLoop]: Abstraction has 39 states and 48 transitions. [2022-07-14 14:50:39,320 INFO L287 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-14 14:50:39,320 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 48 transitions. [2022-07-14 14:50:39,321 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2022-07-14 14:50:39,321 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:50:39,321 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:50:39,323 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 14:50:39,323 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1] [2022-07-14 14:50:39,323 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-14 14:50:39,324 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-14 14:50:39,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:50:39,324 INFO L85 PathProgramCache]: Analyzing trace with hash 506180814, now seen corresponding path program 2 times [2022-07-14 14:50:39,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:50:39,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641355756] [2022-07-14 14:50:39,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:50:39,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:50:39,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:50:39,335 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:50:39,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:50:39,345 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:50:39,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:50:39,346 INFO L85 PathProgramCache]: Analyzing trace with hash 319636608, now seen corresponding path program 2 times [2022-07-14 14:50:39,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:50:39,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816503763] [2022-07-14 14:50:39,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:50:39,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:50:39,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:50:39,353 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:50:39,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:50:39,361 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:50:39,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:50:39,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1200508531, now seen corresponding path program 3 times [2022-07-14 14:50:39,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:50:39,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037786839] [2022-07-14 14:50:39,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:50:39,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:50:39,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:50:39,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 14:50:39,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:50:39,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 14:50:39,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:50:39,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 14:50:39,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:50:39,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-14 14:50:39,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:50:39,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 14:50:39,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:50:39,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 14:50:39,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:50:39,470 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-14 14:50:39,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:50:39,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037786839] [2022-07-14 14:50:39,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037786839] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 14:50:39,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565685548] [2022-07-14 14:50:39,470 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-14 14:50:39,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:50:39,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:50:39,472 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-14 14:50:39,505 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-14 14:50:39,518 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-07-14 14:50:39,518 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 14:50:39,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-14 14:50:39,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:50:39,610 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-14 14:50:39,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 14:50:39,912 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-14 14:50:39,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [565685548] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 14:50:39,913 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 14:50:39,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 12] total 21 [2022-07-14 14:50:39,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028953792] [2022-07-14 14:50:39,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 14:50:40,146 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 14:50:40,147 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 14:50:40,147 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 14:50:40,147 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 14:50:40,147 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-14 14:50:40,147 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:50:40,147 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 14:50:40,147 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 14:50:40,147 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci01-2.c_Iteration4_Loop [2022-07-14 14:50:40,147 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 14:50:40,147 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 14:50:40,148 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-14 14:50:40,156 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-14 14:50:40,157 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-14 14:50:40,159 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-14 14:50:40,208 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 14:50:40,208 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-14 14:50:40,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:50:40,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:50:40,210 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-14 14:50:40,219 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-14 14:50:40,219 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 14:50:40,220 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 14:50:40,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-07-14 14:50:40,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:50:40,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:50:40,263 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-14 14:50:40,264 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-14 14:50:40,265 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-14 14:50:40,265 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 14:50:40,871 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-14 14:50:40,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2022-07-14 14:50:40,874 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 14:50:40,874 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 14:50:40,875 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 14:50:40,875 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 14:50:40,875 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 14:50:40,875 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:50:40,875 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 14:50:40,875 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 14:50:40,875 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci01-2.c_Iteration4_Loop [2022-07-14 14:50:40,875 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 14:50:40,875 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 14:50:40,876 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-14 14:50:40,897 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-14 14:50:40,899 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-14 14:50:40,901 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-14 14:50:40,952 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 14:50:40,952 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 14:50:40,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:50:40,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:50:40,956 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-14 14:50:40,963 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-14 14:50:40,964 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-14 14:50:40,970 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:50:40,971 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:50:40,971 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:50:40,971 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:50:40,971 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:50:40,972 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:50:40,972 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:50:40,986 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 14:50:40,989 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-07-14 14:50:40,989 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-07-14 14:50:40,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:50:40,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:50:40,990 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-14 14:50:40,991 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-14 14:50:40,991 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 14:50:40,992 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-14 14:50:40,992 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 14:50:40,992 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_~n) = 1*fibonacci_~n Supporting invariants [] [2022-07-14 14:50:41,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-07-14 14:50:41,008 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-14 14:50:41,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:50:41,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:50:41,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-14 14:50:41,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:50:41,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:50:41,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-14 14:50:41,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:50:41,328 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-14 14:50:41,329 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-14 14:50:41,329 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-14 14:50:41,406 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-14 14:50:41,431 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-14 14:50:41,432 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-14 14:50:41,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2022-07-14 14:50:41,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 25 letters. Loop has 22 letters. [2022-07-14 14:50:41,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:50:41,433 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-14 14:50:41,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:50:41,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-07-14 14:50:41,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:50:41,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-14 14:50:41,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:50:41,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:50:41,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-14 14:50:41,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:50:41,752 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-14 14:50:41,753 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-14 14:50:41,753 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-14 14:50:41,829 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-14 14:50:41,830 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-14 14:50:41,831 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-14 14:50:41,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2022-07-14 14:50:41,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 25 letters. Loop has 22 letters. [2022-07-14 14:50:41,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:50:41,831 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-14 14:50:41,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:50:41,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:50:41,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-14 14:50:41,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:50:42,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:50:42,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-14 14:50:42,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:50:42,141 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-14 14:50:42,142 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-14 14:50:42,142 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-14 14:50:42,364 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-14 14:50:42,365 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-14 14:50:42,365 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-14 14:50:42,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 47 transitions. [2022-07-14 14:50:42,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 47 transitions. Stem has 25 letters. Loop has 22 letters. [2022-07-14 14:50:42,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:50:42,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 47 transitions. Stem has 47 letters. Loop has 22 letters. [2022-07-14 14:50:42,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:50:42,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 47 transitions. Stem has 25 letters. Loop has 44 letters. [2022-07-14 14:50:42,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:50:42,369 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 345 states and 444 transitions. [2022-07-14 14:50:42,375 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2022-07-14 14:50:42,380 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 345 states to 220 states and 297 transitions. [2022-07-14 14:50:42,380 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 99 [2022-07-14 14:50:42,381 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 116 [2022-07-14 14:50:42,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 220 states and 297 transitions. [2022-07-14 14:50:42,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 14:50:42,382 INFO L369 hiAutomatonCegarLoop]: Abstraction has 220 states and 297 transitions. [2022-07-14 14:50:42,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states and 297 transitions. [2022-07-14 14:50:42,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 172. [2022-07-14 14:50:42,396 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-14 14:50:42,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 223 transitions. [2022-07-14 14:50:42,398 INFO L392 hiAutomatonCegarLoop]: Abstraction has 172 states and 223 transitions. [2022-07-14 14:50:42,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:50:42,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-14 14:50:42,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2022-07-14 14:50:42,399 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-14 14:50:42,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:50:42,638 INFO L93 Difference]: Finished difference Result 349 states and 503 transitions. [2022-07-14 14:50:42,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-14 14:50:42,638 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 349 states and 503 transitions. [2022-07-14 14:50:42,644 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2022-07-14 14:50:42,650 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 349 states to 339 states and 490 transitions. [2022-07-14 14:50:42,650 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 173 [2022-07-14 14:50:42,650 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 193 [2022-07-14 14:50:42,650 INFO L73 IsDeterministic]: Start isDeterministic. Operand 339 states and 490 transitions. [2022-07-14 14:50:42,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 14:50:42,650 INFO L369 hiAutomatonCegarLoop]: Abstraction has 339 states and 490 transitions. [2022-07-14 14:50:42,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states and 490 transitions. [2022-07-14 14:50:42,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 274. [2022-07-14 14:50:42,685 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-14 14:50:42,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 401 transitions. [2022-07-14 14:50:42,689 INFO L392 hiAutomatonCegarLoop]: Abstraction has 274 states and 401 transitions. [2022-07-14 14:50:42,689 INFO L374 stractBuchiCegarLoop]: Abstraction has 274 states and 401 transitions. [2022-07-14 14:50:42,690 INFO L287 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-14 14:50:42,690 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 274 states and 401 transitions. [2022-07-14 14:50:42,692 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2022-07-14 14:50:42,692 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-14 14:50:42,693 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-14 14:50:42,695 INFO L179 hiAutomatonCegarLoop]: Counterexample stem histogram [12, 10, 9, 7, 7, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1] [2022-07-14 14:50:42,695 INFO L180 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-14 14:50:42,695 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-14 14:50:42,696 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-14 14:50:42,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:50:42,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1489009265, now seen corresponding path program 4 times [2022-07-14 14:50:42,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:50:42,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275357275] [2022-07-14 14:50:42,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:50:42,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:50:42,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:50:42,737 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:50:42,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:50:42,769 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:50:42,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:50:42,771 INFO L85 PathProgramCache]: Analyzing trace with hash 927646, now seen corresponding path program 2 times [2022-07-14 14:50:42,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:50:42,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979133629] [2022-07-14 14:50:42,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:50:42,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:50:42,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:50:42,777 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-14 14:50:42,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-14 14:50:42,779 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-14 14:50:42,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:50:42,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1238644268, now seen corresponding path program 5 times [2022-07-14 14:50:42,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 14:50:42,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351278049] [2022-07-14 14:50:42,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 14:50:42,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 14:50:42,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:50:42,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 14:50:42,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:50:42,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 14:50:42,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:50:42,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 14:50:42,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:50:43,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 14:50:43,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:50:43,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 14:50:43,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:50:43,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-14 14:50:43,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:50:43,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-14 14:50:43,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:50:43,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-14 14:50:43,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:50:43,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-14 14:50:43,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:50:43,035 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-14 14:50:43,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 14:50:43,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351278049] [2022-07-14 14:50:43,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351278049] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 14:50:43,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542683876] [2022-07-14 14:50:43,036 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-14 14:50:43,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 14:50:43,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:50:43,040 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-14 14:50:43,044 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-14 14:50:43,086 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2022-07-14 14:50:43,086 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 14:50:43,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-14 14:50:43,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:50:43,169 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-14 14:50:43,169 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 14:50:43,586 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-14 14:50:43,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [542683876] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 14:50:43,586 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 14:50:43,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 16] total 21 [2022-07-14 14:50:43,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864346395] [2022-07-14 14:50:43,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 14:50:43,618 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 14:50:43,619 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 14:50:43,619 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 14:50:43,619 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 14:50:43,619 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-07-14 14:50:43,619 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:50:43,619 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 14:50:43,619 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 14:50:43,619 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci01-2.c_Iteration5_Loop [2022-07-14 14:50:43,619 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 14:50:43,619 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 14:50:43,619 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-14 14:50:43,621 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-14 14:50:43,622 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-14 14:50:43,627 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-14 14:50:43,628 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-14 14:50:43,651 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 14:50:43,651 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-07-14 14:50:43,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:50:43,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:50:43,653 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-14 14:50:43,660 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 14:50:43,661 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 14:50:43,670 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-14 14:50:43,683 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-14 14:50:43,684 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-14 14:50:43,708 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-14 14:50:43,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:50:43,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:50:43,710 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-14 14:50:43,711 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-14 14:50:43,713 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 14:50:43,713 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 14:50:43,734 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-07-14 14:50:43,734 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {fibonacci_#res=0} Honda state: {fibonacci_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-07-14 14:50:43,758 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-14 14:50:43,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:50:43,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:50:43,760 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-14 14:50:43,761 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-14 14:50:43,763 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-07-14 14:50:43,763 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 14:50:43,808 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-14 14:50:43,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:50:43,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:50:43,809 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-14 14:50:43,816 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-07-14 14:50:43,816 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-07-14 14:50:43,835 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-14 14:50:43,863 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-07-14 14:50:43,869 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-14 14:50:43,869 INFO L210 LassoAnalysis]: Preferences: [2022-07-14 14:50:43,869 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-14 14:50:43,869 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-14 14:50:43,869 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-14 14:50:43,869 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-14 14:50:43,869 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:50:43,869 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-14 14:50:43,870 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-14 14:50:43,870 INFO L133 ssoRankerPreferences]: Filename of dumped script: Fibonacci01-2.c_Iteration5_Loop [2022-07-14 14:50:43,870 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-14 14:50:43,870 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-14 14:50:43,870 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-14 14:50:43,872 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-14 14:50:43,874 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-14 14:50:43,879 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-14 14:50:43,881 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-14 14:50:43,911 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-14 14:50:43,911 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-14 14:50:43,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:50:43,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:50:43,913 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-14 14:50:43,921 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-14 14:50:43,927 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:50:43,928 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:50:43,928 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:50:43,928 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:50:43,928 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:50:43,928 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:50:43,929 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:50:43,932 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-14 14:50:43,939 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:50:43,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-07-14 14:50:43,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:50:43,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:50:43,961 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-14 14:50:43,963 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-14 14:50:43,963 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-14 14:50:43,968 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:50:43,968 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:50:43,968 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:50:43,968 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:50:43,968 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:50:43,969 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:50:43,969 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:50:43,985 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-14 14:50:44,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2022-07-14 14:50:44,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:50:44,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:50:44,001 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-14 14:50:44,001 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-14 14:50:44,003 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-14 14:50:44,008 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-14 14:50:44,008 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-14 14:50:44,008 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-14 14:50:44,009 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-14 14:50:44,009 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-14 14:50:44,009 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-14 14:50:44,009 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-14 14:50:44,019 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-14 14:50:44,020 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2022-07-14 14:50:44,020 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-07-14 14:50:44,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-14 14:50:44,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 14:50:44,027 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-14 14:50:44,030 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-14 14:50:44,030 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-14 14:50:44,030 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-07-14 14:50:44,030 INFO L513 LassoAnalysis]: Proved termination. [2022-07-14 14:50:44,030 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(fibonacci_#in~n) = 1*fibonacci_#in~n Supporting invariants [] [2022-07-14 14:50:44,046 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-14 14:50:44,046 INFO L293 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-07-14 14:50:44,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:50:44,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:50:44,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-14 14:50:44,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:50:44,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2022-07-14 14:50:44,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:50:44,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 14:50:44,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:50:44,621 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-14 14:50:44,622 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-14 14:50:44,622 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-14 14:50:44,673 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-14 14:50:44,673 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-14 14:50:44,674 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-14 14:50:44,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2022-07-14 14:50:44,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 72 letters. Loop has 4 letters. [2022-07-14 14:50:44,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:50:44,675 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-14 14:50:44,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:50:44,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:50:44,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-14 14:50:44,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:50:45,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:50:45,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 14:50:45,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:50:45,186 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-14 14:50:45,187 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-14 14:50:45,187 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-14 14:50:45,231 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-14 14:50:45,232 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-14 14:50:45,233 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-14 14:50:45,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2022-07-14 14:50:45,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 72 letters. Loop has 4 letters. [2022-07-14 14:50:45,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:50:45,233 INFO L577 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-07-14 14:50:45,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 14:50:45,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:50:45,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-14 14:50:45,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:50:45,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 14:50:45,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 14:50:45,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 14:50:45,742 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-14 14:50:45,743 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-14 14:50:45,743 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-14 14:50:45,804 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-14 14:50:45,805 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-14 14:50:45,805 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-14 14:50:45,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2022-07-14 14:50:45,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 72 letters. Loop has 4 letters. [2022-07-14 14:50:45,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:50:45,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 76 letters. Loop has 4 letters. [2022-07-14 14:50:45,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:50:45,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 72 letters. Loop has 8 letters. [2022-07-14 14:50:45,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-14 14:50:45,807 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 349 states and 484 transitions. [2022-07-14 14:50:45,811 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2022-07-14 14:50:45,814 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 349 states to 288 states and 417 transitions. [2022-07-14 14:50:45,814 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 138 [2022-07-14 14:50:45,815 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 143 [2022-07-14 14:50:45,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 288 states and 417 transitions. [2022-07-14 14:50:45,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-14 14:50:45,815 INFO L369 hiAutomatonCegarLoop]: Abstraction has 288 states and 417 transitions. [2022-07-14 14:50:45,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states and 417 transitions. [2022-07-14 14:50:45,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 280. [2022-07-14 14:50:45,827 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-14 14:50:45,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 409 transitions. [2022-07-14 14:50:45,829 INFO L392 hiAutomatonCegarLoop]: Abstraction has 280 states and 409 transitions. [2022-07-14 14:50:45,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 14:50:45,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-14 14:50:45,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2022-07-14 14:50:45,830 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-14 14:50:46,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 14:50:46,008 INFO L93 Difference]: Finished difference Result 408 states and 601 transitions. [2022-07-14 14:50:46,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-14 14:50:46,009 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 408 states and 601 transitions. [2022-07-14 14:50:46,014 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-14 14:50:46,014 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 408 states to 0 states and 0 transitions. [2022-07-14 14:50:46,014 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-07-14 14:50:46,014 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-07-14 14:50:46,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-07-14 14:50:46,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-14 14:50:46,015 INFO L369 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-14 14:50:46,015 INFO L392 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-14 14:50:46,015 INFO L374 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-14 14:50:46,015 INFO L287 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-07-14 14:50:46,015 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-07-14 14:50:46,015 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-07-14 14:50:46,015 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-07-14 14:50:46,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.07 02:50:46 BoogieIcfgContainer [2022-07-14 14:50:46,021 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-14 14:50:46,022 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-14 14:50:46,022 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-14 14:50:46,022 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-14 14:50:46,023 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 02:50:35" (3/4) ... [2022-07-14 14:50:46,025 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-14 14:50:46,025 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-14 14:50:46,025 INFO L158 Benchmark]: Toolchain (without parser) took 10795.63ms. Allocated memory was 107.0MB in the beginning and 169.9MB in the end (delta: 62.9MB). Free memory was 74.6MB in the beginning and 93.3MB in the end (delta: -18.7MB). Peak memory consumption was 44.4MB. Max. memory is 16.1GB. [2022-07-14 14:50:46,026 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 107.0MB. Free memory was 61.5MB in the beginning and 61.5MB in the end (delta: 47.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 14:50:46,026 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.15ms. Allocated memory is still 107.0MB. Free memory was 74.4MB in the beginning and 81.8MB in the end (delta: -7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-14 14:50:46,026 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.07ms. Allocated memory is still 107.0MB. Free memory was 81.8MB in the beginning and 80.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 14:50:46,026 INFO L158 Benchmark]: Boogie Preprocessor took 20.21ms. Allocated memory is still 107.0MB. Free memory was 80.4MB in the beginning and 79.4MB in the end (delta: 989.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 14:50:46,027 INFO L158 Benchmark]: RCFGBuilder took 220.06ms. Allocated memory is still 107.0MB. Free memory was 79.4MB in the beginning and 71.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-14 14:50:46,027 INFO L158 Benchmark]: BuchiAutomizer took 10256.77ms. Allocated memory was 107.0MB in the beginning and 169.9MB in the end (delta: 62.9MB). Free memory was 70.7MB in the beginning and 93.3MB in the end (delta: -22.6MB). Peak memory consumption was 43.3MB. Max. memory is 16.1GB. [2022-07-14 14:50:46,027 INFO L158 Benchmark]: Witness Printer took 2.94ms. Allocated memory is still 169.9MB. Free memory is still 93.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 14:50:46,028 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.20ms. Allocated memory is still 107.0MB. Free memory was 61.5MB in the beginning and 61.5MB in the end (delta: 47.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 262.15ms. Allocated memory is still 107.0MB. Free memory was 74.4MB in the beginning and 81.8MB in the end (delta: -7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.07ms. Allocated memory is still 107.0MB. Free memory was 81.8MB in the beginning and 80.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.21ms. Allocated memory is still 107.0MB. Free memory was 80.4MB in the beginning and 79.4MB in the end (delta: 989.4kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 220.06ms. Allocated memory is still 107.0MB. Free memory was 79.4MB in the beginning and 71.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 10256.77ms. Allocated memory was 107.0MB in the beginning and 169.9MB in the end (delta: 62.9MB). Free memory was 70.7MB in the beginning and 93.3MB in the end (delta: -22.6MB). Peak memory consumption was 43.3MB. Max. memory is 16.1GB. * Witness Printer took 2.94ms. Allocated memory is still 169.9MB. Free memory is still 93.3MB. 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 10.2s and 6 iterations. TraceHistogramMax:12. Analysis of lassos took 5.6s. Construction of modules took 0.5s. Büchi inclusion checks took 3.8s. 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.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 442 mSDsluCounter, 379 SdHoareTripleChecker+Invalid, 0.5s 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: 35ms 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-14 14:50:46,061 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-14 14:50:46,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-07-14 14:50:46,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-14 14:50:46,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE