./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/bitvector/soft_float_4_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_4_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 ee05cb2d66f71fb2277986b04bb223cfc634fed1 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:54,615 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 22:08:54,617 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 22:08:54,634 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 22:08:54,634 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 22:08:54,636 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 22:08:54,637 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 22:08:54,639 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 22:08:54,640 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 22:08:54,641 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 22:08:54,642 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 22:08:54,642 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 22:08:54,643 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 22:08:54,644 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 22:08:54,645 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 22:08:54,649 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 22:08:54,650 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 22:08:54,654 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 22:08:54,658 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 22:08:54,662 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 22:08:54,664 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 22:08:54,666 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 22:08:54,671 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 22:08:54,675 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 22:08:54,675 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 22:08:54,676 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 22:08:54,676 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 22:08:54,677 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 22:08:54,679 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 22:08:54,682 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 22:08:54,682 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 22:08:54,683 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 22:08:54,683 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 22:08:54,683 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 22:08:54,684 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 22:08:54,685 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 22:08:54,685 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:54,717 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 22:08:54,718 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 22:08:54,719 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 22:08:54,719 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 22:08:54,719 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 22:08:54,720 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 22:08:54,721 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 22:08:54,721 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 22:08:54,722 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 22:08:54,722 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 22:08:54,722 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 22:08:54,722 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 22:08:54,722 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 22:08:54,722 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 22:08:54,724 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 22:08:54,724 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 22:08:54,724 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 22:08:54,724 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 22:08:54,725 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 22:08:54,725 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 22:08:54,725 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 22:08:54,725 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 22:08:54,725 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 22:08:54,725 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 22:08:54,728 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 22:08:54,728 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 22:08:54,728 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 22:08:54,729 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 22:08:54,729 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 22:08:54,729 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 22:08:54,729 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 22:08:54,732 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 22:08:54,733 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 -> ee05cb2d66f71fb2277986b04bb223cfc634fed1 [2019-01-01 22:08:54,793 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 22:08:54,808 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 22:08:54,814 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 22:08:54,816 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 22:08:54,816 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 22:08:54,817 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/bitvector/soft_float_4_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2019-01-01 22:08:54,871 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66a2c4a6a/bb69f2cf9852404f9a66b85a1656af7d/FLAG62c13e1f6 [2019-01-01 22:08:55,367 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 22:08:55,369 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/bitvector/soft_float_4_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2019-01-01 22:08:55,384 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66a2c4a6a/bb69f2cf9852404f9a66b85a1656af7d/FLAG62c13e1f6 [2019-01-01 22:08:55,662 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66a2c4a6a/bb69f2cf9852404f9a66b85a1656af7d [2019-01-01 22:08:55,666 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 22:08:55,668 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 22:08:55,669 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 22:08:55,669 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 22:08:55,673 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 22:08:55,674 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:08:55" (1/1) ... [2019-01-01 22:08:55,677 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dbefa8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:08:55, skipping insertion in model container [2019-01-01 22:08:55,677 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 10:08:55" (1/1) ... [2019-01-01 22:08:55,685 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 22:08:55,729 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 22:08:55,969 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:08:55,973 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 22:08:56,029 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 22:08:56,050 INFO L195 MainTranslator]: Completed translation [2019-01-01 22:08:56,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:08:56 WrapperNode [2019-01-01 22:08:56,050 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 22:08:56,051 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 22:08:56,051 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 22:08:56,052 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 22:08:56,070 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:56" (1/1) ... [2019-01-01 22:08:56,079 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:56" (1/1) ... [2019-01-01 22:08:56,114 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 22:08:56,114 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 22:08:56,114 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 22:08:56,114 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 22:08:56,197 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:56" (1/1) ... [2019-01-01 22:08:56,197 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:56" (1/1) ... [2019-01-01 22:08:56,201 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:56" (1/1) ... [2019-01-01 22:08:56,202 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:56" (1/1) ... [2019-01-01 22:08:56,218 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:56" (1/1) ... [2019-01-01 22:08:56,226 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:56" (1/1) ... [2019-01-01 22:08:56,228 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:56" (1/1) ... [2019-01-01 22:08:56,232 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 22:08:56,232 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 22:08:56,233 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 22:08:56,233 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 22:08:56,234 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:08:56" (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:56,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 22:08:56,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 22:08:57,078 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 22:08:57,078 INFO L280 CfgBuilder]: Removed 30 assue(true) statements. [2019-01-01 22:08:57,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:08:57 BoogieIcfgContainer [2019-01-01 22:08:57,079 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 22:08:57,080 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 22:08:57,080 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 22:08:57,084 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 22:08:57,085 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:08:57,085 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 10:08:55" (1/3) ... [2019-01-01 22:08:57,086 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5a5ff35c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:08:57, skipping insertion in model container [2019-01-01 22:08:57,086 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:08:57,086 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 10:08:56" (2/3) ... [2019-01-01 22:08:57,087 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5a5ff35c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 10:08:57, skipping insertion in model container [2019-01-01 22:08:57,087 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 22:08:57,087 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 10:08:57" (3/3) ... [2019-01-01 22:08:57,089 INFO L375 chiAutomizerObserver]: Analyzing ICFG soft_float_4_true-unreach-call_true-no-overflow_true-termination.c.cil.c [2019-01-01 22:08:57,148 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 22:08:57,149 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 22:08:57,149 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 22:08:57,149 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 22:08:57,150 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 22:08:57,150 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 22:08:57,150 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 22:08:57,150 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 22:08:57,150 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 22:08:57,166 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states. [2019-01-01 22:08:57,193 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 18 [2019-01-01 22:08:57,193 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:08:57,194 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:08:57,201 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 22:08:57,202 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:08:57,202 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 22:08:57,202 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 72 states. [2019-01-01 22:08:57,209 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 18 [2019-01-01 22:08:57,209 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:08:57,209 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:08:57,210 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 22:08:57,210 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:08:57,217 INFO L794 eck$LassoCheckResult]: Stem: 32#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_add1~0, main_~r_add2~0, main_~zero~0, main_~tmp~2, main_~tmp___0~0, main_~__retres14~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_add1~0;havoc main_~r_add2~0;havoc main_~zero~0;havoc main_~tmp~2;havoc main_~tmp___0~0;havoc main_~__retres14~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); 19#L25true assume !(base2flt_~m % 4294967296 < 16777216); 14#L47-2true [2019-01-01 22:08:57,217 INFO L796 eck$LassoCheckResult]: Loop: 14#L47-2true assume !false; 25#L48true assume base2flt_~m % 4294967296 >= 33554432; 48#L49true assume !(base2flt_~e >= 127);base2flt_~e := 1 + base2flt_~e;base2flt_~m := base2flt_~m / 2; 14#L47-2true [2019-01-01 22:08:57,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:57,224 INFO L82 PathProgramCache]: Analyzing trace with hash 30973, now seen corresponding path program 1 times [2019-01-01 22:08:57,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:57,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:57,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:57,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:08:57,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:57,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:08:57,398 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:57,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 22:08:57,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-01 22:08:57,405 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 22:08:57,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:57,406 INFO L82 PathProgramCache]: Analyzing trace with hash 73619, now seen corresponding path program 1 times [2019-01-01 22:08:57,406 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:57,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:57,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:57,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:08:57,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:57,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:57,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:57,546 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-01 22:08:57,642 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:08:57,644 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:08:57,644 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:08:57,645 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:08:57,645 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 22:08:57,645 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:08:57,645 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:08:57,645 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:08:57,645 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_4_true-unreach-call_true-no-overflow_true-termination.c.cil.c_Iteration1_Loop [2019-01-01 22:08:57,646 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:08:57,646 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:08:57,671 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:57,761 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:57,906 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2019-01-01 22:08:58,000 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:08:58,001 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:08:58,013 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:08:58,014 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 22:08:58,063 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 22:08:58,063 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:08:58,092 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 22:08:58,094 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:08:58,094 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:08:58,094 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:08:58,095 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:08:58,095 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:08:58,095 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:08:58,095 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:08:58,095 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:08:58,095 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_4_true-unreach-call_true-no-overflow_true-termination.c.cil.c_Iteration1_Loop [2019-01-01 22:08:58,095 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:08:58,096 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:08:58,097 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:58,106 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:58,274 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:08:58,279 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:08:58,281 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:58,282 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:08:58,283 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:58,283 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:58,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:58,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:08:58,286 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:08:58,286 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:58,292 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:08:58,298 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 22:08:58,298 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 22:08:58,300 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:08:58,301 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 22:08:58,301 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:08:58,302 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:58,303 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 22:08:58,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:58,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:08:58,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:08:58,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:08:58,400 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:08:58,401 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:58,420 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:58,422 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 72 states. Second operand 3 states. [2019-01-01 22:08:58,530 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 72 states.. Second operand 3 states. Result 212 states and 334 transitions. Complement of second has 6 states. [2019-01-01 22:08:58,533 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:58,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 22:08:58,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 219 transitions. [2019-01-01 22:08:58,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 219 transitions. Stem has 3 letters. Loop has 3 letters. [2019-01-01 22:08:58,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:08:58,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 219 transitions. Stem has 6 letters. Loop has 3 letters. [2019-01-01 22:08:58,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:08:58,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 219 transitions. Stem has 3 letters. Loop has 6 letters. [2019-01-01 22:08:58,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:08:58,545 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 212 states and 334 transitions. [2019-01-01 22:08:58,557 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 27 [2019-01-01 22:08:58,564 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 212 states to 56 states and 81 transitions. [2019-01-01 22:08:58,566 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2019-01-01 22:08:58,566 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2019-01-01 22:08:58,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 81 transitions. [2019-01-01 22:08:58,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:08:58,568 INFO L705 BuchiCegarLoop]: Abstraction has 56 states and 81 transitions. [2019-01-01 22:08:58,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 81 transitions. [2019-01-01 22:08:58,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 45. [2019-01-01 22:08:58,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-01 22:08:58,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 69 transitions. [2019-01-01 22:08:58,598 INFO L728 BuchiCegarLoop]: Abstraction has 45 states and 69 transitions. [2019-01-01 22:08:58,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 22:08:58,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 22:08:58,603 INFO L87 Difference]: Start difference. First operand 45 states and 69 transitions. Second operand 3 states. [2019-01-01 22:08:58,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 22:08:58,678 INFO L93 Difference]: Finished difference Result 23 states and 30 transitions. [2019-01-01 22:08:58,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 22:08:58,680 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. [2019-01-01 22:08:58,681 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2019-01-01 22:08:58,682 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 30 transitions. [2019-01-01 22:08:58,682 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-01-01 22:08:58,682 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-01-01 22:08:58,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 30 transitions. [2019-01-01 22:08:58,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:08:58,684 INFO L705 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2019-01-01 22:08:58,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 30 transitions. [2019-01-01 22:08:58,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-01 22:08:58,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-01 22:08:58,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2019-01-01 22:08:58,687 INFO L728 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2019-01-01 22:08:58,687 INFO L608 BuchiCegarLoop]: Abstraction has 23 states and 30 transitions. [2019-01-01 22:08:58,687 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 22:08:58,688 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions. [2019-01-01 22:08:58,688 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2019-01-01 22:08:58,688 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:08:58,689 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:08:58,689 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 22:08:58,689 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:08:58,690 INFO L794 eck$LassoCheckResult]: Stem: 414#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_add1~0, main_~r_add2~0, main_~zero~0, main_~tmp~2, main_~tmp___0~0, main_~__retres14~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_add1~0;havoc main_~r_add2~0;havoc main_~zero~0;havoc main_~tmp~2;havoc main_~tmp___0~0;havoc main_~__retres14~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; 412#L19 assume 0 == base2flt_~m % 4294967296;base2flt_~__retres4~0 := 0; 400#L69 base2flt_#res := base2flt_~__retres4~0; 401#L70 main_#t~ret4 := base2flt_#res;main_~zero~0 := main_#t~ret4;havoc main_#t~ret4;base2flt_#in~m, base2flt_#in~e := main_~ma~2, main_~ea~2;havoc base2flt_#res;havoc base2flt_~m, base2flt_~e, base2flt_~res~0, base2flt_~__retres4~0;base2flt_~m := base2flt_#in~m;base2flt_~e := base2flt_#in~e;havoc base2flt_~res~0;havoc base2flt_~__retres4~0; 408#L19-1 assume !(0 == base2flt_~m % 4294967296); 411#L25-1 assume !(base2flt_~m % 4294967296 < 16777216); 405#L47-5 [2019-01-01 22:08:58,690 INFO L796 eck$LassoCheckResult]: Loop: 405#L47-5 assume !false; 395#L48-1 assume base2flt_~m % 4294967296 >= 33554432; 397#L49-1 assume !(base2flt_~e >= 127);base2flt_~e := 1 + base2flt_~e;base2flt_~m := base2flt_~m / 2; 405#L47-5 [2019-01-01 22:08:58,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:58,690 INFO L82 PathProgramCache]: Analyzing trace with hash 921737699, now seen corresponding path program 1 times [2019-01-01 22:08:58,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:58,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:58,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:58,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:08:58,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:58,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:58,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:58,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:58,711 INFO L82 PathProgramCache]: Analyzing trace with hash 136178, now seen corresponding path program 1 times [2019-01-01 22:08:58,711 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:58,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:58,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:58,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:08:58,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:58,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:58,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:58,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:58,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1761973968, now seen corresponding path program 1 times [2019-01-01 22:08:58,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:58,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:58,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:58,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:08:58,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:58,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:58,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:58,841 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:08:58,841 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:08:58,841 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:08:58,841 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:08:58,842 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 22:08:58,842 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:08:58,842 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:08:58,842 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:08:58,842 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_4_true-unreach-call_true-no-overflow_true-termination.c.cil.c_Iteration2_Loop [2019-01-01 22:08:58,842 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:08:58,843 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:08:58,844 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:58,855 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:59,201 WARN L181 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2019-01-01 22:08:59,296 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:08:59,296 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:08:59,301 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:08:59,301 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:08:59,375 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:08:59,375 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_base2flt_~m=-1} Honda state: {ULTIMATE.start_base2flt_~m=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:08:59,399 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:08:59,399 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-01-01 22:08:59,450 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 22:08:59,450 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:08:59,495 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 22:08:59,498 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:08:59,498 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:08:59,498 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:08:59,498 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:08:59,498 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:08:59,499 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:08:59,501 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:08:59,502 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:08:59,502 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_4_true-unreach-call_true-no-overflow_true-termination.c.cil.c_Iteration2_Loop [2019-01-01 22:08:59,502 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:08:59,502 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:08:59,503 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:59,624 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:59,779 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:08:59,780 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:08:59,781 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:59,781 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:08:59,782 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:59,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:59,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:59,782 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:08:59,783 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:08:59,783 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:59,804 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:08:59,804 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:59,805 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:08:59,805 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:08:59,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:08:59,806 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:08:59,806 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:08:59,806 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:08:59,807 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:08:59,811 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:08:59,814 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 22:08:59,814 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 22:08:59,815 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:08:59,815 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 22:08:59,815 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:08:59,815 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:59,816 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 22:08:59,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:59,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:08:59,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:08:59,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:08:59,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:08:59,899 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:59,900 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:59,900 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 30 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-01-01 22:08:59,942 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 30 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 40 states and 50 transitions. Complement of second has 5 states. [2019-01-01 22:08:59,945 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:59,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 22:08:59,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2019-01-01 22:08:59,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 6 letters. Loop has 3 letters. [2019-01-01 22:08:59,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:08:59,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 9 letters. Loop has 3 letters. [2019-01-01 22:08:59,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:08:59,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 32 transitions. Stem has 6 letters. Loop has 6 letters. [2019-01-01 22:08:59,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:08:59,947 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 50 transitions. [2019-01-01 22:08:59,951 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 15 [2019-01-01 22:08:59,951 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 37 states and 46 transitions. [2019-01-01 22:08:59,952 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2019-01-01 22:08:59,952 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2019-01-01 22:08:59,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 46 transitions. [2019-01-01 22:08:59,952 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:08:59,952 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 46 transitions. [2019-01-01 22:08:59,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 46 transitions. [2019-01-01 22:08:59,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 26. [2019-01-01 22:08:59,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-01 22:08:59,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2019-01-01 22:08:59,959 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2019-01-01 22:08:59,959 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2019-01-01 22:08:59,959 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 22:08:59,959 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 34 transitions. [2019-01-01 22:08:59,960 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-01-01 22:08:59,960 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:08:59,960 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:08:59,961 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-01 22:08:59,961 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:08:59,961 INFO L794 eck$LassoCheckResult]: Stem: 526#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_add1~0, main_~r_add2~0, main_~zero~0, main_~tmp~2, main_~tmp___0~0, main_~__retres14~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_add1~0;havoc main_~r_add2~0;havoc main_~zero~0;havoc main_~tmp~2;havoc main_~tmp___0~0;havoc main_~__retres14~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; 524#L19 assume 0 == base2flt_~m % 4294967296;base2flt_~__retres4~0 := 0; 512#L69 base2flt_#res := base2flt_~__retres4~0; 513#L70 main_#t~ret4 := base2flt_#res;main_~zero~0 := main_#t~ret4;havoc main_#t~ret4;base2flt_#in~m, base2flt_#in~e := main_~ma~2, main_~ea~2;havoc base2flt_#res;havoc base2flt_~m, base2flt_~e, base2flt_~res~0, base2flt_~__retres4~0;base2flt_~m := base2flt_#in~m;base2flt_~e := base2flt_#in~e;havoc base2flt_~res~0;havoc base2flt_~__retres4~0; 520#L19-1 assume !(0 == base2flt_~m % 4294967296); 523#L25-1 assume base2flt_~m % 4294967296 < 16777216; 528#L37-3 [2019-01-01 22:08:59,961 INFO L796 eck$LassoCheckResult]: Loop: 528#L37-3 assume !false; 518#L28-1 assume !(base2flt_~e <= -128);base2flt_~e := base2flt_~e - 1;base2flt_~m := 2 * base2flt_~m; 519#L37-2 assume base2flt_~m % 4294967296 < 16777216; 528#L37-3 [2019-01-01 22:08:59,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:59,967 INFO L82 PathProgramCache]: Analyzing trace with hash 921737673, now seen corresponding path program 1 times [2019-01-01 22:08:59,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:59,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:59,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:59,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:08:59,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:59,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:59,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:08:59,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:08:59,996 INFO L82 PathProgramCache]: Analyzing trace with hash 110419, now seen corresponding path program 1 times [2019-01-01 22:08:59,996 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:08:59,996 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:08:59,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:08:59,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:08:59,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:00,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:09:00,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:09:00,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:09:00,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1761173643, now seen corresponding path program 1 times [2019-01-01 22:09:00,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:09:00,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:09:00,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:00,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:09:00,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:00,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:09:00,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:09:00,088 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:09:00,088 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:09:00,088 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:09:00,088 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:09:00,088 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 22:09:00,088 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:09:00,089 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:09:00,089 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:09:00,089 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_4_true-unreach-call_true-no-overflow_true-termination.c.cil.c_Iteration3_Loop [2019-01-01 22:09:00,089 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:09:00,089 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:09:00,091 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:09:00,111 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:09:00,204 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:09:00,204 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:09:00,209 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:09:00,209 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:09:00,219 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 22:09:00,219 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_base2flt_~m=0} Honda state: {ULTIMATE.start_base2flt_~m=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:09:00,239 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:09:00,239 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:09:00,261 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 22:09:00,261 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:09:00,285 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 22:09:00,288 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:09:00,288 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:09:00,288 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:09:00,288 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:09:00,289 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:09:00,289 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:09:00,289 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:09:00,289 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:09:00,289 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_4_true-unreach-call_true-no-overflow_true-termination.c.cil.c_Iteration3_Loop [2019-01-01 22:09:00,289 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:09:00,289 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:09:00,291 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:09:00,311 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:09:00,416 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:09:00,417 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:09:00,417 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:09:00,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:09:00,420 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:09:00,421 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:09:00,421 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:09:00,421 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:09:00,423 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:09:00,423 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:09:00,426 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 22:09:00,427 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:09:00,427 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:09:00,427 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:09:00,428 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:09:00,429 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:09:00,429 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:09:00,430 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:09:00,430 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:09:00,434 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:09:00,437 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 22:09:00,438 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 22:09:00,438 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:09:00,438 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 22:09:00,439 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:09:00,439 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:09:00,439 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 22:09:00,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:09:00,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:09:00,498 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:09:00,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:09:00,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:09:00,541 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:09:00,542 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:09:00,542 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 34 transitions. cyclomatic complexity: 12 Second operand 4 states. [2019-01-01 22:09:00,564 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 34 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 44 states and 55 transitions. Complement of second has 5 states. [2019-01-01 22:09:00,565 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:09:00,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 22:09:00,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2019-01-01 22:09:00,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 33 transitions. Stem has 6 letters. Loop has 3 letters. [2019-01-01 22:09:00,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:09:00,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 33 transitions. Stem has 9 letters. Loop has 3 letters. [2019-01-01 22:09:00,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:09:00,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 33 transitions. Stem has 6 letters. Loop has 6 letters. [2019-01-01 22:09:00,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:09:00,568 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 55 transitions. [2019-01-01 22:09:00,568 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2019-01-01 22:09:00,569 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 41 states and 51 transitions. [2019-01-01 22:09:00,570 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2019-01-01 22:09:00,570 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2019-01-01 22:09:00,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 51 transitions. [2019-01-01 22:09:00,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:09:00,570 INFO L705 BuchiCegarLoop]: Abstraction has 41 states and 51 transitions. [2019-01-01 22:09:00,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 51 transitions. [2019-01-01 22:09:00,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 29. [2019-01-01 22:09:00,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-01 22:09:00,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2019-01-01 22:09:00,575 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 38 transitions. [2019-01-01 22:09:00,575 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 38 transitions. [2019-01-01 22:09:00,575 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 22:09:00,575 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 38 transitions. [2019-01-01 22:09:00,576 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-01-01 22:09:00,576 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:09:00,576 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:09:00,578 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:09:00,578 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:09:00,578 INFO L794 eck$LassoCheckResult]: Stem: 646#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_add1~0, main_~r_add2~0, main_~zero~0, main_~tmp~2, main_~tmp___0~0, main_~__retres14~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_add1~0;havoc main_~r_add2~0;havoc main_~zero~0;havoc main_~tmp~2;havoc main_~tmp___0~0;havoc main_~__retres14~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; 643#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 := 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; 639#L19-1 assume 0 == base2flt_~m % 4294967296;base2flt_~__retres4~0 := 0; 634#L69-1 base2flt_#res := base2flt_~__retres4~0; 630#L70-1 main_#t~ret5 := base2flt_#res;main_~a~0 := main_#t~ret5;havoc main_#t~ret5;base2flt_#in~m, base2flt_#in~e := main_~mb~2, main_~eb~2;havoc base2flt_#res;havoc base2flt_~m, base2flt_~e, base2flt_~res~0, base2flt_~__retres4~0;base2flt_~m := base2flt_#in~m;base2flt_~e := base2flt_#in~e;havoc base2flt_~res~0;havoc base2flt_~__retres4~0; 631#L19-2 assume !(0 == base2flt_~m % 4294967296); 640#L25-2 assume !(base2flt_~m % 4294967296 < 16777216); 627#L47-8 [2019-01-01 22:09:00,579 INFO L796 eck$LassoCheckResult]: Loop: 627#L47-8 assume !false; 641#L48-2 assume base2flt_~m % 4294967296 >= 33554432; 626#L49-2 assume !(base2flt_~e >= 127);base2flt_~e := 1 + base2flt_~e;base2flt_~m := base2flt_~m / 2; 627#L47-8 [2019-01-01 22:09:00,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:09:00,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1760951196, now seen corresponding path program 1 times [2019-01-01 22:09:00,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:09:00,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:09:00,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:00,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:09:00,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:00,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:09:00,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:09:00,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:09:00,607 INFO L82 PathProgramCache]: Analyzing trace with hash 198737, now seen corresponding path program 1 times [2019-01-01 22:09:00,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:09:00,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:09:00,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:00,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:09:00,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:00,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:09:00,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:09:00,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:09:00,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1766695638, now seen corresponding path program 1 times [2019-01-01 22:09:00,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:09:00,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:09:00,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:00,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:09:00,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:00,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:09:00,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:09:00,698 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:09:00,698 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:09:00,698 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:09:00,698 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:09:00,698 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 22:09:00,698 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:09:00,699 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:09:00,699 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:09:00,699 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_4_true-unreach-call_true-no-overflow_true-termination.c.cil.c_Iteration4_Loop [2019-01-01 22:09:00,699 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:09:00,699 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:09:00,700 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:09:00,770 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:09:01,262 WARN L181 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2019-01-01 22:09:01,286 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:09:01,286 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:09:01,292 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:09:01,292 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:09:01,317 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 22:09:01,317 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:09:01,337 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 22:09:01,339 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:09:01,339 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:09:01,339 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:09:01,340 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:09:01,340 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:09:01,340 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:09:01,340 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:09:01,340 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:09:01,340 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_4_true-unreach-call_true-no-overflow_true-termination.c.cil.c_Iteration4_Loop [2019-01-01 22:09:01,340 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:09:01,340 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:09:01,341 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:09:01,346 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:09:01,488 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:09:01,488 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:09:01,489 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:09:01,489 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:09:01,491 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:09:01,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:09:01,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:09:01,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:09:01,493 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:09:01,493 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:09:01,496 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:09:01,498 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 22:09:01,499 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 22:09:01,499 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:09:01,499 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 22:09:01,499 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:09:01,499 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:09:01,500 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 22:09:01,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:09:01,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:09:01,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:09:01,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:09:01,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:09:01,569 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:09:01,570 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:09:01,570 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 38 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-01-01 22:09:01,580 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 38 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 32 states and 42 transitions. Complement of second has 4 states. [2019-01-01 22:09:01,581 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:09:01,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 22:09:01,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions. [2019-01-01 22:09:01,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 9 letters. Loop has 3 letters. [2019-01-01 22:09:01,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:09:01,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 12 letters. Loop has 3 letters. [2019-01-01 22:09:01,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:09:01,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 30 transitions. Stem has 9 letters. Loop has 6 letters. [2019-01-01 22:09:01,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:09:01,583 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 42 transitions. [2019-01-01 22:09:01,583 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 22:09:01,584 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 26 states and 34 transitions. [2019-01-01 22:09:01,584 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2019-01-01 22:09:01,584 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-01-01 22:09:01,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 34 transitions. [2019-01-01 22:09:01,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 22:09:01,584 INFO L705 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2019-01-01 22:09:01,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 34 transitions. [2019-01-01 22:09:01,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-01-01 22:09:01,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-01 22:09:01,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2019-01-01 22:09:01,590 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2019-01-01 22:09:01,590 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2019-01-01 22:09:01,590 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 22:09:01,590 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 34 transitions. [2019-01-01 22:09:01,591 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 22:09:01,591 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 22:09:01,591 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 22:09:01,591 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 22:09:01,591 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 22:09:01,593 INFO L794 eck$LassoCheckResult]: Stem: 759#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_add1~0, main_~r_add2~0, main_~zero~0, main_~tmp~2, main_~tmp___0~0, main_~__retres14~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_add1~0;havoc main_~r_add2~0;havoc main_~zero~0;havoc main_~tmp~2;havoc main_~tmp___0~0;havoc main_~__retres14~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; 756#L19 assume 0 == base2flt_~m % 4294967296;base2flt_~__retres4~0 := 0; 746#L69 base2flt_#res := base2flt_~__retres4~0; 747#L70 main_#t~ret4 := base2flt_#res;main_~zero~0 := main_#t~ret4;havoc main_#t~ret4;base2flt_#in~m, base2flt_#in~e := main_~ma~2, main_~ea~2;havoc base2flt_#res;havoc base2flt_~m, base2flt_~e, base2flt_~res~0, base2flt_~__retres4~0;base2flt_~m := base2flt_#in~m;base2flt_~e := base2flt_#in~e;havoc base2flt_~res~0;havoc base2flt_~__retres4~0; 753#L19-1 assume 0 == base2flt_~m % 4294967296;base2flt_~__retres4~0 := 0; 748#L69-1 base2flt_#res := base2flt_~__retres4~0; 744#L70-1 main_#t~ret5 := base2flt_#res;main_~a~0 := main_#t~ret5;havoc main_#t~ret5;base2flt_#in~m, base2flt_#in~e := main_~mb~2, main_~eb~2;havoc base2flt_#res;havoc base2flt_~m, base2flt_~e, base2flt_~res~0, base2flt_~__retres4~0;base2flt_~m := base2flt_#in~m;base2flt_~e := base2flt_#in~e;havoc base2flt_~res~0;havoc base2flt_~__retres4~0; 745#L19-2 assume !(0 == base2flt_~m % 4294967296); 754#L25-2 assume base2flt_~m % 4294967296 < 16777216; 758#L37-5 [2019-01-01 22:09:01,593 INFO L796 eck$LassoCheckResult]: Loop: 758#L37-5 assume !false; 742#L28-2 assume !(base2flt_~e <= -128);base2flt_~e := base2flt_~e - 1;base2flt_~m := 2 * base2flt_~m; 743#L37-4 assume base2flt_~m % 4294967296 < 16777216; 758#L37-5 [2019-01-01 22:09:01,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:09:01,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1760951170, now seen corresponding path program 1 times [2019-01-01 22:09:01,594 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:09:01,594 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:09:01,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:01,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:09:01,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:01,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:09:01,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:09:01,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:09:01,620 INFO L82 PathProgramCache]: Analyzing trace with hash 172978, now seen corresponding path program 1 times [2019-01-01 22:09:01,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:09:01,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:09:01,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:01,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:09:01,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:01,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:09:01,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:09:01,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:09:01,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1765895313, now seen corresponding path program 1 times [2019-01-01 22:09:01,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 22:09:01,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 22:09:01,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:01,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 22:09:01,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 22:09:01,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:09:01,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 22:09:01,725 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:09:01,725 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:09:01,725 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:09:01,726 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:09:01,726 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 22:09:01,726 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:09:01,726 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:09:01,726 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:09:01,727 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_4_true-unreach-call_true-no-overflow_true-termination.c.cil.c_Iteration5_Loop [2019-01-01 22:09:01,727 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:09:01,727 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:09:01,728 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:09:01,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:09:01,857 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:09:01,858 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:09:01,884 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 22:09:01,884 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:09:01,918 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 22:09:01,918 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 22:09:01,939 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 22:09:01,941 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 22:09:01,941 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 22:09:01,941 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 22:09:01,941 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 22:09:01,942 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 22:09:01,942 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 22:09:01,942 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 22:09:01,942 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 22:09:01,942 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_4_true-unreach-call_true-no-overflow_true-termination.c.cil.c_Iteration5_Loop [2019-01-01 22:09:01,942 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 22:09:01,942 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 22:09:01,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:09:01,962 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:09:02,052 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 22:09:02,053 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 22:09:02,053 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:09:02,054 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 22:09:02,055 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 22:09:02,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 22:09:02,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 22:09:02,055 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 22:09:02,056 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 22:09:02,056 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 22:09:02,058 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 22:09:02,061 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 22:09:02,062 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-01 22:09:02,062 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 22:09:02,063 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 22:09:02,063 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 22:09:02,063 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:09:02,065 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 22:09:02,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 22:09:02,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:09:02,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:09:02,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 22:09:02,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 22:09:02,138 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:09:02,138 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:09:02,139 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 34 transitions. cyclomatic complexity: 11 Second operand 4 states. [2019-01-01 22:09:02,156 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 34 transitions. cyclomatic complexity: 11. Second operand 4 states. Result 30 states and 38 transitions. Complement of second has 4 states. [2019-01-01 22:09:02,157 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:09:02,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 22:09:02,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2019-01-01 22:09:02,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 9 letters. Loop has 3 letters. [2019-01-01 22:09:02,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:09:02,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 12 letters. Loop has 3 letters. [2019-01-01 22:09:02,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:09:02,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 27 transitions. Stem has 9 letters. Loop has 6 letters. [2019-01-01 22:09:02,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 22:09:02,158 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 38 transitions. [2019-01-01 22:09:02,159 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 22:09:02,159 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 0 states and 0 transitions. [2019-01-01 22:09:02,159 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 22:09:02,159 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 22:09:02,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 22:09:02,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 22:09:02,160 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:09:02,160 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:09:02,160 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 22:09:02,160 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-01 22:09:02,160 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 22:09:02,160 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 22:09:02,160 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 22:09:02,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 10:09:02 BoogieIcfgContainer [2019-01-01 22:09:02,168 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 22:09:02,168 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 22:09:02,168 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 22:09:02,169 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 22:09:02,169 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:57" (3/4) ... [2019-01-01 22:09:02,173 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 22:09:02,173 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 22:09:02,174 INFO L168 Benchmark]: Toolchain (without parser) took 6507.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 201.3 MB). Free memory was 951.3 MB in the beginning and 1.2 GB in the end (delta: -201.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:09:02,175 INFO L168 Benchmark]: CDTParser took 0.15 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:09:02,176 INFO L168 Benchmark]: CACSL2BoogieTranslator took 382.16 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 935.2 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:09:02,176 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.73 ms. Allocated memory is still 1.0 GB. Free memory is still 935.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:09:02,177 INFO L168 Benchmark]: Boogie Preprocessor took 117.90 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -171.8 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2019-01-01 22:09:02,178 INFO L168 Benchmark]: RCFGBuilder took 846.72 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: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 11.5 GB. [2019-01-01 22:09:02,179 INFO L168 Benchmark]: BuchiAutomizer took 5088.28 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 82.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -73.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. [2019-01-01 22:09:02,180 INFO L168 Benchmark]: Witness Printer took 4.96 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 22:09:02,184 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.15 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 382.16 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 935.2 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 62.73 ms. Allocated memory is still 1.0 GB. Free memory is still 935.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 117.90 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -171.8 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 846.72 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: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5088.28 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 82.3 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -73.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. * Witness Printer took 4.96 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (1 trivial, 5 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * e + 253 and consists of 4 locations. One deterministic module has affine ranking function -2 * e + 253 and consists of 3 locations. One deterministic module has affine ranking function 2 * e + 255 and consists of 3 locations. One deterministic module has affine ranking function -2 * e + 253 and consists of 3 locations. One deterministic module has affine ranking function 2 * e + 255 and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.0s and 6 iterations. TraceHistogramMax:1. Analysis of lassos took 4.1s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 34 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 29 states and ocurred in iteration 3. Nontrivial modules had stage [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 247 SDtfs, 215 SDslu, 26 SDs, 0 SdLazy, 38 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT4 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital21 mio100 ax100 hnf95 lsp57 ukn100 mio100 lsp100 div605 bol100 ite100 ukn100 eq131 hnf43 smp92 dnf100 smp100 tf105 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 21ms VariablesStem: 0 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 5 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...