./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/loop-floats-scientific-comp/loop3_true-unreach-call.c.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_875594ac-f0f9-4298-8c91-3837b66d18b4/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_875594ac-f0f9-4298-8c91-3837b66d18b4/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_875594ac-f0f9-4298-8c91-3837b66d18b4/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_875594ac-f0f9-4298-8c91-3837b66d18b4/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-floats-scientific-comp/loop3_true-unreach-call.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_875594ac-f0f9-4298-8c91-3837b66d18b4/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_875594ac-f0f9-4298-8c91-3837b66d18b4/bin-2019/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 0fd0e678ea36c7b474907750a18ff4e57877f684 .......................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_875594ac-f0f9-4298-8c91-3837b66d18b4/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_875594ac-f0f9-4298-8c91-3837b66d18b4/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_875594ac-f0f9-4298-8c91-3837b66d18b4/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_875594ac-f0f9-4298-8c91-3837b66d18b4/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-floats-scientific-comp/loop3_true-unreach-call.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_875594ac-f0f9-4298-8c91-3837b66d18b4/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_875594ac-f0f9-4298-8c91-3837b66d18b4/bin-2019/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 0fd0e678ea36c7b474907750a18ff4e57877f684 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.23-5842f4b [2018-11-18 16:55:41,396 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 16:55:41,397 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 16:55:41,404 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 16:55:41,404 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 16:55:41,405 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 16:55:41,406 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 16:55:41,407 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 16:55:41,408 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 16:55:41,408 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 16:55:41,409 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 16:55:41,409 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 16:55:41,410 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 16:55:41,410 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 16:55:41,411 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 16:55:41,412 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 16:55:41,413 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 16:55:41,414 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 16:55:41,415 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 16:55:41,416 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 16:55:41,417 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 16:55:41,417 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 16:55:41,419 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 16:55:41,419 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 16:55:41,419 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 16:55:41,420 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 16:55:41,421 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 16:55:41,421 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 16:55:41,422 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 16:55:41,422 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 16:55:41,423 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 16:55:41,423 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 16:55:41,423 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 16:55:41,423 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 16:55:41,424 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 16:55:41,424 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 16:55:41,425 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_875594ac-f0f9-4298-8c91-3837b66d18b4/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-18 16:55:41,435 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 16:55:41,435 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 16:55:41,435 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 16:55:41,435 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 16:55:41,436 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 16:55:41,436 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 16:55:41,436 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 16:55:41,436 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 16:55:41,436 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 16:55:41,436 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 16:55:41,437 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 16:55:41,437 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 16:55:41,437 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 16:55:41,437 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 16:55:41,437 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 16:55:41,437 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 16:55:41,437 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 16:55:41,437 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 16:55:41,437 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 16:55:41,437 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 16:55:41,437 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 16:55:41,437 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 16:55:41,438 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 16:55:41,438 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 16:55:41,438 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 16:55:41,438 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 16:55:41,438 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 16:55:41,438 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 16:55:41,438 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 16:55:41,438 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 16:55:41,438 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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/working_dir_875594ac-f0f9-4298-8c91-3837b66d18b4/bin-2019/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 -> 0fd0e678ea36c7b474907750a18ff4e57877f684 [2018-11-18 16:55:41,462 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 16:55:41,471 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 16:55:41,473 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 16:55:41,474 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 16:55:41,475 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 16:55:41,475 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_875594ac-f0f9-4298-8c91-3837b66d18b4/bin-2019/uautomizer/../../sv-benchmarks/c/loop-floats-scientific-comp/loop3_true-unreach-call.c.i [2018-11-18 16:55:41,519 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_875594ac-f0f9-4298-8c91-3837b66d18b4/bin-2019/uautomizer/data/eb959cb03/cd5060439c7e482da2d8e40517177be7/FLAG603be1b44 [2018-11-18 16:55:41,907 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 16:55:41,907 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_875594ac-f0f9-4298-8c91-3837b66d18b4/sv-benchmarks/c/loop-floats-scientific-comp/loop3_true-unreach-call.c.i [2018-11-18 16:55:41,911 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_875594ac-f0f9-4298-8c91-3837b66d18b4/bin-2019/uautomizer/data/eb959cb03/cd5060439c7e482da2d8e40517177be7/FLAG603be1b44 [2018-11-18 16:55:41,921 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_875594ac-f0f9-4298-8c91-3837b66d18b4/bin-2019/uautomizer/data/eb959cb03/cd5060439c7e482da2d8e40517177be7 [2018-11-18 16:55:41,923 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 16:55:41,924 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-18 16:55:41,925 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 16:55:41,925 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 16:55:41,928 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 16:55:41,929 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:55:41" (1/1) ... [2018-11-18 16:55:41,931 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8be4c51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:55:41, skipping insertion in model container [2018-11-18 16:55:41,931 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:55:41" (1/1) ... [2018-11-18 16:55:41,938 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 16:55:41,951 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 16:55:42,053 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:55:42,055 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 16:55:42,066 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:55:42,074 INFO L195 MainTranslator]: Completed translation [2018-11-18 16:55:42,074 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:55:42 WrapperNode [2018-11-18 16:55:42,074 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 16:55:42,074 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 16:55:42,075 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 16:55:42,075 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 16:55:42,083 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:55:42" (1/1) ... [2018-11-18 16:55:42,083 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:55:42" (1/1) ... [2018-11-18 16:55:42,087 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:55:42" (1/1) ... [2018-11-18 16:55:42,087 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:55:42" (1/1) ... [2018-11-18 16:55:42,092 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:55:42" (1/1) ... [2018-11-18 16:55:42,096 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:55:42" (1/1) ... [2018-11-18 16:55:42,097 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:55:42" (1/1) ... [2018-11-18 16:55:42,098 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 16:55:42,098 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 16:55:42,098 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 16:55:42,099 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 16:55:42,099 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:55:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_875594ac-f0f9-4298-8c91-3837b66d18b4/bin-2019/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 [2018-11-18 16:55:42,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 16:55:42,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 16:55:42,179 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 16:55:42,179 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 16:55:42,179 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 16:55:42,179 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-18 16:55:42,179 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 16:55:42,179 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_float [2018-11-18 16:55:42,179 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 16:55:42,179 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 16:55:42,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 16:55:42,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 16:55:42,315 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 16:55:42,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:55:42 BoogieIcfgContainer [2018-11-18 16:55:42,316 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 16:55:42,317 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 16:55:42,317 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 16:55:42,319 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 16:55:42,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 04:55:41" (1/3) ... [2018-11-18 16:55:42,320 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@af4f1dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 04:55:42, skipping insertion in model container [2018-11-18 16:55:42,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:55:42" (2/3) ... [2018-11-18 16:55:42,321 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@af4f1dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 04:55:42, skipping insertion in model container [2018-11-18 16:55:42,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:55:42" (3/3) ... [2018-11-18 16:55:42,322 INFO L112 eAbstractionObserver]: Analyzing ICFG loop3_true-unreach-call.c.i [2018-11-18 16:55:42,330 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 16:55:42,336 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 16:55:42,349 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 16:55:42,375 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 16:55:42,376 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 16:55:42,376 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 16:55:42,376 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 16:55:42,376 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 16:55:42,377 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 16:55:42,377 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 16:55:42,377 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 16:55:42,377 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 16:55:42,391 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-11-18 16:55:42,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-18 16:55:42,396 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:55:42,396 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:55:42,398 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:55:42,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:55:42,403 INFO L82 PathProgramCache]: Analyzing trace with hash 857481337, now seen corresponding path program 1 times [2018-11-18 16:55:42,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:55:42,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:55:42,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:42,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:55:42,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:42,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:55:42,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:55:42,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:55:42,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 16:55:42,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 16:55:42,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 16:55:42,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 16:55:42,507 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 2 states. [2018-11-18 16:55:42,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:55:42,521 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2018-11-18 16:55:42,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 16:55:42,522 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-18 16:55:42,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:55:42,527 INFO L225 Difference]: With dead ends: 35 [2018-11-18 16:55:42,527 INFO L226 Difference]: Without dead ends: 16 [2018-11-18 16:55:42,529 INFO L604 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 [2018-11-18 16:55:42,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-18 16:55:42,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-18 16:55:42,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-18 16:55:42,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-11-18 16:55:42,551 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2018-11-18 16:55:42,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:55:42,551 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2018-11-18 16:55:42,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 16:55:42,551 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-11-18 16:55:42,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-18 16:55:42,552 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:55:42,552 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:55:42,552 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:55:42,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:55:42,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1154070091, now seen corresponding path program 1 times [2018-11-18 16:55:42,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:55:42,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:55:42,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:42,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:55:42,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:42,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:55:42,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:55:42,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:55:42,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:55:42,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:55:42,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:55:42,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:55:42,625 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 3 states. [2018-11-18 16:55:42,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:55:42,644 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-11-18 16:55:42,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:55:42,645 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-18 16:55:42,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:55:42,645 INFO L225 Difference]: With dead ends: 30 [2018-11-18 16:55:42,645 INFO L226 Difference]: Without dead ends: 20 [2018-11-18 16:55:42,646 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:55:42,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-18 16:55:42,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2018-11-18 16:55:42,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-18 16:55:42,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-11-18 16:55:42,649 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 15 [2018-11-18 16:55:42,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:55:42,649 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-11-18 16:55:42,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:55:42,649 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-18 16:55:42,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-18 16:55:42,649 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:55:42,650 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:55:42,650 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:55:42,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:55:42,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1365889843, now seen corresponding path program 1 times [2018-11-18 16:55:42,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 16:55:42,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 16:55:42,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:42,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:55:42,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 16:55:42,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:55:42,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 16:55:42,680 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-11-18 16:55:42,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 04:55:42 BoogieIcfgContainer [2018-11-18 16:55:42,694 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 16:55:42,694 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 16:55:42,695 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 16:55:42,695 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 16:55:42,695 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:55:42" (3/4) ... [2018-11-18 16:55:42,697 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 16:55:42,697 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 16:55:42,698 INFO L168 Benchmark]: Toolchain (without parser) took 773.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.2 MB). Free memory was 962.4 MB in the beginning and 1.1 GB in the end (delta: -144.7 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-18 16:55:42,699 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 16:55:42,699 INFO L168 Benchmark]: CACSL2BoogieTranslator took 149.14 ms. Allocated memory is still 1.0 GB. Free memory was 962.4 MB in the beginning and 951.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-18 16:55:42,699 INFO L168 Benchmark]: Boogie Preprocessor took 23.71 ms. Allocated memory is still 1.0 GB. Free memory was 951.6 MB in the beginning and 946.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-18 16:55:42,700 INFO L168 Benchmark]: RCFGBuilder took 217.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.2 MB). Free memory was 946.2 MB in the beginning and 1.1 GB in the end (delta: -200.6 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-18 16:55:42,700 INFO L168 Benchmark]: TraceAbstraction took 377.61 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: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. [2018-11-18 16:55:42,701 INFO L168 Benchmark]: Witness Printer took 2.81 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2018-11-18 16:55:42,703 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 149.14 ms. Allocated memory is still 1.0 GB. Free memory was 962.4 MB in the beginning and 951.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.71 ms. Allocated memory is still 1.0 GB. Free memory was 951.6 MB in the beginning and 946.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 217.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.2 MB). Free memory was 946.2 MB in the beginning and 1.1 GB in the end (delta: -200.6 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 377.61 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: 33.1 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. * Witness Printer took 2.81 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 3]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 14, overapproximation of to_real at line 12, overapproximation of someBinaryArithmeticFLOAToperation at line 27. Possible FailurePath: [L5] float pi = 3.14159 ; VAL [\old(pi)=2, pi=314159/100000] [L11] float x = __VERIFIER_nondet_float() ; [L12] float octant1 = 0 ; [L13] float octant2 = pi/8 ; [L15] float oddExp = x ; [L16] float evenExp = 1.0 ; [L17] float term = x ; [L18] unsigned int count = 2 ; [L19] int multFactor = 0 ; [L20] int temp ; VAL [count=2, evenExp=1, multFactor=0, oddExp=3, pi=314159/100000, term=3, x=3] [L22] COND TRUE 1 [L24] term = term * (x/count) VAL [count=2, evenExp=1, multFactor=0, oddExp=3, pi=314159/100000, x=3] [L25] COND FALSE, EXPR !((count>>1 % 2 == 0) ? 1 : -1) VAL [(count>>1 % 2 == 0) ? 1 : -1=-1, count=2, evenExp=1, multFactor=0, oddExp=3, pi=314159/100000, x=3] [L25] multFactor = (count>>1 % 2 == 0) ? 1 : -1 [L27] evenExp = evenExp + multFactor*term [L29] count++ [L31] term = term * (x/count) [L33] oddExp = oddExp + multFactor*term [L35] count++ [L37] temp = __VERIFIER_nondet_int() [L38] COND TRUE temp == 0 VAL [count=4, multFactor=-1, pi=314159/100000, temp=0, x=3] [L41] CALL __VERIFIER_assert( evenExp >= oddExp ) VAL [\old(cond)=0, pi=314159/100000] [L3] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, pi=314159/100000] [L3] __VERIFIER_error() VAL [\old(cond)=0, cond=0, pi=314159/100000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 23 locations, 1 error locations. UNSAFE Result, 0.3s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 39 SDtfs, 1 SDslu, 13 SDs, 0 SdLazy, 5 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 41 NumberOfCodeBlocks, 41 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 24 ConstructedInterpolants, 0 QuantifiedInterpolants, 716 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: 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.23-5842f4b [2018-11-18 16:55:44,110 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 16:55:44,111 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 16:55:44,118 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 16:55:44,118 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 16:55:44,118 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 16:55:44,119 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 16:55:44,120 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 16:55:44,120 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 16:55:44,121 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 16:55:44,121 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 16:55:44,122 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 16:55:44,122 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 16:55:44,123 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 16:55:44,123 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 16:55:44,124 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 16:55:44,125 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 16:55:44,126 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 16:55:44,127 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 16:55:44,128 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 16:55:44,128 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 16:55:44,129 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 16:55:44,131 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 16:55:44,131 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 16:55:44,131 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 16:55:44,132 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 16:55:44,132 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 16:55:44,132 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 16:55:44,133 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 16:55:44,134 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 16:55:44,134 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 16:55:44,134 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 16:55:44,134 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 16:55:44,135 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 16:55:44,135 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 16:55:44,136 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 16:55:44,136 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_875594ac-f0f9-4298-8c91-3837b66d18b4/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-18 16:55:44,145 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 16:55:44,145 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 16:55:44,146 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 16:55:44,146 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 16:55:44,146 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 16:55:44,146 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 16:55:44,146 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 16:55:44,147 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 16:55:44,147 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 16:55:44,147 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 16:55:44,147 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 16:55:44,147 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 16:55:44,147 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 16:55:44,147 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 16:55:44,148 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 16:55:44,148 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 16:55:44,148 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 16:55:44,148 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 16:55:44,148 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 16:55:44,148 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 16:55:44,148 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 16:55:44,148 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 16:55:44,149 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 16:55:44,149 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 16:55:44,149 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 16:55:44,149 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 16:55:44,149 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 16:55:44,149 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 16:55:44,149 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-18 16:55:44,150 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 16:55:44,150 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 16:55:44,150 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-18 16:55:44,150 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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/working_dir_875594ac-f0f9-4298-8c91-3837b66d18b4/bin-2019/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 -> 0fd0e678ea36c7b474907750a18ff4e57877f684 [2018-11-18 16:55:44,179 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 16:55:44,187 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 16:55:44,190 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 16:55:44,191 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 16:55:44,191 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 16:55:44,192 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_875594ac-f0f9-4298-8c91-3837b66d18b4/bin-2019/uautomizer/../../sv-benchmarks/c/loop-floats-scientific-comp/loop3_true-unreach-call.c.i [2018-11-18 16:55:44,239 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_875594ac-f0f9-4298-8c91-3837b66d18b4/bin-2019/uautomizer/data/24aa5a1ed/2329669d283a4fbb8ad599a65e3af302/FLAG3bb934ddd [2018-11-18 16:55:44,545 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 16:55:44,545 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_875594ac-f0f9-4298-8c91-3837b66d18b4/sv-benchmarks/c/loop-floats-scientific-comp/loop3_true-unreach-call.c.i [2018-11-18 16:55:44,549 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_875594ac-f0f9-4298-8c91-3837b66d18b4/bin-2019/uautomizer/data/24aa5a1ed/2329669d283a4fbb8ad599a65e3af302/FLAG3bb934ddd [2018-11-18 16:55:44,557 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_875594ac-f0f9-4298-8c91-3837b66d18b4/bin-2019/uautomizer/data/24aa5a1ed/2329669d283a4fbb8ad599a65e3af302 [2018-11-18 16:55:44,559 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 16:55:44,560 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-18 16:55:44,560 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 16:55:44,560 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 16:55:44,563 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 16:55:44,564 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:55:44" (1/1) ... [2018-11-18 16:55:44,566 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e366777 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:55:44, skipping insertion in model container [2018-11-18 16:55:44,566 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 04:55:44" (1/1) ... [2018-11-18 16:55:44,571 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 16:55:44,585 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 16:55:44,705 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:55:44,709 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 16:55:44,726 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 16:55:44,738 INFO L195 MainTranslator]: Completed translation [2018-11-18 16:55:44,738 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:55:44 WrapperNode [2018-11-18 16:55:44,738 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 16:55:44,739 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 16:55:44,739 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 16:55:44,739 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 16:55:44,750 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:55:44" (1/1) ... [2018-11-18 16:55:44,750 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:55:44" (1/1) ... [2018-11-18 16:55:44,754 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:55:44" (1/1) ... [2018-11-18 16:55:44,754 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:55:44" (1/1) ... [2018-11-18 16:55:44,759 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:55:44" (1/1) ... [2018-11-18 16:55:44,761 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:55:44" (1/1) ... [2018-11-18 16:55:44,762 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:55:44" (1/1) ... [2018-11-18 16:55:44,764 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 16:55:44,764 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 16:55:44,764 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 16:55:44,764 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 16:55:44,765 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:55:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_875594ac-f0f9-4298-8c91-3837b66d18b4/bin-2019/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 [2018-11-18 16:55:44,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 16:55:44,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 16:55:44,836 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 16:55:44,836 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 16:55:44,836 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 16:55:44,836 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-18 16:55:44,836 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 16:55:44,836 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_float [2018-11-18 16:55:44,836 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 16:55:44,836 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 16:55:44,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 16:55:44,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 16:55:48,188 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 16:55:48,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:55:48 BoogieIcfgContainer [2018-11-18 16:55:48,189 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 16:55:48,190 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 16:55:48,190 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 16:55:48,193 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 16:55:48,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 04:55:44" (1/3) ... [2018-11-18 16:55:48,193 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e12a2aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 04:55:48, skipping insertion in model container [2018-11-18 16:55:48,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 04:55:44" (2/3) ... [2018-11-18 16:55:48,194 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e12a2aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 04:55:48, skipping insertion in model container [2018-11-18 16:55:48,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 04:55:48" (3/3) ... [2018-11-18 16:55:48,195 INFO L112 eAbstractionObserver]: Analyzing ICFG loop3_true-unreach-call.c.i [2018-11-18 16:55:48,201 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 16:55:48,206 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 16:55:48,214 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 16:55:48,237 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 16:55:48,237 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 16:55:48,238 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 16:55:48,238 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 16:55:48,238 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 16:55:48,238 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 16:55:48,238 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 16:55:48,238 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 16:55:48,238 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 16:55:48,247 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-11-18 16:55:48,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-18 16:55:48,250 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:55:48,251 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:55:48,252 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:55:48,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:55:48,255 INFO L82 PathProgramCache]: Analyzing trace with hash 857481337, now seen corresponding path program 1 times [2018-11-18 16:55:48,257 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 16:55:48,257 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_875594ac-f0f9-4298-8c91-3837b66d18b4/bin-2019/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 [2018-11-18 16:55:48,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:55:48,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:55:48,305 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:55:48,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:55:48,314 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 16:55:48,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:55:48,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 16:55:48,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 16:55:48,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 16:55:48,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 16:55:48,334 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 2 states. [2018-11-18 16:55:48,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:55:48,348 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2018-11-18 16:55:48,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 16:55:48,349 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2018-11-18 16:55:48,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:55:48,354 INFO L225 Difference]: With dead ends: 35 [2018-11-18 16:55:48,354 INFO L226 Difference]: Without dead ends: 16 [2018-11-18 16:55:48,356 INFO L604 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 [2018-11-18 16:55:48,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-18 16:55:48,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-18 16:55:48,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-18 16:55:48,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2018-11-18 16:55:48,377 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2018-11-18 16:55:48,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:55:48,378 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2018-11-18 16:55:48,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 16:55:48,378 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-11-18 16:55:48,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-18 16:55:48,378 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:55:48,379 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:55:48,379 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:55:48,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:55:48,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1154070091, now seen corresponding path program 1 times [2018-11-18 16:55:48,380 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 16:55:48,380 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_875594ac-f0f9-4298-8c91-3837b66d18b4/bin-2019/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 [2018-11-18 16:55:48,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:55:48,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:55:49,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:55:49,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:55:49,036 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 16:55:49,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:55:49,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 16:55:49,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 16:55:49,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 16:55:49,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:55:49,050 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 3 states. [2018-11-18 16:55:52,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:55:52,684 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2018-11-18 16:55:52,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 16:55:52,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-18 16:55:52,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:55:52,685 INFO L225 Difference]: With dead ends: 30 [2018-11-18 16:55:52,686 INFO L226 Difference]: Without dead ends: 20 [2018-11-18 16:55:52,686 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 16:55:52,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-18 16:55:52,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2018-11-18 16:55:52,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-18 16:55:52,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-11-18 16:55:52,689 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 15 [2018-11-18 16:55:52,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:55:52,690 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-11-18 16:55:52,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 16:55:52,690 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-18 16:55:52,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-18 16:55:52,690 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:55:52,690 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:55:52,690 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:55:52,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:55:52,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1365889843, now seen corresponding path program 1 times [2018-11-18 16:55:52,691 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 16:55:52,691 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_875594ac-f0f9-4298-8c91-3837b66d18b4/bin-2019/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 [2018-11-18 16:55:52,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:55:54,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:55:54,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:56:12,526 WARN L180 SmtUtils]: Spent 13.86 s on a formula simplification that was a NOOP. DAG size: 29 [2018-11-18 16:56:33,680 WARN L180 SmtUtils]: Spent 15.44 s on a formula simplification that was a NOOP. DAG size: 33 [2018-11-18 16:56:36,012 WARN L832 $PredicateComparison]: unable to prove that (exists ((main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven main_~x~0 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (and (= (fp.add roundNearestTiesToEven main_~x~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) c_main_~oddExp~0) (fp.gt main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt 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_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 [2018-11-18 16:56:38,317 WARN L854 $PredicateComparison]: unable to prove that (exists ((main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven main_~x~0 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (and (= (fp.add roundNearestTiesToEven main_~x~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) c_main_~oddExp~0) (fp.gt main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt 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_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 [2018-11-18 16:56:50,370 WARN L832 $PredicateComparison]: unable to prove that (or (and (exists ((main_~x~0 (_ FloatingPoint 8 24))) (and (not (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven main_~x~0 (fp.div roundNearestTiesToEven 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 main_~x~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))))))) (fp.gt main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt 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___VERIFIER_assert_#in~cond| (_ bv0 32))) (and (= (bvadd |c___VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32)) (exists ((v_prenex_2 (_ FloatingPoint 8 24))) (and (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven v_prenex_2 (fp.div roundNearestTiesToEven v_prenex_2 ((_ 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 v_prenex_2 (fp.mul roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven v_prenex_2 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))))) (fp.lt v_prenex_2 (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 v_prenex_2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))))) is different from false [2018-11-18 16:57:02,210 WARN L832 $PredicateComparison]: unable to prove that (or (and (exists ((v_prenex_2 (_ FloatingPoint 8 24))) (and (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven v_prenex_2 (fp.div roundNearestTiesToEven v_prenex_2 ((_ 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_prenex_2 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_prenex_2 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))))) (fp.lt v_prenex_2 (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 v_prenex_2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))) (= (bvadd c___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))) (and (= (_ bv0 32) c___VERIFIER_assert_~cond) (exists ((main_~x~0 (_ FloatingPoint 8 24))) (and (not (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven main_~x~0 (fp.div roundNearestTiesToEven 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 main_~x~0 (fp.mul roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))))))) (fp.gt main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt 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)))))))) is different from false [2018-11-18 16:57:09,146 WARN L832 $PredicateComparison]: unable to prove that (exists ((main_~x~0 (_ FloatingPoint 8 24))) (and (not (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven main_~x~0 (fp.div roundNearestTiesToEven 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 main_~x~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))))))) (fp.gt main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt 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)))))) is different from false [2018-11-18 16:57:11,421 WARN L854 $PredicateComparison]: unable to prove that (exists ((main_~x~0 (_ FloatingPoint 8 24))) (and (not (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven main_~x~0 (fp.div roundNearestTiesToEven 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 main_~x~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))))))) (fp.gt main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt 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)))))) is different from true [2018-11-18 16:57:11,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:57:11,425 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 16:57:11,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 16:57:11,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-18 16:57:11,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 16:57:11,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 16:57:11,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=22, Unknown=6, NotChecked=44, Total=90 [2018-11-18 16:57:11,446 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 10 states. [2018-11-18 16:57:19,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:57:19,813 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-11-18 16:57:19,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 16:57:19,814 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2018-11-18 16:57:19,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:57:19,815 INFO L225 Difference]: With dead ends: 26 [2018-11-18 16:57:19,815 INFO L226 Difference]: Without dead ends: 21 [2018-11-18 16:57:19,815 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 53.9s TimeCoverageRelationStatistics Valid=22, Invalid=30, Unknown=6, NotChecked=52, Total=110 [2018-11-18 16:57:19,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-18 16:57:19,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-18 16:57:19,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-18 16:57:19,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-18 16:57:19,819 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 15 [2018-11-18 16:57:19,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:57:19,819 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-18 16:57:19,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 16:57:19,819 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-18 16:57:19,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 16:57:19,820 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:57:19,820 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:57:19,820 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:57:19,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:57:19,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1908428422, now seen corresponding path program 1 times [2018-11-18 16:57:19,821 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 16:57:19,821 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_875594ac-f0f9-4298-8c91-3837b66d18b4/bin-2019/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 [2018-11-18 16:57:19,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:57:21,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:57:21,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:57:21,187 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:57:21,187 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:57:21,217 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 16:57:21,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 16:57:21,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-18 16:57:21,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 16:57:21,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 16:57:21,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-18 16:57:21,240 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 6 states. [2018-11-18 16:57:31,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 16:57:31,848 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2018-11-18 16:57:31,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 16:57:31,849 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-18 16:57:31,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 16:57:31,850 INFO L225 Difference]: With dead ends: 41 [2018-11-18 16:57:31,850 INFO L226 Difference]: Without dead ends: 31 [2018-11-18 16:57:31,851 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-18 16:57:31,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-18 16:57:31,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2018-11-18 16:57:31,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-18 16:57:31,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-11-18 16:57:31,856 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 20 [2018-11-18 16:57:31,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 16:57:31,856 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-11-18 16:57:31,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 16:57:31,857 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-11-18 16:57:31,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 16:57:31,857 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 16:57:31,857 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 16:57:31,857 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 16:57:31,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 16:57:31,858 INFO L82 PathProgramCache]: Analyzing trace with hash -611531512, now seen corresponding path program 1 times [2018-11-18 16:57:31,858 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 16:57:31,858 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_875594ac-f0f9-4298-8c91-3837b66d18b4/bin-2019/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 [2018-11-18 16:57:31,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 16:57:55,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 16:57:55,562 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 16:58:16,931 WARN L180 SmtUtils]: Spent 16.56 s on a formula simplification that was a NOOP. DAG size: 29 [2018-11-18 16:58:38,318 WARN L180 SmtUtils]: Spent 15.51 s on a formula simplification that was a NOOP. DAG size: 33 [2018-11-18 16:58:40,693 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32))))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= c_main_~term~0 (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_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_main_~evenExp~0 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse1 .cse0))) (= (bvadd c_main_~count~0 (_ bv4294967292 32)) (_ bv0 32)) (= (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse1 c_main_~term~0)) c_main_~oddExp~0))) is different from false [2018-11-18 16:58:44,578 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) c_main_~oddExp~0) (= c_main_~term~0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0)))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_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_main_~evenExp~0 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse2))) (= (bvadd c_main_~count~0 (_ bv4294967292 32)) (_ bv0 32))))) is different from false [2018-11-18 16:58:46,948 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) c_main_~oddExp~0) (= c_main_~term~0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0)))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_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_main_~evenExp~0 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse2))) (= (bvadd c_main_~count~0 (_ bv4294967292 32)) (_ bv0 32))))) is different from true [2018-11-18 16:58:49,246 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) c_main_~oddExp~0) (= c_main_~term~0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0)))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_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_main_~evenExp~0 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse2))) (= (bvadd |c_main_#t~ite2| (_ bv1 32)) (_ bv0 32)) (= (bvadd c_main_~count~0 (_ bv4294967292 32)) (_ bv0 32))))) is different from false [2018-11-18 16:58:53,780 WARN L832 $PredicateComparison]: unable to prove that (exists ((main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse3 (fp.mul roundNearestTiesToEven main_~x~0 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (and (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) c_main_~oddExp~0) (fp.gt main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt 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_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 .cse3)) (fp.mul roundNearestTiesToEven .cse0 .cse2)))))))) is different from false [2018-11-18 16:58:56,132 WARN L854 $PredicateComparison]: unable to prove that (exists ((main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse3 (fp.mul roundNearestTiesToEven main_~x~0 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (and (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) c_main_~oddExp~0) (fp.gt main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt 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_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 .cse3)) (fp.mul roundNearestTiesToEven .cse0 .cse2)))))))) is different from true [2018-11-18 16:59:08,094 WARN L832 $PredicateComparison]: unable to prove that (or (and (exists ((v_prenex_5 (_ FloatingPoint 8 24))) (and (not (let ((.cse1 (fp.mul roundNearestTiesToEven v_prenex_5 (fp.div roundNearestTiesToEven v_prenex_5 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_prenex_5 ((_ 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_prenex_5 ((_ 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_prenex_5 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven v_prenex_5 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))))))))))) (fp.lt v_prenex_5 (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 v_prenex_5 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))) (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))) (and (= (bvadd |c___VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32)) (exists ((main_~x~0 (_ FloatingPoint 8 24))) (and (fp.gt main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt 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)))) (let ((.cse5 (fp.mul roundNearestTiesToEven main_~x~0 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse7 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven 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 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 main_~x~0 (fp.mul roundNearestTiesToEven .cse4 .cse7)) (fp.mul roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))))))))))) is different from false [2018-11-18 16:59:20,029 WARN L832 $PredicateComparison]: unable to prove that (or (and (= (_ bv0 32) c___VERIFIER_assert_~cond) (exists ((v_prenex_5 (_ FloatingPoint 8 24))) (and (not (let ((.cse1 (fp.mul roundNearestTiesToEven v_prenex_5 (fp.div roundNearestTiesToEven v_prenex_5 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_prenex_5 ((_ 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_prenex_5 ((_ 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_prenex_5 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven v_prenex_5 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))))))))))) (fp.lt v_prenex_5 (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 v_prenex_5 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))))) (and (exists ((main_~x~0 (_ FloatingPoint 8 24))) (and (fp.gt main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt 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)))) (let ((.cse5 (fp.mul roundNearestTiesToEven main_~x~0 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse7 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven 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 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 main_~x~0 (fp.mul roundNearestTiesToEven .cse4 .cse7)) (fp.mul roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))))))))) (= (bvadd c___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)))) is different from false [2018-11-18 16:59:27,006 WARN L832 $PredicateComparison]: unable to prove that (exists ((v_prenex_5 (_ FloatingPoint 8 24))) (and (not (let ((.cse1 (fp.mul roundNearestTiesToEven v_prenex_5 (fp.div roundNearestTiesToEven v_prenex_5 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_prenex_5 ((_ 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_prenex_5 ((_ 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_prenex_5 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven v_prenex_5 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))))))))))) (fp.lt v_prenex_5 (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 v_prenex_5 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))) is different from false [2018-11-18 16:59:29,298 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_prenex_5 (_ FloatingPoint 8 24))) (and (not (let ((.cse1 (fp.mul roundNearestTiesToEven v_prenex_5 (fp.div roundNearestTiesToEven v_prenex_5 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_prenex_5 ((_ 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_prenex_5 ((_ 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_prenex_5 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven v_prenex_5 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))))))))))) (fp.lt v_prenex_5 (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 v_prenex_5 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))) is different from true [2018-11-18 16:59:29,303 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2018-11-18 16:59:29,303 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 16:59:35,370 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_main_#t~ite2|))) (fp.geq (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))))) is different from false [2018-11-18 16:59:37,447 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_main_#t~ite2|))) (fp.geq (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))))) is different from true [2018-11-18 16:59:39,516 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (fp.geq (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))))) is different from false [2018-11-18 16:59:41,583 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (fp.geq (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))))) is different from true [2018-11-18 16:59:43,700 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))))) (fp.geq (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))))) is different from false [2018-11-18 16:59:45,810 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))))) (fp.geq (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))))) is different from true [2018-11-18 16:59:47,996 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_main_#t~ite2|)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32)))))))))) is different from false [2018-11-18 16:59:50,181 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_main_#t~ite2|)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32)))))))))) is different from true [2018-11-18 16:59:52,361 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32)))))))))) is different from false [2018-11-18 16:59:54,536 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32)))))))))) is different from true [2018-11-18 16:59:56,767 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32))))))))))) is different from false [2018-11-18 16:59:58,996 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32))))))))))) is different from true [2018-11-18 17:00:01,902 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_main_~oddExp~0_14 (_ FloatingPoint 8 24))) (or (not (fp.lt v_main_~oddExp~0_14 (fp.div roundNearestTiesToEven c_~pi~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32))))) (let ((.cse1 (fp.mul roundNearestTiesToEven v_main_~oddExp~0_14 (fp.div roundNearestTiesToEven v_main_~oddExp~0_14 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_main_~oddExp~0_14 ((_ 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_main_~oddExp~0_14 ((_ 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_main_~oddExp~0_14 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven v_main_~oddExp~0_14 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))))))) (not (fp.gt v_main_~oddExp~0_14 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))))) is different from true [2018-11-18 17:00:08,861 WARN L832 $PredicateComparison]: unable to prove that (forall ((v_main_~oddExp~0_14 (_ FloatingPoint 8 24))) (or (not (fp.lt v_main_~oddExp~0_14 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32))))) (let ((.cse1 (fp.mul roundNearestTiesToEven v_main_~oddExp~0_14 (fp.div roundNearestTiesToEven v_main_~oddExp~0_14 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_main_~oddExp~0_14 ((_ 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_main_~oddExp~0_14 ((_ 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_main_~oddExp~0_14 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven v_main_~oddExp~0_14 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))))))) (not (fp.gt v_main_~oddExp~0_14 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))))) is different from false [2018-11-18 17:00:11,185 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_main_~oddExp~0_14 (_ FloatingPoint 8 24))) (or (not (fp.lt v_main_~oddExp~0_14 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32))))) (let ((.cse1 (fp.mul roundNearestTiesToEven v_main_~oddExp~0_14 (fp.div roundNearestTiesToEven v_main_~oddExp~0_14 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_main_~oddExp~0_14 ((_ 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_main_~oddExp~0_14 ((_ 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_main_~oddExp~0_14 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven v_main_~oddExp~0_14 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))))))) (not (fp.gt v_main_~oddExp~0_14 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))))) is different from true [2018-11-18 17:00:11,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:00:11,205 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_875594ac-f0f9-4298-8c91-3837b66d18b4/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 17:00:11,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 17:00:23,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2018-11-18 17:00:24,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-18 17:00:24,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-11-18 17:00:24,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-18 17:00:24,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-18 17:00:24,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=57, Unknown=26, NotChecked=420, Total=552 [2018-11-18 17:00:24,082 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 13 states. [2018-11-18 17:00:33,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:00:33,276 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-11-18 17:00:33,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 17:00:33,277 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 20 [2018-11-18 17:00:33,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:00:33,278 INFO L225 Difference]: With dead ends: 36 [2018-11-18 17:00:33,278 INFO L226 Difference]: Without dead ends: 31 [2018-11-18 17:00:33,278 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 109.1s TimeCoverageRelationStatistics Valid=54, Invalid=70, Unknown=26, NotChecked=450, Total=600 [2018-11-18 17:00:33,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-18 17:00:33,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-18 17:00:33,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-18 17:00:33,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-11-18 17:00:33,284 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 20 [2018-11-18 17:00:33,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:00:33,285 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-11-18 17:00:33,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-18 17:00:33,285 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-11-18 17:00:33,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-18 17:00:33,285 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:00:33,286 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:00:33,286 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:00:33,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:00:33,286 INFO L82 PathProgramCache]: Analyzing trace with hash 497228205, now seen corresponding path program 2 times [2018-11-18 17:00:33,286 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 17:00:33,286 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_875594ac-f0f9-4298-8c91-3837b66d18b4/bin-2019/uautomizer/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2018-11-18 17:00:33,296 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-18 17:01:18,227 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 17:01:18,228 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 17:01:18,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:01:36,036 WARN L180 SmtUtils]: Spent 12.23 s on a formula simplification that was a NOOP. DAG size: 29 [2018-11-18 17:01:38,053 WARN L832 $PredicateComparison]: unable to prove that (and (= c_main_~x~0 c_main_~oddExp~0) (= (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))) c_main_~term~0) (= (bvadd c_main_~count~0 (_ bv4294967294 32)) (_ bv0 32)) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= c_main_~evenExp~0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.lt c_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)))) (= (bvadd |c_main_#t~ite2| (_ bv1 32)) (_ bv0 32))) is different from false [2018-11-18 17:01:40,334 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32))))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= c_main_~term~0 (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_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_main_~evenExp~0 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse1 .cse0))) (= (bvadd c_main_~count~0 (_ bv4294967292 32)) (_ bv0 32)) (= (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse1 c_main_~term~0)) c_main_~oddExp~0))) is different from false [2018-11-18 17:01:42,591 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32))))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= c_main_~term~0 (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_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_main_~evenExp~0 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse1 .cse0))) (= (bvadd c_main_~count~0 (_ bv4294967292 32)) (_ bv0 32)) (= (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse1 c_main_~term~0)) c_main_~oddExp~0))) is different from true [2018-11-18 17:01:44,879 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) c_main_~oddExp~0) (= c_main_~term~0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0)))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_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_main_~evenExp~0 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse2))) (= (bvadd c_main_~count~0 (_ bv4294967292 32)) (_ bv0 32))))) is different from false [2018-11-18 17:01:47,172 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) c_main_~oddExp~0) (= c_main_~term~0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0)))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_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_main_~evenExp~0 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse2))) (= (bvadd c_main_~count~0 (_ bv4294967292 32)) (_ bv0 32))))) is different from true [2018-11-18 17:01:49,459 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) c_main_~oddExp~0) (= c_main_~term~0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0)))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_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_main_~evenExp~0 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse0 .cse2))) (= (bvadd |c_main_#t~ite2| (_ bv1 32)) (_ bv0 32)) (= (bvadd c_main_~count~0 (_ bv4294967292 32)) (_ bv0 32))))) is different from false [2018-11-18 17:01:53,523 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (and (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) c_main_~oddExp~0) (= c_main_~term~0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_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_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 .cse3)) (fp.mul roundNearestTiesToEven .cse0 .cse2))) (= (bvadd c_main_~count~0 (_ bv4294967290 32)) (_ bv0 32)))))) is different from false [2018-11-18 17:01:55,916 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (and (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) c_main_~oddExp~0) (= c_main_~term~0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_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_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 .cse3)) (fp.mul roundNearestTiesToEven .cse0 .cse2))) (= (bvadd c_main_~count~0 (_ bv4294967290 32)) (_ bv0 32)))))) is different from true [2018-11-18 17:01:58,261 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (and (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) c_main_~oddExp~0) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_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_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 .cse3)) (fp.mul roundNearestTiesToEven .cse0 .cse4))) (= (bvadd c_main_~count~0 (_ bv4294967290 32)) (_ bv0 32)) (= (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))) c_main_~term~0)))))) is different from false [2018-11-18 17:02:00,578 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (and (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) c_main_~oddExp~0) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_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_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 .cse3)) (fp.mul roundNearestTiesToEven .cse0 .cse4))) (= (bvadd c_main_~count~0 (_ bv4294967290 32)) (_ bv0 32)) (= (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))) c_main_~term~0)))))) is different from true [2018-11-18 17:02:02,920 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (and (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) c_main_~oddExp~0) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_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)))) (= (bvadd |c_main_#t~ite2| (_ bv1 32)) (_ bv0 32)) (= c_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 .cse3)) (fp.mul roundNearestTiesToEven .cse0 .cse4))) (= (bvadd c_main_~count~0 (_ bv4294967290 32)) (_ bv0 32)) (= (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))) c_main_~term~0)))))) is different from false [2018-11-18 17:02:05,229 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (and (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) c_main_~oddExp~0) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_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)))) (= (bvadd |c_main_#t~ite2| (_ bv1 32)) (_ bv0 32)) (= c_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 .cse3)) (fp.mul roundNearestTiesToEven .cse0 .cse4))) (= (bvadd c_main_~count~0 (_ bv4294967290 32)) (_ bv0 32)) (= (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))) c_main_~term~0)))))) is different from true [2018-11-18 17:02:07,743 WARN L832 $PredicateComparison]: unable to prove that (exists ((main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse1 (fp.mul roundNearestTiesToEven main_~x~0 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven 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 main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv6 32)))))) (and (= c_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 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 .cse3))) (fp.gt main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32)))))) c_main_~oddExp~0) (fp.lt 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))))))))))) is different from false [2018-11-18 17:02:10,211 WARN L854 $PredicateComparison]: unable to prove that (exists ((main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse1 (fp.mul roundNearestTiesToEven main_~x~0 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven 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 main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv6 32)))))) (and (= c_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 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 .cse3))) (fp.gt main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32)))))) c_main_~oddExp~0) (fp.lt 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))))))))))) is different from true [2018-11-18 17:02:23,289 WARN L832 $PredicateComparison]: unable to prove that (or (and (exists ((v_prenex_7 (_ FloatingPoint 8 24))) (and (not (let ((.cse1 (fp.mul roundNearestTiesToEven v_prenex_7 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven v_prenex_7 ((_ 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_prenex_7 ((_ 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_prenex_7 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32))))))))))))) (fp.lt v_prenex_7 (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 v_prenex_7 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))) (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))) (and (= (bvadd |c___VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32)) (exists ((main_~x~0 (_ FloatingPoint 8 24))) (and (fp.gt main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt 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)))) (let ((.cse7 (fp.mul roundNearestTiesToEven main_~x~0 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse10 (fp.mul roundNearestTiesToEven .cse7 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse8 (fp.mul roundNearestTiesToEven .cse10 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse11 (fp.mul roundNearestTiesToEven .cse8 (fp.div roundNearestTiesToEven 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 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 main_~x~0 (fp.mul roundNearestTiesToEven .cse6 .cse10)) (fp.mul roundNearestTiesToEven .cse6 .cse11)) (fp.mul roundNearestTiesToEven .cse6 (fp.mul roundNearestTiesToEven .cse9 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32)))))))))))))))) is different from false [2018-11-18 17:02:36,351 WARN L832 $PredicateComparison]: unable to prove that (or (and (exists ((v_prenex_7 (_ FloatingPoint 8 24))) (and (not (let ((.cse1 (fp.mul roundNearestTiesToEven v_prenex_7 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven v_prenex_7 ((_ 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_prenex_7 ((_ 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_prenex_7 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32))))))))))))) (fp.lt v_prenex_7 (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 v_prenex_7 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))) (= (_ bv0 32) c___VERIFIER_assert_~cond)) (and (= (bvadd c___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (exists ((main_~x~0 (_ FloatingPoint 8 24))) (and (fp.gt main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt 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)))) (let ((.cse7 (fp.mul roundNearestTiesToEven main_~x~0 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse10 (fp.mul roundNearestTiesToEven .cse7 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse8 (fp.mul roundNearestTiesToEven .cse10 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse11 (fp.mul roundNearestTiesToEven .cse8 (fp.div roundNearestTiesToEven 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 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 main_~x~0 (fp.mul roundNearestTiesToEven .cse6 .cse10)) (fp.mul roundNearestTiesToEven .cse6 .cse11)) (fp.mul roundNearestTiesToEven .cse6 (fp.mul roundNearestTiesToEven .cse9 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32)))))))))))))))) is different from false [2018-11-18 17:02:43,898 WARN L832 $PredicateComparison]: unable to prove that (exists ((v_prenex_7 (_ FloatingPoint 8 24))) (and (not (let ((.cse1 (fp.mul roundNearestTiesToEven v_prenex_7 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven v_prenex_7 ((_ 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_prenex_7 ((_ 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_prenex_7 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32))))))))))))) (fp.lt v_prenex_7 (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 v_prenex_7 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))) is different from false [2018-11-18 17:02:46,366 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_prenex_7 (_ FloatingPoint 8 24))) (and (not (let ((.cse1 (fp.mul roundNearestTiesToEven v_prenex_7 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven v_prenex_7 ((_ 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_prenex_7 ((_ 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_prenex_7 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven v_prenex_7 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32))))))))))))) (fp.lt v_prenex_7 (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 v_prenex_7 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))) is different from true [2018-11-18 17:02:46,375 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2018-11-18 17:02:46,375 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 17:02:52,065 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_main_#t~ite2|))) (fp.geq (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))))) is different from false [2018-11-18 17:02:54,154 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_main_#t~ite2|))) (fp.geq (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))))) is different from true [2018-11-18 17:02:56,228 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (fp.geq (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))))) is different from false [2018-11-18 17:02:58,314 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (fp.geq (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))))) is different from true [2018-11-18 17:03:00,465 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))))) (fp.geq (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))))) is different from false [2018-11-18 17:03:02,620 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))))) (fp.geq (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))))) is different from true [2018-11-18 17:03:04,860 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_main_#t~ite2|)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32)))))))))) is different from false [2018-11-18 17:03:07,097 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_main_#t~ite2|)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32)))))))))) is different from true [2018-11-18 17:03:09,307 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32)))))))))) is different from false [2018-11-18 17:03:11,494 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32)))))))))) is different from true [2018-11-18 17:03:13,731 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32))))))))))) is different from false [2018-11-18 17:03:15,974 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32))))))))))) is different from true [2018-11-18 17:03:18,281 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse4 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_main_#t~ite2|)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.mul roundNearestTiesToEven .cse1 .cse3)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_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_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv5 32)))))))))))) is different from false [2018-11-18 17:03:20,587 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_main_#t~ite2|)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.mul roundNearestTiesToEven .cse1 .cse3)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_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_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv5 32)))))))))))) is different from true [2018-11-18 17:03:22,889 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_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_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv5 32)))))))))))) is different from false [2018-11-18 17:03:25,183 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_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_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv5 32)))))))))))) is different from true [2018-11-18 17:03:27,537 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_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_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_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv5 32))))))))))))) is different from false [2018-11-18 17:03:29,895 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_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_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_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv5 32))))))))))))) is different from true [2018-11-18 17:03:33,324 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_main_~term~0_34 (_ FloatingPoint 8 24))) (or (not (fp.lt v_main_~term~0_34 (fp.div roundNearestTiesToEven c_~pi~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32))))) (not (fp.gt v_main_~term~0_34 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))) (let ((.cse1 (fp.mul roundNearestTiesToEven v_main_~term~0_34 (fp.div roundNearestTiesToEven v_main_~term~0_34 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_main_~term~0_34 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven v_main_~term~0_34 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven v_main_~term~0_34 ((_ 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_main_~term~0_34 ((_ 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_main_~term~0_34 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven v_main_~term~0_34 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32)))))))))))))) is different from true [2018-11-18 17:03:40,828 WARN L832 $PredicateComparison]: unable to prove that (forall ((v_main_~term~0_34 (_ FloatingPoint 8 24))) (or (not (fp.gt v_main_~term~0_34 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))) (let ((.cse1 (fp.mul roundNearestTiesToEven v_main_~term~0_34 (fp.div roundNearestTiesToEven v_main_~term~0_34 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_main_~term~0_34 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven v_main_~term~0_34 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven v_main_~term~0_34 ((_ 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_main_~term~0_34 ((_ 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_main_~term~0_34 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven v_main_~term~0_34 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32)))))))))))) (not (fp.lt v_main_~term~0_34 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32))))))) is different from false [2018-11-18 17:03:43,341 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_main_~term~0_34 (_ FloatingPoint 8 24))) (or (not (fp.gt v_main_~term~0_34 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32)))) (let ((.cse1 (fp.mul roundNearestTiesToEven v_main_~term~0_34 (fp.div roundNearestTiesToEven v_main_~term~0_34 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_main_~term~0_34 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven v_main_~term~0_34 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven v_main_~term~0_34 ((_ 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_main_~term~0_34 ((_ 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_main_~term~0_34 (fp.mul roundNearestTiesToEven .cse0 .cse4)) (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven v_main_~term~0_34 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32)))))))))))) (not (fp.lt v_main_~term~0_34 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32))))))) is different from true [2018-11-18 17:03:43,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 17:03:43,368 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_875594ac-f0f9-4298-8c91-3837b66d18b4/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 17:03:43,375 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 17:04:07,700 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 17:04:07,700 INFO L250 tOrderPrioritization]: Conjunction of SSA is unknown [2018-11-18 17:04:08,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-18 17:04:08,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-11-18 17:04:08,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-18 17:04:08,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-18 17:04:08,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=45, Unknown=40, NotChecked=726, Total=870 [2018-11-18 17:04:08,139 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 16 states. [2018-11-18 17:04:19,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:04:19,740 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2018-11-18 17:04:19,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-18 17:04:19,834 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2018-11-18 17:04:19,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:04:19,835 INFO L225 Difference]: With dead ends: 41 [2018-11-18 17:04:19,835 INFO L226 Difference]: Without dead ends: 36 [2018-11-18 17:04:19,836 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 22 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 115.6s TimeCoverageRelationStatistics Valid=64, Invalid=56, Unknown=40, NotChecked=770, Total=930 [2018-11-18 17:04:19,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-18 17:04:19,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-18 17:04:19,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-18 17:04:19,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-11-18 17:04:19,841 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 25 [2018-11-18 17:04:19,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:04:19,842 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-11-18 17:04:19,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-18 17:04:19,842 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-11-18 17:04:19,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 17:04:19,843 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:04:19,843 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:04:19,843 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:04:19,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:04:19,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1071354458, now seen corresponding path program 2 times [2018-11-18 17:04:19,843 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 17:04:19,843 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_875594ac-f0f9-4298-8c91-3837b66d18b4/bin-2019/uautomizer/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2018-11-18 17:04:19,846 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 17:04:22,210 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 17:04:22,210 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 17:04:22,365 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:04:22,393 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:04:22,393 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 17:04:22,448 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 17:04:22,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 17:04:22,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-11-18 17:04:22,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 17:04:22,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 17:04:22,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-18 17:04:22,476 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 10 states. [2018-11-18 17:04:41,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 17:04:41,212 INFO L93 Difference]: Finished difference Result 72 states and 83 transitions. [2018-11-18 17:04:41,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 17:04:41,213 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2018-11-18 17:04:41,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 17:04:41,213 INFO L225 Difference]: With dead ends: 72 [2018-11-18 17:04:41,213 INFO L226 Difference]: Without dead ends: 57 [2018-11-18 17:04:41,214 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2018-11-18 17:04:41,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-18 17:04:41,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 49. [2018-11-18 17:04:41,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-18 17:04:41,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-11-18 17:04:41,218 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 30 [2018-11-18 17:04:41,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 17:04:41,218 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-11-18 17:04:41,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 17:04:41,218 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-18 17:04:41,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-18 17:04:41,218 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 17:04:41,219 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 17:04:41,219 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 17:04:41,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 17:04:41,219 INFO L82 PathProgramCache]: Analyzing trace with hash 703652904, now seen corresponding path program 3 times [2018-11-18 17:04:41,219 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-18 17:04:41,219 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_875594ac-f0f9-4298-8c91-3837b66d18b4/bin-2019/uautomizer/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2018-11-18 17:04:41,223 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-18 17:06:18,340 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-18 17:06:18,340 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 17:06:18,557 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 17:06:20,606 WARN L832 $PredicateComparison]: unable to prove that (and (= c_main_~x~0 c_main_~oddExp~0) (= (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))) c_main_~term~0) (= (bvadd c_main_~count~0 (_ bv4294967294 32)) (_ bv0 32)) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (= c_main_~evenExp~0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.lt c_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))))) is different from false [2018-11-18 17:06:39,768 WARN L180 SmtUtils]: Spent 15.59 s on a formula simplification that was a NOOP. DAG size: 33 [2018-11-18 17:06:42,086 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967294 32)))))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= c_main_~term~0 (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967295 32)))))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_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)))) (= (_ bv4 32) c_main_~count~0) (= c_main_~evenExp~0 (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse1 .cse0))) (= (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse1 c_main_~term~0)) c_main_~oddExp~0))) is different from false [2018-11-18 17:06:46,312 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967294 32))))))) (let ((.cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967295 32)))))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))) c_main_~term~0) (= c_main_~oddExp~0 (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse1 .cse0))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_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)))) (= (_ bv4 32) c_main_~count~0) (= c_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 [2018-11-18 17:06:48,851 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967294 32))))))) (let ((.cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967295 32)))))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))) c_main_~term~0) (= c_main_~oddExp~0 (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse1 .cse0))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_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)))) (= (bvadd |c_main_#t~ite2| (_ bv1 32)) (_ bv0 32)) (= (_ bv4 32) c_main_~count~0) (= c_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 [2018-11-18 17:06:50,993 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967294 32))))))) (let ((.cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967295 32)))))) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))) c_main_~term~0) (= c_main_~oddExp~0 (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse1 .cse0))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_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)))) (= (bvadd |c_main_#t~ite2| (_ bv1 32)) (_ bv0 32)) (= (_ bv4 32) c_main_~count~0) (= c_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 true [2018-11-18 17:06:53,334 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (and (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) c_main_~oddExp~0) (= c_main_~term~0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_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_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 .cse3)) (fp.mul roundNearestTiesToEven .cse0 .cse2))) (= (bvadd c_main_~count~0 (_ bv4294967290 32)) (_ bv0 32)))))) is different from false [2018-11-18 17:06:55,611 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (and (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) c_main_~oddExp~0) (= c_main_~term~0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))))) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_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_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 .cse3)) (fp.mul roundNearestTiesToEven .cse0 .cse2))) (= (bvadd c_main_~count~0 (_ bv4294967290 32)) (_ bv0 32)))))) is different from true [2018-11-18 17:06:57,966 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (and (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) c_main_~oddExp~0) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_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_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 .cse3)) (fp.mul roundNearestTiesToEven .cse0 .cse4))) (= (bvadd c_main_~count~0 (_ bv4294967290 32)) (_ bv0 32)) (= (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))) c_main_~term~0)))))) is different from false [2018-11-18 17:07:00,286 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (and (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) c_main_~oddExp~0) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_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_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 .cse3)) (fp.mul roundNearestTiesToEven .cse0 .cse4))) (= (bvadd c_main_~count~0 (_ bv4294967290 32)) (_ bv0 32)) (= (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))) c_main_~term~0)))))) is different from true [2018-11-18 17:07:02,642 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (and (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) c_main_~oddExp~0) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_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)))) (= (bvadd |c_main_#t~ite2| (_ bv1 32)) (_ bv0 32)) (= c_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 .cse3)) (fp.mul roundNearestTiesToEven .cse0 .cse4))) (= (bvadd c_main_~count~0 (_ bv4294967290 32)) (_ bv0 32)) (= (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))) c_main_~term~0)))))) is different from false [2018-11-18 17:07:04,959 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (and (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) c_main_~oddExp~0) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_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)))) (= (bvadd |c_main_#t~ite2| (_ bv1 32)) (_ bv0 32)) (= c_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 .cse3)) (fp.mul roundNearestTiesToEven .cse0 .cse4))) (= (bvadd c_main_~count~0 (_ bv4294967290 32)) (_ bv0 32)) (= (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))) c_main_~term~0)))))) is different from true [2018-11-18 17:07:07,493 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse4 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967294 32))))))) (and (= (_ bv8 32) c_main_~count~0) (= (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967295 32))))) c_main_~term~0) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_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.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.mul roundNearestTiesToEven .cse1 .cse3)) (fp.mul roundNearestTiesToEven .cse1 c_main_~term~0)) c_main_~oddExp~0) (= c_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 .cse1 .cse4)) (fp.mul roundNearestTiesToEven .cse1 .cse5)) (fp.mul roundNearestTiesToEven .cse1 .cse0))))))))) is different from false [2018-11-18 17:07:09,927 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse0 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967294 32))))))) (and (= (_ bv8 32) c_main_~count~0) (= (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967295 32))))) c_main_~term~0) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_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.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.mul roundNearestTiesToEven .cse1 .cse3)) (fp.mul roundNearestTiesToEven .cse1 c_main_~term~0)) c_main_~oddExp~0) (= c_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 .cse1 .cse4)) (fp.mul roundNearestTiesToEven .cse1 .cse5)) (fp.mul roundNearestTiesToEven .cse1 .cse0))))))))) is different from true [2018-11-18 17:07:12,472 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse4 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (let ((.cse6 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967294 32))))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967295 32)))))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= (_ bv8 32) c_main_~count~0) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_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.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) c_main_~oddExp~0) (= (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))) c_main_~term~0) (= c_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 .cse6)))))))))) is different from false [2018-11-18 17:07:15,147 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (let ((.cse6 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967294 32))))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967295 32)))))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= (_ bv8 32) c_main_~count~0) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_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.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) c_main_~oddExp~0) (= (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))) c_main_~term~0) (= c_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 .cse6)))))))))) is different from true [2018-11-18 17:07:17,692 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse4 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (let ((.cse6 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967294 32))))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967295 32)))))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= (_ bv8 32) c_main_~count~0) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_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.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) c_main_~oddExp~0) (= (bvadd |c_main_#t~ite2| (_ bv1 32)) (_ bv0 32)) (= (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))) c_main_~term~0) (= c_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 .cse6)))))))))) is different from false [2018-11-18 17:07:20,094 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (fp.mul roundNearestTiesToEven c_main_~x~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (let ((.cse6 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967294 32))))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4294967295 32)))))) (.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (and (= (_ bv8 32) c_main_~count~0) (fp.gt c_main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt c_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.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) c_main_~oddExp~0) (= (bvadd |c_main_#t~ite2| (_ bv1 32)) (_ bv0 32)) (= (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))) c_main_~term~0) (= c_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 .cse6)))))))))) is different from true [2018-11-18 17:07:22,682 WARN L832 $PredicateComparison]: unable to prove that (exists ((main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse5 (fp.mul roundNearestTiesToEven main_~x~0 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse6 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (let ((.cse7 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv6 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse7 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse4 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv8 32)))))) (and (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv9 32)))))) c_main_~oddExp~0) (= c_main_~evenExp~0 (fp.add roundNearestTiesToEven (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 .cse5)) (fp.mul roundNearestTiesToEven .cse0 .cse6)) (fp.mul roundNearestTiesToEven .cse0 .cse7)) (fp.mul roundNearestTiesToEven .cse0 .cse4))) (fp.gt main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt 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))))))))))))) is different from false [2018-11-18 17:07:25,194 WARN L854 $PredicateComparison]: unable to prove that (exists ((main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse5 (fp.mul roundNearestTiesToEven main_~x~0 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse6 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (let ((.cse7 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv6 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse7 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse4 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv8 32)))))) (and (= (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv9 32)))))) c_main_~oddExp~0) (= c_main_~evenExp~0 (fp.add roundNearestTiesToEven (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 .cse5)) (fp.mul roundNearestTiesToEven .cse0 .cse6)) (fp.mul roundNearestTiesToEven .cse0 .cse7)) (fp.mul roundNearestTiesToEven .cse0 .cse4))) (fp.gt main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt 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))))))))))))) is different from true [2018-11-18 17:07:38,653 WARN L832 $PredicateComparison]: unable to prove that (or (and (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)) (exists ((main_~x~0 (_ FloatingPoint 8 24))) (and (fp.gt main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt 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)))) (not (let ((.cse1 (fp.mul roundNearestTiesToEven main_~x~0 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse6 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv6 32)))))) (let ((.cse7 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse4 (fp.mul roundNearestTiesToEven .cse7 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv8 32)))))) (fp.geq (fp.add roundNearestTiesToEven (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.mul roundNearestTiesToEven .cse0 .cse4)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 .cse6)) (fp.mul roundNearestTiesToEven .cse0 .cse7)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv9 32)))))))))))))))))) (and (= (bvadd |c___VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32)) (exists ((v_prenex_11 (_ FloatingPoint 8 24))) (and (fp.gt v_prenex_11 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (let ((.cse9 (fp.mul roundNearestTiesToEven v_prenex_11 (fp.div roundNearestTiesToEven v_prenex_11 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse13 (fp.mul roundNearestTiesToEven .cse9 (fp.div roundNearestTiesToEven v_prenex_11 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse10 (fp.mul roundNearestTiesToEven .cse13 (fp.div roundNearestTiesToEven v_prenex_11 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse14 (fp.mul roundNearestTiesToEven .cse10 (fp.div roundNearestTiesToEven v_prenex_11 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (let ((.cse11 (fp.mul roundNearestTiesToEven .cse14 (fp.div roundNearestTiesToEven v_prenex_11 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv6 32)))))) (let ((.cse15 (fp.mul roundNearestTiesToEven .cse11 (fp.div roundNearestTiesToEven v_prenex_11 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32)))))) (let ((.cse8 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse12 (fp.mul roundNearestTiesToEven .cse15 (fp.div roundNearestTiesToEven v_prenex_11 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv8 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse8 .cse9)) (fp.mul roundNearestTiesToEven .cse8 .cse10)) (fp.mul roundNearestTiesToEven .cse8 .cse11)) (fp.mul roundNearestTiesToEven .cse8 .cse12)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven v_prenex_11 (fp.mul roundNearestTiesToEven .cse8 .cse13)) (fp.mul roundNearestTiesToEven .cse8 .cse14)) (fp.mul roundNearestTiesToEven .cse8 .cse15)) (fp.mul roundNearestTiesToEven .cse8 (fp.mul roundNearestTiesToEven .cse12 (fp.div roundNearestTiesToEven v_prenex_11 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv9 32)))))))))))))) (fp.lt v_prenex_11 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))))))) is different from false [2018-11-18 17:07:52,178 WARN L832 $PredicateComparison]: unable to prove that (or (and (exists ((v_prenex_11 (_ FloatingPoint 8 24))) (and (fp.gt v_prenex_11 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (let ((.cse1 (fp.mul roundNearestTiesToEven v_prenex_11 (fp.div roundNearestTiesToEven v_prenex_11 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven v_prenex_11 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven v_prenex_11 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse6 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven v_prenex_11 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven v_prenex_11 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv6 32)))))) (let ((.cse7 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven v_prenex_11 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse4 (fp.mul roundNearestTiesToEven .cse7 (fp.div roundNearestTiesToEven v_prenex_11 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv8 32)))))) (fp.geq (fp.add roundNearestTiesToEven (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.mul roundNearestTiesToEven .cse0 .cse4)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven v_prenex_11 (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 .cse6)) (fp.mul roundNearestTiesToEven .cse0 .cse7)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven v_prenex_11 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv9 32)))))))))))))) (fp.lt v_prenex_11 (fp.div roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 314159.0 100000.0))) ((_ to_fp 8 24) roundNearestTiesToEven (_ bv8 32)))))) (= (bvadd c___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))) (and (= (_ bv0 32) c___VERIFIER_assert_~cond) (exists ((main_~x~0 (_ FloatingPoint 8 24))) (and (fp.gt main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt 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)))) (not (let ((.cse9 (fp.mul roundNearestTiesToEven main_~x~0 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse13 (fp.mul roundNearestTiesToEven .cse9 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse10 (fp.mul roundNearestTiesToEven .cse13 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse14 (fp.mul roundNearestTiesToEven .cse10 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (let ((.cse11 (fp.mul roundNearestTiesToEven .cse14 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv6 32)))))) (let ((.cse15 (fp.mul roundNearestTiesToEven .cse11 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32)))))) (let ((.cse8 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse12 (fp.mul roundNearestTiesToEven .cse15 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv8 32)))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (fp.mul roundNearestTiesToEven .cse8 .cse9)) (fp.mul roundNearestTiesToEven .cse8 .cse10)) (fp.mul roundNearestTiesToEven .cse8 .cse11)) (fp.mul roundNearestTiesToEven .cse8 .cse12)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven main_~x~0 (fp.mul roundNearestTiesToEven .cse8 .cse13)) (fp.mul roundNearestTiesToEven .cse8 .cse14)) (fp.mul roundNearestTiesToEven .cse8 .cse15)) (fp.mul roundNearestTiesToEven .cse8 (fp.mul roundNearestTiesToEven .cse12 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv9 32))))))))))))))))))) is different from false [2018-11-18 17:07:59,940 WARN L832 $PredicateComparison]: unable to prove that (exists ((main_~x~0 (_ FloatingPoint 8 24))) (and (fp.gt main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt 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)))) (not (let ((.cse1 (fp.mul roundNearestTiesToEven main_~x~0 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse6 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv6 32)))))) (let ((.cse7 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse4 (fp.mul roundNearestTiesToEven .cse7 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv8 32)))))) (fp.geq (fp.add roundNearestTiesToEven (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.mul roundNearestTiesToEven .cse0 .cse4)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 .cse6)) (fp.mul roundNearestTiesToEven .cse0 .cse7)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv9 32))))))))))))))))) is different from false [2018-11-18 17:08:02,464 WARN L854 $PredicateComparison]: unable to prove that (exists ((main_~x~0 (_ FloatingPoint 8 24))) (and (fp.gt main_~x~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))) (fp.lt 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)))) (not (let ((.cse1 (fp.mul roundNearestTiesToEven main_~x~0 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (let ((.cse6 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv6 32)))))) (let ((.cse7 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv7 32)))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse4 (fp.mul roundNearestTiesToEven .cse7 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv8 32)))))) (fp.geq (fp.add roundNearestTiesToEven (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.mul roundNearestTiesToEven .cse0 .cse4)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven main_~x~0 (fp.mul roundNearestTiesToEven .cse0 .cse5)) (fp.mul roundNearestTiesToEven .cse0 .cse6)) (fp.mul roundNearestTiesToEven .cse0 .cse7)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv9 32))))))))))))))))) is different from true [2018-11-18 17:08:02,478 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 30 not checked. [2018-11-18 17:08:02,478 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 17:08:07,055 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_main_#t~ite2|))) (fp.geq (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))))) is different from false [2018-11-18 17:08:09,154 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_main_#t~ite2|))) (fp.geq (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))))) is different from true [2018-11-18 17:08:11,236 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (fp.geq (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))))) is different from false [2018-11-18 17:08:13,321 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32)))) (fp.geq (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))))) is different from true [2018-11-18 17:08:15,470 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))))) (fp.geq (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))))) is different from false [2018-11-18 17:08:17,613 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))))) (fp.geq (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))))) is different from true [2018-11-18 17:08:19,835 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_main_#t~ite2|)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32)))))))))) is different from false [2018-11-18 17:08:22,054 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_main_#t~ite2|)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32)))))))))) is different from true [2018-11-18 17:08:24,267 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32)))))))))) is different from false [2018-11-18 17:08:26,478 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse1 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32)))))))))) is different from true [2018-11-18 17:08:28,743 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32))))))))))) is different from false [2018-11-18 17:08:31,011 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven c_main_~count~0))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse2 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse1)) (fp.mul roundNearestTiesToEven .cse0 .cse2)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~oddExp~0 (fp.mul roundNearestTiesToEven .cse0 .cse3)) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32))))))))))) is different from true [2018-11-18 17:08:33,353 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse4 (fp.mul roundNearestTiesToEven c_main_~term~0 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv1 32))))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv2 32))))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv3 32))))))) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven |c_main_#t~ite2|)) (.cse1 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv4294967295 32))) (.cse3 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven c_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv4 32))))))) (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_main_~evenExp~0 (fp.mul roundNearestTiesToEven .cse0 c_main_~term~0)) (fp.mul roundNearestTiesToEven .cse1 .cse2)) (fp.mul roundNearestTiesToEven .cse1 .cse3)) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven c_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_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (bvadd c_main_~count~0 (_ bv5 32)))))))))))) is different from false [2018-11-18 17:08:33,939 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-11-18 17:08:34,139 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2018-11-18 17:08:34,140 FATAL L265 ToolchainWalker]: 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:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:845) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:767) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:339) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:418) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:290) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 40 more [2018-11-18 17:08:34,142 INFO L168 Benchmark]: Toolchain (without parser) took 769582.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 948.6 MB in the beginning and 1.1 GB in the end (delta: -148.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 17:08:34,142 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 17:08:34,142 INFO L168 Benchmark]: CACSL2BoogieTranslator took 178.33 ms. Allocated memory is still 1.0 GB. Free memory was 948.6 MB in the beginning and 932.5 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-18 17:08:34,143 INFO L168 Benchmark]: Boogie Preprocessor took 24.79 ms. Allocated memory is still 1.0 GB. Free memory is still 932.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 17:08:34,143 INFO L168 Benchmark]: RCFGBuilder took 3425.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 932.5 MB in the beginning and 1.1 GB in the end (delta: -180.2 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2018-11-18 17:08:34,143 INFO L168 Benchmark]: TraceAbstraction took 765951.68 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -5.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.3 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2018-11-18 17:08:34,145 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 178.33 ms. Allocated memory is still 1.0 GB. Free memory was 948.6 MB in the beginning and 932.5 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.79 ms. Allocated memory is still 1.0 GB. Free memory is still 932.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 3425.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 932.5 MB in the beginning and 1.1 GB in the end (delta: -180.2 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 765951.68 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -5.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 15.3 MB). Peak memory consumption was 9.6 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...