./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/bitvector/soft_float_2_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_2_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 45b185c6c694406b0734db5727dff1b8fd93ebcf ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:32,445 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 22:08:32,447 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 22:08:32,464 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 22:08:32,464 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 22:08:32,466 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 22:08:32,467 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 22:08:32,471 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 22:08:32,473 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 22:08:32,476 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 22:08:32,477 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 22:08:32,477 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 22:08:32,480 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 22:08:32,483 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 22:08:32,484 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 22:08:32,485 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 22:08:32,494 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 22:08:32,496 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 22:08:32,501 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 22:08:32,502 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 22:08:32,506 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 22:08:32,507 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 22:08:32,512 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 22:08:32,512 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 22:08:32,514 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 22:08:32,515 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 22:08:32,516 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 22:08:32,520 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 22:08:32,521 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 22:08:32,524 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 22:08:32,525 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 22:08:32,526 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 22:08:32,526 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 22:08:32,526 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 22:08:32,527 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 22:08:32,528 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 22:08:32,528 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:32,553 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 22:08:32,553 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 22:08:32,554 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 22:08:32,555 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 22:08:32,555 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 22:08:32,555 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 22:08:32,555 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 22:08:32,555 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 22:08:32,556 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 22:08:32,556 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 22:08:32,557 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 22:08:32,557 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 22:08:32,557 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 22:08:32,557 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 22:08:32,557 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 22:08:32,557 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 22:08:32,558 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 22:08:32,559 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 22:08:32,559 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 22:08:32,559 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 22:08:32,559 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 22:08:32,559 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 22:08:32,559 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 22:08:32,560 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 22:08:32,560 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 22:08:32,560 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 22:08:32,560 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 22:08:32,560 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 22:08:32,561 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 22:08:32,562 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 22:08:32,562 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 22:08:32,563 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 22:08:32,563 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 -> 45b185c6c694406b0734db5727dff1b8fd93ebcf [2019-01-01 22:08:32,599 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 22:08:32,618 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 22:08:32,626 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 22:08:32,628 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 22:08:32,628 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 22:08:32,629 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/bitvector/soft_float_2_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2019-01-01 22:08:32,704 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/148c9b824/e4ba9c3f26a04720a1050c64b2377b11/FLAG29b879ba9 [2019-01-01 22:08:33,209 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 22:08:33,210 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/bitvector/soft_float_2_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2019-01-01 22:08:33,220 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/148c9b824/e4ba9c3f26a04720a1050c64b2377b11/FLAG29b879ba9 [2019-01-01 22:08:33,525 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/148c9b824/e4ba9c3f26a04720a1050c64b2377b11 [2019-01-01 22:08:33,529 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 22:08:33,531 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 22:08:33,532 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 22:08:33,532 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 22:08:33,538 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 22:08:33,540 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:08:33" (1/1) ... [2019-01-01 22:08:33,543 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d7ba34b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:08:33, skipping insertion in model container [2019-01-01 22:08:33,544 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:08:33" (1/1) ... [2019-01-01 22:08:33,554 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 22:08:33,597 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 22:08:33,926 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:08:33,938 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 22:08:34,019 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:08:34,041 INFO L195 MainTranslator]: Completed translation [2019-01-01 22:08:34,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:08:34 WrapperNode [2019-01-01 22:08:34,041 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 22:08:34,042 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 22:08:34,042 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 22:08:34,043 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 22:08:34,053 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:34" (1/1) ... [2019-01-01 22:08:34,064 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:34" (1/1) ... [2019-01-01 22:08:34,205 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 22:08:34,206 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 22:08:34,206 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 22:08:34,206 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 22:08:34,224 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:34" (1/1) ... [2019-01-01 22:08:34,225 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:34" (1/1) ... [2019-01-01 22:08:34,236 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:34" (1/1) ... [2019-01-01 22:08:34,236 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:34" (1/1) ... [2019-01-01 22:08:34,253 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:34" (1/1) ... [2019-01-01 22:08:34,272 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:34" (1/1) ... [2019-01-01 22:08:34,274 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:34" (1/1) ... [2019-01-01 22:08:34,283 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 22:08:34,285 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 22:08:34,287 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 22:08:34,287 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 22:08:34,288 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:08:34" (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:34,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 22:08:34,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 22:08:35,157 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 22:08:35,160 INFO L280 CfgBuilder]: Removed 24 assue(true) statements. [2019-01-01 22:08:35,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:08:35 BoogieIcfgContainer [2019-01-01 22:08:35,161 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 22:08:35,161 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 22:08:35,162 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 22:08:35,165 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 22:08:35,166 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:08:35,166 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 10:08:33" (1/3) ... [2019-01-01 22:08:35,168 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@54904b9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:08:35, skipping insertion in model container [2019-01-01 22:08:35,168 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:08:35,168 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:08:34" (2/3) ... [2019-01-01 22:08:35,168 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@54904b9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:08:35, skipping insertion in model container [2019-01-01 22:08:35,168 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:08:35,169 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:08:35" (3/3) ... [2019-01-01 22:08:35,171 INFO L375 chiAutomizerObserver]: Analyzing ICFG soft_float_2_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2019-01-01 22:08:35,231 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 22:08:35,232 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 22:08:35,232 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 22:08:35,232 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 22:08:35,233 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 22:08:35,233 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 22:08:35,233 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 22:08:35,233 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 22:08:35,233 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 22:08:35,252 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states. [2019-01-01 22:08:35,283 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 24 [2019-01-01 22:08:35,283 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:08:35,283 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:08:35,292 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 22:08:35,292 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:08:35,292 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 22:08:35,292 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states. [2019-01-01 22:08:35,299 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 24 [2019-01-01 22:08:35,299 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:08:35,299 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:08:35,299 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 22:08:35,300 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:08:35,309 INFO L794 eck$LassoCheckResult]: Stem: 34#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_#t~ret8, main_~a~0, main_~ma~2, main_~ea~2, main_~b~0, main_~mb~2, main_~eb~2, main_~r_mul~0, main_~zero~0, main_~one~0, main_~sa~0, main_~tmp~2, main_~tmp___0~0, main_~tmp___1~0, main_~__retres16~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_mul~0;havoc main_~zero~0;havoc main_~one~0;havoc main_~sa~0;havoc main_~tmp~2;havoc main_~tmp___0~0;havoc main_~tmp___1~0;havoc main_~__retres16~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; 30#L19true assume !(0 == base2flt_~m % 4294967296); 17#L25true assume !(base2flt_~m % 4294967296 < 16777216); 13#L47-2true [2019-01-01 22:08:35,310 INFO L796 eck$LassoCheckResult]: Loop: 13#L47-2true assume !false; 22#L48true assume base2flt_~m % 4294967296 >= 33554432; 47#L49true assume !(base2flt_~e >= 127);base2flt_~e := 1 + base2flt_~e;base2flt_~m := base2flt_~m / 2; 13#L47-2true [2019-01-01 22:08:35,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:35,316 INFO L82 PathProgramCache]: Analyzing trace with hash 30973, now seen corresponding path program 1 times [2019-01-01 22:08:35,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:35,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:35,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:35,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:08:35,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:35,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:08:35,498 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:35,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:08:35,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-01 22:08:35,505 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:08:35,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:35,506 INFO L82 PathProgramCache]: Analyzing trace with hash 73619, now seen corresponding path program 1 times [2019-01-01 22:08:35,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:35,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:35,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:35,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:08:35,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:35,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:35,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:35,656 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-01 22:08:35,755 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:08:35,756 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:08:35,756 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:08:35,756 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:08:35,756 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 22:08:35,757 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:08:35,757 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:08:35,757 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:08:35,757 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_2_true-unreach-call_true-no-overflow_true-termination.c.cil.c_Iteration1_Loop [2019-01-01 22:08:35,757 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:08:35,758 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:08:35,780 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:35,811 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:35,969 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2019-01-01 22:08:36,114 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:08:36,115 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) [2019-01-01 22:08:36,124 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:08:36,125 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:08:36,173 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:08:36,174 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 3 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:08:36,196 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:08:36,196 INFO L163 nArgumentSynthesizer]: Using integer mode. 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:36,220 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 22:08:36,221 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:08:36,246 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 22:08:36,248 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:08:36,249 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:08:36,249 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:08:36,249 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:08:36,249 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:08:36,249 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:08:36,249 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:08:36,250 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:08:36,250 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_2_true-unreach-call_true-no-overflow_true-termination.c.cil.c_Iteration1_Loop [2019-01-01 22:08:36,250 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:08:36,250 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:08:36,251 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:36,264 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:36,438 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:08:36,445 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:08:36,447 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:36,449 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:08:36,450 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:36,450 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:36,451 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:36,451 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:08:36,454 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:08:36,455 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:36,466 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:36,467 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:36,468 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:08:36,468 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:36,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:36,468 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:36,468 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:08:36,470 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:08:36,471 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:36,477 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:08:36,482 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 22:08:36,483 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 22:08:36,485 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:08:36,486 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 22:08:36,486 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:08:36,486 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:36,488 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 22:08:36,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:36,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:08:36,564 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:08:36,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:08:36,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:08:36,595 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:36,616 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:36,618 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 70 states. Second operand 3 states. [2019-01-01 22:08:36,791 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 70 states.. Second operand 3 states. Result 203 states and 343 transitions. Complement of second has 6 states. [2019-01-01 22:08:36,792 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:36,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 22:08:36,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 227 transitions. [2019-01-01 22:08:36,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 227 transitions. Stem has 3 letters. Loop has 3 letters. [2019-01-01 22:08:36,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:08:36,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 227 transitions. Stem has 6 letters. Loop has 3 letters. [2019-01-01 22:08:36,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:08:36,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 227 transitions. Stem has 3 letters. Loop has 6 letters. [2019-01-01 22:08:36,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:08:36,802 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 203 states and 343 transitions. [2019-01-01 22:08:36,814 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 39 [2019-01-01 22:08:36,825 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 203 states to 78 states and 119 transitions. [2019-01-01 22:08:36,827 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 74 [2019-01-01 22:08:36,828 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 75 [2019-01-01 22:08:36,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 119 transitions. [2019-01-01 22:08:36,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:08:36,830 INFO L705 BuchiCegarLoop]: Abstraction has 78 states and 119 transitions. [2019-01-01 22:08:36,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 119 transitions. [2019-01-01 22:08:36,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 67. [2019-01-01 22:08:36,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-01 22:08:36,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 107 transitions. [2019-01-01 22:08:36,862 INFO L728 BuchiCegarLoop]: Abstraction has 67 states and 107 transitions. [2019-01-01 22:08:36,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:08:36,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:08:36,867 INFO L87 Difference]: Start difference. First operand 67 states and 107 transitions. Second operand 3 states. [2019-01-01 22:08:37,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:08:37,001 INFO L93 Difference]: Finished difference Result 34 states and 47 transitions. [2019-01-01 22:08:37,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:08:37,003 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 47 transitions. [2019-01-01 22:08:37,004 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 18 [2019-01-01 22:08:37,005 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 47 transitions. [2019-01-01 22:08:37,005 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2019-01-01 22:08:37,006 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2019-01-01 22:08:37,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 47 transitions. [2019-01-01 22:08:37,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:08:37,006 INFO L705 BuchiCegarLoop]: Abstraction has 34 states and 47 transitions. [2019-01-01 22:08:37,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 47 transitions. [2019-01-01 22:08:37,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-01-01 22:08:37,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-01 22:08:37,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 47 transitions. [2019-01-01 22:08:37,010 INFO L728 BuchiCegarLoop]: Abstraction has 34 states and 47 transitions. [2019-01-01 22:08:37,010 INFO L608 BuchiCegarLoop]: Abstraction has 34 states and 47 transitions. [2019-01-01 22:08:37,010 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 22:08:37,010 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 47 transitions. [2019-01-01 22:08:37,011 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 18 [2019-01-01 22:08:37,012 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:08:37,012 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:08:37,012 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 22:08:37,012 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:08:37,013 INFO L794 eck$LassoCheckResult]: Stem: 447#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_#t~ret8, main_~a~0, main_~ma~2, main_~ea~2, main_~b~0, main_~mb~2, main_~eb~2, main_~r_mul~0, main_~zero~0, main_~one~0, main_~sa~0, main_~tmp~2, main_~tmp___0~0, main_~tmp___1~0, main_~__retres16~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_mul~0;havoc main_~zero~0;havoc main_~one~0;havoc main_~sa~0;havoc main_~tmp~2;havoc main_~tmp___0~0;havoc main_~tmp___1~0;havoc main_~__retres16~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; 445#L19 assume 0 == base2flt_~m % 4294967296;base2flt_~__retres4~0 := 0; 418#L69 base2flt_#res := base2flt_~__retres4~0; 419#L70 main_#t~ret4 := base2flt_#res;main_~zero~0 := main_#t~ret4;havoc main_#t~ret4;base2flt_#in~m, base2flt_#in~e := 1, 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; 442#L19-1 assume !(0 == base2flt_~m % 4294967296); 430#L25-1 assume !(base2flt_~m % 4294967296 < 16777216); 422#L47-5 [2019-01-01 22:08:37,013 INFO L796 eck$LassoCheckResult]: Loop: 422#L47-5 assume !false; 425#L48-1 assume base2flt_~m % 4294967296 >= 33554432; 420#L49-1 assume !(base2flt_~e >= 127);base2flt_~e := 1 + base2flt_~e;base2flt_~m := base2flt_~m / 2; 422#L47-5 [2019-01-01 22:08:37,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:37,013 INFO L82 PathProgramCache]: Analyzing trace with hash 921737699, now seen corresponding path program 1 times [2019-01-01 22:08:37,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:37,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:37,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:37,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:08:37,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:37,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:08:37,192 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2019-01-01 22:08:37,239 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:37,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:08:37,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 22:08:37,240 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:08:37,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:37,242 INFO L82 PathProgramCache]: Analyzing trace with hash 136178, now seen corresponding path program 1 times [2019-01-01 22:08:37,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:37,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:37,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:37,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:08:37,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:37,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:37,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:37,393 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-01 22:08:37,499 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:08:37,499 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:08:37,499 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:08:37,499 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:08:37,499 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 22:08:37,499 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:08:37,500 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:08:37,500 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:08:37,500 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_2_true-unreach-call_true-no-overflow_true-termination.c.cil.c_Iteration2_Loop [2019-01-01 22:08:37,500 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:08:37,500 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:08:37,502 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:37,535 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:37,679 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2019-01-01 22:08:37,744 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:08:37,745 INFO L412 LassoAnalysis]: Checking for nontermination... 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:37,756 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:08:37,756 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:08:37,790 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:08:37,790 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 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:08:37,813 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:08:37,813 INFO L163 nArgumentSynthesizer]: Using integer mode. 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:37,837 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 22:08:37,837 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:08:37,879 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 22:08:37,885 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:08:37,886 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:08:37,886 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:08:37,886 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:08:37,886 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:08:37,886 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:08:37,886 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:08:37,887 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:08:37,887 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_2_true-unreach-call_true-no-overflow_true-termination.c.cil.c_Iteration2_Loop [2019-01-01 22:08:37,887 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:08:37,887 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:08:37,888 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:37,900 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:38,051 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2019-01-01 22:08:38,107 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:08:38,108 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:08:38,108 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:38,110 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:08:38,111 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:38,111 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:38,111 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:38,111 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:08:38,113 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:08:38,113 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:38,122 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:38,123 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:38,123 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:08:38,125 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:38,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:38,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:38,125 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:08:38,126 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:08:38,126 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:38,132 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:08:38,135 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 22:08:38,136 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 22:08:38,136 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:08:38,136 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 22:08:38,136 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:08:38,137 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:38,137 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 22:08:38,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:38,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:08:38,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:08:38,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:08:38,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:08:38,195 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:38,195 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:38,196 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 47 transitions. cyclomatic complexity: 19 Second operand 3 states. [2019-01-01 22:08:38,254 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 47 transitions. cyclomatic complexity: 19. Second operand 3 states. Result 62 states and 84 transitions. Complement of second has 5 states. [2019-01-01 22:08:38,260 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:38,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 22:08:38,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2019-01-01 22:08:38,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 49 transitions. Stem has 6 letters. Loop has 3 letters. [2019-01-01 22:08:38,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:08:38,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 49 transitions. Stem has 9 letters. Loop has 3 letters. [2019-01-01 22:08:38,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:08:38,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 49 transitions. Stem has 6 letters. Loop has 6 letters. [2019-01-01 22:08:38,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:08:38,263 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 84 transitions. [2019-01-01 22:08:38,267 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 27 [2019-01-01 22:08:38,268 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 59 states and 80 transitions. [2019-01-01 22:08:38,270 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2019-01-01 22:08:38,270 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2019-01-01 22:08:38,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 80 transitions. [2019-01-01 22:08:38,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:08:38,271 INFO L705 BuchiCegarLoop]: Abstraction has 59 states and 80 transitions. [2019-01-01 22:08:38,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 80 transitions. [2019-01-01 22:08:38,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 37. [2019-01-01 22:08:38,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-01 22:08:38,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2019-01-01 22:08:38,276 INFO L728 BuchiCegarLoop]: Abstraction has 37 states and 51 transitions. [2019-01-01 22:08:38,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:08:38,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:08:38,276 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand 3 states. [2019-01-01 22:08:38,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:08:38,376 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2019-01-01 22:08:38,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:08:38,376 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 46 transitions. [2019-01-01 22:08:38,377 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 15 [2019-01-01 22:08:38,378 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 46 transitions. [2019-01-01 22:08:38,378 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2019-01-01 22:08:38,379 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2019-01-01 22:08:38,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 46 transitions. [2019-01-01 22:08:38,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:08:38,379 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 46 transitions. [2019-01-01 22:08:38,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 46 transitions. [2019-01-01 22:08:38,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2019-01-01 22:08:38,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-01 22:08:38,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2019-01-01 22:08:38,382 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 41 transitions. [2019-01-01 22:08:38,382 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 41 transitions. [2019-01-01 22:08:38,383 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 22:08:38,383 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 41 transitions. [2019-01-01 22:08:38,383 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 15 [2019-01-01 22:08:38,384 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:08:38,384 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:08:38,384 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 22:08:38,384 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:08:38,385 INFO L794 eck$LassoCheckResult]: Stem: 658#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_#t~ret8, main_~a~0, main_~ma~2, main_~ea~2, main_~b~0, main_~mb~2, main_~eb~2, main_~r_mul~0, main_~zero~0, main_~one~0, main_~sa~0, main_~tmp~2, main_~tmp___0~0, main_~tmp___1~0, main_~__retres16~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_mul~0;havoc main_~zero~0;havoc main_~one~0;havoc main_~sa~0;havoc main_~tmp~2;havoc main_~tmp___0~0;havoc main_~tmp___1~0;havoc main_~__retres16~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; 655#L19 assume 0 == base2flt_~m % 4294967296;base2flt_~__retres4~0 := 0; 632#L69 base2flt_#res := base2flt_~__retres4~0; 633#L70 main_#t~ret4 := base2flt_#res;main_~zero~0 := main_#t~ret4;havoc main_#t~ret4;base2flt_#in~m, base2flt_#in~e := 1, 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; 652#L19-1 assume !(0 == base2flt_~m % 4294967296); 640#L25-1 assume base2flt_~m % 4294967296 < 16777216; 641#L37-3 [2019-01-01 22:08:38,385 INFO L796 eck$LassoCheckResult]: Loop: 641#L37-3 assume !false; 650#L28-1 assume !(base2flt_~e <= -128);base2flt_~e := base2flt_~e - 1;base2flt_~m := 2 * base2flt_~m; 651#L37-2 assume base2flt_~m % 4294967296 < 16777216; 641#L37-3 [2019-01-01 22:08:38,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:38,385 INFO L82 PathProgramCache]: Analyzing trace with hash 921737673, now seen corresponding path program 1 times [2019-01-01 22:08:38,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:38,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:38,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:38,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:08:38,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:38,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:38,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:38,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:38,404 INFO L82 PathProgramCache]: Analyzing trace with hash 110419, now seen corresponding path program 1 times [2019-01-01 22:08:38,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:38,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:38,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:38,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:08:38,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:38,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:38,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:38,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:38,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1761173643, now seen corresponding path program 1 times [2019-01-01 22:08:38,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:38,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:38,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:38,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:08:38,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:38,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:38,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:38,489 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:08:38,489 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:08:38,489 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:08:38,489 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:08:38,489 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 22:08:38,489 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:08:38,490 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:08:38,490 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:08:38,490 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_2_true-unreach-call_true-no-overflow_true-termination.c.cil.c_Iteration3_Loop [2019-01-01 22:08:38,490 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:08:38,490 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:08:38,491 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 22:08:38,502 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:38,648 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:08:38,648 INFO L412 LassoAnalysis]: Checking for nontermination... 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:38,652 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:08:38,652 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:08:38,673 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:08:38,673 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 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:38,697 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:08:38,697 INFO L163 nArgumentSynthesizer]: Using integer mode. 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:38,722 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 22:08:38,723 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:08:38,744 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 22:08:38,746 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:08:38,746 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:08:38,746 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:08:38,746 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:08:38,746 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:08:38,746 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:08:38,749 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:08:38,749 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:08:38,749 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_2_true-unreach-call_true-no-overflow_true-termination.c.cil.c_Iteration3_Loop [2019-01-01 22:08:38,749 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:08:38,749 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:08:38,751 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:38,765 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:38,860 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:08:38,860 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:08:38,861 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:38,863 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:08:38,864 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:38,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:38,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:38,864 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:08:38,866 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:08:38,866 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:38,870 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:38,870 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:38,871 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:08:38,871 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:38,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:38,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:38,872 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:08:38,874 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:08:38,875 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:38,879 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:08:38,882 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 22:08:38,883 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 22:08:38,883 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:08:38,883 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 22:08:38,883 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:08:38,884 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:38,884 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 22:08:38,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:38,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:08:38,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:08:38,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:08:38,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:08:39,021 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:39,021 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:39,021 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 41 transitions. cyclomatic complexity: 15 Second operand 4 states. [2019-01-01 22:08:39,038 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 41 transitions. cyclomatic complexity: 15. Second operand 4 states. Result 59 states and 78 transitions. Complement of second has 5 states. [2019-01-01 22:08:39,039 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:39,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 22:08:39,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2019-01-01 22:08:39,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 43 transitions. Stem has 6 letters. Loop has 3 letters. [2019-01-01 22:08:39,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:08:39,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 43 transitions. Stem has 9 letters. Loop has 3 letters. [2019-01-01 22:08:39,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:08:39,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 43 transitions. Stem has 6 letters. Loop has 6 letters. [2019-01-01 22:08:39,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:08:39,041 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 78 transitions. [2019-01-01 22:08:39,043 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 24 [2019-01-01 22:08:39,044 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 56 states and 74 transitions. [2019-01-01 22:08:39,044 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2019-01-01 22:08:39,044 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2019-01-01 22:08:39,045 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 74 transitions. [2019-01-01 22:08:39,045 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:08:39,045 INFO L705 BuchiCegarLoop]: Abstraction has 56 states and 74 transitions. [2019-01-01 22:08:39,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 74 transitions. [2019-01-01 22:08:39,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 34. [2019-01-01 22:08:39,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-01 22:08:39,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2019-01-01 22:08:39,048 INFO L728 BuchiCegarLoop]: Abstraction has 34 states and 45 transitions. [2019-01-01 22:08:39,048 INFO L608 BuchiCegarLoop]: Abstraction has 34 states and 45 transitions. [2019-01-01 22:08:39,048 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 22:08:39,048 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 45 transitions. [2019-01-01 22:08:39,049 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2019-01-01 22:08:39,049 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:08:39,049 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:08:39,049 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:08:39,050 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:08:39,050 INFO L794 eck$LassoCheckResult]: Stem: 797#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_#t~ret8, main_~a~0, main_~ma~2, main_~ea~2, main_~b~0, main_~mb~2, main_~eb~2, main_~r_mul~0, main_~zero~0, main_~one~0, main_~sa~0, main_~tmp~2, main_~tmp___0~0, main_~tmp___1~0, main_~__retres16~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_mul~0;havoc main_~zero~0;havoc main_~one~0;havoc main_~sa~0;havoc main_~tmp~2;havoc main_~tmp___0~0;havoc main_~tmp___1~0;havoc main_~__retres16~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; 794#L19 assume 0 == base2flt_~m % 4294967296;base2flt_~__retres4~0 := 0; 770#L69 base2flt_#res := base2flt_~__retres4~0; 771#L70 main_#t~ret4 := base2flt_#res;main_~zero~0 := main_#t~ret4;havoc main_#t~ret4;base2flt_#in~m, base2flt_#in~e := 1, 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; 791#L19-1 assume 0 == base2flt_~m % 4294967296;base2flt_~__retres4~0 := 0; 782#L69-1 base2flt_#res := base2flt_~__retres4~0; 783#L70-1 main_#t~ret5 := base2flt_#res;main_~one~0 := main_#t~ret5;havoc main_#t~ret5;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; 786#L19-2 assume !(0 == base2flt_~m % 4294967296); 776#L25-2 assume !(base2flt_~m % 4294967296 < 16777216); 769#L47-8 [2019-01-01 22:08:39,050 INFO L796 eck$LassoCheckResult]: Loop: 769#L47-8 assume !false; 792#L48-2 assume base2flt_~m % 4294967296 >= 33554432; 767#L49-2 assume !(base2flt_~e >= 127);base2flt_~e := 1 + base2flt_~e;base2flt_~m := base2flt_~m / 2; 769#L47-8 [2019-01-01 22:08:39,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:39,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1760951196, now seen corresponding path program 1 times [2019-01-01 22:08:39,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:39,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:39,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:39,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:08:39,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:39,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:08:39,126 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:39,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:08:39,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-01 22:08:39,126 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:08:39,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:39,127 INFO L82 PathProgramCache]: Analyzing trace with hash 198737, now seen corresponding path program 1 times [2019-01-01 22:08:39,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:39,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:39,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:39,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:08:39,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:39,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:39,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:39,164 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:08:39,164 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:08:39,165 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:08:39,165 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:08:39,165 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 22:08:39,165 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:08:39,165 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:08:39,165 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:08:39,166 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_2_true-unreach-call_true-no-overflow_true-termination.c.cil.c_Iteration4_Loop [2019-01-01 22:08:39,166 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:08:39,166 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:08:39,167 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:39,174 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:39,364 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:08:39,365 INFO L412 LassoAnalysis]: Checking for nontermination... 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:39,368 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:08:39,368 INFO L163 nArgumentSynthesizer]: Using integer mode. 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:39,393 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 22:08:39,393 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:08:39,415 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 22:08:39,416 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:08:39,417 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:08:39,417 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:08:39,417 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:08:39,417 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:08:39,417 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:08:39,417 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:08:39,417 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:08:39,418 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_2_true-unreach-call_true-no-overflow_true-termination.c.cil.c_Iteration4_Loop [2019-01-01 22:08:39,418 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:08:39,418 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:08:39,419 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:39,431 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:39,565 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:08:39,565 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:08:39,565 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:39,566 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:08:39,566 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:39,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:39,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:39,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:08:39,569 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:08:39,569 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:39,574 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:08:39,576 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 22:08:39,577 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 22:08:39,577 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:08:39,578 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 22:08:39,578 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:08:39,578 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:39,578 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 22:08:39,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:39,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:08:39,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:08:39,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:08:39,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:08:39,628 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:39,628 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:39,628 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 45 transitions. cyclomatic complexity: 16 Second operand 3 states. [2019-01-01 22:08:39,648 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 45 transitions. cyclomatic complexity: 16. Second operand 3 states. Result 51 states and 65 transitions. Complement of second has 5 states. [2019-01-01 22:08:39,650 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:39,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 22:08:39,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2019-01-01 22:08:39,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 43 transitions. Stem has 9 letters. Loop has 3 letters. [2019-01-01 22:08:39,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:08:39,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 43 transitions. Stem has 12 letters. Loop has 3 letters. [2019-01-01 22:08:39,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:08:39,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 43 transitions. Stem has 9 letters. Loop has 6 letters. [2019-01-01 22:08:39,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:08:39,652 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 65 transitions. [2019-01-01 22:08:39,653 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 15 [2019-01-01 22:08:39,653 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 48 states and 61 transitions. [2019-01-01 22:08:39,654 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2019-01-01 22:08:39,654 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2019-01-01 22:08:39,654 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 61 transitions. [2019-01-01 22:08:39,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:08:39,654 INFO L705 BuchiCegarLoop]: Abstraction has 48 states and 61 transitions. [2019-01-01 22:08:39,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 61 transitions. [2019-01-01 22:08:39,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 37. [2019-01-01 22:08:39,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-01 22:08:39,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2019-01-01 22:08:39,664 INFO L728 BuchiCegarLoop]: Abstraction has 37 states and 49 transitions. [2019-01-01 22:08:39,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:08:39,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:08:39,665 INFO L87 Difference]: Start difference. First operand 37 states and 49 transitions. Second operand 3 states. [2019-01-01 22:08:39,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:08:39,757 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2019-01-01 22:08:39,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:08:39,758 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 52 transitions. [2019-01-01 22:08:39,759 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-01-01 22:08:39,760 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 52 transitions. [2019-01-01 22:08:39,760 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2019-01-01 22:08:39,760 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2019-01-01 22:08:39,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 52 transitions. [2019-01-01 22:08:39,761 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:08:39,761 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 52 transitions. [2019-01-01 22:08:39,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 52 transitions. [2019-01-01 22:08:39,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2019-01-01 22:08:39,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-01 22:08:39,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2019-01-01 22:08:39,766 INFO L728 BuchiCegarLoop]: Abstraction has 37 states and 48 transitions. [2019-01-01 22:08:39,766 INFO L608 BuchiCegarLoop]: Abstraction has 37 states and 48 transitions. [2019-01-01 22:08:39,766 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 22:08:39,766 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 48 transitions. [2019-01-01 22:08:39,767 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-01-01 22:08:39,767 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:08:39,767 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:08:39,767 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:08:39,767 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:08:39,768 INFO L794 eck$LassoCheckResult]: Stem: 1018#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_#t~ret8, main_~a~0, main_~ma~2, main_~ea~2, main_~b~0, main_~mb~2, main_~eb~2, main_~r_mul~0, main_~zero~0, main_~one~0, main_~sa~0, main_~tmp~2, main_~tmp___0~0, main_~tmp___1~0, main_~__retres16~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_mul~0;havoc main_~zero~0;havoc main_~one~0;havoc main_~sa~0;havoc main_~tmp~2;havoc main_~tmp___0~0;havoc main_~tmp___1~0;havoc main_~__retres16~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; 1015#L19 assume 0 == base2flt_~m % 4294967296;base2flt_~__retres4~0 := 0; 989#L69 base2flt_#res := base2flt_~__retres4~0; 990#L70 main_#t~ret4 := base2flt_#res;main_~zero~0 := main_#t~ret4;havoc main_#t~ret4;base2flt_#in~m, base2flt_#in~e := 1, 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; 1011#L19-1 assume !(0 == base2flt_~m % 4294967296); 998#L25-1 assume base2flt_~m % 4294967296 < 16777216; 999#L37-3 assume !false; 1008#L28-1 assume base2flt_~e <= -128;base2flt_~__retres4~0 := 0; 1002#L69-1 base2flt_#res := base2flt_~__retres4~0; 1003#L70-1 main_#t~ret5 := base2flt_#res;main_~one~0 := main_#t~ret5;havoc main_#t~ret5;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; 1006#L19-2 assume !(0 == base2flt_~m % 4294967296); 995#L25-2 assume base2flt_~m % 4294967296 < 16777216; 997#L37-5 [2019-01-01 22:08:39,768 INFO L796 eck$LassoCheckResult]: Loop: 997#L37-5 assume !false; 1004#L28-2 assume !(base2flt_~e <= -128);base2flt_~e := base2flt_~e - 1;base2flt_~m := 2 * base2flt_~m; 1005#L37-4 assume base2flt_~m % 4294967296 < 16777216; 997#L37-5 [2019-01-01 22:08:39,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:39,768 INFO L82 PathProgramCache]: Analyzing trace with hash -197167406, now seen corresponding path program 1 times [2019-01-01 22:08:39,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:39,769 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:39,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:39,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:08:39,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:39,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:08:39,895 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:39,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:08:39,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 22:08:39,895 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:08:39,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:39,896 INFO L82 PathProgramCache]: Analyzing trace with hash 172978, now seen corresponding path program 1 times [2019-01-01 22:08:39,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:39,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:39,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:39,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:08:39,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:39,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:39,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:39,930 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:08:39,931 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:08:39,931 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:08:39,931 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:08:39,931 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 22:08:39,931 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:08:39,931 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:08:39,932 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:08:39,932 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_2_true-unreach-call_true-no-overflow_true-termination.c.cil.c_Iteration5_Loop [2019-01-01 22:08:39,932 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:08:39,932 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:08:39,934 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:39,946 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:40,044 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:08:40,044 INFO L412 LassoAnalysis]: Checking for nontermination... 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:40,054 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:08:40,054 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:08:40,075 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:08:40,075 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 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:08:40,108 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:08:40,108 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:08:40,130 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 22:08:40,131 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:08:40,151 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 22:08:40,153 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:08:40,153 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:08:40,153 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:08:40,153 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:08:40,153 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:08:40,153 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:08:40,154 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:08:40,154 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:08:40,154 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_2_true-unreach-call_true-no-overflow_true-termination.c.cil.c_Iteration5_Loop [2019-01-01 22:08:40,154 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:08:40,154 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:08:40,155 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:40,164 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:40,249 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:08:40,249 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:08:40,250 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:40,251 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:08:40,251 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:40,251 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:40,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:40,252 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:08:40,252 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:08:40,253 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:40,254 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:40,255 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:40,255 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:08:40,255 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:40,256 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:40,256 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:40,256 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:08:40,256 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:08:40,256 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:40,259 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:08:40,261 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 22:08:40,261 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 22:08:40,261 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:08:40,261 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 22:08:40,262 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:08:40,262 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:40,262 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 22:08:40,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:40,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:08:40,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:08:40,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:08:40,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:08:40,488 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:40,489 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:40,489 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 48 transitions. cyclomatic complexity: 16 Second operand 4 states. [2019-01-01 22:08:40,504 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states and 48 transitions. cyclomatic complexity: 16. Second operand 4 states. Result 55 states and 69 transitions. Complement of second has 5 states. [2019-01-01 22:08:40,506 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:40,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 22:08:40,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2019-01-01 22:08:40,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 43 transitions. Stem has 12 letters. Loop has 3 letters. [2019-01-01 22:08:40,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:08:40,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 43 transitions. Stem has 15 letters. Loop has 3 letters. [2019-01-01 22:08:40,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:08:40,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 43 transitions. Stem has 12 letters. Loop has 6 letters. [2019-01-01 22:08:40,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:08:40,508 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 69 transitions. [2019-01-01 22:08:40,509 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2019-01-01 22:08:40,510 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 52 states and 65 transitions. [2019-01-01 22:08:40,510 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2019-01-01 22:08:40,510 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2019-01-01 22:08:40,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 65 transitions. [2019-01-01 22:08:40,510 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:08:40,510 INFO L705 BuchiCegarLoop]: Abstraction has 52 states and 65 transitions. [2019-01-01 22:08:40,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 65 transitions. [2019-01-01 22:08:40,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 40. [2019-01-01 22:08:40,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-01 22:08:40,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2019-01-01 22:08:40,517 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 52 transitions. [2019-01-01 22:08:40,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 22:08:40,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-01 22:08:40,517 INFO L87 Difference]: Start difference. First operand 40 states and 52 transitions. Second operand 4 states. [2019-01-01 22:08:40,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:08:40,605 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2019-01-01 22:08:40,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 22:08:40,606 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 55 transitions. [2019-01-01 22:08:40,607 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-01 22:08:40,608 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 43 states and 54 transitions. [2019-01-01 22:08:40,608 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2019-01-01 22:08:40,608 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2019-01-01 22:08:40,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 54 transitions. [2019-01-01 22:08:40,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:08:40,611 INFO L705 BuchiCegarLoop]: Abstraction has 43 states and 54 transitions. [2019-01-01 22:08:40,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 54 transitions. [2019-01-01 22:08:40,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2019-01-01 22:08:40,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-01 22:08:40,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 51 transitions. [2019-01-01 22:08:40,614 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 51 transitions. [2019-01-01 22:08:40,614 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 51 transitions. [2019-01-01 22:08:40,614 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 22:08:40,614 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 51 transitions. [2019-01-01 22:08:40,614 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-01 22:08:40,614 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:08:40,615 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:08:40,615 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:08:40,615 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:08:40,616 INFO L794 eck$LassoCheckResult]: Stem: 1266#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_#t~ret8, main_~a~0, main_~ma~2, main_~ea~2, main_~b~0, main_~mb~2, main_~eb~2, main_~r_mul~0, main_~zero~0, main_~one~0, main_~sa~0, main_~tmp~2, main_~tmp___0~0, main_~tmp___1~0, main_~__retres16~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_mul~0;havoc main_~zero~0;havoc main_~one~0;havoc main_~sa~0;havoc main_~tmp~2;havoc main_~tmp___0~0;havoc main_~tmp___1~0;havoc main_~__retres16~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; 1261#L19 assume 0 == base2flt_~m % 4294967296;base2flt_~__retres4~0 := 0; 1234#L69 base2flt_#res := base2flt_~__retres4~0; 1235#L70 main_#t~ret4 := base2flt_#res;main_~zero~0 := main_#t~ret4;havoc main_#t~ret4;base2flt_#in~m, base2flt_#in~e := 1, 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; 1257#L19-1 assume !(0 == base2flt_~m % 4294967296); 1243#L25-1 assume base2flt_~m % 4294967296 < 16777216; 1244#L37-3 assume !false; 1255#L28-1 assume !(base2flt_~e <= -128);base2flt_~e := base2flt_~e - 1;base2flt_~m := 2 * base2flt_~m; 1256#L37-2 assume !(base2flt_~m % 4294967296 < 16777216); 1262#L63-1 base2flt_~m := ~bitwiseAnd(base2flt_~m, ~bitwiseComplement(16777216));base2flt_~res~0 := ~bitwiseOr(base2flt_~m, 16777216 * (128 + base2flt_~e));base2flt_~__retres4~0 := base2flt_~res~0; 1247#L69-1 base2flt_#res := base2flt_~__retres4~0; 1248#L70-1 main_#t~ret5 := base2flt_#res;main_~one~0 := main_#t~ret5;havoc main_#t~ret5;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; 1252#L19-2 assume 0 == base2flt_~m % 4294967296;base2flt_~__retres4~0 := 0; 1231#L69-2 base2flt_#res := base2flt_~__retres4~0; 1245#L70-2 main_#t~ret6 := base2flt_#res;main_~a~0 := main_#t~ret6;havoc main_#t~ret6;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; 1253#L19-3 assume !(0 == base2flt_~m % 4294967296); 1238#L25-3 assume !(base2flt_~m % 4294967296 < 16777216); 1239#L47-11 [2019-01-01 22:08:40,616 INFO L796 eck$LassoCheckResult]: Loop: 1239#L47-11 assume !false; 1268#L48-3 assume base2flt_~m % 4294967296 >= 33554432; 1246#L49-3 assume !(base2flt_~e >= 127);base2flt_~e := 1 + base2flt_~e;base2flt_~m := base2flt_~m / 2; 1239#L47-11 [2019-01-01 22:08:40,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:40,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1360904017, now seen corresponding path program 1 times [2019-01-01 22:08:40,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:40,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:40,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:40,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:08:40,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:40,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:08:40,690 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:40,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:08:40,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 22:08:40,691 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:08:40,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:40,692 INFO L82 PathProgramCache]: Analyzing trace with hash 261296, now seen corresponding path program 1 times [2019-01-01 22:08:40,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:40,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:40,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:40,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:08:40,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:40,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:40,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:40,733 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:08:40,733 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:08:40,733 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:08:40,733 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:08:40,734 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 22:08:40,734 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:08:40,734 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:08:40,734 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:08:40,734 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_2_true-unreach-call_true-no-overflow_true-termination.c.cil.c_Iteration6_Loop [2019-01-01 22:08:40,734 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:08:40,735 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:08:40,736 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:40,751 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:40,897 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:08:40,897 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:08:40,902 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:08:40,902 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:08:40,925 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 22:08:40,925 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:08:40,948 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 22:08:40,950 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:08:40,950 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:08:40,950 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:08:40,951 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:08:40,951 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:08:40,951 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:08:40,951 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:08:40,951 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:08:40,951 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_2_true-unreach-call_true-no-overflow_true-termination.c.cil.c_Iteration6_Loop [2019-01-01 22:08:40,951 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:08:40,951 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:08:40,953 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:40,966 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:41,229 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-01-01 22:08:41,230 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:08:41,230 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:08:41,230 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:41,231 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:08:41,231 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:41,231 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:41,231 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:41,231 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:08:41,235 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:08:41,235 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:41,237 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:08:41,243 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 22:08:41,243 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 22:08:41,243 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:08:41,243 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 22:08:41,243 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:08:41,244 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:41,244 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 22:08:41,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:41,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:08:41,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:08:41,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:08:41,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:08:41,344 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:41,344 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:41,344 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 51 transitions. cyclomatic complexity: 16 Second operand 3 states. [2019-01-01 22:08:41,366 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 51 transitions. cyclomatic complexity: 16. Second operand 3 states. Result 43 states and 55 transitions. Complement of second has 4 states. [2019-01-01 22:08:41,367 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:41,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 22:08:41,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2019-01-01 22:08:41,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 40 transitions. Stem has 17 letters. Loop has 3 letters. [2019-01-01 22:08:41,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:08:41,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 40 transitions. Stem has 20 letters. Loop has 3 letters. [2019-01-01 22:08:41,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:08:41,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 40 transitions. Stem has 17 letters. Loop has 6 letters. [2019-01-01 22:08:41,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:08:41,369 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 55 transitions. [2019-01-01 22:08:41,369 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 22:08:41,372 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 37 states and 47 transitions. [2019-01-01 22:08:41,372 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-01-01 22:08:41,372 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-01-01 22:08:41,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 47 transitions. [2019-01-01 22:08:41,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:08:41,373 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 47 transitions. [2019-01-01 22:08:41,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 47 transitions. [2019-01-01 22:08:41,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-01-01 22:08:41,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-01 22:08:41,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2019-01-01 22:08:41,376 INFO L728 BuchiCegarLoop]: Abstraction has 37 states and 47 transitions. [2019-01-01 22:08:41,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 22:08:41,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 22:08:41,377 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. Second operand 4 states. [2019-01-01 22:08:41,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:08:41,451 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2019-01-01 22:08:41,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 22:08:41,452 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 56 transitions. [2019-01-01 22:08:41,453 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 22:08:41,454 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 56 transitions. [2019-01-01 22:08:41,454 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2019-01-01 22:08:41,455 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2019-01-01 22:08:41,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 56 transitions. [2019-01-01 22:08:41,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:08:41,455 INFO L705 BuchiCegarLoop]: Abstraction has 45 states and 56 transitions. [2019-01-01 22:08:41,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 56 transitions. [2019-01-01 22:08:41,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2019-01-01 22:08:41,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-01 22:08:41,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 50 transitions. [2019-01-01 22:08:41,458 INFO L728 BuchiCegarLoop]: Abstraction has 39 states and 50 transitions. [2019-01-01 22:08:41,458 INFO L608 BuchiCegarLoop]: Abstraction has 39 states and 50 transitions. [2019-01-01 22:08:41,458 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2019-01-01 22:08:41,459 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 50 transitions. [2019-01-01 22:08:41,459 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 22:08:41,459 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:08:41,459 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:08:41,460 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:08:41,460 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:08:41,460 INFO L794 eck$LassoCheckResult]: Stem: 1506#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_#t~ret8, main_~a~0, main_~ma~2, main_~ea~2, main_~b~0, main_~mb~2, main_~eb~2, main_~r_mul~0, main_~zero~0, main_~one~0, main_~sa~0, main_~tmp~2, main_~tmp___0~0, main_~tmp___1~0, main_~__retres16~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_mul~0;havoc main_~zero~0;havoc main_~one~0;havoc main_~sa~0;havoc main_~tmp~2;havoc main_~tmp___0~0;havoc main_~tmp___1~0;havoc main_~__retres16~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; 1503#L19 assume 0 == base2flt_~m % 4294967296;base2flt_~__retres4~0 := 0; 1478#L69 base2flt_#res := base2flt_~__retres4~0; 1479#L70 main_#t~ret4 := base2flt_#res;main_~zero~0 := main_#t~ret4;havoc main_#t~ret4;base2flt_#in~m, base2flt_#in~e := 1, 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; 1499#L19-1 assume !(0 == base2flt_~m % 4294967296); 1486#L25-1 assume base2flt_~m % 4294967296 < 16777216; 1487#L37-3 assume !false; 1497#L28-1 assume !(base2flt_~e <= -128);base2flt_~e := base2flt_~e - 1;base2flt_~m := 2 * base2flt_~m; 1498#L37-2 assume base2flt_~m % 4294967296 < 16777216; 1509#L37-3 assume !false; 1496#L28-1 assume base2flt_~e <= -128;base2flt_~__retres4~0 := 0; 1489#L69-1 base2flt_#res := base2flt_~__retres4~0; 1490#L70-1 main_#t~ret5 := base2flt_#res;main_~one~0 := main_#t~ret5;havoc main_#t~ret5;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; 1494#L19-2 assume 0 == base2flt_~m % 4294967296;base2flt_~__retres4~0 := 0; 1475#L69-2 base2flt_#res := base2flt_~__retres4~0; 1488#L70-2 main_#t~ret6 := base2flt_#res;main_~a~0 := main_#t~ret6;havoc main_#t~ret6;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; 1495#L19-3 assume !(0 == base2flt_~m % 4294967296); 1482#L25-3 assume base2flt_~m % 4294967296 < 16777216; 1480#L37-7 [2019-01-01 22:08:41,460 INFO L796 eck$LassoCheckResult]: Loop: 1480#L37-7 assume !false; 1481#L28-3 assume !(base2flt_~e <= -128);base2flt_~e := base2flt_~e - 1;base2flt_~m := 2 * base2flt_~m; 1505#L37-6 assume base2flt_~m % 4294967296 < 16777216; 1480#L37-7 [2019-01-01 22:08:41,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:41,461 INFO L82 PathProgramCache]: Analyzing trace with hash -377438794, now seen corresponding path program 1 times [2019-01-01 22:08:41,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:41,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:41,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:41,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:08:41,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:41,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:08:41,505 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:08:41,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 22:08:41,506 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 22:08:41,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:08:41,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:08:41,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:08:41,553 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 22:08:41,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 22:08:41,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2019-01-01 22:08:41,574 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:08:41,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:41,574 INFO L82 PathProgramCache]: Analyzing trace with hash 235537, now seen corresponding path program 1 times [2019-01-01 22:08:41,574 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:41,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:41,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:41,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:08:41,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:41,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:41,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:41,662 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:08:41,662 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:08:41,662 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:08:41,662 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:08:41,662 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 22:08:41,662 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:08:41,663 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:08:41,663 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:08:41,663 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_2_true-unreach-call_true-no-overflow_true-termination.c.cil.c_Iteration7_Loop [2019-01-01 22:08:41,663 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:08:41,663 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:08:41,664 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:41,753 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:41,857 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:08:41,858 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:08:41,862 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:08:41,862 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:08:41,873 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:08:41,873 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 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:08:41,895 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:08:41,895 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:08:41,918 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 22:08:41,918 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:08:41,940 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 22:08:41,942 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:08:41,942 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:08:41,942 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:08:41,943 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:08:41,943 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:08:41,943 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:08:41,943 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:08:41,943 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:08:41,943 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_2_true-unreach-call_true-no-overflow_true-termination.c.cil.c_Iteration7_Loop [2019-01-01 22:08:41,943 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:08:41,943 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:08:41,944 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:41,952 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:42,030 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:08:42,031 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:08:42,032 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:42,034 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:08:42,034 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:42,034 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:42,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:42,034 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:08:42,035 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:08:42,035 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:42,037 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:42,037 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:42,037 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:08:42,037 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:42,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:42,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:42,038 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:08:42,038 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:08:42,038 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:42,048 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:08:42,049 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 22:08:42,050 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 22:08:42,055 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:08:42,055 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 22:08:42,055 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:08:42,056 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:42,056 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 22:08:42,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:42,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:08:42,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:08:42,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:08:42,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:08:42,310 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:42,310 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:42,310 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 50 transitions. cyclomatic complexity: 15 Second operand 4 states. [2019-01-01 22:08:42,338 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 50 transitions. cyclomatic complexity: 15. Second operand 4 states. Result 43 states and 54 transitions. Complement of second has 4 states. [2019-01-01 22:08:42,339 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:42,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 22:08:42,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2019-01-01 22:08:42,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 37 transitions. Stem has 18 letters. Loop has 3 letters. [2019-01-01 22:08:42,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:08:42,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 37 transitions. Stem has 21 letters. Loop has 3 letters. [2019-01-01 22:08:42,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:08:42,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 37 transitions. Stem has 18 letters. Loop has 6 letters. [2019-01-01 22:08:42,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:08:42,341 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 54 transitions. [2019-01-01 22:08:42,341 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 22:08:42,341 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 0 states and 0 transitions. [2019-01-01 22:08:42,342 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 22:08:42,342 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 22:08:42,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 22:08:42,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:08:42,343 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:08:42,343 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:08:42,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 22:08:42,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-01 22:08:42,343 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 5 states. [2019-01-01 22:08:42,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:08:42,344 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-01 22:08:42,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-01 22:08:42,344 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-01 22:08:42,344 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 22:08:42,344 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 22:08:42,344 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 22:08:42,344 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 22:08:42,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 22:08:42,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:08:42,345 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:08:42,345 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:08:42,345 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:08:42,345 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2019-01-01 22:08:42,345 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 22:08:42,345 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 22:08:42,345 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 22:08:42,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 10:08:42 BoogieIcfgContainer [2019-01-01 22:08:42,352 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 22:08:42,353 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 22:08:42,353 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 22:08:42,353 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 22:08:42,356 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:35" (3/4) ... [2019-01-01 22:08:42,360 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 22:08:42,360 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 22:08:42,361 INFO L168 Benchmark]: Toolchain (without parser) took 8831.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 186.6 MB). Free memory was 951.4 MB in the beginning and 973.8 MB in the end (delta: -22.5 MB). Peak memory consumption was 164.2 MB. Max. memory is 11.5 GB. [2019-01-01 22:08:42,363 INFO L168 Benchmark]: CDTParser took 0.25 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:42,364 INFO L168 Benchmark]: CACSL2BoogieTranslator took 509.68 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 935.3 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:42,366 INFO L168 Benchmark]: Boogie Procedure Inliner took 163.28 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.3 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -164.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2019-01-01 22:08:42,367 INFO L168 Benchmark]: Boogie Preprocessor took 78.79 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-01 22:08:42,367 INFO L168 Benchmark]: RCFGBuilder took 875.76 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: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2019-01-01 22:08:42,369 INFO L168 Benchmark]: BuchiAutomizer took 7191.19 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 973.8 MB in the end (delta: 86.1 MB). Peak memory consumption was 168.4 MB. Max. memory is 11.5 GB. [2019-01-01 22:08:42,371 INFO L168 Benchmark]: Witness Printer took 7.54 ms. Allocated memory is still 1.2 GB. Free memory is still 973.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:08:42,379 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.25 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 509.68 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 935.3 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 163.28 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.3 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -164.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 78.79 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 875.76 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: 25.9 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7191.19 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 973.8 MB in the end (delta: 86.1 MB). Peak memory consumption was 168.4 MB. Max. memory is 11.5 GB. * Witness Printer took 7.54 ms. Allocated memory is still 1.2 GB. Free memory is still 973.8 MB. 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 13 terminating modules (6 trivial, 7 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. 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. 6 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.1s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 5.1s. Construction of modules took 0.5s. Büchi inclusion checks took 1.1s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 9. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 95 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 40 states and ocurred in iteration 5. Nontrivial modules had stage [7, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 542 SDtfs, 373 SDslu, 116 SDs, 0 SdLazy, 207 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI0 SILT6 lasso0 LassoPreprocessingBenchmarks: Lassos: inital21 mio100 ax100 hnf95 lsp57 ukn100 mio100 lsp100 div596 bol100 ite100 ukn100 eq131 hnf43 smp92 dnf100 smp100 tf105 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 20ms VariablesStem: 0 VariablesLoop: 5 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 7 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...