./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-floats-scientific-comp/loop3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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_0890a272-3318-4cc1-9e61-1fe352b47ecd/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_0890a272-3318-4cc1-9e61-1fe352b47ecd/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0890a272-3318-4cc1-9e61-1fe352b47ecd/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0890a272-3318-4cc1-9e61-1fe352b47ecd/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-floats-scientific-comp/loop3.c -s /tmp/vcloud-vcloud-master/worker/run_dir_0890a272-3318-4cc1-9e61-1fe352b47ecd/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0890a272-3318-4cc1-9e61-1fe352b47ecd/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 16de9293a0e84e3b3a329f13e1e1507a400214f0 ......................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_0890a272-3318-4cc1-9e61-1fe352b47ecd/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_0890a272-3318-4cc1-9e61-1fe352b47ecd/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0890a272-3318-4cc1-9e61-1fe352b47ecd/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0890a272-3318-4cc1-9e61-1fe352b47ecd/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-floats-scientific-comp/loop3.c -s /tmp/vcloud-vcloud-master/worker/run_dir_0890a272-3318-4cc1-9e61-1fe352b47ecd/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0890a272-3318-4cc1-9e61-1fe352b47ecd/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 16de9293a0e84e3b3a329f13e1e1507a400214f0 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:21:20,623 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:21:20,624 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:21:20,639 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:21:20,639 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:21:20,641 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:21:20,642 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:21:20,652 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:21:20,656 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:21:20,660 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:21:20,662 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:21:20,663 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:21:20,663 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:21:20,666 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:21:20,667 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:21:20,668 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:21:20,668 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:21:20,669 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:21:20,671 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:21:20,675 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:21:20,678 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:21:20,680 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:21:20,683 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:21:20,684 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:21:20,687 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:21:20,687 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:21:20,687 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:21:20,689 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:21:20,689 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:21:20,690 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:21:20,690 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:21:20,691 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:21:20,691 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:21:20,692 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:21:20,694 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:21:20,694 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:21:20,695 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:21:20,695 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:21:20,695 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:21:20,696 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:21:20,696 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:21:20,697 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_0890a272-3318-4cc1-9e61-1fe352b47ecd/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-16 00:21:20,724 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:21:20,724 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:21:20,725 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:21:20,725 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:21:20,726 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:21:20,726 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:21:20,726 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:21:20,726 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:21:20,727 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:21:20,727 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:21:20,727 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:21:20,727 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:21:20,727 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:21:20,728 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:21:20,728 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:21:20,728 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:21:20,728 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:21:20,729 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:21:20,729 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:21:20,729 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:21:20,729 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:21:20,729 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:21:20,730 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:21:20,730 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:21:20,730 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:21:20,730 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:21:20,731 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:21:20,731 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:21:20,731 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_0890a272-3318-4cc1-9e61-1fe352b47ecd/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(G ! call(__VERIFIER_error())) ) 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 -> 16de9293a0e84e3b3a329f13e1e1507a400214f0 [2019-11-16 00:21:20,770 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:21:20,781 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:21:20,785 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:21:20,786 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:21:20,787 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:21:20,787 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0890a272-3318-4cc1-9e61-1fe352b47ecd/bin/uautomizer/../../sv-benchmarks/c/loop-floats-scientific-comp/loop3.c [2019-11-16 00:21:20,846 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0890a272-3318-4cc1-9e61-1fe352b47ecd/bin/uautomizer/data/369a81aef/388e5c7daa134e30af99681b37e89e37/FLAGd163c4cfb [2019-11-16 00:21:21,262 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:21:21,263 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0890a272-3318-4cc1-9e61-1fe352b47ecd/sv-benchmarks/c/loop-floats-scientific-comp/loop3.c [2019-11-16 00:21:21,269 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0890a272-3318-4cc1-9e61-1fe352b47ecd/bin/uautomizer/data/369a81aef/388e5c7daa134e30af99681b37e89e37/FLAGd163c4cfb [2019-11-16 00:21:21,651 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0890a272-3318-4cc1-9e61-1fe352b47ecd/bin/uautomizer/data/369a81aef/388e5c7daa134e30af99681b37e89e37 [2019-11-16 00:21:21,653 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:21:21,655 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:21:21,658 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:21:21,659 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:21:21,662 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:21:21,663 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:21:21" (1/1) ... [2019-11-16 00:21:21,665 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d62c7d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:21, skipping insertion in model container [2019-11-16 00:21:21,666 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:21:21" (1/1) ... [2019-11-16 00:21:21,672 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:21:21,690 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:21:21,978 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:21:21,986 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:21:22,014 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:21:22,028 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:21:22,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:22 WrapperNode [2019-11-16 00:21:22,029 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:21:22,029 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:21:22,029 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:21:22,030 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:21:22,038 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:21:22" (1/1) ... [2019-11-16 00:21:22,044 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:21:22" (1/1) ... [2019-11-16 00:21:22,064 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:21:22,066 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:21:22,066 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:21:22,066 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:21:22,075 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:22" (1/1) ... [2019-11-16 00:21:22,075 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:22" (1/1) ... [2019-11-16 00:21:22,082 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:22" (1/1) ... [2019-11-16 00:21:22,083 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:22" (1/1) ... [2019-11-16 00:21:22,093 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:22" (1/1) ... [2019-11-16 00:21:22,098 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:22" (1/1) ... [2019-11-16 00:21:22,101 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:22" (1/1) ... [2019-11-16 00:21:22,109 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:21:22,110 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:21:22,110 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:21:22,110 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:21:22,111 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0890a272-3318-4cc1-9e61-1fe352b47ecd/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:21:22,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:21:22,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:21:22,367 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:21:22,367 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-16 00:21:22,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:21:22 BoogieIcfgContainer [2019-11-16 00:21:22,373 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:21:22,374 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:21:22,374 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:21:22,377 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:21:22,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:21:21" (1/3) ... [2019-11-16 00:21:22,378 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4531e12d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:21:22, skipping insertion in model container [2019-11-16 00:21:22,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:22" (2/3) ... [2019-11-16 00:21:22,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4531e12d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:21:22, skipping insertion in model container [2019-11-16 00:21:22,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:21:22" (3/3) ... [2019-11-16 00:21:22,381 INFO L109 eAbstractionObserver]: Analyzing ICFG loop3.c [2019-11-16 00:21:22,390 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:21:22,397 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-16 00:21:22,409 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-16 00:21:22,432 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:21:22,432 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:21:22,432 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:21:22,432 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:21:22,432 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:21:22,433 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:21:22,433 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:21:22,433 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:21:22,463 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2019-11-16 00:21:22,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-16 00:21:22,468 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:21:22,469 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-16 00:21:22,471 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:21:22,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:21:22,484 INFO L82 PathProgramCache]: Analyzing trace with hash 890122407, now seen corresponding path program 1 times [2019-11-16 00:21:22,498 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:21:22,499 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499082937] [2019-11-16 00:21:22,499 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:22,499 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:22,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:21:22,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:22,668 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:21:22,669 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499082937] [2019-11-16 00:21:22,669 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:21:22,670 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:21:22,670 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649026835] [2019-11-16 00:21:22,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-16 00:21:22,674 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:21:22,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-16 00:21:22,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-16 00:21:22,690 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 2 states. [2019-11-16 00:21:22,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:21:22,712 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2019-11-16 00:21:22,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-16 00:21:22,714 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2019-11-16 00:21:22,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:21:22,725 INFO L225 Difference]: With dead ends: 22 [2019-11-16 00:21:22,725 INFO L226 Difference]: Without dead ends: 10 [2019-11-16 00:21:22,730 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-16 00:21:22,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-11-16 00:21:22,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-11-16 00:21:22,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-16 00:21:22,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2019-11-16 00:21:22,763 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 6 [2019-11-16 00:21:22,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:21:22,764 INFO L462 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-11-16 00:21:22,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-16 00:21:22,764 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2019-11-16 00:21:22,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-16 00:21:22,766 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:21:22,766 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:21:22,767 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:21:22,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:21:22,767 INFO L82 PathProgramCache]: Analyzing trace with hash 642088082, now seen corresponding path program 1 times [2019-11-16 00:21:22,768 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:21:22,768 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599738548] [2019-11-16 00:21:22,768 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:22,769 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:21:22,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:21:22,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:21:22,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:21:22,876 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:21:22,876 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-16 00:21:22,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:21:22 BoogieIcfgContainer [2019-11-16 00:21:22,905 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:21:22,906 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:21:22,906 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:21:22,906 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:21:22,907 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:21:22" (3/4) ... [2019-11-16 00:21:22,910 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-16 00:21:22,910 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:21:22,912 INFO L168 Benchmark]: Toolchain (without parser) took 1256.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 951.5 MB in the beginning and 1.1 GB in the end (delta: -128.6 MB). Peak memory consumption was 4.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:21:22,912 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:21:22,913 INFO L168 Benchmark]: CACSL2BoogieTranslator took 370.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 951.5 MB in the beginning and 1.1 GB in the end (delta: -172.7 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2019-11-16 00:21:22,914 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.20 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:21:22,914 INFO L168 Benchmark]: Boogie Preprocessor took 43.76 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:21:22,915 INFO L168 Benchmark]: RCFGBuilder took 263.35 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: 21.8 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:21:22,916 INFO L168 Benchmark]: TraceAbstraction took 531.58 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: 20.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:21:22,916 INFO L168 Benchmark]: Witness Printer took 4.48 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:21:22,920 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.28 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 370.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 951.5 MB in the beginning and 1.1 GB in the end (delta: -172.7 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.20 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. * Boogie Preprocessor took 43.76 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 263.35 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: 21.8 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 531.58 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: 20.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Witness Printer took 4.48 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 8]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 46, overapproximation of to_real at line 17, overapproximation of someBinaryArithmeticFLOAToperation at line 32. Possible FailurePath: [L10] float pi = 3.14159 ; VAL [pi=314159/100000] [L16] float x = __VERIFIER_nondet_float() ; [L17] float octant1 = 0 ; [L18] float octant2 = pi/8 ; [L20] float oddExp = x ; [L21] float evenExp = 1.0 ; [L22] float term = x ; [L23] unsigned int count = 2 ; [L24] int multFactor = 0 ; [L25] int temp ; VAL [pi=314159/100000] [L27] COND TRUE 1 [L29] term = term * (x/count) VAL [pi=314159/100000] [L30] EXPR (count>>1 % 2 == 0) ? 1 : -1 VAL [pi=314159/100000] [L30] multFactor = (count>>1 % 2 == 0) ? 1 : -1 [L32] evenExp = evenExp + multFactor*term [L34] count++ [L36] term = term * (x/count) [L38] oddExp = oddExp + multFactor*term [L40] count++ [L42] temp = __VERIFIER_nondet_int() [L43] COND TRUE temp == 0 VAL [pi=314159/100000] [L8] COND TRUE !(cond) VAL [pi=314159/100000] [L8] __VERIFIER_error() VAL [pi=314159/100000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 14 locations, 1 error locations. Result: UNSAFE, OverallTime: 0.4s, OverallIterations: 2, TraceHistogramMax: 1, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 15 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 15 NumberOfCodeBlocks, 15 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 5 ConstructedInterpolants, 0 QuantifiedInterpolants, 25 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-11-16 00:21:25,165 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:21:25,166 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:21:25,177 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:21:25,178 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:21:25,179 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:21:25,180 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:21:25,182 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:21:25,184 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:21:25,185 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:21:25,186 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:21:25,187 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:21:25,188 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:21:25,189 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:21:25,190 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:21:25,191 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:21:25,192 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:21:25,193 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:21:25,195 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:21:25,197 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:21:25,199 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:21:25,200 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:21:25,201 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:21:25,202 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:21:25,205 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:21:25,205 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:21:25,205 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:21:25,206 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:21:25,207 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:21:25,208 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:21:25,208 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:21:25,209 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:21:25,210 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:21:25,211 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:21:25,212 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:21:25,212 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:21:25,213 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:21:25,213 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:21:25,213 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:21:25,214 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:21:25,215 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:21:25,215 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_0890a272-3318-4cc1-9e61-1fe352b47ecd/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-16 00:21:25,229 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:21:25,230 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:21:25,231 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:21:25,231 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:21:25,232 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:21:25,232 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:21:25,232 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:21:25,232 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:21:25,233 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:21:25,233 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:21:25,233 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:21:25,233 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:21:25,233 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-16 00:21:25,234 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-16 00:21:25,234 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:21:25,234 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:21:25,234 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:21:25,235 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:21:25,235 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:21:25,235 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:21:25,235 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:21:25,236 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:21:25,236 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:21:25,236 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:21:25,236 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:21:25,237 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:21:25,237 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-16 00:21:25,237 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-16 00:21:25,237 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:21:25,237 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-16 00:21:25,238 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_0890a272-3318-4cc1-9e61-1fe352b47ecd/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(G ! call(__VERIFIER_error())) ) 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 -> 16de9293a0e84e3b3a329f13e1e1507a400214f0 [2019-11-16 00:21:25,268 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:21:25,278 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:21:25,281 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:21:25,282 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:21:25,283 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:21:25,284 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0890a272-3318-4cc1-9e61-1fe352b47ecd/bin/uautomizer/../../sv-benchmarks/c/loop-floats-scientific-comp/loop3.c [2019-11-16 00:21:25,335 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0890a272-3318-4cc1-9e61-1fe352b47ecd/bin/uautomizer/data/a611e0d3c/cdd64c4401014a279dbb396ac188bfd5/FLAG9e8a04de8 [2019-11-16 00:21:25,710 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:21:25,711 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0890a272-3318-4cc1-9e61-1fe352b47ecd/sv-benchmarks/c/loop-floats-scientific-comp/loop3.c [2019-11-16 00:21:25,716 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0890a272-3318-4cc1-9e61-1fe352b47ecd/bin/uautomizer/data/a611e0d3c/cdd64c4401014a279dbb396ac188bfd5/FLAG9e8a04de8 [2019-11-16 00:21:26,086 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0890a272-3318-4cc1-9e61-1fe352b47ecd/bin/uautomizer/data/a611e0d3c/cdd64c4401014a279dbb396ac188bfd5 [2019-11-16 00:21:26,090 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:21:26,092 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:21:26,097 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:21:26,097 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:21:26,100 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:21:26,101 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:21:26" (1/1) ... [2019-11-16 00:21:26,104 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cafac0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:26, skipping insertion in model container [2019-11-16 00:21:26,104 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:21:26" (1/1) ... [2019-11-16 00:21:26,111 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:21:26,132 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:21:26,349 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:21:26,358 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:21:26,389 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:21:26,403 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:21:26,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:26 WrapperNode [2019-11-16 00:21:26,404 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:21:26,404 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:21:26,405 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:21:26,405 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:21:26,475 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:21:26" (1/1) ... [2019-11-16 00:21:26,483 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:21:26" (1/1) ... [2019-11-16 00:21:26,508 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:21:26,508 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:21:26,509 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:21:26,509 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:21:26,516 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:26" (1/1) ... [2019-11-16 00:21:26,516 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:26" (1/1) ... [2019-11-16 00:21:26,518 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:26" (1/1) ... [2019-11-16 00:21:26,518 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:26" (1/1) ... [2019-11-16 00:21:26,524 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:26" (1/1) ... [2019-11-16 00:21:26,527 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:26" (1/1) ... [2019-11-16 00:21:26,531 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:26" (1/1) ... [2019-11-16 00:21:26,534 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:21:26,534 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:21:26,535 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:21:26,535 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:21:26,538 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0890a272-3318-4cc1-9e61-1fe352b47ecd/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:21:26,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:21:26,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:21:30,268 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:21:30,268 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-16 00:21:30,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:21:30 BoogieIcfgContainer [2019-11-16 00:21:30,270 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:21:30,271 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:21:30,271 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:21:30,274 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:21:30,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:21:26" (1/3) ... [2019-11-16 00:21:30,275 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1edaeee0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:21:30, skipping insertion in model container [2019-11-16 00:21:30,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:21:26" (2/3) ... [2019-11-16 00:21:30,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1edaeee0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:21:30, skipping insertion in model container [2019-11-16 00:21:30,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:21:30" (3/3) ... [2019-11-16 00:21:30,278 INFO L109 eAbstractionObserver]: Analyzing ICFG loop3.c [2019-11-16 00:21:30,288 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:21:30,296 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-16 00:21:30,307 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-16 00:21:30,330 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:21:30,330 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:21:30,330 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:21:30,330 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:21:30,331 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:21:30,331 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:21:30,331 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:21:30,332 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:21:30,346 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2019-11-16 00:21:30,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-16 00:21:30,351 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:21:30,352 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-16 00:21:30,354 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:21:30,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:21:30,360 INFO L82 PathProgramCache]: Analyzing trace with hash 890122407, now seen corresponding path program 1 times [2019-11-16 00:21:30,370 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:21:30,370 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [455327662] [2019-11-16 00:21:30,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0890a272-3318-4cc1-9e61-1fe352b47ecd/bin/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-11-16 00:21:30,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:30,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-16 00:21:30,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:21:30,462 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:21:30,463 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:21:30,466 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:21:30,467 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [455327662] [2019-11-16 00:21:30,468 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:21:30,468 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-16 00:21:30,468 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997897895] [2019-11-16 00:21:30,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-16 00:21:30,472 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:21:30,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-16 00:21:30,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-16 00:21:30,484 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 2 states. [2019-11-16 00:21:30,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:21:30,495 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2019-11-16 00:21:30,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-16 00:21:30,497 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2019-11-16 00:21:30,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:21:30,505 INFO L225 Difference]: With dead ends: 22 [2019-11-16 00:21:30,506 INFO L226 Difference]: Without dead ends: 10 [2019-11-16 00:21:30,509 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-16 00:21:30,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-11-16 00:21:30,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-11-16 00:21:30,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-11-16 00:21:30,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2019-11-16 00:21:30,537 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 6 [2019-11-16 00:21:30,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:21:30,538 INFO L462 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2019-11-16 00:21:30,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-16 00:21:30,538 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2019-11-16 00:21:30,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-16 00:21:30,539 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:21:30,539 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:21:30,753 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-16 00:21:30,754 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:21:30,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:21:30,754 INFO L82 PathProgramCache]: Analyzing trace with hash 642088082, now seen corresponding path program 1 times [2019-11-16 00:21:30,754 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:21:30,755 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [594966923] [2019-11-16 00:21:30,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0890a272-3318-4cc1-9e61-1fe352b47ecd/bin/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-11-16 00:21:33,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:21:33,240 WARN L254 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-16 00:21:33,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:21:59,396 WARN L191 SmtUtils]: Spent 20.26 s on a formula simplification that was a NOOP. DAG size: 28 [2019-11-16 00:22:18,652 WARN L191 SmtUtils]: Spent 14.52 s on a formula simplification that was a NOOP. DAG size: 32 [2019-11-16 00:22:21,071 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (and (= (fp.add roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) c_ULTIMATE.start_main_~oddExp~0) (fp.lt ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= c_ULTIMATE.start_main_~evenExp~0 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)))))) is different from false [2019-11-16 00:22:23,426 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (and (= (fp.add roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) c_ULTIMATE.start_main_~oddExp~0) (fp.lt ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= c_ULTIMATE.start_main_~evenExp~0 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)))))) is different from true [2019-11-16 00:22:23,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:22:35,732 WARN L838 $PredicateComparison]: unable to prove that (or (and (= (bvadd c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (fp.geq (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))))) (fp.lt ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))))) (and (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (and (fp.lt ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (not (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (fp.geq (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse2 .cse3)) (fp.add roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))))))))) (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) is different from false [2019-11-16 00:22:42,950 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (and (fp.lt ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (not (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (fp.geq (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))))))))) is different from false [2019-11-16 00:22:45,314 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (and (fp.lt ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (not (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (fp.geq (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))))))))) is different from true [2019-11-16 00:22:45,318 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:45,318 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:22:50,519 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_ULTIMATE.start_main_#t~ite2|))) (fp.geq (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))) is different from false [2019-11-16 00:22:52,620 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_ULTIMATE.start_main_#t~ite2|))) (fp.geq (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))) is different from true [2019-11-16 00:22:54,714 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (fp.geq (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))) is different from false [2019-11-16 00:22:56,800 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (fp.geq (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))) is different from true [2019-11-16 00:22:58,959 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))))) (fp.geq (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))) is different from false [2019-11-16 00:23:01,118 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))))) (fp.geq (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))) is different from true [2019-11-16 00:23:04,203 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~oddExp~0_9 (_ FloatingPoint 8 24))) (or (not (fp.lt v_ULTIMATE.start_main_~oddExp~0_9 (fp.div roundNearestTiesToEven c_~pi~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven v_ULTIMATE.start_main_~oddExp~0_9 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~oddExp~0_9 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (fp.geq (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven v_ULTIMATE.start_main_~oddExp~0_9 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~oddExp~0_9 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))))) (not (fp.gt v_ULTIMATE.start_main_~oddExp~0_9 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))))) is different from true [2019-11-16 00:23:04,204 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:23:04,205 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [594966923] [2019-11-16 00:23:04,205 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:23:04,205 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 14 [2019-11-16 00:23:04,205 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86513281] [2019-11-16 00:23:04,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-16 00:23:04,207 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:23:04,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-16 00:23:04,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=12, NotChecked=126, Total=210 [2019-11-16 00:23:04,209 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand 15 states. [2019-11-16 00:23:06,593 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~oddExp~0_9 (_ FloatingPoint 8 24))) (or (not (fp.lt v_ULTIMATE.start_main_~oddExp~0_9 (fp.div roundNearestTiesToEven c_~pi~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven v_ULTIMATE.start_main_~oddExp~0_9 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~oddExp~0_9 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (fp.geq (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven v_ULTIMATE.start_main_~oddExp~0_9 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~oddExp~0_9 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))))) (not (fp.gt v_ULTIMATE.start_main_~oddExp~0_9 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))))) (= c_~pi~0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))))) is different from false [2019-11-16 00:23:08,991 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~oddExp~0_9 (_ FloatingPoint 8 24))) (or (not (fp.lt v_ULTIMATE.start_main_~oddExp~0_9 (fp.div roundNearestTiesToEven c_~pi~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven v_ULTIMATE.start_main_~oddExp~0_9 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~oddExp~0_9 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (fp.geq (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven v_ULTIMATE.start_main_~oddExp~0_9 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~oddExp~0_9 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))))) (not (fp.gt v_ULTIMATE.start_main_~oddExp~0_9 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))))) (= c_~pi~0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))))) is different from true [2019-11-16 00:23:11,385 WARN L838 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~term~0) (= (_ bv2 32) c_ULTIMATE.start_main_~count~0) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (= c_ULTIMATE.start_main_~evenExp~0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~oddExp~0) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))))) (fp.geq (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32)))))))))) is different from false [2019-11-16 00:23:13,538 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~term~0) (= (_ bv2 32) c_ULTIMATE.start_main_~count~0) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (= c_ULTIMATE.start_main_~evenExp~0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~oddExp~0) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))))) (fp.geq (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32)))))))))) is different from true [2019-11-16 00:23:15,934 WARN L838 $PredicateComparison]: unable to prove that (and (= (_ bv2 32) c_ULTIMATE.start_main_~count~0) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (= c_ULTIMATE.start_main_~evenExp~0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~oddExp~0) (= (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))) c_ULTIMATE.start_main_~term~0) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (fp.geq (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32)))))))))) is different from false [2019-11-16 00:23:18,023 WARN L860 $PredicateComparison]: unable to prove that (and (= (_ bv2 32) c_ULTIMATE.start_main_~count~0) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (= c_ULTIMATE.start_main_~evenExp~0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~oddExp~0) (= (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))) c_ULTIMATE.start_main_~term~0) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (fp.geq (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32)))))))))) is different from true [2019-11-16 00:23:20,424 WARN L838 $PredicateComparison]: unable to prove that (and (= (bvadd |c_ULTIMATE.start_main_#t~ite2| (_ bv1 32)) (_ bv0 32)) (= (_ bv2 32) c_ULTIMATE.start_main_~count~0) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (= c_ULTIMATE.start_main_~evenExp~0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~oddExp~0) (= (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))) c_ULTIMATE.start_main_~term~0) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_ULTIMATE.start_main_#t~ite2|))) (fp.geq (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32)))))))))) is different from false [2019-11-16 00:23:22,536 WARN L860 $PredicateComparison]: unable to prove that (and (= (bvadd |c_ULTIMATE.start_main_#t~ite2| (_ bv1 32)) (_ bv0 32)) (= (_ bv2 32) c_ULTIMATE.start_main_~count~0) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (= c_ULTIMATE.start_main_~evenExp~0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~oddExp~0) (= (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))) c_ULTIMATE.start_main_~term~0) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_ULTIMATE.start_main_#t~ite2|))) (fp.geq (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32)))))))))) is different from true [2019-11-16 00:23:24,948 WARN L838 $PredicateComparison]: unable to prove that (and (fp.geq c_ULTIMATE.start_main_~evenExp~0 c_ULTIMATE.start_main_~oddExp~0) (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (and (= (fp.add roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) c_ULTIMATE.start_main_~oddExp~0) (fp.lt ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= c_ULTIMATE.start_main_~evenExp~0 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1))))))) is different from false [2019-11-16 00:23:29,705 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) (and (not .cse0) (or (and (= (bvadd c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (and (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (fp.geq (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.add roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))))) (fp.lt ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))))) (and (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (and (fp.lt ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (not (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse4 (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (fp.geq (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse3 .cse4)) (fp.add roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))))))))) .cse0)))) is different from false [2019-11-16 00:23:29,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:29,727 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2019-11-16 00:23:29,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:23:29,728 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 9 [2019-11-16 00:23:29,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:29,729 INFO L225 Difference]: With dead ends: 18 [2019-11-16 00:23:29,729 INFO L226 Difference]: Without dead ends: 14 [2019-11-16 00:23:29,731 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 99.8s TimeCoverageRelationStatistics Valid=43, Invalid=43, Unknown=22, NotChecked=312, Total=420 [2019-11-16 00:23:29,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-11-16 00:23:29,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-11-16 00:23:29,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-16 00:23:29,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2019-11-16 00:23:29,736 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 9 [2019-11-16 00:23:29,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:29,736 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2019-11-16 00:23:29,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-16 00:23:29,736 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2019-11-16 00:23:29,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-16 00:23:29,737 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:29,737 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:29,940 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-16 00:23:29,941 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:23:29,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:29,941 INFO L82 PathProgramCache]: Analyzing trace with hash 584829780, now seen corresponding path program 1 times [2019-11-16 00:23:29,942 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:23:29,942 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [225638411] [2019-11-16 00:23:29,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0890a272-3318-4cc1-9e61-1fe352b47ecd/bin/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-11-16 00:23:30,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:23:30,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:23:30,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:23:30,832 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:23:30,832 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:23:30,842 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:23:30,842 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [225638411] [2019-11-16 00:23:30,842 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:23:30,843 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-16 00:23:30,843 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491364822] [2019-11-16 00:23:30,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:23:30,844 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:23:30,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:23:30,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:23:30,844 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 4 states. [2019-11-16 00:23:36,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:23:36,233 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2019-11-16 00:23:36,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:23:36,235 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-11-16 00:23:36,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:23:36,236 INFO L225 Difference]: With dead ends: 23 [2019-11-16 00:23:36,236 INFO L226 Difference]: Without dead ends: 15 [2019-11-16 00:23:36,237 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:23:36,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-11-16 00:23:36,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-11-16 00:23:36,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-16 00:23:36,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-11-16 00:23:36,241 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2019-11-16 00:23:36,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:23:36,241 INFO L462 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-11-16 00:23:36,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:23:36,241 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-11-16 00:23:36,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-16 00:23:36,242 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:23:36,242 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:23:36,447 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-16 00:23:36,448 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:23:36,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:23:36,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1074766744, now seen corresponding path program 1 times [2019-11-16 00:23:36,449 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:23:36,449 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1057113790] [2019-11-16 00:23:36,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0890a272-3318-4cc1-9e61-1fe352b47ecd/bin/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-11-16 00:24:43,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:24:43,957 WARN L254 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-16 00:24:43,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:25:09,991 WARN L191 SmtUtils]: Spent 20.84 s on a formula simplification that was a NOOP. DAG size: 28 [2019-11-16 00:25:41,520 WARN L191 SmtUtils]: Spent 27.23 s on a formula simplification that was a NOOP. DAG size: 32 [2019-11-16 00:25:43,926 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32))))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= c_ULTIMATE.start_main_~term~0 (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32)))))) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967292 32)) (_ bv0 32)) (= c_ULTIMATE.start_main_~evenExp~0 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse1 .cse0))) (= c_ULTIMATE.start_main_~oddExp~0 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse1 c_ULTIMATE.start_main_~term~0))))) is different from false [2019-11-16 00:25:46,375 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32)))))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= c_ULTIMATE.start_main_~term~0 (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0)))) (= (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse1 .cse0)) c_ULTIMATE.start_main_~oddExp~0) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967292 32)) (_ bv0 32)) (= c_ULTIMATE.start_main_~evenExp~0 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse1 .cse2)))))) is different from false [2019-11-16 00:25:48,817 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32)))))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= c_ULTIMATE.start_main_~term~0 (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0)))) (= (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse1 .cse0)) c_ULTIMATE.start_main_~oddExp~0) (= (bvadd |c_ULTIMATE.start_main_#t~ite2| (_ bv1 32)) (_ bv0 32)) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967292 32)) (_ bv0 32)) (= c_ULTIMATE.start_main_~evenExp~0 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse1 .cse2)))))) is different from false [2019-11-16 00:25:51,323 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse1 (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (and (= c_ULTIMATE.start_main_~evenExp~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2))) (fp.lt ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) c_ULTIMATE.start_main_~oddExp~0)))))) is different from false [2019-11-16 00:25:53,769 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse1 (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (and (= c_ULTIMATE.start_main_~evenExp~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2))) (fp.lt ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) c_ULTIMATE.start_main_~oddExp~0)))))) is different from true [2019-11-16 00:25:53,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:26:06,651 WARN L838 $PredicateComparison]: unable to prove that (or (and (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (and (let ((.cse1 (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))))))) (fp.lt ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))) (= (bvadd c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))) (and (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (and (fp.lt ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (not (let ((.cse5 (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse7 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse6 (fp.mul roundNearestTiesToEven .cse7 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse4 .cse5)) (fp.mul roundNearestTiesToEven .cse4 .cse6)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse4 .cse7)) (fp.mul roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))))))))))))) (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) is different from false [2019-11-16 00:26:14,111 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (and (fp.lt ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (not (let ((.cse1 (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))))))))))))) is different from false [2019-11-16 00:26:16,550 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (and (fp.lt ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (not (let ((.cse1 (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))))))))))))) is different from true [2019-11-16 00:26:16,557 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2019-11-16 00:26:16,557 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:26:22,244 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_ULTIMATE.start_main_#t~ite2|))) (fp.geq (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))) is different from false [2019-11-16 00:26:24,358 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_ULTIMATE.start_main_#t~ite2|))) (fp.geq (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))) is different from true [2019-11-16 00:26:26,480 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (fp.geq (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))) is different from false [2019-11-16 00:26:28,572 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (fp.geq (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))) is different from true [2019-11-16 00:26:30,734 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))))) (fp.geq (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))) is different from false [2019-11-16 00:26:32,930 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))))) (fp.geq (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))) is different from true [2019-11-16 00:26:35,193 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_ULTIMATE.start_main_#t~ite2|)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32)))))))))) is different from false [2019-11-16 00:26:37,461 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_ULTIMATE.start_main_#t~ite2|)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32)))))))))) is different from true [2019-11-16 00:26:39,738 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32)))))))))) is different from false [2019-11-16 00:26:41,990 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32)))))))))) is different from true [2019-11-16 00:26:44,306 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32))))))))))) is different from false [2019-11-16 00:26:46,628 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32))))))))))) is different from true [2019-11-16 00:26:50,074 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~oddExp~0_16 (_ FloatingPoint 8 24))) (or (let ((.cse1 (fp.mul roundNearestTiesToEven v_ULTIMATE.start_main_~oddExp~0_16 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~oddExp~0_16 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~oddExp~0_16 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~oddExp~0_16 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven v_ULTIMATE.start_main_~oddExp~0_16 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~oddExp~0_16 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))))))) (not (fp.gt v_ULTIMATE.start_main_~oddExp~0_16 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))) (not (fp.lt v_ULTIMATE.start_main_~oddExp~0_16 (fp.div roundNearestTiesToEven c_~pi~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32))))))) is different from true [2019-11-16 00:26:50,077 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2019-11-16 00:26:50,077 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1057113790] [2019-11-16 00:26:50,077 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:26:50,078 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 20 [2019-11-16 00:26:50,078 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761364875] [2019-11-16 00:26:50,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-16 00:26:50,079 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:26:50,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-16 00:26:50,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=44, Unknown=21, NotChecked=312, Total=420 [2019-11-16 00:26:50,080 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 21 states. [2019-11-16 00:26:52,538 WARN L838 $PredicateComparison]: unable to prove that (and (= c_~pi~0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0)))) (forall ((v_ULTIMATE.start_main_~oddExp~0_16 (_ FloatingPoint 8 24))) (or (let ((.cse1 (fp.mul roundNearestTiesToEven v_ULTIMATE.start_main_~oddExp~0_16 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~oddExp~0_16 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~oddExp~0_16 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~oddExp~0_16 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven v_ULTIMATE.start_main_~oddExp~0_16 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~oddExp~0_16 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))))))) (not (fp.gt v_ULTIMATE.start_main_~oddExp~0_16 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))) (not (fp.lt v_ULTIMATE.start_main_~oddExp~0_16 (fp.div roundNearestTiesToEven c_~pi~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))))))) is different from false [2019-11-16 00:26:55,039 WARN L860 $PredicateComparison]: unable to prove that (and (= c_~pi~0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0)))) (forall ((v_ULTIMATE.start_main_~oddExp~0_16 (_ FloatingPoint 8 24))) (or (let ((.cse1 (fp.mul roundNearestTiesToEven v_ULTIMATE.start_main_~oddExp~0_16 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~oddExp~0_16 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~oddExp~0_16 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~oddExp~0_16 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven v_ULTIMATE.start_main_~oddExp~0_16 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~oddExp~0_16 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))))))) (not (fp.gt v_ULTIMATE.start_main_~oddExp~0_16 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))) (not (fp.lt v_ULTIMATE.start_main_~oddExp~0_16 (fp.div roundNearestTiesToEven c_~pi~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))))))) is different from true [2019-11-16 00:26:57,551 WARN L838 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~term~0) (= (_ bv2 32) c_ULTIMATE.start_main_~count~0) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (= c_ULTIMATE.start_main_~evenExp~0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (let ((.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32))))))))))) (= c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~oddExp~0)) is different from false [2019-11-16 00:26:59,867 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~term~0) (= (_ bv2 32) c_ULTIMATE.start_main_~count~0) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (= c_ULTIMATE.start_main_~evenExp~0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (let ((.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32))))))))))) (= c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~oddExp~0)) is different from true [2019-11-16 00:27:02,369 WARN L838 $PredicateComparison]: unable to prove that (and (= (_ bv2 32) c_ULTIMATE.start_main_~count~0) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (= c_ULTIMATE.start_main_~evenExp~0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~oddExp~0) (= (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))) c_ULTIMATE.start_main_~term~0) (let ((.cse2 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32))))))))))) is different from false [2019-11-16 00:27:04,624 WARN L860 $PredicateComparison]: unable to prove that (and (= (_ bv2 32) c_ULTIMATE.start_main_~count~0) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (= c_ULTIMATE.start_main_~evenExp~0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~oddExp~0) (= (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))) c_ULTIMATE.start_main_~term~0) (let ((.cse2 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32))))))))))) is different from true [2019-11-16 00:27:07,122 WARN L838 $PredicateComparison]: unable to prove that (and (= (bvadd |c_ULTIMATE.start_main_#t~ite2| (_ bv1 32)) (_ bv0 32)) (= (_ bv2 32) c_ULTIMATE.start_main_~count~0) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (= c_ULTIMATE.start_main_~evenExp~0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~oddExp~0) (= (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))) c_ULTIMATE.start_main_~term~0) (let ((.cse3 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_ULTIMATE.start_main_#t~ite2|)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32))))))))))) is different from false [2019-11-16 00:27:09,401 WARN L860 $PredicateComparison]: unable to prove that (and (= (bvadd |c_ULTIMATE.start_main_#t~ite2| (_ bv1 32)) (_ bv0 32)) (= (_ bv2 32) c_ULTIMATE.start_main_~count~0) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (= c_ULTIMATE.start_main_~evenExp~0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~oddExp~0) (= (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))) c_ULTIMATE.start_main_~term~0) (let ((.cse3 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_ULTIMATE.start_main_#t~ite2|)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32))))))))))) is different from true [2019-11-16 00:27:11,892 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32))))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= c_ULTIMATE.start_main_~term~0 (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32)))))) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967292 32)) (_ bv0 32)) (= c_ULTIMATE.start_main_~evenExp~0 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse1 .cse0))) (= c_ULTIMATE.start_main_~oddExp~0 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse1 c_ULTIMATE.start_main_~term~0))) (let ((.cse2 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))))) (fp.geq (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))))) is different from false [2019-11-16 00:27:14,064 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32))))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= c_ULTIMATE.start_main_~term~0 (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32)))))) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967292 32)) (_ bv0 32)) (= c_ULTIMATE.start_main_~evenExp~0 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse1 .cse0))) (= c_ULTIMATE.start_main_~oddExp~0 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse1 c_ULTIMATE.start_main_~term~0))) (let ((.cse2 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))))) (fp.geq (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))))) is different from true [2019-11-16 00:27:16,557 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32)))))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= c_ULTIMATE.start_main_~term~0 (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0)))) (= (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse1 .cse0)) c_ULTIMATE.start_main_~oddExp~0) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967292 32)) (_ bv0 32)) (= c_ULTIMATE.start_main_~evenExp~0 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse1 .cse2))) (fp.geq (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse1 c_ULTIMATE.start_main_~term~0)) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))))) is different from false [2019-11-16 00:27:18,652 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32)))))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= c_ULTIMATE.start_main_~term~0 (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0)))) (= (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse1 .cse0)) c_ULTIMATE.start_main_~oddExp~0) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967292 32)) (_ bv0 32)) (= c_ULTIMATE.start_main_~evenExp~0 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse1 .cse2))) (fp.geq (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse1 c_ULTIMATE.start_main_~term~0)) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))))) is different from true [2019-11-16 00:27:21,151 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32)))))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= c_ULTIMATE.start_main_~term~0 (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0)))) (= (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse1 .cse0)) c_ULTIMATE.start_main_~oddExp~0) (= (bvadd |c_ULTIMATE.start_main_#t~ite2| (_ bv1 32)) (_ bv0 32)) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven |c_ULTIMATE.start_main_#t~ite2|))) (fp.geq (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse2 c_ULTIMATE.start_main_~term~0)) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))) (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967292 32)) (_ bv0 32)) (= c_ULTIMATE.start_main_~evenExp~0 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse1 .cse3)))))) is different from false [2019-11-16 00:27:23,268 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32)))))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= c_ULTIMATE.start_main_~term~0 (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0)))) (= (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse1 .cse0)) c_ULTIMATE.start_main_~oddExp~0) (= (bvadd |c_ULTIMATE.start_main_#t~ite2| (_ bv1 32)) (_ bv0 32)) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven |c_ULTIMATE.start_main_#t~ite2|))) (fp.geq (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse2 c_ULTIMATE.start_main_~term~0)) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))) (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967292 32)) (_ bv0 32)) (= c_ULTIMATE.start_main_~evenExp~0 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse1 .cse3)))))) is different from true [2019-11-16 00:27:25,772 WARN L838 $PredicateComparison]: unable to prove that (and (fp.geq c_ULTIMATE.start_main_~evenExp~0 c_ULTIMATE.start_main_~oddExp~0) (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse1 (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (and (= c_ULTIMATE.start_main_~evenExp~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2))) (fp.lt ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) c_ULTIMATE.start_main_~oddExp~0))))))) is different from false [2019-11-16 00:27:32,515 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) (and (not .cse0) (or (and (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (and (let ((.cse2 (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.mul roundNearestTiesToEven .cse1 .cse3)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse1 .cse4)) (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))))))) (fp.lt ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))) (= (bvadd c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))) (and (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (and (fp.lt ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (not (let ((.cse6 (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse8 (fp.mul roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse5 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse7 (fp.mul roundNearestTiesToEven .cse8 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse5 .cse6)) (fp.mul roundNearestTiesToEven .cse5 .cse7)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse5 .cse8)) (fp.mul roundNearestTiesToEven .cse5 (fp.mul roundNearestTiesToEven .cse7 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))))))))))))) .cse0)))) is different from false [2019-11-16 00:27:34,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:27:34,491 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2019-11-16 00:27:34,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:27:34,491 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 13 [2019-11-16 00:27:34,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:27:34,492 INFO L225 Difference]: With dead ends: 22 [2019-11-16 00:27:34,492 INFO L226 Difference]: Without dead ends: 18 [2019-11-16 00:27:34,493 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 22 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 149.4s TimeCoverageRelationStatistics Valid=61, Invalid=46, Unknown=37, NotChecked=726, Total=870 [2019-11-16 00:27:34,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-11-16 00:27:34,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-11-16 00:27:34,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-11-16 00:27:34,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-11-16 00:27:34,497 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 13 [2019-11-16 00:27:34,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:27:34,498 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-11-16 00:27:34,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-16 00:27:34,498 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2019-11-16 00:27:34,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-16 00:27:34,498 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:27:34,499 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:27:34,699 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-16 00:27:34,699 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:27:34,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:34,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1132025046, now seen corresponding path program 1 times [2019-11-16 00:27:34,701 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:27:34,701 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [497790702] [2019-11-16 00:27:34,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0890a272-3318-4cc1-9e61-1fe352b47ecd/bin/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-11-16 00:27:36,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:36,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-16 00:27:36,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:27:36,714 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:27:36,714 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:27:36,746 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:27:36,747 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [497790702] [2019-11-16 00:27:36,747 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:27:36,747 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-11-16 00:27:36,747 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219494902] [2019-11-16 00:27:36,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:27:36,748 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:27:36,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:27:36,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:27:36,749 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 6 states. [2019-11-16 00:27:47,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:27:47,992 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2019-11-16 00:27:47,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:27:47,993 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2019-11-16 00:27:47,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:27:47,994 INFO L225 Difference]: With dead ends: 34 [2019-11-16 00:27:47,994 INFO L226 Difference]: Without dead ends: 26 [2019-11-16 00:27:47,995 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:27:47,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-16 00:27:47,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 22. [2019-11-16 00:27:47,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-16 00:27:48,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-11-16 00:27:48,000 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 13 [2019-11-16 00:27:48,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:27:48,000 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-11-16 00:27:48,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:27:48,000 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-11-16 00:27:48,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-16 00:27:48,001 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:27:48,001 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2019-11-16 00:27:48,202 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-16 00:27:48,202 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:27:48,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:48,203 INFO L82 PathProgramCache]: Analyzing trace with hash -958701250, now seen corresponding path program 2 times [2019-11-16 00:27:48,203 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-16 00:27:48,203 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [47196825] [2019-11-16 00:27:48,203 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0890a272-3318-4cc1-9e61-1fe352b47ecd/bin/uautomizer/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-11-16 00:29:14,005 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-16 00:29:14,005 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-16 00:29:14,206 WARN L254 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-16 00:29:14,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:29:34,435 WARN L191 SmtUtils]: Spent 15.59 s on a formula simplification that was a NOOP. DAG size: 28 [2019-11-16 00:30:03,583 WARN L191 SmtUtils]: Spent 24.17 s on a formula simplification that was a NOOP. DAG size: 32 [2019-11-16 00:30:06,030 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967294 32)))))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= c_ULTIMATE.start_main_~evenExp~0 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1))) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32))))) c_ULTIMATE.start_main_~term~0) (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967292 32)) (_ bv0 32)) (= c_ULTIMATE.start_main_~oddExp~0 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0))))) is different from false [2019-11-16 00:30:08,488 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967294 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32))))))) (and (= c_ULTIMATE.start_main_~evenExp~0 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1))) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= c_ULTIMATE.start_main_~term~0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0)))) (= c_ULTIMATE.start_main_~oddExp~0 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse2))) (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967292 32)) (_ bv0 32))))) is different from false [2019-11-16 00:30:10,935 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967294 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32))))))) (and (= c_ULTIMATE.start_main_~evenExp~0 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1))) (= (bvadd |c_ULTIMATE.start_main_#t~ite2| (_ bv1 32)) (_ bv0 32)) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= c_ULTIMATE.start_main_~term~0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0)))) (= c_ULTIMATE.start_main_~oddExp~0 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse2))) (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967292 32)) (_ bv0 32))))) is different from false [2019-11-16 00:30:13,066 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967294 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32))))))) (and (= c_ULTIMATE.start_main_~evenExp~0 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1))) (= (bvadd |c_ULTIMATE.start_main_#t~ite2| (_ bv1 32)) (_ bv0 32)) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= c_ULTIMATE.start_main_~term~0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0)))) (= c_ULTIMATE.start_main_~oddExp~0 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse2))) (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967292 32)) (_ bv0 32))))) is different from true [2019-11-16 00:30:15,592 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32))))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= c_ULTIMATE.start_main_~evenExp~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2))) (= (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32))))) c_ULTIMATE.start_main_~term~0) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) c_ULTIMATE.start_main_~oddExp~0) (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967290 32)) (_ bv0 32)))))) is different from false [2019-11-16 00:30:18,168 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32))))))) (and (= c_ULTIMATE.start_main_~evenExp~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2))) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))) c_ULTIMATE.start_main_~term~0) (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967290 32)) (_ bv0 32)) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) c_ULTIMATE.start_main_~oddExp~0)))))) is different from false [2019-11-16 00:30:20,724 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32))))))) (and (= c_ULTIMATE.start_main_~evenExp~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2))) (= (bvadd |c_ULTIMATE.start_main_#t~ite2| (_ bv1 32)) (_ bv0 32)) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))) c_ULTIMATE.start_main_~term~0) (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967290 32)) (_ bv0 32)) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) c_ULTIMATE.start_main_~oddExp~0)))))) is different from false [2019-11-16 00:30:22,975 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32))))))) (and (= c_ULTIMATE.start_main_~evenExp~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2))) (= (bvadd |c_ULTIMATE.start_main_#t~ite2| (_ bv1 32)) (_ bv0 32)) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))) c_ULTIMATE.start_main_~term~0) (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967290 32)) (_ bv0 32)) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) c_ULTIMATE.start_main_~oddExp~0)))))) is different from true [2019-11-16 00:30:25,731 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse4 (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv6 32)))))) (and (fp.lt ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (= c_ULTIMATE.start_main_~oddExp~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32))))))) (fp.gt ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= c_ULTIMATE.start_main_~evenExp~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 .cse3)))))))))) is different from false [2019-11-16 00:30:28,399 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse4 (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv6 32)))))) (and (fp.lt ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (= c_ULTIMATE.start_main_~oddExp~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32))))))) (fp.gt ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= c_ULTIMATE.start_main_~evenExp~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 .cse3)))))))))) is different from true [2019-11-16 00:30:28,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:30:42,831 WARN L838 $PredicateComparison]: unable to prove that (or (and (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (and (fp.lt ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (not (let ((.cse1 (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv6 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32))))))))))))))) (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32))) (and (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (and (fp.lt ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (let ((.cse7 (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse10 (fp.mul roundNearestTiesToEven .cse7 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse8 (fp.mul roundNearestTiesToEven .cse10 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse11 (fp.mul roundNearestTiesToEven .cse8 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (let ((.cse6 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse9 (fp.mul roundNearestTiesToEven .cse11 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv6 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse6 .cse7)) (fp.mul roundNearestTiesToEven .cse6 .cse8)) (fp.mul roundNearestTiesToEven .cse6 .cse9)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse6 .cse10)) (fp.mul roundNearestTiesToEven .cse6 .cse11)) (fp.mul roundNearestTiesToEven .cse6 (fp.mul roundNearestTiesToEven .cse9 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32)))))))))))))) (= (bvadd c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)))) is different from false [2019-11-16 00:30:51,078 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (and (fp.lt ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (not (let ((.cse1 (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv6 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32))))))))))))))) is different from false [2019-11-16 00:30:53,745 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (and (fp.lt ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (not (let ((.cse1 (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv6 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32))))))))))))))) is different from true [2019-11-16 00:30:53,752 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2019-11-16 00:30:53,752 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:30:58,364 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_ULTIMATE.start_main_#t~ite2|))) (fp.geq (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))) is different from false [2019-11-16 00:31:00,478 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_ULTIMATE.start_main_#t~ite2|))) (fp.geq (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))) is different from true [2019-11-16 00:31:02,572 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (fp.geq (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))) is different from false [2019-11-16 00:31:04,667 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (fp.geq (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))) is different from true [2019-11-16 00:31:06,831 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))))) (fp.geq (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))) is different from false [2019-11-16 00:31:08,995 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))))) (fp.geq (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))) is different from true [2019-11-16 00:31:11,280 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_ULTIMATE.start_main_#t~ite2|)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32)))))))))) is different from false [2019-11-16 00:31:13,550 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_ULTIMATE.start_main_#t~ite2|)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32)))))))))) is different from true [2019-11-16 00:31:15,801 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32)))))))))) is different from false [2019-11-16 00:31:18,058 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32)))))))))) is different from true [2019-11-16 00:31:20,384 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32))))))))))) is different from false [2019-11-16 00:31:22,710 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32))))))))))) is different from true [2019-11-16 00:31:25,155 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_ULTIMATE.start_main_#t~ite2|)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.mul roundNearestTiesToEven .cse1 .cse3)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse1 .cse5)) (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv5 32)))))))))))) is different from false [2019-11-16 00:31:27,584 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse4 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_ULTIMATE.start_main_#t~ite2|)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.mul roundNearestTiesToEven .cse1 .cse3)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse1 .cse5)) (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv5 32)))))))))))) is different from true [2019-11-16 00:31:29,997 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv5 32)))))))))))) is different from false [2019-11-16 00:31:32,411 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv5 32)))))))))))) is different from true [2019-11-16 00:31:34,890 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv5 32))))))))))))) is different from false [2019-11-16 00:31:37,371 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv5 32))))))))))))) is different from true [2019-11-16 00:31:41,595 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~term~0_42 (_ FloatingPoint 8 24))) (or (not (fp.gt v_ULTIMATE.start_main_~term~0_42 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))) (let ((.cse1 (fp.mul roundNearestTiesToEven v_ULTIMATE.start_main_~term~0_42 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~term~0_42 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~term~0_42 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~term~0_42 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~term~0_42 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~term~0_42 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv6 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven v_ULTIMATE.start_main_~term~0_42 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~term~0_42 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32)))))))))))) (not (fp.lt v_ULTIMATE.start_main_~term~0_42 (fp.div roundNearestTiesToEven c_~pi~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32))))))) is different from true [2019-11-16 00:31:41,600 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2019-11-16 00:31:41,601 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [47196825] [2019-11-16 00:31:41,601 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:31:41,602 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 26 [2019-11-16 00:31:41,602 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585012186] [2019-11-16 00:31:41,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-16 00:31:41,603 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:31:41,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-16 00:31:41,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=44, Unknown=33, NotChecked=570, Total=702 [2019-11-16 00:31:41,604 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 27 states. [2019-11-16 00:31:44,305 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~term~0_42 (_ FloatingPoint 8 24))) (or (not (fp.gt v_ULTIMATE.start_main_~term~0_42 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))) (let ((.cse1 (fp.mul roundNearestTiesToEven v_ULTIMATE.start_main_~term~0_42 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~term~0_42 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~term~0_42 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~term~0_42 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~term~0_42 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~term~0_42 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv6 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven v_ULTIMATE.start_main_~term~0_42 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~term~0_42 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32)))))))))))) (not (fp.lt v_ULTIMATE.start_main_~term~0_42 (fp.div roundNearestTiesToEven c_~pi~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32))))))) (= c_~pi~0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))))) is different from false [2019-11-16 00:31:47,050 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~term~0_42 (_ FloatingPoint 8 24))) (or (not (fp.gt v_ULTIMATE.start_main_~term~0_42 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))) (let ((.cse1 (fp.mul roundNearestTiesToEven v_ULTIMATE.start_main_~term~0_42 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~term~0_42 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~term~0_42 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~term~0_42 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~term~0_42 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~term~0_42 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv6 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven v_ULTIMATE.start_main_~term~0_42 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~term~0_42 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32)))))))))))) (not (fp.lt v_ULTIMATE.start_main_~term~0_42 (fp.div roundNearestTiesToEven c_~pi~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32))))))) (= c_~pi~0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))))) is different from true [2019-11-16 00:31:49,796 WARN L838 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~term~0) (= (_ bv2 32) c_ULTIMATE.start_main_~count~0) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (= c_ULTIMATE.start_main_~evenExp~0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv5 32))))))))))))) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~oddExp~0)) is different from false [2019-11-16 00:31:52,267 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~term~0) (= (_ bv2 32) c_ULTIMATE.start_main_~count~0) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (= c_ULTIMATE.start_main_~evenExp~0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv5 32))))))))))))) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~oddExp~0)) is different from true [2019-11-16 00:31:55,012 WARN L838 $PredicateComparison]: unable to prove that (and (let ((.cse3 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv5 32)))))))))))) (= (_ bv2 32) c_ULTIMATE.start_main_~count~0) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (= c_ULTIMATE.start_main_~evenExp~0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~oddExp~0) (= (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))) c_ULTIMATE.start_main_~term~0)) is different from false [2019-11-16 00:31:57,433 WARN L860 $PredicateComparison]: unable to prove that (and (let ((.cse3 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv5 32)))))))))))) (= (_ bv2 32) c_ULTIMATE.start_main_~count~0) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (= c_ULTIMATE.start_main_~evenExp~0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~oddExp~0) (= (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))) c_ULTIMATE.start_main_~term~0)) is different from true [2019-11-16 00:32:00,185 WARN L838 $PredicateComparison]: unable to prove that (and (= (bvadd |c_ULTIMATE.start_main_#t~ite2| (_ bv1 32)) (_ bv0 32)) (let ((.cse4 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_ULTIMATE.start_main_#t~ite2|)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.mul roundNearestTiesToEven .cse1 .cse3)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse1 .cse5)) (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv5 32)))))))))))) (= (_ bv2 32) c_ULTIMATE.start_main_~count~0) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (= c_ULTIMATE.start_main_~evenExp~0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~oddExp~0) (= (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))) c_ULTIMATE.start_main_~term~0)) is different from false [2019-11-16 00:32:02,622 WARN L860 $PredicateComparison]: unable to prove that (and (= (bvadd |c_ULTIMATE.start_main_#t~ite2| (_ bv1 32)) (_ bv0 32)) (let ((.cse4 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_ULTIMATE.start_main_#t~ite2|)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.mul roundNearestTiesToEven .cse1 .cse3)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse1 .cse5)) (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv5 32)))))))))))) (= (_ bv2 32) c_ULTIMATE.start_main_~count~0) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (= c_ULTIMATE.start_main_~evenExp~0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= c_ULTIMATE.start_main_~x~0 c_ULTIMATE.start_main_~oddExp~0) (= (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))) c_ULTIMATE.start_main_~term~0)) is different from true [2019-11-16 00:32:05,353 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967294 32)))))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= c_ULTIMATE.start_main_~evenExp~0 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1))) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (let ((.cse2 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32))))))))))) (= (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32))))) c_ULTIMATE.start_main_~term~0) (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967292 32)) (_ bv0 32)) (= c_ULTIMATE.start_main_~oddExp~0 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0))))) is different from false [2019-11-16 00:32:07,687 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967294 32)))))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= c_ULTIMATE.start_main_~evenExp~0 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1))) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (let ((.cse2 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32))))))))))) (= (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32))))) c_ULTIMATE.start_main_~term~0) (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967292 32)) (_ bv0 32)) (= c_ULTIMATE.start_main_~oddExp~0 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0))))) is different from true [2019-11-16 00:32:10,412 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967294 32))))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32)))))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= c_ULTIMATE.start_main_~evenExp~0 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1))) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= c_ULTIMATE.start_main_~term~0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0)))) (= c_ULTIMATE.start_main_~oddExp~0 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse2))) (let ((.cse4 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32)))))))))) (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967292 32)) (_ bv0 32))))) is different from false [2019-11-16 00:32:13,243 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967294 32))))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32)))))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= c_ULTIMATE.start_main_~evenExp~0 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1))) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= c_ULTIMATE.start_main_~term~0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0)))) (= c_ULTIMATE.start_main_~oddExp~0 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse2))) (let ((.cse4 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32)))))))))) (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967292 32)) (_ bv0 32))))) is different from true [2019-11-16 00:32:15,966 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967294 32))))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32)))))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= c_ULTIMATE.start_main_~evenExp~0 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1))) (= (bvadd |c_ULTIMATE.start_main_#t~ite2| (_ bv1 32)) (_ bv0 32)) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= c_ULTIMATE.start_main_~term~0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0)))) (= c_ULTIMATE.start_main_~oddExp~0 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse2))) (let ((.cse5 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven |c_ULTIMATE.start_main_#t~ite2|)) (.cse4 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse3 c_ULTIMATE.start_main_~term~0)) (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse3 .cse5)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32)))))))))) (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967292 32)) (_ bv0 32))))) is different from false [2019-11-16 00:32:18,251 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967294 32))))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32)))))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= c_ULTIMATE.start_main_~evenExp~0 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1))) (= (bvadd |c_ULTIMATE.start_main_#t~ite2| (_ bv1 32)) (_ bv0 32)) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= c_ULTIMATE.start_main_~term~0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0)))) (= c_ULTIMATE.start_main_~oddExp~0 (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse2))) (let ((.cse5 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven |c_ULTIMATE.start_main_#t~ite2|)) (.cse4 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse3 c_ULTIMATE.start_main_~term~0)) (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse3 .cse5)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32)))))))))) (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967292 32)) (_ bv0 32))))) is different from true [2019-11-16 00:32:20,999 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32))))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= c_ULTIMATE.start_main_~evenExp~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2))) (= (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32))))) c_ULTIMATE.start_main_~term~0) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) c_ULTIMATE.start_main_~oddExp~0) (let ((.cse4 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))))) (fp.geq (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))) (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967290 32)) (_ bv0 32)))))) is different from false [2019-11-16 00:32:23,319 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32))))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= c_ULTIMATE.start_main_~evenExp~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2))) (= (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32))))) c_ULTIMATE.start_main_~term~0) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) c_ULTIMATE.start_main_~oddExp~0) (let ((.cse4 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))))) (fp.geq (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))) (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967290 32)) (_ bv0 32)))))) is different from true [2019-11-16 00:32:26,100 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32))))))) (and (= c_ULTIMATE.start_main_~evenExp~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2))) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))) c_ULTIMATE.start_main_~term~0) (fp.geq (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32)))))))) (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967290 32)) (_ bv0 32)) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) c_ULTIMATE.start_main_~oddExp~0)))))) is different from false [2019-11-16 00:32:28,206 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32))))))) (and (= c_ULTIMATE.start_main_~evenExp~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2))) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))) c_ULTIMATE.start_main_~term~0) (fp.geq (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_main_~term~0)) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32)))))))) (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967290 32)) (_ bv0 32)) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) c_ULTIMATE.start_main_~oddExp~0)))))) is different from true [2019-11-16 00:32:30,991 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse4 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32))))))) (and (= c_ULTIMATE.start_main_~evenExp~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2))) (= (bvadd |c_ULTIMATE.start_main_#t~ite2| (_ bv1 32)) (_ bv0 32)) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven |c_ULTIMATE.start_main_#t~ite2|))) (fp.geq (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse3 c_ULTIMATE.start_main_~term~0)) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))) (= (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))) c_ULTIMATE.start_main_~term~0) (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967290 32)) (_ bv0 32)) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 .cse4)) c_ULTIMATE.start_main_~oddExp~0)))))) is different from false [2019-11-16 00:32:33,120 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse4 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32))))))) (and (= c_ULTIMATE.start_main_~evenExp~0 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2))) (= (bvadd |c_ULTIMATE.start_main_#t~ite2| (_ bv1 32)) (_ bv0 32)) (fp.lt c_ULTIMATE.start_main_~x~0 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))) (fp.gt c_ULTIMATE.start_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven |c_ULTIMATE.start_main_#t~ite2|))) (fp.geq (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse3 c_ULTIMATE.start_main_~term~0)) (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_main_~term~0 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))))) (= (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_ULTIMATE.start_main_~count~0))) c_ULTIMATE.start_main_~term~0) (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967290 32)) (_ bv0 32)) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_ULTIMATE.start_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 .cse4)) c_ULTIMATE.start_main_~oddExp~0)))))) is different from true [2019-11-16 00:32:33,963 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-11-16 00:32:33,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-16 00:32:34,164 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-16 00:32:34,165 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:153) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:140) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:829) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:388) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:668) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:597) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:454) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1461) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:654) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 44 more [2019-11-16 00:32:34,170 INFO L168 Benchmark]: Toolchain (without parser) took 668077.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 951.0 MB in the beginning and 911.7 MB in the end (delta: 39.3 MB). Peak memory consumption was 191.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:32:34,171 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 977.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:32:34,173 INFO L168 Benchmark]: CACSL2BoogieTranslator took 307.44 ms. Allocated memory is still 1.0 GB. Free memory was 951.0 MB in the beginning and 940.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:32:34,174 INFO L168 Benchmark]: Boogie Procedure Inliner took 103.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -208.3 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2019-11-16 00:32:34,175 INFO L168 Benchmark]: Boogie Preprocessor took 25.77 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:32:34,176 INFO L168 Benchmark]: RCFGBuilder took 3735.60 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: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:32:34,176 INFO L168 Benchmark]: TraceAbstraction took 663897.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 911.7 MB in the end (delta: 210.5 MB). Peak memory consumption was 210.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:32:34,180 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 977.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 307.44 ms. Allocated memory is still 1.0 GB. Free memory was 951.0 MB in the beginning and 940.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 103.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -208.3 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.77 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3735.60 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: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 663897.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 911.7 MB in the end (delta: 210.5 MB). Peak memory consumption was 210.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...