./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/bitvector/soft_float_2a.c.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_4e90d189-e627-4cb5-9dbf-b20b765d5572/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_4e90d189-e627-4cb5-9dbf-b20b765d5572/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_4e90d189-e627-4cb5-9dbf-b20b765d5572/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_4e90d189-e627-4cb5-9dbf-b20b765d5572/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/bitvector/soft_float_2a.c.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_4e90d189-e627-4cb5-9dbf-b20b765d5572/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_4e90d189-e627-4cb5-9dbf-b20b765d5572/bin/uautomizer --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 9a8cb7a54337f31cc721bc63892cae8fcf685402 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:22:23,045 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:22:23,047 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:22:23,065 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:22:23,066 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:22:23,068 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:22:23,070 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:22:23,082 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:22:23,087 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:22:23,090 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:22:23,093 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:22:23,094 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:22:23,096 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:22:23,098 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:22:23,100 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:22:23,101 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:22:23,102 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:22:23,104 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:22:23,107 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:22:23,112 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:22:23,116 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:22:23,118 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:22:23,121 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:22:23,122 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:22:23,125 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:22:23,125 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:22:23,125 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:22:23,127 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:22:23,128 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:22:23,129 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:22:23,129 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:22:23,130 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:22:23,131 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:22:23,131 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:22:23,134 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:22:23,134 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:22:23,135 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:22:23,135 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:22:23,136 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:22:23,137 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:22:23,137 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:22:23,139 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_4e90d189-e627-4cb5-9dbf-b20b765d5572/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-16 00:22:23,171 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:22:23,183 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:22:23,184 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:22:23,185 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:22:23,185 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:22:23,185 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-16 00:22:23,186 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-16 00:22:23,186 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-16 00:22:23,186 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-16 00:22:23,187 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-16 00:22:23,187 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-16 00:22:23,187 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:22:23,187 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:22:23,188 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-16 00:22:23,188 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:22:23,188 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:22:23,188 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:22:23,189 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-16 00:22:23,189 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-16 00:22:23,189 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-16 00:22:23,189 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:22:23,190 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:22:23,190 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-16 00:22:23,190 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:22:23,191 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-16 00:22:23,191 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:22:23,191 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:22:23,192 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-16 00:22:23,193 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:22:23,193 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:22:23,194 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-16 00:22:23,195 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-16 00:22:23,198 INFO L138 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_4e90d189-e627-4cb5-9dbf-b20b765d5572/bin/uautomizer 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 -> 9a8cb7a54337f31cc721bc63892cae8fcf685402 [2019-11-16 00:22:23,237 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:22:23,255 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:22:23,261 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:22:23,262 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:22:23,263 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:22:23,264 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_4e90d189-e627-4cb5-9dbf-b20b765d5572/bin/uautomizer/../../sv-benchmarks/c/bitvector/soft_float_2a.c.cil.c [2019-11-16 00:22:23,335 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4e90d189-e627-4cb5-9dbf-b20b765d5572/bin/uautomizer/data/22d9d4eb7/14d37efb2ca542b18b368cf4570b2fa9/FLAGf433b8ee5 [2019-11-16 00:22:23,878 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:22:23,878 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_4e90d189-e627-4cb5-9dbf-b20b765d5572/sv-benchmarks/c/bitvector/soft_float_2a.c.cil.c [2019-11-16 00:22:23,891 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4e90d189-e627-4cb5-9dbf-b20b765d5572/bin/uautomizer/data/22d9d4eb7/14d37efb2ca542b18b368cf4570b2fa9/FLAGf433b8ee5 [2019-11-16 00:22:24,233 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_4e90d189-e627-4cb5-9dbf-b20b765d5572/bin/uautomizer/data/22d9d4eb7/14d37efb2ca542b18b368cf4570b2fa9 [2019-11-16 00:22:24,235 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:22:24,236 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:22:24,237 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:22:24,237 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:22:24,241 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:22:24,242 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:22:24" (1/1) ... [2019-11-16 00:22:24,248 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e67027d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:24, skipping insertion in model container [2019-11-16 00:22:24,248 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:22:24" (1/1) ... [2019-11-16 00:22:24,255 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:22:24,281 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:22:24,548 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:22:24,552 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:22:24,598 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:22:24,612 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:22:24,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:24 WrapperNode [2019-11-16 00:22:24,613 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:22:24,614 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:22:24,614 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:22:24,614 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:22:24,624 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:24" (1/1) ... [2019-11-16 00:22:24,631 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:24" (1/1) ... [2019-11-16 00:22:24,669 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:22:24,670 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:22:24,670 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:22:24,670 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:22:24,686 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:24" (1/1) ... [2019-11-16 00:22:24,687 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:24" (1/1) ... [2019-11-16 00:22:24,699 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:24" (1/1) ... [2019-11-16 00:22:24,709 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:24" (1/1) ... [2019-11-16 00:22:24,719 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:24" (1/1) ... [2019-11-16 00:22:24,744 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:24" (1/1) ... [2019-11-16 00:22:24,747 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:24" (1/1) ... [2019-11-16 00:22:24,752 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:22:24,753 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:22:24,753 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:22:24,753 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:22:24,754 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e90d189-e627-4cb5-9dbf-b20b765d5572/bin/uautomizer/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-11-16 00:22:24,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:22:24,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:22:25,603 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:22:25,604 INFO L284 CfgBuilder]: Removed 24 assume(true) statements. [2019-11-16 00:22:25,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:22:25 BoogieIcfgContainer [2019-11-16 00:22:25,605 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:22:25,606 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-16 00:22:25,606 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-16 00:22:25,610 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-16 00:22:25,611 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:22:25,612 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.11 12:22:24" (1/3) ... [2019-11-16 00:22:25,613 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4b6ca230 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:22:25, skipping insertion in model container [2019-11-16 00:22:25,613 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:22:25,614 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:22:24" (2/3) ... [2019-11-16 00:22:25,614 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4b6ca230 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 12:22:25, skipping insertion in model container [2019-11-16 00:22:25,614 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-16 00:22:25,615 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:22:25" (3/3) ... [2019-11-16 00:22:25,616 INFO L371 chiAutomizerObserver]: Analyzing ICFG soft_float_2a.c.cil.c [2019-11-16 00:22:25,671 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-16 00:22:25,671 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-16 00:22:25,671 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-16 00:22:25,671 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:22:25,671 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:22:25,672 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-16 00:22:25,672 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:22:25,672 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-16 00:22:25,691 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states. [2019-11-16 00:22:25,721 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 24 [2019-11-16 00:22:25,721 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:22:25,722 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:22:25,729 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-16 00:22:25,729 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-16 00:22:25,729 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-16 00:22:25,730 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 70 states. [2019-11-16 00:22:25,736 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 24 [2019-11-16 00:22:25,736 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:22:25,737 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:22:25,737 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-16 00:22:25,737 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-16 00:22:25,746 INFO L791 eck$LassoCheckResult]: Stem: 34#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_#t~ret5, main_#t~ret6, main_#t~ret7, main_#t~ret8, main_~a~0, main_~ma~2, main_~ea~2, main_~b~0, main_~mb~2, main_~eb~2, main_~r_mul~0, main_~zero~0, main_~one~0, main_~sa~0, main_~tmp~2, main_~tmp___0~0, main_~tmp___1~0, main_~__retres16~0;havoc main_~a~0;main_~ma~2 := main_#t~nondet0;havoc main_#t~nondet0;main_~ea~2 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~b~0;main_~mb~2 := main_#t~nondet2;havoc main_#t~nondet2;main_~eb~2 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~r_mul~0;havoc main_~zero~0;havoc main_~one~0;havoc main_~sa~0;havoc main_~tmp~2;havoc main_~tmp___0~0;havoc main_~tmp___1~0;havoc main_~__retres16~0;base2flt_#in~m, base2flt_#in~e := 0, 0;havoc base2flt_#res;havoc base2flt_~m, base2flt_~e, base2flt_~res~0, base2flt_~__retres4~0;base2flt_~m := base2flt_#in~m;base2flt_~e := base2flt_#in~e;havoc base2flt_~res~0;havoc base2flt_~__retres4~0; 30#L19true assume !(0 == base2flt_~m % 4294967296); 17#L25true assume !(base2flt_~m % 4294967296 < 16777216); 13#L47-2true [2019-11-16 00:22:25,747 INFO L793 eck$LassoCheckResult]: Loop: 13#L47-2true assume !false; 22#L48true assume base2flt_~m % 4294967296 >= 33554432; 47#L49true assume !(base2flt_~e >= 127);base2flt_~e := 1 + base2flt_~e;base2flt_~m := base2flt_~m / 2; 13#L47-2true [2019-11-16 00:22:25,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:25,753 INFO L82 PathProgramCache]: Analyzing trace with hash 30973, now seen corresponding path program 1 times [2019-11-16 00:22:25,763 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:25,763 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744976052] [2019-11-16 00:22:25,763 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:25,764 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:25,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:25,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:25,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:22:25,932 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744976052] [2019-11-16 00:22:25,933 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:22:25,933 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-11-16 00:22:25,934 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247355045] [2019-11-16 00:22:25,941 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:22:25,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:25,942 INFO L82 PathProgramCache]: Analyzing trace with hash 73619, now seen corresponding path program 1 times [2019-11-16 00:22:25,942 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:25,943 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754503510] [2019-11-16 00:22:25,943 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:25,943 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:25,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:25,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:22:25,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:22:25,989 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:22:26,055 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:22:26,056 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:22:26,056 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:22:26,056 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:22:26,057 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:22:26,057 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:22:26,058 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:22:26,058 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:22:26,058 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_2a.c.cil.c_Iteration1_Loop [2019-11-16 00:22:26,058 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:22:26,059 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:22:26,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:26,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:26,272 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:22:26,272 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e90d189-e627-4cb5-9dbf-b20b765d5572/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:22:26,281 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:22:26,281 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:22:26,296 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:22:26,296 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_base2flt_~m=-1} Honda state: {ULTIMATE.start_base2flt_~m=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e90d189-e627-4cb5-9dbf-b20b765d5572/bin/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:22:26,306 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:22:26,306 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e90d189-e627-4cb5-9dbf-b20b765d5572/bin/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:22:26,334 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:22:26,334 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:22:26,344 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:22:26,347 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:22:26,347 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:22:26,347 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:22:26,348 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:22:26,348 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:22:26,348 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:22:26,348 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:22:26,348 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:22:26,348 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_2a.c.cil.c_Iteration1_Loop [2019-11-16 00:22:26,349 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:22:26,349 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:22:26,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:26,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:26,488 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:22:26,493 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:22:26,495 INFO L120 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-11-16 00:22:26,497 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:26,497 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:22:26,498 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:26,498 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:26,498 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:26,501 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:22:26,501 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:22:26,520 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:26,531 INFO L120 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-11-16 00:22:26,533 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:26,534 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:22:26,534 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:26,534 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:26,534 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:26,535 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:22:26,536 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:22:26,542 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:22:26,563 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:22:26,571 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-16 00:22:26,574 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:22:26,574 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:22:26,574 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:22:26,575 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e) = -2*ULTIMATE.start_base2flt_~e + 253 Supporting invariants [] [2019-11-16 00:22:26,578 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:22:26,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:26,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:26,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:22:26,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:22:26,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:26,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:22:26,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:22:26,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:22:26,675 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-11-16 00:22:26,677 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 70 states. Second operand 3 states. [2019-11-16 00:22:26,764 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 70 states.. Second operand 3 states. Result 203 states and 343 transitions. Complement of second has 6 states. [2019-11-16 00:22:26,765 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-11-16 00:22:26,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:22:26,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 227 transitions. [2019-11-16 00:22:26,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 227 transitions. Stem has 3 letters. Loop has 3 letters. [2019-11-16 00:22:26,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:22:26,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 227 transitions. Stem has 6 letters. Loop has 3 letters. [2019-11-16 00:22:26,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:22:26,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 227 transitions. Stem has 3 letters. Loop has 6 letters. [2019-11-16 00:22:26,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:22:26,775 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 203 states and 343 transitions. [2019-11-16 00:22:26,789 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 39 [2019-11-16 00:22:26,796 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 203 states to 78 states and 119 transitions. [2019-11-16 00:22:26,797 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 74 [2019-11-16 00:22:26,799 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 75 [2019-11-16 00:22:26,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 119 transitions. [2019-11-16 00:22:26,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:22:26,800 INFO L688 BuchiCegarLoop]: Abstraction has 78 states and 119 transitions. [2019-11-16 00:22:26,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 119 transitions. [2019-11-16 00:22:26,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 67. [2019-11-16 00:22:26,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-16 00:22:26,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 107 transitions. [2019-11-16 00:22:26,839 INFO L711 BuchiCegarLoop]: Abstraction has 67 states and 107 transitions. [2019-11-16 00:22:26,839 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:22:26,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:22:26,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:22:26,843 INFO L87 Difference]: Start difference. First operand 67 states and 107 transitions. Second operand 3 states. [2019-11-16 00:22:26,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:26,931 INFO L93 Difference]: Finished difference Result 34 states and 47 transitions. [2019-11-16 00:22:26,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:22:26,932 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 47 transitions. [2019-11-16 00:22:26,933 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 18 [2019-11-16 00:22:26,934 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 34 states and 47 transitions. [2019-11-16 00:22:26,934 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2019-11-16 00:22:26,935 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2019-11-16 00:22:26,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 47 transitions. [2019-11-16 00:22:26,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:22:26,935 INFO L688 BuchiCegarLoop]: Abstraction has 34 states and 47 transitions. [2019-11-16 00:22:26,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 47 transitions. [2019-11-16 00:22:26,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-11-16 00:22:26,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-16 00:22:26,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 47 transitions. [2019-11-16 00:22:26,939 INFO L711 BuchiCegarLoop]: Abstraction has 34 states and 47 transitions. [2019-11-16 00:22:26,939 INFO L591 BuchiCegarLoop]: Abstraction has 34 states and 47 transitions. [2019-11-16 00:22:26,939 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-16 00:22:26,940 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 47 transitions. [2019-11-16 00:22:26,941 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 18 [2019-11-16 00:22:26,941 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:22:26,941 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:22:26,942 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-16 00:22:26,942 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-16 00:22:26,942 INFO L791 eck$LassoCheckResult]: Stem: 447#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_#t~ret5, main_#t~ret6, main_#t~ret7, main_#t~ret8, main_~a~0, main_~ma~2, main_~ea~2, main_~b~0, main_~mb~2, main_~eb~2, main_~r_mul~0, main_~zero~0, main_~one~0, main_~sa~0, main_~tmp~2, main_~tmp___0~0, main_~tmp___1~0, main_~__retres16~0;havoc main_~a~0;main_~ma~2 := main_#t~nondet0;havoc main_#t~nondet0;main_~ea~2 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~b~0;main_~mb~2 := main_#t~nondet2;havoc main_#t~nondet2;main_~eb~2 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~r_mul~0;havoc main_~zero~0;havoc main_~one~0;havoc main_~sa~0;havoc main_~tmp~2;havoc main_~tmp___0~0;havoc main_~tmp___1~0;havoc main_~__retres16~0;base2flt_#in~m, base2flt_#in~e := 0, 0;havoc base2flt_#res;havoc base2flt_~m, base2flt_~e, base2flt_~res~0, base2flt_~__retres4~0;base2flt_~m := base2flt_#in~m;base2flt_~e := base2flt_#in~e;havoc base2flt_~res~0;havoc base2flt_~__retres4~0; 445#L19 assume 0 == base2flt_~m % 4294967296;base2flt_~__retres4~0 := 0; 418#L69 base2flt_#res := base2flt_~__retres4~0; 419#L70 main_#t~ret4 := base2flt_#res;main_~zero~0 := main_#t~ret4;havoc main_#t~ret4;base2flt_#in~m, base2flt_#in~e := 1, 0;havoc base2flt_#res;havoc base2flt_~m, base2flt_~e, base2flt_~res~0, base2flt_~__retres4~0;base2flt_~m := base2flt_#in~m;base2flt_~e := base2flt_#in~e;havoc base2flt_~res~0;havoc base2flt_~__retres4~0; 442#L19-1 assume !(0 == base2flt_~m % 4294967296); 430#L25-1 assume !(base2flt_~m % 4294967296 < 16777216); 422#L47-5 [2019-11-16 00:22:26,943 INFO L793 eck$LassoCheckResult]: Loop: 422#L47-5 assume !false; 425#L48-1 assume base2flt_~m % 4294967296 >= 33554432; 420#L49-1 assume !(base2flt_~e >= 127);base2flt_~e := 1 + base2flt_~e;base2flt_~m := base2flt_~m / 2; 422#L47-5 [2019-11-16 00:22:26,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:26,943 INFO L82 PathProgramCache]: Analyzing trace with hash 921737699, now seen corresponding path program 1 times [2019-11-16 00:22:26,943 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:26,944 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797944048] [2019-11-16 00:22:26,944 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:26,944 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:26,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:26,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:27,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:22:27,015 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797944048] [2019-11-16 00:22:27,015 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:22:27,015 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:22:27,015 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810592638] [2019-11-16 00:22:27,016 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:22:27,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:27,016 INFO L82 PathProgramCache]: Analyzing trace with hash 136178, now seen corresponding path program 1 times [2019-11-16 00:22:27,017 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:27,017 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617163936] [2019-11-16 00:22:27,017 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:27,017 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:27,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:27,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:22:27,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:22:27,046 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:22:27,075 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:22:27,075 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:22:27,076 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:22:27,076 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:22:27,076 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:22:27,076 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:22:27,076 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:22:27,076 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:22:27,077 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_2a.c.cil.c_Iteration2_Loop [2019-11-16 00:22:27,077 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:22:27,077 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:22:27,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:27,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:27,195 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:22:27,195 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e90d189-e627-4cb5-9dbf-b20b765d5572/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:22:27,212 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:22:27,212 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:22:27,220 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:22:27,221 INFO L440 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 /tmp/vcloud-vcloud-master/worker/run_dir_4e90d189-e627-4cb5-9dbf-b20b765d5572/bin/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:22:27,244 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:22:27,244 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e90d189-e627-4cb5-9dbf-b20b765d5572/bin/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:22:27,270 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:22:27,270 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:22:27,280 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:22:27,283 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:22:27,283 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:22:27,284 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:22:27,284 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:22:27,284 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:22:27,284 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:22:27,284 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:22:27,284 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:22:27,285 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_2a.c.cil.c_Iteration2_Loop [2019-11-16 00:22:27,285 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:22:27,285 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:22:27,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:27,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:27,428 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:22:27,428 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:22:27,429 INFO L120 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-11-16 00:22:27,430 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:27,430 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:22:27,431 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:27,431 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:27,431 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:27,432 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:22:27,433 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:22:27,445 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:27,445 INFO L120 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-11-16 00:22:27,450 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:27,450 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:22:27,451 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:27,451 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:27,451 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:27,452 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:22:27,452 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:22:27,466 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:22:27,478 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:22:27,478 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-16 00:22:27,479 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:22:27,479 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:22:27,480 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:22:27,480 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e) = -2*ULTIMATE.start_base2flt_~e + 253 Supporting invariants [] [2019-11-16 00:22:27,480 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:22:27,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:27,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:27,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:22:27,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:22:27,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:27,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:22:27,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:22:27,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:22:27,533 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-11-16 00:22:27,533 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 47 transitions. cyclomatic complexity: 19 Second operand 3 states. [2019-11-16 00:22:27,556 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 47 transitions. cyclomatic complexity: 19. Second operand 3 states. Result 62 states and 84 transitions. Complement of second has 5 states. [2019-11-16 00:22:27,559 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-11-16 00:22:27,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:22:27,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2019-11-16 00:22:27,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 49 transitions. Stem has 6 letters. Loop has 3 letters. [2019-11-16 00:22:27,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:22:27,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 49 transitions. Stem has 9 letters. Loop has 3 letters. [2019-11-16 00:22:27,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:22:27,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 49 transitions. Stem has 6 letters. Loop has 6 letters. [2019-11-16 00:22:27,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:22:27,562 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 84 transitions. [2019-11-16 00:22:27,563 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 27 [2019-11-16 00:22:27,564 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 59 states and 80 transitions. [2019-11-16 00:22:27,564 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2019-11-16 00:22:27,565 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2019-11-16 00:22:27,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 80 transitions. [2019-11-16 00:22:27,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:22:27,565 INFO L688 BuchiCegarLoop]: Abstraction has 59 states and 80 transitions. [2019-11-16 00:22:27,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 80 transitions. [2019-11-16 00:22:27,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 37. [2019-11-16 00:22:27,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-16 00:22:27,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2019-11-16 00:22:27,569 INFO L711 BuchiCegarLoop]: Abstraction has 37 states and 51 transitions. [2019-11-16 00:22:27,569 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:22:27,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:22:27,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:22:27,572 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand 3 states. [2019-11-16 00:22:27,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:27,644 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2019-11-16 00:22:27,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:22:27,644 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 46 transitions. [2019-11-16 00:22:27,645 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 15 [2019-11-16 00:22:27,646 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 35 states and 46 transitions. [2019-11-16 00:22:27,646 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2019-11-16 00:22:27,647 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2019-11-16 00:22:27,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 46 transitions. [2019-11-16 00:22:27,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:22:27,647 INFO L688 BuchiCegarLoop]: Abstraction has 35 states and 46 transitions. [2019-11-16 00:22:27,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 46 transitions. [2019-11-16 00:22:27,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2019-11-16 00:22:27,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-16 00:22:27,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2019-11-16 00:22:27,650 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 41 transitions. [2019-11-16 00:22:27,651 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 41 transitions. [2019-11-16 00:22:27,651 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-16 00:22:27,651 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 41 transitions. [2019-11-16 00:22:27,651 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 15 [2019-11-16 00:22:27,652 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:22:27,652 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:22:27,652 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-16 00:22:27,652 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-16 00:22:27,653 INFO L791 eck$LassoCheckResult]: Stem: 658#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_#t~ret5, main_#t~ret6, main_#t~ret7, main_#t~ret8, main_~a~0, main_~ma~2, main_~ea~2, main_~b~0, main_~mb~2, main_~eb~2, main_~r_mul~0, main_~zero~0, main_~one~0, main_~sa~0, main_~tmp~2, main_~tmp___0~0, main_~tmp___1~0, main_~__retres16~0;havoc main_~a~0;main_~ma~2 := main_#t~nondet0;havoc main_#t~nondet0;main_~ea~2 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~b~0;main_~mb~2 := main_#t~nondet2;havoc main_#t~nondet2;main_~eb~2 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~r_mul~0;havoc main_~zero~0;havoc main_~one~0;havoc main_~sa~0;havoc main_~tmp~2;havoc main_~tmp___0~0;havoc main_~tmp___1~0;havoc main_~__retres16~0;base2flt_#in~m, base2flt_#in~e := 0, 0;havoc base2flt_#res;havoc base2flt_~m, base2flt_~e, base2flt_~res~0, base2flt_~__retres4~0;base2flt_~m := base2flt_#in~m;base2flt_~e := base2flt_#in~e;havoc base2flt_~res~0;havoc base2flt_~__retres4~0; 655#L19 assume 0 == base2flt_~m % 4294967296;base2flt_~__retres4~0 := 0; 632#L69 base2flt_#res := base2flt_~__retres4~0; 633#L70 main_#t~ret4 := base2flt_#res;main_~zero~0 := main_#t~ret4;havoc main_#t~ret4;base2flt_#in~m, base2flt_#in~e := 1, 0;havoc base2flt_#res;havoc base2flt_~m, base2flt_~e, base2flt_~res~0, base2flt_~__retres4~0;base2flt_~m := base2flt_#in~m;base2flt_~e := base2flt_#in~e;havoc base2flt_~res~0;havoc base2flt_~__retres4~0; 652#L19-1 assume !(0 == base2flt_~m % 4294967296); 640#L25-1 assume base2flt_~m % 4294967296 < 16777216; 641#L37-3 [2019-11-16 00:22:27,653 INFO L793 eck$LassoCheckResult]: Loop: 641#L37-3 assume !false; 650#L28-1 assume !(base2flt_~e <= -128);base2flt_~e := base2flt_~e - 1;base2flt_~m := 2 * base2flt_~m; 651#L37-2 assume base2flt_~m % 4294967296 < 16777216; 641#L37-3 [2019-11-16 00:22:27,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:27,653 INFO L82 PathProgramCache]: Analyzing trace with hash 921737673, now seen corresponding path program 1 times [2019-11-16 00:22:27,654 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:27,658 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811596492] [2019-11-16 00:22:27,658 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:27,658 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:27,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:27,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:22:27,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:22:27,687 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:22:27,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:27,688 INFO L82 PathProgramCache]: Analyzing trace with hash 110419, now seen corresponding path program 1 times [2019-11-16 00:22:27,688 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:27,688 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647109502] [2019-11-16 00:22:27,688 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:27,688 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:27,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:27,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:22:27,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:22:27,712 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:22:27,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:27,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1761173643, now seen corresponding path program 1 times [2019-11-16 00:22:27,713 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:27,713 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126590948] [2019-11-16 00:22:27,713 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:27,713 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:27,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:27,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:22:27,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:22:27,759 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:22:27,783 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:22:27,783 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:22:27,783 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:22:27,783 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:22:27,784 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:22:27,784 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:22:27,784 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:22:27,784 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:22:27,784 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_2a.c.cil.c_Iteration3_Loop [2019-11-16 00:22:27,784 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:22:27,785 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:22:27,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:27,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:27,883 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:22:27,884 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e90d189-e627-4cb5-9dbf-b20b765d5572/bin/uautomizer/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-11-16 00:22:27,900 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:22:27,900 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:22:27,913 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:22:27,914 INFO L440 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 /tmp/vcloud-vcloud-master/worker/run_dir_4e90d189-e627-4cb5-9dbf-b20b765d5572/bin/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:22:27,927 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:22:27,927 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e90d189-e627-4cb5-9dbf-b20b765d5572/bin/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:22:27,946 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:22:27,946 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:22:27,954 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:22:27,956 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:22:27,956 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:22:27,957 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:22:27,957 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:22:27,957 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:22:27,957 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:22:27,957 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:22:27,957 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:22:27,958 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_2a.c.cil.c_Iteration3_Loop [2019-11-16 00:22:27,958 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:22:27,958 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:22:27,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:27,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:28,070 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:22:28,070 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:22:28,071 INFO L120 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-11-16 00:22:28,071 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:28,072 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:22:28,072 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:28,072 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:28,072 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:28,073 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:22:28,073 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:22:28,076 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:28,076 INFO L120 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-11-16 00:22:28,077 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:28,077 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:22:28,077 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:28,078 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:28,087 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:28,088 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:22:28,088 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:22:28,093 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:22:28,096 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:22:28,096 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-16 00:22:28,097 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:22:28,097 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:22:28,097 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:22:28,097 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e) = 2*ULTIMATE.start_base2flt_~e + 255 Supporting invariants [] [2019-11-16 00:22:28,098 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:22:28,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:28,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:28,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:22:28,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:22:28,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:28,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:22:28,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:22:28,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:22:28,176 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-11-16 00:22:28,176 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 41 transitions. cyclomatic complexity: 15 Second operand 4 states. [2019-11-16 00:22:28,192 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 41 transitions. cyclomatic complexity: 15. Second operand 4 states. Result 59 states and 78 transitions. Complement of second has 5 states. [2019-11-16 00:22:28,192 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-11-16 00:22:28,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-16 00:22:28,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2019-11-16 00:22:28,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 43 transitions. Stem has 6 letters. Loop has 3 letters. [2019-11-16 00:22:28,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:22:28,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 43 transitions. Stem has 9 letters. Loop has 3 letters. [2019-11-16 00:22:28,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:22:28,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 43 transitions. Stem has 6 letters. Loop has 6 letters. [2019-11-16 00:22:28,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:22:28,195 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 78 transitions. [2019-11-16 00:22:28,196 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 24 [2019-11-16 00:22:28,197 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 56 states and 74 transitions. [2019-11-16 00:22:28,197 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2019-11-16 00:22:28,197 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2019-11-16 00:22:28,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 74 transitions. [2019-11-16 00:22:28,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:22:28,198 INFO L688 BuchiCegarLoop]: Abstraction has 56 states and 74 transitions. [2019-11-16 00:22:28,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 74 transitions. [2019-11-16 00:22:28,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 34. [2019-11-16 00:22:28,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-16 00:22:28,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2019-11-16 00:22:28,201 INFO L711 BuchiCegarLoop]: Abstraction has 34 states and 45 transitions. [2019-11-16 00:22:28,201 INFO L591 BuchiCegarLoop]: Abstraction has 34 states and 45 transitions. [2019-11-16 00:22:28,201 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-16 00:22:28,201 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 45 transitions. [2019-11-16 00:22:28,201 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2019-11-16 00:22:28,202 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:22:28,202 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:22:28,202 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:22:28,202 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-16 00:22:28,203 INFO L791 eck$LassoCheckResult]: Stem: 797#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_#t~ret5, main_#t~ret6, main_#t~ret7, main_#t~ret8, main_~a~0, main_~ma~2, main_~ea~2, main_~b~0, main_~mb~2, main_~eb~2, main_~r_mul~0, main_~zero~0, main_~one~0, main_~sa~0, main_~tmp~2, main_~tmp___0~0, main_~tmp___1~0, main_~__retres16~0;havoc main_~a~0;main_~ma~2 := main_#t~nondet0;havoc main_#t~nondet0;main_~ea~2 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~b~0;main_~mb~2 := main_#t~nondet2;havoc main_#t~nondet2;main_~eb~2 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~r_mul~0;havoc main_~zero~0;havoc main_~one~0;havoc main_~sa~0;havoc main_~tmp~2;havoc main_~tmp___0~0;havoc main_~tmp___1~0;havoc main_~__retres16~0;base2flt_#in~m, base2flt_#in~e := 0, 0;havoc base2flt_#res;havoc base2flt_~m, base2flt_~e, base2flt_~res~0, base2flt_~__retres4~0;base2flt_~m := base2flt_#in~m;base2flt_~e := base2flt_#in~e;havoc base2flt_~res~0;havoc base2flt_~__retres4~0; 794#L19 assume 0 == base2flt_~m % 4294967296;base2flt_~__retres4~0 := 0; 770#L69 base2flt_#res := base2flt_~__retres4~0; 771#L70 main_#t~ret4 := base2flt_#res;main_~zero~0 := main_#t~ret4;havoc main_#t~ret4;base2flt_#in~m, base2flt_#in~e := 1, 0;havoc base2flt_#res;havoc base2flt_~m, base2flt_~e, base2flt_~res~0, base2flt_~__retres4~0;base2flt_~m := base2flt_#in~m;base2flt_~e := base2flt_#in~e;havoc base2flt_~res~0;havoc base2flt_~__retres4~0; 791#L19-1 assume 0 == base2flt_~m % 4294967296;base2flt_~__retres4~0 := 0; 782#L69-1 base2flt_#res := base2flt_~__retres4~0; 783#L70-1 main_#t~ret5 := base2flt_#res;main_~one~0 := main_#t~ret5;havoc main_#t~ret5;base2flt_#in~m, base2flt_#in~e := main_~ma~2, main_~ea~2;havoc base2flt_#res;havoc base2flt_~m, base2flt_~e, base2flt_~res~0, base2flt_~__retres4~0;base2flt_~m := base2flt_#in~m;base2flt_~e := base2flt_#in~e;havoc base2flt_~res~0;havoc base2flt_~__retres4~0; 786#L19-2 assume !(0 == base2flt_~m % 4294967296); 776#L25-2 assume !(base2flt_~m % 4294967296 < 16777216); 769#L47-8 [2019-11-16 00:22:28,203 INFO L793 eck$LassoCheckResult]: Loop: 769#L47-8 assume !false; 792#L48-2 assume base2flt_~m % 4294967296 >= 33554432; 767#L49-2 assume !(base2flt_~e >= 127);base2flt_~e := 1 + base2flt_~e;base2flt_~m := base2flt_~m / 2; 769#L47-8 [2019-11-16 00:22:28,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:28,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1760951196, now seen corresponding path program 1 times [2019-11-16 00:22:28,203 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:28,204 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187172511] [2019-11-16 00:22:28,204 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:28,204 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:28,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:28,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:28,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:22:28,242 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187172511] [2019-11-16 00:22:28,242 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:22:28,242 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:22:28,242 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365064670] [2019-11-16 00:22:28,243 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:22:28,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:28,243 INFO L82 PathProgramCache]: Analyzing trace with hash 198737, now seen corresponding path program 1 times [2019-11-16 00:22:28,243 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:28,243 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973467320] [2019-11-16 00:22:28,244 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:28,244 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:28,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:28,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:22:28,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:22:28,262 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:22:28,290 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:22:28,290 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:22:28,290 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:22:28,290 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:22:28,291 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:22:28,291 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:22:28,291 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:22:28,291 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:22:28,291 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_2a.c.cil.c_Iteration4_Loop [2019-11-16 00:22:28,291 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:22:28,291 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:22:28,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:28,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:28,391 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:22:28,391 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e90d189-e627-4cb5-9dbf-b20b765d5572/bin/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:22:28,403 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:22:28,404 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e90d189-e627-4cb5-9dbf-b20b765d5572/bin/uautomizer/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-11-16 00:22:28,423 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:22:28,423 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:22:28,439 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:22:28,441 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:22:28,441 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:22:28,441 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:22:28,442 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:22:28,442 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:22:28,442 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:22:28,442 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:22:28,442 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:22:28,442 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_2a.c.cil.c_Iteration4_Loop [2019-11-16 00:22:28,443 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:22:28,443 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:22:28,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:28,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:28,561 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:22:28,562 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:22:28,562 INFO L120 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-11-16 00:22:28,563 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:28,563 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:22:28,563 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:28,563 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:28,563 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:28,564 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:22:28,564 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:22:28,567 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:22:28,569 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:22:28,569 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-16 00:22:28,569 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:22:28,569 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:22:28,570 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:22:28,570 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e) = -2*ULTIMATE.start_base2flt_~e + 253 Supporting invariants [] [2019-11-16 00:22:28,577 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:22:28,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:28,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:28,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:22:28,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:22:28,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:28,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:22:28,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:22:28,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:22:28,623 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-11-16 00:22:28,623 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 45 transitions. cyclomatic complexity: 16 Second operand 3 states. [2019-11-16 00:22:28,638 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 45 transitions. cyclomatic complexity: 16. Second operand 3 states. Result 51 states and 65 transitions. Complement of second has 5 states. [2019-11-16 00:22:28,640 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-11-16 00:22:28,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:22:28,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2019-11-16 00:22:28,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 43 transitions. Stem has 9 letters. Loop has 3 letters. [2019-11-16 00:22:28,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:22:28,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 43 transitions. Stem has 12 letters. Loop has 3 letters. [2019-11-16 00:22:28,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:22:28,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 43 transitions. Stem has 9 letters. Loop has 6 letters. [2019-11-16 00:22:28,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:22:28,642 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 65 transitions. [2019-11-16 00:22:28,642 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 15 [2019-11-16 00:22:28,643 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 48 states and 61 transitions. [2019-11-16 00:22:28,643 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2019-11-16 00:22:28,644 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2019-11-16 00:22:28,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 61 transitions. [2019-11-16 00:22:28,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:22:28,644 INFO L688 BuchiCegarLoop]: Abstraction has 48 states and 61 transitions. [2019-11-16 00:22:28,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states and 61 transitions. [2019-11-16 00:22:28,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 37. [2019-11-16 00:22:28,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-16 00:22:28,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2019-11-16 00:22:28,675 INFO L711 BuchiCegarLoop]: Abstraction has 37 states and 49 transitions. [2019-11-16 00:22:28,676 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:22:28,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:22:28,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:22:28,676 INFO L87 Difference]: Start difference. First operand 37 states and 49 transitions. Second operand 3 states. [2019-11-16 00:22:28,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:28,743 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2019-11-16 00:22:28,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:22:28,744 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 52 transitions. [2019-11-16 00:22:28,744 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-16 00:22:28,745 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 41 states and 52 transitions. [2019-11-16 00:22:28,745 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2019-11-16 00:22:28,745 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2019-11-16 00:22:28,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 52 transitions. [2019-11-16 00:22:28,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:22:28,746 INFO L688 BuchiCegarLoop]: Abstraction has 41 states and 52 transitions. [2019-11-16 00:22:28,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 52 transitions. [2019-11-16 00:22:28,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2019-11-16 00:22:28,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-16 00:22:28,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2019-11-16 00:22:28,750 INFO L711 BuchiCegarLoop]: Abstraction has 37 states and 48 transitions. [2019-11-16 00:22:28,750 INFO L591 BuchiCegarLoop]: Abstraction has 37 states and 48 transitions. [2019-11-16 00:22:28,750 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-16 00:22:28,750 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 48 transitions. [2019-11-16 00:22:28,751 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-16 00:22:28,751 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:22:28,751 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:22:28,751 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:22:28,751 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-16 00:22:28,752 INFO L791 eck$LassoCheckResult]: Stem: 1018#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_#t~ret5, main_#t~ret6, main_#t~ret7, main_#t~ret8, main_~a~0, main_~ma~2, main_~ea~2, main_~b~0, main_~mb~2, main_~eb~2, main_~r_mul~0, main_~zero~0, main_~one~0, main_~sa~0, main_~tmp~2, main_~tmp___0~0, main_~tmp___1~0, main_~__retres16~0;havoc main_~a~0;main_~ma~2 := main_#t~nondet0;havoc main_#t~nondet0;main_~ea~2 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~b~0;main_~mb~2 := main_#t~nondet2;havoc main_#t~nondet2;main_~eb~2 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~r_mul~0;havoc main_~zero~0;havoc main_~one~0;havoc main_~sa~0;havoc main_~tmp~2;havoc main_~tmp___0~0;havoc main_~tmp___1~0;havoc main_~__retres16~0;base2flt_#in~m, base2flt_#in~e := 0, 0;havoc base2flt_#res;havoc base2flt_~m, base2flt_~e, base2flt_~res~0, base2flt_~__retres4~0;base2flt_~m := base2flt_#in~m;base2flt_~e := base2flt_#in~e;havoc base2flt_~res~0;havoc base2flt_~__retres4~0; 1015#L19 assume 0 == base2flt_~m % 4294967296;base2flt_~__retres4~0 := 0; 989#L69 base2flt_#res := base2flt_~__retres4~0; 990#L70 main_#t~ret4 := base2flt_#res;main_~zero~0 := main_#t~ret4;havoc main_#t~ret4;base2flt_#in~m, base2flt_#in~e := 1, 0;havoc base2flt_#res;havoc base2flt_~m, base2flt_~e, base2flt_~res~0, base2flt_~__retres4~0;base2flt_~m := base2flt_#in~m;base2flt_~e := base2flt_#in~e;havoc base2flt_~res~0;havoc base2flt_~__retres4~0; 1011#L19-1 assume !(0 == base2flt_~m % 4294967296); 998#L25-1 assume base2flt_~m % 4294967296 < 16777216; 999#L37-3 assume !false; 1008#L28-1 assume base2flt_~e <= -128;base2flt_~__retres4~0 := 0; 1002#L69-1 base2flt_#res := base2flt_~__retres4~0; 1003#L70-1 main_#t~ret5 := base2flt_#res;main_~one~0 := main_#t~ret5;havoc main_#t~ret5;base2flt_#in~m, base2flt_#in~e := main_~ma~2, main_~ea~2;havoc base2flt_#res;havoc base2flt_~m, base2flt_~e, base2flt_~res~0, base2flt_~__retres4~0;base2flt_~m := base2flt_#in~m;base2flt_~e := base2flt_#in~e;havoc base2flt_~res~0;havoc base2flt_~__retres4~0; 1006#L19-2 assume !(0 == base2flt_~m % 4294967296); 995#L25-2 assume base2flt_~m % 4294967296 < 16777216; 997#L37-5 [2019-11-16 00:22:28,752 INFO L793 eck$LassoCheckResult]: Loop: 997#L37-5 assume !false; 1004#L28-2 assume !(base2flt_~e <= -128);base2flt_~e := base2flt_~e - 1;base2flt_~m := 2 * base2flt_~m; 1005#L37-4 assume base2flt_~m % 4294967296 < 16777216; 997#L37-5 [2019-11-16 00:22:28,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:28,752 INFO L82 PathProgramCache]: Analyzing trace with hash -197167406, now seen corresponding path program 1 times [2019-11-16 00:22:28,752 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:28,752 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649409729] [2019-11-16 00:22:28,752 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:28,753 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:28,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:28,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:28,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:22:28,797 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649409729] [2019-11-16 00:22:28,797 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:22:28,797 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:22:28,798 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354042683] [2019-11-16 00:22:28,798 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:22:28,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:28,798 INFO L82 PathProgramCache]: Analyzing trace with hash 172978, now seen corresponding path program 1 times [2019-11-16 00:22:28,798 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:28,799 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884821087] [2019-11-16 00:22:28,799 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:28,799 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:28,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:28,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:22:28,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:22:28,803 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:22:28,830 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:22:28,830 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:22:28,830 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:22:28,830 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:22:28,830 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:22:28,831 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:22:28,831 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:22:28,831 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:22:28,831 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_2a.c.cil.c_Iteration5_Loop [2019-11-16 00:22:28,831 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:22:28,831 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:22:28,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:28,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-11-16 00:22:28,917 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:22:28,918 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e90d189-e627-4cb5-9dbf-b20b765d5572/bin/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-16 00:22:28,931 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:22:28,932 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:22:28,940 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:22:28,940 INFO L440 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 /tmp/vcloud-vcloud-master/worker/run_dir_4e90d189-e627-4cb5-9dbf-b20b765d5572/bin/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:22:28,951 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:22:28,951 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e90d189-e627-4cb5-9dbf-b20b765d5572/bin/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:22:28,961 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:22:28,961 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:22:28,969 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:22:28,971 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:22:28,971 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:22:28,971 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:22:28,972 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:22:28,972 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:22:28,972 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:22:28,972 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:22:28,972 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:22:28,972 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_2a.c.cil.c_Iteration5_Loop [2019-11-16 00:22:28,972 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:22:28,972 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:22:28,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:28,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:29,073 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:22:29,073 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:22:29,073 INFO L120 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-11-16 00:22:29,074 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:29,074 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:22:29,074 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:29,074 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:29,074 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:29,075 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:22:29,075 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:22:29,077 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:29,078 INFO L120 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-11-16 00:22:29,078 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:29,078 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:22:29,078 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:29,079 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:29,079 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:29,079 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:22:29,079 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:22:29,082 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:22:29,084 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:22:29,085 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-16 00:22:29,085 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:22:29,085 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:22:29,086 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:22:29,086 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e) = 2*ULTIMATE.start_base2flt_~e + 255 Supporting invariants [] [2019-11-16 00:22:29,086 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:22:29,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:29,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:29,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:22:29,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:22:29,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:29,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:22:29,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:22:29,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:22:29,155 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-11-16 00:22:29,156 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 37 states and 48 transitions. cyclomatic complexity: 16 Second operand 4 states. [2019-11-16 00:22:29,170 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 37 states and 48 transitions. cyclomatic complexity: 16. Second operand 4 states. Result 55 states and 69 transitions. Complement of second has 5 states. [2019-11-16 00:22:29,170 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-11-16 00:22:29,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-16 00:22:29,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2019-11-16 00:22:29,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 43 transitions. Stem has 12 letters. Loop has 3 letters. [2019-11-16 00:22:29,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:22:29,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 43 transitions. Stem has 15 letters. Loop has 3 letters. [2019-11-16 00:22:29,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:22:29,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 43 transitions. Stem has 12 letters. Loop has 6 letters. [2019-11-16 00:22:29,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:22:29,172 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 69 transitions. [2019-11-16 00:22:29,173 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2019-11-16 00:22:29,174 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 52 states and 65 transitions. [2019-11-16 00:22:29,174 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 40 [2019-11-16 00:22:29,174 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2019-11-16 00:22:29,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 65 transitions. [2019-11-16 00:22:29,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:22:29,174 INFO L688 BuchiCegarLoop]: Abstraction has 52 states and 65 transitions. [2019-11-16 00:22:29,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 65 transitions. [2019-11-16 00:22:29,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 40. [2019-11-16 00:22:29,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-16 00:22:29,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2019-11-16 00:22:29,177 INFO L711 BuchiCegarLoop]: Abstraction has 40 states and 52 transitions. [2019-11-16 00:22:29,177 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:22:29,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:22:29,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:22:29,178 INFO L87 Difference]: Start difference. First operand 40 states and 52 transitions. Second operand 4 states. [2019-11-16 00:22:29,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:29,245 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2019-11-16 00:22:29,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:22:29,246 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 55 transitions. [2019-11-16 00:22:29,246 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-16 00:22:29,247 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 43 states and 54 transitions. [2019-11-16 00:22:29,247 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2019-11-16 00:22:29,247 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33 [2019-11-16 00:22:29,247 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 54 transitions. [2019-11-16 00:22:29,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:22:29,247 INFO L688 BuchiCegarLoop]: Abstraction has 43 states and 54 transitions. [2019-11-16 00:22:29,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 54 transitions. [2019-11-16 00:22:29,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2019-11-16 00:22:29,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-16 00:22:29,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 51 transitions. [2019-11-16 00:22:29,250 INFO L711 BuchiCegarLoop]: Abstraction has 40 states and 51 transitions. [2019-11-16 00:22:29,250 INFO L591 BuchiCegarLoop]: Abstraction has 40 states and 51 transitions. [2019-11-16 00:22:29,250 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-16 00:22:29,250 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 51 transitions. [2019-11-16 00:22:29,250 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2019-11-16 00:22:29,250 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:22:29,251 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:22:29,251 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:22:29,251 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-16 00:22:29,252 INFO L791 eck$LassoCheckResult]: Stem: 1266#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_#t~ret5, main_#t~ret6, main_#t~ret7, main_#t~ret8, main_~a~0, main_~ma~2, main_~ea~2, main_~b~0, main_~mb~2, main_~eb~2, main_~r_mul~0, main_~zero~0, main_~one~0, main_~sa~0, main_~tmp~2, main_~tmp___0~0, main_~tmp___1~0, main_~__retres16~0;havoc main_~a~0;main_~ma~2 := main_#t~nondet0;havoc main_#t~nondet0;main_~ea~2 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~b~0;main_~mb~2 := main_#t~nondet2;havoc main_#t~nondet2;main_~eb~2 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~r_mul~0;havoc main_~zero~0;havoc main_~one~0;havoc main_~sa~0;havoc main_~tmp~2;havoc main_~tmp___0~0;havoc main_~tmp___1~0;havoc main_~__retres16~0;base2flt_#in~m, base2flt_#in~e := 0, 0;havoc base2flt_#res;havoc base2flt_~m, base2flt_~e, base2flt_~res~0, base2flt_~__retres4~0;base2flt_~m := base2flt_#in~m;base2flt_~e := base2flt_#in~e;havoc base2flt_~res~0;havoc base2flt_~__retres4~0; 1261#L19 assume 0 == base2flt_~m % 4294967296;base2flt_~__retres4~0 := 0; 1234#L69 base2flt_#res := base2flt_~__retres4~0; 1235#L70 main_#t~ret4 := base2flt_#res;main_~zero~0 := main_#t~ret4;havoc main_#t~ret4;base2flt_#in~m, base2flt_#in~e := 1, 0;havoc base2flt_#res;havoc base2flt_~m, base2flt_~e, base2flt_~res~0, base2flt_~__retres4~0;base2flt_~m := base2flt_#in~m;base2flt_~e := base2flt_#in~e;havoc base2flt_~res~0;havoc base2flt_~__retres4~0; 1257#L19-1 assume !(0 == base2flt_~m % 4294967296); 1243#L25-1 assume base2flt_~m % 4294967296 < 16777216; 1244#L37-3 assume !false; 1255#L28-1 assume !(base2flt_~e <= -128);base2flt_~e := base2flt_~e - 1;base2flt_~m := 2 * base2flt_~m; 1256#L37-2 assume !(base2flt_~m % 4294967296 < 16777216); 1262#L63-1 base2flt_~m := ~bitwiseAnd(base2flt_~m, ~bitwiseComplement(16777216));base2flt_~res~0 := ~bitwiseOr(base2flt_~m, 16777216 * (128 + base2flt_~e));base2flt_~__retres4~0 := base2flt_~res~0; 1247#L69-1 base2flt_#res := base2flt_~__retres4~0; 1248#L70-1 main_#t~ret5 := base2flt_#res;main_~one~0 := main_#t~ret5;havoc main_#t~ret5;base2flt_#in~m, base2flt_#in~e := main_~ma~2, main_~ea~2;havoc base2flt_#res;havoc base2flt_~m, base2flt_~e, base2flt_~res~0, base2flt_~__retres4~0;base2flt_~m := base2flt_#in~m;base2flt_~e := base2flt_#in~e;havoc base2flt_~res~0;havoc base2flt_~__retres4~0; 1252#L19-2 assume 0 == base2flt_~m % 4294967296;base2flt_~__retres4~0 := 0; 1231#L69-2 base2flt_#res := base2flt_~__retres4~0; 1245#L70-2 main_#t~ret6 := base2flt_#res;main_~a~0 := main_#t~ret6;havoc main_#t~ret6;base2flt_#in~m, base2flt_#in~e := main_~mb~2, main_~eb~2;havoc base2flt_#res;havoc base2flt_~m, base2flt_~e, base2flt_~res~0, base2flt_~__retres4~0;base2flt_~m := base2flt_#in~m;base2flt_~e := base2flt_#in~e;havoc base2flt_~res~0;havoc base2flt_~__retres4~0; 1253#L19-3 assume !(0 == base2flt_~m % 4294967296); 1238#L25-3 assume !(base2flt_~m % 4294967296 < 16777216); 1239#L47-11 [2019-11-16 00:22:29,252 INFO L793 eck$LassoCheckResult]: Loop: 1239#L47-11 assume !false; 1268#L48-3 assume base2flt_~m % 4294967296 >= 33554432; 1246#L49-3 assume !(base2flt_~e >= 127);base2flt_~e := 1 + base2flt_~e;base2flt_~m := base2flt_~m / 2; 1239#L47-11 [2019-11-16 00:22:29,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:29,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1360904017, now seen corresponding path program 1 times [2019-11-16 00:22:29,252 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:29,252 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844326247] [2019-11-16 00:22:29,252 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:29,252 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:29,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:29,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:29,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:22:29,305 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844326247] [2019-11-16 00:22:29,305 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:22:29,305 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:22:29,305 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728355482] [2019-11-16 00:22:29,306 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:22:29,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:29,306 INFO L82 PathProgramCache]: Analyzing trace with hash 261296, now seen corresponding path program 1 times [2019-11-16 00:22:29,306 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:29,306 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122938175] [2019-11-16 00:22:29,306 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:29,307 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:29,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:29,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:22:29,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:22:29,314 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:22:29,342 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:22:29,343 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:22:29,343 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:22:29,343 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:22:29,343 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:22:29,343 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:22:29,343 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:22:29,343 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:22:29,343 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_2a.c.cil.c_Iteration6_Loop [2019-11-16 00:22:29,343 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:22:29,344 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:22:29,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:29,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:29,418 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:22:29,418 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e90d189-e627-4cb5-9dbf-b20b765d5572/bin/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:22:29,430 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:22:29,430 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e90d189-e627-4cb5-9dbf-b20b765d5572/bin/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:22:29,446 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:22:29,447 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:22:29,454 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:22:29,456 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:22:29,456 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:22:29,457 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:22:29,457 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:22:29,457 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:22:29,457 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:22:29,457 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:22:29,457 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:22:29,457 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_2a.c.cil.c_Iteration6_Loop [2019-11-16 00:22:29,457 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:22:29,457 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:22:29,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:29,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:29,534 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:22:29,535 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:22:29,535 INFO L120 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-11-16 00:22:29,535 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:29,536 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:22:29,536 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:29,536 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:29,536 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:29,536 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:22:29,536 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:22:29,538 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:22:29,540 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:22:29,540 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-16 00:22:29,540 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:22:29,540 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:22:29,540 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:22:29,541 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e) = -2*ULTIMATE.start_base2flt_~e + 253 Supporting invariants [] [2019-11-16 00:22:29,541 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:22:29,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:29,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:29,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:22:29,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:22:29,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:29,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:22:29,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:22:29,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:22:29,583 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-11-16 00:22:29,583 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 40 states and 51 transitions. cyclomatic complexity: 16 Second operand 3 states. [2019-11-16 00:22:29,588 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 40 states and 51 transitions. cyclomatic complexity: 16. Second operand 3 states. Result 43 states and 55 transitions. Complement of second has 4 states. [2019-11-16 00:22:29,588 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-11-16 00:22:29,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-16 00:22:29,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2019-11-16 00:22:29,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 40 transitions. Stem has 17 letters. Loop has 3 letters. [2019-11-16 00:22:29,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:22:29,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 40 transitions. Stem has 20 letters. Loop has 3 letters. [2019-11-16 00:22:29,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:22:29,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 40 transitions. Stem has 17 letters. Loop has 6 letters. [2019-11-16 00:22:29,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:22:29,590 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 55 transitions. [2019-11-16 00:22:29,590 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-16 00:22:29,591 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 37 states and 47 transitions. [2019-11-16 00:22:29,591 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2019-11-16 00:22:29,591 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2019-11-16 00:22:29,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 47 transitions. [2019-11-16 00:22:29,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:22:29,591 INFO L688 BuchiCegarLoop]: Abstraction has 37 states and 47 transitions. [2019-11-16 00:22:29,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 47 transitions. [2019-11-16 00:22:29,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-11-16 00:22:29,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-16 00:22:29,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2019-11-16 00:22:29,593 INFO L711 BuchiCegarLoop]: Abstraction has 37 states and 47 transitions. [2019-11-16 00:22:29,594 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:22:29,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:22:29,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:22:29,594 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. Second operand 4 states. [2019-11-16 00:22:29,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:29,668 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2019-11-16 00:22:29,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:22:29,669 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 45 states and 56 transitions. [2019-11-16 00:22:29,669 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-16 00:22:29,670 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 45 states to 45 states and 56 transitions. [2019-11-16 00:22:29,670 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2019-11-16 00:22:29,670 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2019-11-16 00:22:29,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 56 transitions. [2019-11-16 00:22:29,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-16 00:22:29,671 INFO L688 BuchiCegarLoop]: Abstraction has 45 states and 56 transitions. [2019-11-16 00:22:29,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 56 transitions. [2019-11-16 00:22:29,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2019-11-16 00:22:29,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-16 00:22:29,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 50 transitions. [2019-11-16 00:22:29,673 INFO L711 BuchiCegarLoop]: Abstraction has 39 states and 50 transitions. [2019-11-16 00:22:29,673 INFO L591 BuchiCegarLoop]: Abstraction has 39 states and 50 transitions. [2019-11-16 00:22:29,673 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-16 00:22:29,673 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 50 transitions. [2019-11-16 00:22:29,673 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-16 00:22:29,673 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-16 00:22:29,674 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-16 00:22:29,674 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:22:29,674 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-16 00:22:29,675 INFO L791 eck$LassoCheckResult]: Stem: 1506#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_#t~ret4, main_#t~ret5, main_#t~ret6, main_#t~ret7, main_#t~ret8, main_~a~0, main_~ma~2, main_~ea~2, main_~b~0, main_~mb~2, main_~eb~2, main_~r_mul~0, main_~zero~0, main_~one~0, main_~sa~0, main_~tmp~2, main_~tmp___0~0, main_~tmp___1~0, main_~__retres16~0;havoc main_~a~0;main_~ma~2 := main_#t~nondet0;havoc main_#t~nondet0;main_~ea~2 := main_#t~nondet1;havoc main_#t~nondet1;havoc main_~b~0;main_~mb~2 := main_#t~nondet2;havoc main_#t~nondet2;main_~eb~2 := main_#t~nondet3;havoc main_#t~nondet3;havoc main_~r_mul~0;havoc main_~zero~0;havoc main_~one~0;havoc main_~sa~0;havoc main_~tmp~2;havoc main_~tmp___0~0;havoc main_~tmp___1~0;havoc main_~__retres16~0;base2flt_#in~m, base2flt_#in~e := 0, 0;havoc base2flt_#res;havoc base2flt_~m, base2flt_~e, base2flt_~res~0, base2flt_~__retres4~0;base2flt_~m := base2flt_#in~m;base2flt_~e := base2flt_#in~e;havoc base2flt_~res~0;havoc base2flt_~__retres4~0; 1503#L19 assume 0 == base2flt_~m % 4294967296;base2flt_~__retres4~0 := 0; 1478#L69 base2flt_#res := base2flt_~__retres4~0; 1479#L70 main_#t~ret4 := base2flt_#res;main_~zero~0 := main_#t~ret4;havoc main_#t~ret4;base2flt_#in~m, base2flt_#in~e := 1, 0;havoc base2flt_#res;havoc base2flt_~m, base2flt_~e, base2flt_~res~0, base2flt_~__retres4~0;base2flt_~m := base2flt_#in~m;base2flt_~e := base2flt_#in~e;havoc base2flt_~res~0;havoc base2flt_~__retres4~0; 1499#L19-1 assume !(0 == base2flt_~m % 4294967296); 1486#L25-1 assume base2flt_~m % 4294967296 < 16777216; 1487#L37-3 assume !false; 1497#L28-1 assume !(base2flt_~e <= -128);base2flt_~e := base2flt_~e - 1;base2flt_~m := 2 * base2flt_~m; 1498#L37-2 assume base2flt_~m % 4294967296 < 16777216; 1509#L37-3 assume !false; 1496#L28-1 assume base2flt_~e <= -128;base2flt_~__retres4~0 := 0; 1489#L69-1 base2flt_#res := base2flt_~__retres4~0; 1490#L70-1 main_#t~ret5 := base2flt_#res;main_~one~0 := main_#t~ret5;havoc main_#t~ret5;base2flt_#in~m, base2flt_#in~e := main_~ma~2, main_~ea~2;havoc base2flt_#res;havoc base2flt_~m, base2flt_~e, base2flt_~res~0, base2flt_~__retres4~0;base2flt_~m := base2flt_#in~m;base2flt_~e := base2flt_#in~e;havoc base2flt_~res~0;havoc base2flt_~__retres4~0; 1494#L19-2 assume 0 == base2flt_~m % 4294967296;base2flt_~__retres4~0 := 0; 1475#L69-2 base2flt_#res := base2flt_~__retres4~0; 1488#L70-2 main_#t~ret6 := base2flt_#res;main_~a~0 := main_#t~ret6;havoc main_#t~ret6;base2flt_#in~m, base2flt_#in~e := main_~mb~2, main_~eb~2;havoc base2flt_#res;havoc base2flt_~m, base2flt_~e, base2flt_~res~0, base2flt_~__retres4~0;base2flt_~m := base2flt_#in~m;base2flt_~e := base2flt_#in~e;havoc base2flt_~res~0;havoc base2flt_~__retres4~0; 1495#L19-3 assume !(0 == base2flt_~m % 4294967296); 1482#L25-3 assume base2flt_~m % 4294967296 < 16777216; 1480#L37-7 [2019-11-16 00:22:29,675 INFO L793 eck$LassoCheckResult]: Loop: 1480#L37-7 assume !false; 1481#L28-3 assume !(base2flt_~e <= -128);base2flt_~e := base2flt_~e - 1;base2flt_~m := 2 * base2flt_~m; 1505#L37-6 assume base2flt_~m % 4294967296 < 16777216; 1480#L37-7 [2019-11-16 00:22:29,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:29,675 INFO L82 PathProgramCache]: Analyzing trace with hash -377438794, now seen corresponding path program 1 times [2019-11-16 00:22:29,675 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:29,675 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979135376] [2019-11-16 00:22:29,676 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:29,676 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:29,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:29,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:29,730 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:22:29,730 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979135376] [2019-11-16 00:22:29,731 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109909758] [2019-11-16 00:22:29,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e90d189-e627-4cb5-9dbf-b20b765d5572/bin/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:22:29,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:29,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:22:29,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:22:29,788 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:22:29,788 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:22:29,788 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2019-11-16 00:22:29,788 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965024646] [2019-11-16 00:22:29,789 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-16 00:22:29,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:29,789 INFO L82 PathProgramCache]: Analyzing trace with hash 235537, now seen corresponding path program 1 times [2019-11-16 00:22:29,790 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:22:29,790 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711681305] [2019-11-16 00:22:29,790 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:29,790 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:22:29,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:22:29,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:22:29,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:22:29,795 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:22:29,822 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:22:29,822 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:22:29,822 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:22:29,822 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:22:29,823 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-16 00:22:29,823 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:22:29,823 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:22:29,823 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:22:29,823 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_2a.c.cil.c_Iteration7_Loop [2019-11-16 00:22:29,823 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:22:29,823 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:22:29,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:29,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:29,888 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:22:29,888 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e90d189-e627-4cb5-9dbf-b20b765d5572/bin/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:22:29,894 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:22:29,894 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:22:29,901 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-16 00:22:29,901 INFO L440 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 /tmp/vcloud-vcloud-master/worker/run_dir_4e90d189-e627-4cb5-9dbf-b20b765d5572/bin/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:22:29,911 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-16 00:22:29,911 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4e90d189-e627-4cb5-9dbf-b20b765d5572/bin/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:22:29,918 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-16 00:22:29,919 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-16 00:22:29,925 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-16 00:22:29,927 INFO L210 LassoAnalysis]: Preferences: [2019-11-16 00:22:29,927 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-16 00:22:29,927 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-16 00:22:29,927 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-16 00:22:29,927 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-16 00:22:29,927 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-16 00:22:29,927 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-16 00:22:29,927 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-16 00:22:29,927 INFO L131 ssoRankerPreferences]: Filename of dumped script: soft_float_2a.c.cil.c_Iteration7_Loop [2019-11-16 00:22:29,928 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-16 00:22:29,928 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-16 00:22:29,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:29,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-16 00:22:30,012 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-16 00:22:30,013 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-16 00:22:30,013 INFO L120 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-11-16 00:22:30,014 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:30,014 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:22:30,014 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:30,014 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:30,014 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:30,015 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:22:30,015 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:22:30,016 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-16 00:22:30,017 INFO L120 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-11-16 00:22:30,017 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-16 00:22:30,017 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-16 00:22:30,017 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-16 00:22:30,017 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-16 00:22:30,017 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-16 00:22:30,018 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-16 00:22:30,018 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-16 00:22:30,020 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-16 00:22:30,021 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-16 00:22:30,021 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-11-16 00:22:30,022 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-16 00:22:30,022 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-16 00:22:30,022 INFO L510 LassoAnalysis]: Proved termination. [2019-11-16 00:22:30,022 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e) = 2*ULTIMATE.start_base2flt_~e + 255 Supporting invariants [] [2019-11-16 00:22:30,023 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-11-16 00:22:30,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:22:30,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:30,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:22:30,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:22:30,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:22:30,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-16 00:22:30,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:22:30,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:22:30,086 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-11-16 00:22:30,086 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 50 transitions. cyclomatic complexity: 15 Second operand 4 states. [2019-11-16 00:22:30,092 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 50 transitions. cyclomatic complexity: 15. Second operand 4 states. Result 43 states and 54 transitions. Complement of second has 4 states. [2019-11-16 00:22:30,094 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-11-16 00:22:30,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-16 00:22:30,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2019-11-16 00:22:30,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 37 transitions. Stem has 18 letters. Loop has 3 letters. [2019-11-16 00:22:30,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:22:30,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 37 transitions. Stem has 21 letters. Loop has 3 letters. [2019-11-16 00:22:30,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:22:30,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 37 transitions. Stem has 18 letters. Loop has 6 letters. [2019-11-16 00:22:30,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-16 00:22:30,096 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 54 transitions. [2019-11-16 00:22:30,097 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:22:30,097 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 0 states and 0 transitions. [2019-11-16 00:22:30,097 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-16 00:22:30,097 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-16 00:22:30,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-16 00:22:30,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:22:30,098 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:22:30,098 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:22:30,098 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:22:30,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:22:30,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:22:30,099 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 5 states. [2019-11-16 00:22:30,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:22:30,099 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-11-16 00:22:30,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-16 00:22:30,099 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-11-16 00:22:30,099 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:22:30,099 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-11-16 00:22:30,100 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-16 00:22:30,100 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-16 00:22:30,100 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-16 00:22:30,100 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-16 00:22:30,100 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:22:30,100 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:22:30,100 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:22:30,100 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-16 00:22:30,100 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:22:30,101 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-16 00:22:30,101 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-16 00:22:30,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 16.11 12:22:30 BoogieIcfgContainer [2019-11-16 00:22:30,118 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-16 00:22:30,118 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:22:30,118 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:22:30,119 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:22:30,119 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:22:25" (3/4) ... [2019-11-16 00:22:30,122 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-16 00:22:30,123 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:22:30,125 INFO L168 Benchmark]: Toolchain (without parser) took 5887.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 212.9 MB). Free memory was 946.5 MB in the beginning and 983.2 MB in the end (delta: -36.7 MB). Peak memory consumption was 176.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:22:30,125 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:22:30,126 INFO L168 Benchmark]: CACSL2BoogieTranslator took 376.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 946.5 MB in the beginning and 1.1 GB in the end (delta: -173.5 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:22:30,127 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:22:30,127 INFO L168 Benchmark]: Boogie Preprocessor took 82.60 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:22:30,128 INFO L168 Benchmark]: RCFGBuilder took 852.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 36.2 MB). Peak memory consumption was 36.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:22:30,129 INFO L168 Benchmark]: BuchiAutomizer took 4512.12 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 84.4 MB). Free memory was 1.1 GB in the beginning and 983.2 MB in the end (delta: 93.8 MB). Peak memory consumption was 178.3 MB. Max. memory is 11.5 GB. [2019-11-16 00:22:30,129 INFO L168 Benchmark]: Witness Printer took 4.30 ms. Allocated memory is still 1.2 GB. Free memory is still 983.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:22:30,145 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 376.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 946.5 MB in the beginning and 1.1 GB in the end (delta: -173.5 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 55.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 82.60 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 852.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 36.2 MB). Peak memory consumption was 36.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4512.12 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 84.4 MB). Free memory was 1.1 GB in the beginning and 983.2 MB in the end (delta: 93.8 MB). Peak memory consumption was 178.3 MB. Max. memory is 11.5 GB. * Witness Printer took 4.30 ms. Allocated memory is still 1.2 GB. Free memory is still 983.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 13 terminating modules (6 trivial, 7 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * e + 253 and consists of 4 locations. One deterministic module has affine ranking function -2 * e + 253 and consists of 3 locations. One deterministic module has affine ranking function 2 * e + 255 and consists of 3 locations. One deterministic module has affine ranking function -2 * e + 253 and consists of 3 locations. One deterministic module has affine ranking function 2 * e + 255 and consists of 3 locations. One deterministic module has affine ranking function -2 * e + 253 and consists of 3 locations. One deterministic module has affine ranking function 2 * e + 255 and consists of 3 locations. 6 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.4s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 3.2s. Construction of modules took 0.3s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 9. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 95 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 40 states and ocurred in iteration 5. Nontrivial modules had stage [7, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 542 SDtfs, 373 SDslu, 116 SDs, 0 SdLazy, 207 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI0 SILT6 lasso0 LassoPreprocessingBenchmarks: Lassos: inital21 mio100 ax100 hnf95 lsp57 ukn100 mio100 lsp100 div575 bol100 ite100 ukn100 eq132 hnf44 smp92 dnf100 smp100 tf105 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 25ms VariablesStem: 0 VariablesLoop: 5 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 7 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...