./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/bitvector/soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/bitvector/soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash f756365182c9801d4a2ac186a40692687a86b469 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 22:08:21,398 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 22:08:21,400 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 22:08:21,414 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 22:08:21,414 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 22:08:21,415 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 22:08:21,416 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 22:08:21,418 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 22:08:21,420 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 22:08:21,421 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 22:08:21,422 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 22:08:21,422 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 22:08:21,423 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 22:08:21,424 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 22:08:21,425 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 22:08:21,426 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 22:08:21,427 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 22:08:21,429 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 22:08:21,431 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 22:08:21,433 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 22:08:21,434 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 22:08:21,435 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 22:08:21,438 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 22:08:21,438 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 22:08:21,439 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 22:08:21,440 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 22:08:21,441 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 22:08:21,442 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 22:08:21,443 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 22:08:21,446 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 22:08:21,446 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 22:08:21,447 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 22:08:21,447 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 22:08:21,447 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 22:08:21,452 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 22:08:21,453 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 22:08:21,453 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-01 22:08:21,470 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 22:08:21,470 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 22:08:21,471 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 22:08:21,472 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 22:08:21,472 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 22:08:21,472 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 22:08:21,472 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 22:08:21,472 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 22:08:21,473 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 22:08:21,473 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 22:08:21,473 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 22:08:21,473 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 22:08:21,473 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 22:08:21,473 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 22:08:21,474 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 22:08:21,474 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 22:08:21,474 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 22:08:21,474 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 22:08:21,474 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 22:08:21,474 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 22:08:21,475 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 22:08:21,475 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 22:08:21,475 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 22:08:21,475 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 22:08:21,475 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 22:08:21,475 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 22:08:21,476 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 22:08:21,476 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 22:08:21,476 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 22:08:21,476 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 22:08:21,476 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 22:08:21,477 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 22:08:21,478 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f756365182c9801d4a2ac186a40692687a86b469 [2019-01-01 22:08:21,536 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 22:08:21,553 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 22:08:21,558 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 22:08:21,563 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 22:08:21,564 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 22:08:21,564 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/bitvector/soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2019-01-01 22:08:21,620 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3579906ef/8235ea12d6b14bedb249bb08a75a81f0/FLAG1203e69b9 [2019-01-01 22:08:22,115 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 22:08:22,116 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/bitvector/soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2019-01-01 22:08:22,126 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3579906ef/8235ea12d6b14bedb249bb08a75a81f0/FLAG1203e69b9 [2019-01-01 22:08:22,423 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3579906ef/8235ea12d6b14bedb249bb08a75a81f0 [2019-01-01 22:08:22,427 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 22:08:22,429 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 22:08:22,431 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 22:08:22,431 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 22:08:22,435 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 22:08:22,436 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:08:22" (1/1) ... [2019-01-01 22:08:22,439 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1249e86e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:08:22, skipping insertion in model container [2019-01-01 22:08:22,440 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:08:22" (1/1) ... [2019-01-01 22:08:22,448 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 22:08:22,491 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 22:08:22,826 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:08:22,832 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 22:08:22,883 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:08:22,899 INFO L195 MainTranslator]: Completed translation [2019-01-01 22:08:22,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:08:22 WrapperNode [2019-01-01 22:08:22,899 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 22:08:22,900 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 22:08:22,901 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 22:08:22,901 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 22:08:22,911 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:08:22" (1/1) ... [2019-01-01 22:08:22,919 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:08:22" (1/1) ... [2019-01-01 22:08:23,023 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 22:08:23,023 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 22:08:23,023 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 22:08:23,024 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 22:08:23,035 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:08:22" (1/1) ... [2019-01-01 22:08:23,036 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:08:22" (1/1) ... [2019-01-01 22:08:23,039 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:08:22" (1/1) ... [2019-01-01 22:08:23,040 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:08:22" (1/1) ... [2019-01-01 22:08:23,048 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:08:22" (1/1) ... [2019-01-01 22:08:23,057 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:08:22" (1/1) ... [2019-01-01 22:08:23,060 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:08:22" (1/1) ... [2019-01-01 22:08:23,064 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 22:08:23,065 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 22:08:23,066 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 22:08:23,066 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 22:08:23,067 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:08:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:08:23,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 22:08:23,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 22:08:24,096 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 22:08:24,096 INFO L280 CfgBuilder]: Removed 28 assue(true) statements. [2019-01-01 22:08:24,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:08:24 BoogieIcfgContainer [2019-01-01 22:08:24,097 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 22:08:24,097 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 22:08:24,097 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 22:08:24,101 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 22:08:24,102 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:08:24,102 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 10:08:22" (1/3) ... [2019-01-01 22:08:24,104 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7ed9243d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:08:24, skipping insertion in model container [2019-01-01 22:08:24,104 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:08:24,104 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:08:22" (2/3) ... [2019-01-01 22:08:24,104 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7ed9243d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:08:24, skipping insertion in model container [2019-01-01 22:08:24,104 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:08:24,105 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:08:24" (3/3) ... [2019-01-01 22:08:24,107 INFO L375 chiAutomizerObserver]: Analyzing ICFG soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2019-01-01 22:08:24,167 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 22:08:24,168 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 22:08:24,168 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 22:08:24,168 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 22:08:24,168 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 22:08:24,168 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 22:08:24,168 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 22:08:24,169 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 22:08:24,169 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 22:08:24,187 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states. [2019-01-01 22:08:24,215 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 18 [2019-01-01 22:08:24,216 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:08:24,216 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:08:24,222 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 22:08:24,222 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:08:24,222 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 22:08:24,223 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states. [2019-01-01 22:08:24,230 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 18 [2019-01-01 22:08:24,231 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:08:24,231 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:08:24,231 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 22:08:24,231 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:08:24,239 INFO L794 eck$LassoCheckResult]: Stem: 37#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_#t~ret5, main_#t~ret6, main_#t~ret7, main_~a~0, main_~ma~2, main_~ea~2, main_~b~0, main_~mb~2, main_~eb~2, main_~r_add~0, main_~zero~0, main_~sa~0, main_~sb~0, main_~tmp~2, main_~tmp___0~0, main_~tmp___1~0, main_~tmp___2~0, main_~tmp___3~0, main_~tmp___4~0, main_~tmp___5~0, main_~tmp___6~0, main_~tmp___7~0, main_~tmp___8~0, main_~tmp___9~0, main_~__retres23~0;havoc main_~a~0;main_~ma~2 := main_#t~nondet0;havoc main_#t~nondet0;main_~ea~2 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~b~0;main_~mb~2 := main_#t~nondet2;havoc main_#t~nondet2;main_~eb~2 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~r_add~0;havoc main_~zero~0;havoc main_~sa~0;havoc main_~sb~0;havoc main_~tmp~2;havoc main_~tmp___0~0;havoc main_~tmp___1~0;havoc main_~tmp___2~0;havoc main_~tmp___3~0;havoc main_~tmp___4~0;havoc main_~tmp___5~0;havoc main_~tmp___6~0;havoc main_~tmp___7~0;havoc main_~tmp___8~0;havoc main_~tmp___9~0;havoc main_~__retres23~0;base2flt_#in~m, base2flt_#in~e := 0, 0;havoc base2flt_#res;havoc base2flt_~m, base2flt_~e, base2flt_~res~0, base2flt_~__retres4~0;base2flt_~m := base2flt_#in~m;base2flt_~e := base2flt_#in~e;havoc base2flt_~res~0;havoc base2flt_~__retres4~0; 33#L19true assume !(0 == base2flt_~m % 4294967296); 21#L25true assume !(base2flt_~m % 4294967296 < 16777216); 16#L47-2true [2019-01-01 22:08:24,239 INFO L796 eck$LassoCheckResult]: Loop: 16#L47-2true assume !false; 27#L48true assume base2flt_~m % 4294967296 >= 33554432; 55#L49true assume !(base2flt_~e >= 127);base2flt_~e := 1 + base2flt_~e;base2flt_~m := base2flt_~m / 2; 16#L47-2true [2019-01-01 22:08:24,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:24,245 INFO L82 PathProgramCache]: Analyzing trace with hash 30973, now seen corresponding path program 1 times [2019-01-01 22:08:24,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:24,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:24,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:24,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:08:24,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:24,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:08:24,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:08:24,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:08:24,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-01 22:08:24,438 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:08:24,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:24,438 INFO L82 PathProgramCache]: Analyzing trace with hash 73619, now seen corresponding path program 1 times [2019-01-01 22:08:24,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:24,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:24,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:24,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:08:24,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:24,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:24,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:24,589 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:08:24,590 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:08:24,590 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:08:24,590 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:08:24,591 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 22:08:24,591 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:08:24,591 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:08:24,591 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:08:24,591 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c_Iteration1_Loop [2019-01-01 22:08:24,591 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:08:24,592 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:08:24,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:08:24,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:08:24,900 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-01-01 22:08:24,907 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:08:24,907 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:08:24,922 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:08:24,923 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 22:08:24,971 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 22:08:24,971 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:08:25,022 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 22:08:25,025 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:08:25,026 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:08:25,026 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:08:25,026 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:08:25,026 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:08:25,026 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:08:25,026 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:08:25,027 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:08:25,028 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c_Iteration1_Loop [2019-01-01 22:08:25,028 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:08:25,028 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:08:25,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:08:25,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:08:25,455 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:08:25,461 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:08:25,462 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:08:25,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:08:25,464 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:25,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:25,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:25,465 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:08:25,467 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:08:25,467 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:25,473 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:08:25,480 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 22:08:25,480 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 22:08:25,482 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:08:25,482 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 22:08:25,483 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:08:25,484 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e) = -2*ULTIMATE.start_base2flt_~e + 253 Supporting invariants [] [2019-01-01 22:08:25,485 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 22:08:25,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:25,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:08:25,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:08:25,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:08:25,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:08:25,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:08:25,727 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-01 22:08:25,728 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 86 states. Second operand 3 states. [2019-01-01 22:08:25,892 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 86 states.. Second operand 3 states. Result 254 states and 411 transitions. Complement of second has 6 states. [2019-01-01 22:08:25,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 22:08:25,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 22:08:25,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 269 transitions. [2019-01-01 22:08:25,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 269 transitions. Stem has 3 letters. Loop has 3 letters. [2019-01-01 22:08:25,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:08:25,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 269 transitions. Stem has 6 letters. Loop has 3 letters. [2019-01-01 22:08:25,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:08:25,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 269 transitions. Stem has 3 letters. Loop has 6 letters. [2019-01-01 22:08:25,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:08:25,906 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 254 states and 411 transitions. [2019-01-01 22:08:25,921 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 27 [2019-01-01 22:08:25,933 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 254 states to 56 states and 81 transitions. [2019-01-01 22:08:25,937 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2019-01-01 22:08:25,938 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2019-01-01 22:08:25,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 81 transitions. [2019-01-01 22:08:25,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:08:25,940 INFO L705 BuchiCegarLoop]: Abstraction has 56 states and 81 transitions. [2019-01-01 22:08:25,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 81 transitions. [2019-01-01 22:08:25,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 45. [2019-01-01 22:08:25,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-01 22:08:25,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 69 transitions. [2019-01-01 22:08:25,980 INFO L728 BuchiCegarLoop]: Abstraction has 45 states and 69 transitions. [2019-01-01 22:08:25,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:08:25,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:08:25,984 INFO L87 Difference]: Start difference. First operand 45 states and 69 transitions. Second operand 3 states. [2019-01-01 22:08:26,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:08:26,049 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2019-01-01 22:08:26,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:08:26,051 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2019-01-01 22:08:26,052 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2019-01-01 22:08:26,054 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 30 transitions. [2019-01-01 22:08:26,054 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-01-01 22:08:26,055 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-01-01 22:08:26,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 30 transitions. [2019-01-01 22:08:26,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:08:26,055 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2019-01-01 22:08:26,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 30 transitions. [2019-01-01 22:08:26,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-01 22:08:26,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-01 22:08:26,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2019-01-01 22:08:26,059 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2019-01-01 22:08:26,060 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2019-01-01 22:08:26,060 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 22:08:26,060 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions. [2019-01-01 22:08:26,061 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2019-01-01 22:08:26,061 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:08:26,061 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:08:26,061 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 22:08:26,061 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:08:26,062 INFO L794 eck$LassoCheckResult]: Stem: 469#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_#t~ret5, main_#t~ret6, main_#t~ret7, main_~a~0, main_~ma~2, main_~ea~2, main_~b~0, main_~mb~2, main_~eb~2, main_~r_add~0, main_~zero~0, main_~sa~0, main_~sb~0, main_~tmp~2, main_~tmp___0~0, main_~tmp___1~0, main_~tmp___2~0, main_~tmp___3~0, main_~tmp___4~0, main_~tmp___5~0, main_~tmp___6~0, main_~tmp___7~0, main_~tmp___8~0, main_~tmp___9~0, main_~__retres23~0;havoc main_~a~0;main_~ma~2 := main_#t~nondet0;havoc main_#t~nondet0;main_~ea~2 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~b~0;main_~mb~2 := main_#t~nondet2;havoc main_#t~nondet2;main_~eb~2 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~r_add~0;havoc main_~zero~0;havoc main_~sa~0;havoc main_~sb~0;havoc main_~tmp~2;havoc main_~tmp___0~0;havoc main_~tmp___1~0;havoc main_~tmp___2~0;havoc main_~tmp___3~0;havoc main_~tmp___4~0;havoc main_~tmp___5~0;havoc main_~tmp___6~0;havoc main_~tmp___7~0;havoc main_~tmp___8~0;havoc main_~tmp___9~0;havoc main_~__retres23~0;base2flt_#in~m, base2flt_#in~e := 0, 0;havoc base2flt_#res;havoc base2flt_~m, base2flt_~e, base2flt_~res~0, base2flt_~__retres4~0;base2flt_~m := base2flt_#in~m;base2flt_~e := base2flt_#in~e;havoc base2flt_~res~0;havoc base2flt_~__retres4~0; 468#L19 assume 0 == base2flt_~m % 4294967296;base2flt_~__retres4~0 := 0; 456#L69 base2flt_#res := base2flt_~__retres4~0; 457#L70 main_#t~ret4 := base2flt_#res;main_~zero~0 := main_#t~ret4;havoc main_#t~ret4;base2flt_#in~m, base2flt_#in~e := main_~ma~2, main_~ea~2;havoc base2flt_#res;havoc base2flt_~m, base2flt_~e, base2flt_~res~0, base2flt_~__retres4~0;base2flt_~m := base2flt_#in~m;base2flt_~e := base2flt_#in~e;havoc base2flt_~res~0;havoc base2flt_~__retres4~0; 464#L19-1 assume !(0 == base2flt_~m % 4294967296); 467#L25-1 assume !(base2flt_~m % 4294967296 < 16777216); 461#L47-5 [2019-01-01 22:08:26,062 INFO L796 eck$LassoCheckResult]: Loop: 461#L47-5 assume !false; 449#L48-1 assume base2flt_~m % 4294967296 >= 33554432; 451#L49-1 assume !(base2flt_~e >= 127);base2flt_~e := 1 + base2flt_~e;base2flt_~m := base2flt_~m / 2; 461#L47-5 [2019-01-01 22:08:26,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:26,063 INFO L82 PathProgramCache]: Analyzing trace with hash 921737699, now seen corresponding path program 1 times [2019-01-01 22:08:26,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:26,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:26,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:26,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:08:26,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:26,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:26,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:26,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:26,085 INFO L82 PathProgramCache]: Analyzing trace with hash 136178, now seen corresponding path program 1 times [2019-01-01 22:08:26,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:26,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:26,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:26,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:08:26,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:26,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:26,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:26,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:26,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1761973968, now seen corresponding path program 1 times [2019-01-01 22:08:26,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:26,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:26,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:26,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:08:26,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:26,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:26,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:26,202 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:08:26,203 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:08:26,203 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:08:26,203 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:08:26,203 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 22:08:26,203 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:08:26,204 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:08:26,204 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:08:26,204 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c_Iteration2_Loop [2019-01-01 22:08:26,204 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:08:26,204 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:08:26,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:08:26,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:08:26,347 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:08:26,347 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:08:26,352 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:08:26,352 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:08:26,433 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:08:26,433 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_base2flt_~m=-1} Honda state: {ULTIMATE.start_base2flt_~m=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:08:26,453 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:08:26,454 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 22:08:26,505 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 22:08:26,505 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:08:26,575 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 22:08:26,581 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:08:26,582 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:08:26,582 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:08:26,582 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:08:26,582 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:08:26,582 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:08:26,582 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:08:26,583 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:08:26,583 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c_Iteration2_Loop [2019-01-01 22:08:26,583 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:08:26,583 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:08:26,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:08:26,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:08:26,852 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:08:26,852 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:08:26,853 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:08:26,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:08:26,857 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:26,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:26,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:26,858 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:08:26,860 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:08:26,860 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:26,877 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:26,881 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:08:26,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:08:26,882 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:26,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:26,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:26,883 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:08:26,888 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:08:26,888 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:26,900 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:08:26,906 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 22:08:26,906 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 22:08:26,907 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:08:26,910 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 22:08:26,910 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:08:26,910 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e) = -2*ULTIMATE.start_base2flt_~e + 253 Supporting invariants [] [2019-01-01 22:08:26,911 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 22:08:26,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:26,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:08:26,978 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:08:26,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:08:26,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:08:26,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:08:26,989 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-01 22:08:26,989 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 30 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-01-01 22:08:27,063 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 30 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 40 states and 50 transitions. Complement of second has 5 states. [2019-01-01 22:08:27,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 22:08:27,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 22:08:27,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2019-01-01 22:08:27,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 6 letters. Loop has 3 letters. [2019-01-01 22:08:27,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:08:27,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 9 letters. Loop has 3 letters. [2019-01-01 22:08:27,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:08:27,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 6 letters. Loop has 6 letters. [2019-01-01 22:08:27,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:08:27,066 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 50 transitions. [2019-01-01 22:08:27,067 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 15 [2019-01-01 22:08:27,069 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 37 states and 46 transitions. [2019-01-01 22:08:27,069 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2019-01-01 22:08:27,069 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2019-01-01 22:08:27,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 46 transitions. [2019-01-01 22:08:27,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:08:27,070 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 46 transitions. [2019-01-01 22:08:27,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 46 transitions. [2019-01-01 22:08:27,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2019-01-01 22:08:27,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-01 22:08:27,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2019-01-01 22:08:27,073 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2019-01-01 22:08:27,073 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2019-01-01 22:08:27,073 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 22:08:27,073 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 34 transitions. [2019-01-01 22:08:27,074 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-01-01 22:08:27,074 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:08:27,074 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:08:27,075 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 22:08:27,079 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:08:27,079 INFO L794 eck$LassoCheckResult]: Stem: 583#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_#t~ret5, main_#t~ret6, main_#t~ret7, main_~a~0, main_~ma~2, main_~ea~2, main_~b~0, main_~mb~2, main_~eb~2, main_~r_add~0, main_~zero~0, main_~sa~0, main_~sb~0, main_~tmp~2, main_~tmp___0~0, main_~tmp___1~0, main_~tmp___2~0, main_~tmp___3~0, main_~tmp___4~0, main_~tmp___5~0, main_~tmp___6~0, main_~tmp___7~0, main_~tmp___8~0, main_~tmp___9~0, main_~__retres23~0;havoc main_~a~0;main_~ma~2 := main_#t~nondet0;havoc main_#t~nondet0;main_~ea~2 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~b~0;main_~mb~2 := main_#t~nondet2;havoc main_#t~nondet2;main_~eb~2 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~r_add~0;havoc main_~zero~0;havoc main_~sa~0;havoc main_~sb~0;havoc main_~tmp~2;havoc main_~tmp___0~0;havoc main_~tmp___1~0;havoc main_~tmp___2~0;havoc main_~tmp___3~0;havoc main_~tmp___4~0;havoc main_~tmp___5~0;havoc main_~tmp___6~0;havoc main_~tmp___7~0;havoc main_~tmp___8~0;havoc main_~tmp___9~0;havoc main_~__retres23~0;base2flt_#in~m, base2flt_#in~e := 0, 0;havoc base2flt_#res;havoc base2flt_~m, base2flt_~e, base2flt_~res~0, base2flt_~__retres4~0;base2flt_~m := base2flt_#in~m;base2flt_~e := base2flt_#in~e;havoc base2flt_~res~0;havoc base2flt_~__retres4~0; 580#L19 assume 0 == base2flt_~m % 4294967296;base2flt_~__retres4~0 := 0; 568#L69 base2flt_#res := base2flt_~__retres4~0; 569#L70 main_#t~ret4 := base2flt_#res;main_~zero~0 := main_#t~ret4;havoc main_#t~ret4;base2flt_#in~m, base2flt_#in~e := main_~ma~2, main_~ea~2;havoc base2flt_#res;havoc base2flt_~m, base2flt_~e, base2flt_~res~0, base2flt_~__retres4~0;base2flt_~m := base2flt_#in~m;base2flt_~e := base2flt_#in~e;havoc base2flt_~res~0;havoc base2flt_~__retres4~0; 576#L19-1 assume !(0 == base2flt_~m % 4294967296); 579#L25-1 assume base2flt_~m % 4294967296 < 16777216; 584#L37-3 [2019-01-01 22:08:27,079 INFO L796 eck$LassoCheckResult]: Loop: 584#L37-3 assume !false; 574#L28-1 assume !(base2flt_~e <= -128);base2flt_~e := base2flt_~e - 1;base2flt_~m := 2 * base2flt_~m; 575#L37-2 assume base2flt_~m % 4294967296 < 16777216; 584#L37-3 [2019-01-01 22:08:27,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:27,081 INFO L82 PathProgramCache]: Analyzing trace with hash 921737673, now seen corresponding path program 1 times [2019-01-01 22:08:27,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:27,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:27,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:27,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:08:27,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:27,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:27,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:27,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:27,102 INFO L82 PathProgramCache]: Analyzing trace with hash 110419, now seen corresponding path program 1 times [2019-01-01 22:08:27,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:27,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:27,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:27,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:08:27,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:27,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:27,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:27,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:27,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1761173643, now seen corresponding path program 1 times [2019-01-01 22:08:27,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:27,113 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:27,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:27,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:08:27,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:27,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:27,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:27,218 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:08:27,218 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:08:27,218 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:08:27,218 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:08:27,219 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 22:08:27,219 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:08:27,219 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:08:27,219 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:08:27,219 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c_Iteration3_Loop [2019-01-01 22:08:27,219 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:08:27,220 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:08:27,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:08:27,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:08:27,353 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:08:27,353 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:08:27,357 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:08:27,357 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:08:27,371 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:08:27,371 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_base2flt_~m=0} Honda state: {ULTIMATE.start_base2flt_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:08:27,392 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:08:27,393 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:08:27,415 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 22:08:27,415 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:08:27,437 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 22:08:27,440 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:08:27,440 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:08:27,440 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:08:27,440 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:08:27,440 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:08:27,441 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:08:27,441 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:08:27,441 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:08:27,442 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c_Iteration3_Loop [2019-01-01 22:08:27,442 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:08:27,442 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:08:27,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:08:27,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:08:27,604 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:08:27,604 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:08:27,605 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:08:27,606 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:08:27,606 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:27,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:27,607 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:27,607 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:08:27,608 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:08:27,608 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:27,611 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:27,611 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:08:27,612 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:08:27,612 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:27,612 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:27,612 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:27,613 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:08:27,613 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:08:27,613 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:27,617 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:08:27,620 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 22:08:27,620 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 22:08:27,620 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:08:27,620 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 22:08:27,621 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:08:27,621 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e) = 2*ULTIMATE.start_base2flt_~e + 255 Supporting invariants [] [2019-01-01 22:08:27,621 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 22:08:27,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:27,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:08:27,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:08:27,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:08:27,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:08:27,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:08:27,707 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 22:08:27,707 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 34 transitions. cyclomatic complexity: 12 Second operand 4 states. [2019-01-01 22:08:27,729 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 34 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 44 states and 55 transitions. Complement of second has 5 states. [2019-01-01 22:08:27,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 22:08:27,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 22:08:27,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2019-01-01 22:08:27,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 33 transitions. Stem has 6 letters. Loop has 3 letters. [2019-01-01 22:08:27,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:08:27,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 33 transitions. Stem has 9 letters. Loop has 3 letters. [2019-01-01 22:08:27,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:08:27,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 33 transitions. Stem has 6 letters. Loop has 6 letters. [2019-01-01 22:08:27,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:08:27,735 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 55 transitions. [2019-01-01 22:08:27,736 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2019-01-01 22:08:27,736 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 41 states and 51 transitions. [2019-01-01 22:08:27,737 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2019-01-01 22:08:27,737 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2019-01-01 22:08:27,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 51 transitions. [2019-01-01 22:08:27,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:08:27,737 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 51 transitions. [2019-01-01 22:08:27,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 51 transitions. [2019-01-01 22:08:27,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 29. [2019-01-01 22:08:27,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-01 22:08:27,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2019-01-01 22:08:27,740 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 38 transitions. [2019-01-01 22:08:27,741 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 38 transitions. [2019-01-01 22:08:27,741 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 22:08:27,741 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 38 transitions. [2019-01-01 22:08:27,741 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-01 22:08:27,742 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:08:27,742 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:08:27,742 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:08:27,742 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:08:27,743 INFO L794 eck$LassoCheckResult]: Stem: 702#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_#t~ret5, main_#t~ret6, main_#t~ret7, main_~a~0, main_~ma~2, main_~ea~2, main_~b~0, main_~mb~2, main_~eb~2, main_~r_add~0, main_~zero~0, main_~sa~0, main_~sb~0, main_~tmp~2, main_~tmp___0~0, main_~tmp___1~0, main_~tmp___2~0, main_~tmp___3~0, main_~tmp___4~0, main_~tmp___5~0, main_~tmp___6~0, main_~tmp___7~0, main_~tmp___8~0, main_~tmp___9~0, main_~__retres23~0;havoc main_~a~0;main_~ma~2 := main_#t~nondet0;havoc main_#t~nondet0;main_~ea~2 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~b~0;main_~mb~2 := main_#t~nondet2;havoc main_#t~nondet2;main_~eb~2 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~r_add~0;havoc main_~zero~0;havoc main_~sa~0;havoc main_~sb~0;havoc main_~tmp~2;havoc main_~tmp___0~0;havoc main_~tmp___1~0;havoc main_~tmp___2~0;havoc main_~tmp___3~0;havoc main_~tmp___4~0;havoc main_~tmp___5~0;havoc main_~tmp___6~0;havoc main_~tmp___7~0;havoc main_~tmp___8~0;havoc main_~tmp___9~0;havoc main_~__retres23~0;base2flt_#in~m, base2flt_#in~e := 0, 0;havoc base2flt_#res;havoc base2flt_~m, base2flt_~e, base2flt_~res~0, base2flt_~__retres4~0;base2flt_~m := base2flt_#in~m;base2flt_~e := base2flt_#in~e;havoc base2flt_~res~0;havoc base2flt_~__retres4~0; 699#L19 assume 0 == base2flt_~m % 4294967296;base2flt_~__retres4~0 := 0; 688#L69 base2flt_#res := base2flt_~__retres4~0; 689#L70 main_#t~ret4 := base2flt_#res;main_~zero~0 := main_#t~ret4;havoc main_#t~ret4;base2flt_#in~m, base2flt_#in~e := main_~ma~2, main_~ea~2;havoc base2flt_#res;havoc base2flt_~m, base2flt_~e, base2flt_~res~0, base2flt_~__retres4~0;base2flt_~m := base2flt_#in~m;base2flt_~e := base2flt_#in~e;havoc base2flt_~res~0;havoc base2flt_~__retres4~0; 695#L19-1 assume 0 == base2flt_~m % 4294967296;base2flt_~__retres4~0 := 0; 690#L69-1 base2flt_#res := base2flt_~__retres4~0; 686#L70-1 main_#t~ret5 := base2flt_#res;main_~a~0 := main_#t~ret5;havoc main_#t~ret5;base2flt_#in~m, base2flt_#in~e := main_~mb~2, main_~eb~2;havoc base2flt_#res;havoc base2flt_~m, base2flt_~e, base2flt_~res~0, base2flt_~__retres4~0;base2flt_~m := base2flt_#in~m;base2flt_~e := base2flt_#in~e;havoc base2flt_~res~0;havoc base2flt_~__retres4~0; 687#L19-2 assume !(0 == base2flt_~m % 4294967296); 696#L25-2 assume !(base2flt_~m % 4294967296 < 16777216); 683#L47-8 [2019-01-01 22:08:27,743 INFO L796 eck$LassoCheckResult]: Loop: 683#L47-8 assume !false; 697#L48-2 assume base2flt_~m % 4294967296 >= 33554432; 682#L49-2 assume !(base2flt_~e >= 127);base2flt_~e := 1 + base2flt_~e;base2flt_~m := base2flt_~m / 2; 683#L47-8 [2019-01-01 22:08:27,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:27,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1760951196, now seen corresponding path program 1 times [2019-01-01 22:08:27,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:27,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:27,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:27,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:08:27,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:27,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:27,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:27,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:27,766 INFO L82 PathProgramCache]: Analyzing trace with hash 198737, now seen corresponding path program 1 times [2019-01-01 22:08:27,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:27,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:27,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:27,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:08:27,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:27,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:27,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:27,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:27,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1766695638, now seen corresponding path program 1 times [2019-01-01 22:08:27,778 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:27,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:27,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:27,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:08:27,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:27,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:27,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:27,874 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:08:27,874 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:08:27,874 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:08:27,874 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:08:27,874 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 22:08:27,875 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:08:27,875 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:08:27,875 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:08:27,875 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c_Iteration4_Loop [2019-01-01 22:08:27,875 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:08:27,875 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:08:27,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:08:27,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:08:28,451 WARN L181 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2019-01-01 22:08:28,484 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:08:28,484 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:08:28,489 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:08:28,489 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:08:28,516 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 22:08:28,516 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:08:28,539 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 22:08:28,541 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:08:28,541 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:08:28,542 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:08:28,542 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:08:28,542 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:08:28,542 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:08:28,542 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:08:28,542 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:08:28,542 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c_Iteration4_Loop [2019-01-01 22:08:28,542 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:08:28,542 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:08:28,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:08:28,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:08:28,677 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:08:28,677 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:08:28,679 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:08:28,679 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:08:28,679 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:28,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:28,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:28,680 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:08:28,682 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:08:28,682 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:28,685 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:08:28,692 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 22:08:28,692 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 22:08:28,692 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:08:28,692 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 22:08:28,693 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:08:28,696 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e) = -2*ULTIMATE.start_base2flt_~e + 253 Supporting invariants [] [2019-01-01 22:08:28,696 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 22:08:28,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:28,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:08:28,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:08:28,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:08:28,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:08:28,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:08:28,776 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-01 22:08:28,777 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 38 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-01-01 22:08:28,796 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 38 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 32 states and 42 transitions. Complement of second has 4 states. [2019-01-01 22:08:28,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 22:08:28,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 22:08:28,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2019-01-01 22:08:28,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 9 letters. Loop has 3 letters. [2019-01-01 22:08:28,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:08:28,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 12 letters. Loop has 3 letters. [2019-01-01 22:08:28,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:08:28,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 9 letters. Loop has 6 letters. [2019-01-01 22:08:28,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:08:28,799 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 42 transitions. [2019-01-01 22:08:28,800 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 22:08:28,800 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 26 states and 34 transitions. [2019-01-01 22:08:28,800 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-01-01 22:08:28,800 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-01-01 22:08:28,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 34 transitions. [2019-01-01 22:08:28,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:08:28,801 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2019-01-01 22:08:28,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 34 transitions. [2019-01-01 22:08:28,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-01-01 22:08:28,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-01 22:08:28,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2019-01-01 22:08:28,805 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2019-01-01 22:08:28,806 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2019-01-01 22:08:28,806 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 22:08:28,806 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 34 transitions. [2019-01-01 22:08:28,806 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 22:08:28,808 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:08:28,808 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:08:28,809 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:08:28,810 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:08:28,810 INFO L794 eck$LassoCheckResult]: Stem: 815#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_#t~ret5, main_#t~ret6, main_#t~ret7, main_~a~0, main_~ma~2, main_~ea~2, main_~b~0, main_~mb~2, main_~eb~2, main_~r_add~0, main_~zero~0, main_~sa~0, main_~sb~0, main_~tmp~2, main_~tmp___0~0, main_~tmp___1~0, main_~tmp___2~0, main_~tmp___3~0, main_~tmp___4~0, main_~tmp___5~0, main_~tmp___6~0, main_~tmp___7~0, main_~tmp___8~0, main_~tmp___9~0, main_~__retres23~0;havoc main_~a~0;main_~ma~2 := main_#t~nondet0;havoc main_#t~nondet0;main_~ea~2 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~b~0;main_~mb~2 := main_#t~nondet2;havoc main_#t~nondet2;main_~eb~2 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~r_add~0;havoc main_~zero~0;havoc main_~sa~0;havoc main_~sb~0;havoc main_~tmp~2;havoc main_~tmp___0~0;havoc main_~tmp___1~0;havoc main_~tmp___2~0;havoc main_~tmp___3~0;havoc main_~tmp___4~0;havoc main_~tmp___5~0;havoc main_~tmp___6~0;havoc main_~tmp___7~0;havoc main_~tmp___8~0;havoc main_~tmp___9~0;havoc main_~__retres23~0;base2flt_#in~m, base2flt_#in~e := 0, 0;havoc base2flt_#res;havoc base2flt_~m, base2flt_~e, base2flt_~res~0, base2flt_~__retres4~0;base2flt_~m := base2flt_#in~m;base2flt_~e := base2flt_#in~e;havoc base2flt_~res~0;havoc base2flt_~__retres4~0; 812#L19 assume 0 == base2flt_~m % 4294967296;base2flt_~__retres4~0 := 0; 800#L69 base2flt_#res := base2flt_~__retres4~0; 801#L70 main_#t~ret4 := base2flt_#res;main_~zero~0 := main_#t~ret4;havoc main_#t~ret4;base2flt_#in~m, base2flt_#in~e := main_~ma~2, main_~ea~2;havoc base2flt_#res;havoc base2flt_~m, base2flt_~e, base2flt_~res~0, base2flt_~__retres4~0;base2flt_~m := base2flt_#in~m;base2flt_~e := base2flt_#in~e;havoc base2flt_~res~0;havoc base2flt_~__retres4~0; 809#L19-1 assume 0 == base2flt_~m % 4294967296;base2flt_~__retres4~0 := 0; 804#L69-1 base2flt_#res := base2flt_~__retres4~0; 802#L70-1 main_#t~ret5 := base2flt_#res;main_~a~0 := main_#t~ret5;havoc main_#t~ret5;base2flt_#in~m, base2flt_#in~e := main_~mb~2, main_~eb~2;havoc base2flt_#res;havoc base2flt_~m, base2flt_~e, base2flt_~res~0, base2flt_~__retres4~0;base2flt_~m := base2flt_#in~m;base2flt_~e := base2flt_#in~e;havoc base2flt_~res~0;havoc base2flt_~__retres4~0; 803#L19-2 assume !(0 == base2flt_~m % 4294967296); 810#L25-2 assume base2flt_~m % 4294967296 < 16777216; 814#L37-5 [2019-01-01 22:08:28,810 INFO L796 eck$LassoCheckResult]: Loop: 814#L37-5 assume !false; 798#L28-2 assume !(base2flt_~e <= -128);base2flt_~e := base2flt_~e - 1;base2flt_~m := 2 * base2flt_~m; 799#L37-4 assume base2flt_~m % 4294967296 < 16777216; 814#L37-5 [2019-01-01 22:08:28,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:28,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1760951170, now seen corresponding path program 1 times [2019-01-01 22:08:28,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:28,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:28,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:28,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:08:28,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:28,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:28,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:28,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:28,835 INFO L82 PathProgramCache]: Analyzing trace with hash 172978, now seen corresponding path program 1 times [2019-01-01 22:08:28,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:28,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:28,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:28,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:08:28,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:28,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:28,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:28,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:28,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1765895313, now seen corresponding path program 1 times [2019-01-01 22:08:28,844 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:28,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:28,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:28,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:08:28,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:28,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:28,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:28,996 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-01-01 22:08:29,118 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-01-01 22:08:29,133 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:08:29,133 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:08:29,133 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:08:29,133 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:08:29,133 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 22:08:29,135 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:08:29,135 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:08:29,135 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:08:29,135 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c_Iteration5_Loop [2019-01-01 22:08:29,135 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:08:29,135 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:08:29,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:08:29,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:08:29,368 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:08:29,368 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:08:29,402 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:08:29,402 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:08:29,429 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 22:08:29,429 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:08:29,474 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 22:08:29,476 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:08:29,476 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:08:29,476 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:08:29,476 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:08:29,477 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:08:29,477 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:08:29,477 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:08:29,477 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:08:29,477 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_1_true-unreach-call_true-no-overflow_true-termination.c.cil.c_Iteration5_Loop [2019-01-01 22:08:29,477 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:08:29,477 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:08:29,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:08:29,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:08:29,597 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:08:29,597 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:08:29,598 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 22:08:29,601 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:08:29,601 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:29,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:29,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:29,602 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:08:29,602 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:08:29,603 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:29,605 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:08:29,607 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 22:08:29,607 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 22:08:29,607 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:08:29,608 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 22:08:29,609 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:08:29,609 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e) = 2*ULTIMATE.start_base2flt_~e + 255 Supporting invariants [] [2019-01-01 22:08:29,609 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 22:08:29,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:29,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:08:29,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:08:29,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:08:29,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:08:29,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:08:29,686 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 22:08:29,686 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 34 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-01-01 22:08:29,692 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 34 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 30 states and 38 transitions. Complement of second has 4 states. [2019-01-01 22:08:29,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 22:08:29,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 22:08:29,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2019-01-01 22:08:29,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 9 letters. Loop has 3 letters. [2019-01-01 22:08:29,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:08:29,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 12 letters. Loop has 3 letters. [2019-01-01 22:08:29,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:08:29,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 9 letters. Loop has 6 letters. [2019-01-01 22:08:29,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:08:29,694 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 38 transitions. [2019-01-01 22:08:29,695 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 22:08:29,695 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 0 states and 0 transitions. [2019-01-01 22:08:29,695 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 22:08:29,695 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 22:08:29,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 22:08:29,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:08:29,696 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:08:29,696 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:08:29,696 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:08:29,696 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 22:08:29,696 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 22:08:29,696 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 22:08:29,696 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 22:08:29,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 10:08:29 BoogieIcfgContainer [2019-01-01 22:08:29,706 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 22:08:29,706 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 22:08:29,706 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 22:08:29,707 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 22:08:29,707 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:08:24" (3/4) ... [2019-01-01 22:08:29,712 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 22:08:29,712 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 22:08:29,713 INFO L168 Benchmark]: Toolchain (without parser) took 7285.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 195.0 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -192.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 11.5 GB. [2019-01-01 22:08:29,714 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:08:29,715 INFO L168 Benchmark]: CACSL2BoogieTranslator took 469.19 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 936.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-01-01 22:08:29,716 INFO L168 Benchmark]: Boogie Procedure Inliner took 122.60 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -169.6 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2019-01-01 22:08:29,717 INFO L168 Benchmark]: Boogie Preprocessor took 40.87 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:08:29,717 INFO L168 Benchmark]: RCFGBuilder took 1032.27 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 39.5 MB). Peak memory consumption was 39.5 MB. Max. memory is 11.5 GB. [2019-01-01 22:08:29,718 INFO L168 Benchmark]: BuchiAutomizer took 5608.65 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 82.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -78.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 11.5 GB. [2019-01-01 22:08:29,720 INFO L168 Benchmark]: Witness Printer took 6.09 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:08:29,725 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 469.19 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 936.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 122.60 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -169.6 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.87 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1032.27 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 39.5 MB). Peak memory consumption was 39.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5608.65 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 82.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -78.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 11.5 GB. * Witness Printer took 6.09 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (1 trivial, 5 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * e + 253 and consists of 4 locations. One deterministic module has affine ranking function -2 * e + 253 and consists of 3 locations. One deterministic module has affine ranking function 2 * e + 255 and consists of 3 locations. One deterministic module has affine ranking function -2 * e + 253 and consists of 3 locations. One deterministic module has affine ranking function 2 * e + 255 and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.5s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 4.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 34 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 29 states and ocurred in iteration 3. Nontrivial modules had stage [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 272 SDtfs, 240 SDslu, 26 SDs, 0 SdLazy, 38 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT4 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital21 mio100 ax100 hnf95 lsp57 ukn100 mio100 lsp100 div605 bol100 ite100 ukn100 eq131 hnf43 smp92 dnf100 smp100 tf105 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 21ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...