./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-floats-scientific-comp/loop1-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-floats-scientific-comp/loop1-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 72f53508ad2da2a8e23f1a2d8fc400a48c7a0120 .................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-floats-scientific-comp/loop1-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 72f53508ad2da2a8e23f1a2d8fc400a48c7a0120 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.2.0-a4ecdab [2020-10-24 23:27:20,434 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 23:27:20,437 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 23:27:20,488 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 23:27:20,489 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 23:27:20,491 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 23:27:20,492 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 23:27:20,495 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 23:27:20,497 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 23:27:20,498 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 23:27:20,500 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 23:27:20,502 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 23:27:20,502 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 23:27:20,504 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 23:27:20,505 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 23:27:20,506 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 23:27:20,512 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 23:27:20,513 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 23:27:20,516 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 23:27:20,518 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 23:27:20,520 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 23:27:20,522 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 23:27:20,524 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 23:27:20,525 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 23:27:20,529 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 23:27:20,529 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 23:27:20,530 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 23:27:20,531 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 23:27:20,532 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 23:27:20,533 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 23:27:20,534 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 23:27:20,535 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 23:27:20,536 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 23:27:20,537 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 23:27:20,538 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 23:27:20,539 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 23:27:20,540 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 23:27:20,541 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 23:27:20,541 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 23:27:20,543 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 23:27:20,544 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 23:27:20,545 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-24 23:27:20,613 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 23:27:20,614 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 23:27:20,617 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-24 23:27:20,618 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-24 23:27:20,618 INFO L138 SettingsManager]: * Use SBE=true [2020-10-24 23:27:20,618 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 23:27:20,619 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 23:27:20,620 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-24 23:27:20,621 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 23:27:20,621 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 23:27:20,622 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 23:27:20,622 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 23:27:20,623 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 23:27:20,623 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 23:27:20,623 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 23:27:20,623 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 23:27:20,624 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 23:27:20,624 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 23:27:20,624 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-24 23:27:20,624 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 23:27:20,625 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 23:27:20,625 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 23:27:20,625 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 23:27:20,626 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-24 23:27:20,626 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-24 23:27:20,626 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-24 23:27:20,627 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-24 23:27:20,627 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 23:27:20,627 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-24 23:27:20,627 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_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 -> 72f53508ad2da2a8e23f1a2d8fc400a48c7a0120 [2020-10-24 23:27:21,031 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 23:27:21,063 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 23:27:21,066 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 23:27:21,067 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 23:27:21,068 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 23:27:21,069 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-floats-scientific-comp/loop1-1.c [2020-10-24 23:27:21,152 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c08f9566a/694687f430ed47af9db054e3fbe8f0ec/FLAGb93abfaa7 [2020-10-24 23:27:21,754 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 23:27:21,756 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-floats-scientific-comp/loop1-1.c [2020-10-24 23:27:21,764 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c08f9566a/694687f430ed47af9db054e3fbe8f0ec/FLAGb93abfaa7 [2020-10-24 23:27:22,106 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c08f9566a/694687f430ed47af9db054e3fbe8f0ec [2020-10-24 23:27:22,109 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 23:27:22,119 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-24 23:27:22,124 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 23:27:22,125 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 23:27:22,129 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 23:27:22,130 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:27:22" (1/1) ... [2020-10-24 23:27:22,148 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33971e9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:22, skipping insertion in model container [2020-10-24 23:27:22,148 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:27:22" (1/1) ... [2020-10-24 23:27:22,157 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 23:27:22,180 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-24 23:27:22,354 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 23:27:22,365 INFO L203 MainTranslator]: Completed pre-run [2020-10-24 23:27:22,386 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 23:27:22,406 INFO L208 MainTranslator]: Completed translation [2020-10-24 23:27:22,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:22 WrapperNode [2020-10-24 23:27:22,407 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 23:27:22,408 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-24 23:27:22,409 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-24 23:27:22,409 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-24 23:27:22,418 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:22" (1/1) ... [2020-10-24 23:27:22,427 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:22" (1/1) ... [2020-10-24 23:27:22,450 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-24 23:27:22,451 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 23:27:22,451 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 23:27:22,451 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 23:27:22,461 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:22" (1/1) ... [2020-10-24 23:27:22,461 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:22" (1/1) ... [2020-10-24 23:27:22,464 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:22" (1/1) ... [2020-10-24 23:27:22,464 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:22" (1/1) ... [2020-10-24 23:27:22,470 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:22" (1/1) ... [2020-10-24 23:27:22,474 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:22" (1/1) ... [2020-10-24 23:27:22,476 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:22" (1/1) ... [2020-10-24 23:27:22,478 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 23:27:22,479 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 23:27:22,479 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 23:27:22,479 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 23:27:22,480 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory: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 [2020-10-24 23:27:22,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-24 23:27:22,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 23:27:22,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 23:27:22,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 23:27:22,793 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 23:27:22,793 INFO L298 CfgBuilder]: Removed 13 assume(true) statements. [2020-10-24 23:27:22,795 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:27:22 BoogieIcfgContainer [2020-10-24 23:27:22,795 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 23:27:22,797 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 23:27:22,798 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 23:27:22,801 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 23:27:22,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:27:22" (1/3) ... [2020-10-24 23:27:22,806 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45ade04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:27:22, skipping insertion in model container [2020-10-24 23:27:22,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:22" (2/3) ... [2020-10-24 23:27:22,807 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45ade04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:27:22, skipping insertion in model container [2020-10-24 23:27:22,807 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:27:22" (3/3) ... [2020-10-24 23:27:22,809 INFO L111 eAbstractionObserver]: Analyzing ICFG loop1-1.c [2020-10-24 23:27:22,830 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-24 23:27:22,836 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 23:27:22,851 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 23:27:22,883 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 23:27:22,883 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 23:27:22,883 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-24 23:27:22,883 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 23:27:22,884 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 23:27:22,884 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 23:27:22,884 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 23:27:22,884 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 23:27:22,905 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2020-10-24 23:27:22,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-24 23:27:22,913 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 23:27:22,914 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 23:27:22,915 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 23:27:22,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 23:27:22,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1235864049, now seen corresponding path program 1 times [2020-10-24 23:27:22,942 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-24 23:27:22,943 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703388564] [2020-10-24 23:27:22,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 23:27:23,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 23:27:23,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 23:27:23,128 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703388564] [2020-10-24 23:27:23,130 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 23:27:23,130 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-24 23:27:23,131 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753810962] [2020-10-24 23:27:23,137 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-24 23:27:23,138 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-24 23:27:23,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-24 23:27:23,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-24 23:27:23,169 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 2 states. [2020-10-24 23:27:23,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 23:27:23,188 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2020-10-24 23:27:23,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-24 23:27:23,189 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-10-24 23:27:23,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 23:27:23,197 INFO L225 Difference]: With dead ends: 30 [2020-10-24 23:27:23,198 INFO L226 Difference]: Without dead ends: 12 [2020-10-24 23:27:23,201 INFO L677 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 [2020-10-24 23:27:23,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2020-10-24 23:27:23,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2020-10-24 23:27:23,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-24 23:27:23,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2020-10-24 23:27:23,237 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2020-10-24 23:27:23,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 23:27:23,238 INFO L481 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2020-10-24 23:27:23,238 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-24 23:27:23,238 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2020-10-24 23:27:23,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-24 23:27:23,239 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 23:27:23,246 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 23:27:23,247 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-24 23:27:23,247 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 23:27:23,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 23:27:23,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1503627718, now seen corresponding path program 1 times [2020-10-24 23:27:23,251 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-24 23:27:23,252 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309337175] [2020-10-24 23:27:23,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 23:27:23,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-24 23:27:23,356 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-24 23:27:23,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-24 23:27:23,386 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-24 23:27:23,414 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-24 23:27:23,415 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-24 23:27:23,416 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-24 23:27:23,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 11:27:23 BoogieIcfgContainer [2020-10-24 23:27:23,447 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-24 23:27:23,448 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-24 23:27:23,448 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-24 23:27:23,448 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-24 23:27:23,449 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:27:22" (3/4) ... [2020-10-24 23:27:23,453 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-24 23:27:23,453 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-24 23:27:23,456 INFO L168 Benchmark]: Toolchain (without parser) took 1344.12 ms. Allocated memory was 39.8 MB in the beginning and 48.2 MB in the end (delta: 8.4 MB). Free memory was 16.9 MB in the beginning and 26.1 MB in the end (delta: -9.2 MB). Peak memory consumption was 1.2 MB. Max. memory is 16.1 GB. [2020-10-24 23:27:23,458 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 39.8 MB. Free memory was 26.4 MB in the beginning and 26.4 MB in the end (delta: 32.3 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 23:27:23,459 INFO L168 Benchmark]: CACSL2BoogieTranslator took 283.22 ms. Allocated memory was 39.8 MB in the beginning and 48.2 MB in the end (delta: 8.4 MB). Free memory was 16.2 MB in the beginning and 24.2 MB in the end (delta: -7.9 MB). Peak memory consumption was 5.4 MB. Max. memory is 16.1 GB. [2020-10-24 23:27:23,460 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.89 ms. Allocated memory is still 48.2 MB. Free memory was 24.2 MB in the beginning and 22.6 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-24 23:27:23,463 INFO L168 Benchmark]: Boogie Preprocessor took 27.04 ms. Allocated memory is still 48.2 MB. Free memory was 22.6 MB in the beginning and 21.6 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 23:27:23,465 INFO L168 Benchmark]: RCFGBuilder took 316.50 ms. Allocated memory is still 48.2 MB. Free memory was 21.5 MB in the beginning and 21.8 MB in the end (delta: -357.8 kB). Peak memory consumption was 2.8 MB. Max. memory is 16.1 GB. [2020-10-24 23:27:23,466 INFO L168 Benchmark]: TraceAbstraction took 649.31 ms. Allocated memory is still 48.2 MB. Free memory was 21.5 MB in the beginning and 26.5 MB in the end (delta: -5.1 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 23:27:23,467 INFO L168 Benchmark]: Witness Printer took 5.86 ms. Allocated memory is still 48.2 MB. Free memory was 26.5 MB in the beginning and 26.1 MB in the end (delta: 436.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 23:27:23,472 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 39.8 MB. Free memory was 26.4 MB in the beginning and 26.4 MB in the end (delta: 32.3 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 283.22 ms. Allocated memory was 39.8 MB in the beginning and 48.2 MB in the end (delta: 8.4 MB). Free memory was 16.2 MB in the beginning and 24.2 MB in the end (delta: -7.9 MB). Peak memory consumption was 5.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 41.89 ms. Allocated memory is still 48.2 MB. Free memory was 24.2 MB in the beginning and 22.6 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 27.04 ms. Allocated memory is still 48.2 MB. Free memory was 22.6 MB in the beginning and 21.6 MB in the end (delta: 1.0 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 316.50 ms. Allocated memory is still 48.2 MB. Free memory was 21.5 MB in the beginning and 21.8 MB in the end (delta: -357.8 kB). Peak memory consumption was 2.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 649.31 ms. Allocated memory is still 48.2 MB. Free memory was 21.5 MB in the beginning and 26.5 MB in the end (delta: -5.1 MB). There was no memory consumed. Max. memory is 16.1 GB. * Witness Printer took 5.86 ms. Allocated memory is still 48.2 MB. Free memory was 26.5 MB in the beginning and 26.1 MB in the end (delta: 436.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 8]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 22, overapproximation of someBinaryFLOATComparisonOperation at line 39, overapproximation of someBinaryArithmeticFLOAToperation at line 31. Possible FailurePath: [L20] float x = __VERIFIER_nondet_float() ; [L11] COND FALSE !(!cond) [L11] COND FALSE !(!cond) [L23] float exp = 1.0 ; [L24] float term = 1.0 ; [L25] unsigned int count = 1 ; [L26] float result = 2*(1/(1-x)) ; [L27] int temp ; [L29] COND TRUE 1 [L31] term = term * (x/count) [L32] exp = exp + term [L33] count++ [L35] temp = __VERIFIER_nondet_int() [L36] COND TRUE temp ==0 [L13] COND TRUE !(cond) [L8] __assert_fail("0", "loop1-1.c", 8, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 0.5s, OverallIterations: 2, TraceHistogramMax: 1, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 16 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 9 ConstructedInterpolants, 0 QuantifiedInterpolants, 81 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.0-a4ecdab [2020-10-24 23:27:26,125 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 23:27:26,130 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 23:27:26,201 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 23:27:26,202 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 23:27:26,209 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 23:27:26,212 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 23:27:26,220 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 23:27:26,224 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 23:27:26,231 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 23:27:26,232 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 23:27:26,236 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 23:27:26,236 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 23:27:26,240 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 23:27:26,241 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 23:27:26,243 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 23:27:26,245 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 23:27:26,246 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 23:27:26,253 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 23:27:26,255 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 23:27:26,262 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 23:27:26,264 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 23:27:26,266 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 23:27:26,268 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 23:27:26,272 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 23:27:26,274 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 23:27:26,275 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 23:27:26,277 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 23:27:26,277 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 23:27:26,279 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 23:27:26,279 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 23:27:26,280 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 23:27:26,282 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 23:27:26,283 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 23:27:26,285 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 23:27:26,285 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 23:27:26,286 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 23:27:26,286 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 23:27:26,287 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 23:27:26,289 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 23:27:26,290 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 23:27:26,291 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-10-24 23:27:26,349 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 23:27:26,349 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 23:27:26,353 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-24 23:27:26,354 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-24 23:27:26,354 INFO L138 SettingsManager]: * Use SBE=true [2020-10-24 23:27:26,355 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 23:27:26,355 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 23:27:26,356 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 23:27:26,356 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 23:27:26,356 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 23:27:26,357 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 23:27:26,358 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 23:27:26,358 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-10-24 23:27:26,358 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-10-24 23:27:26,359 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 23:27:26,359 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 23:27:26,359 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 23:27:26,359 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 23:27:26,360 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 23:27:26,360 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-24 23:27:26,360 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 23:27:26,360 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 23:27:26,361 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 23:27:26,361 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 23:27:26,361 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-24 23:27:26,362 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-24 23:27:26,362 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-10-24 23:27:26,362 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-10-24 23:27:26,362 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 23:27:26,363 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-24 23:27:26,363 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-24 23:27:26,363 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_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 -> 72f53508ad2da2a8e23f1a2d8fc400a48c7a0120 [2020-10-24 23:27:26,762 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 23:27:26,821 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 23:27:26,825 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 23:27:26,828 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 23:27:26,829 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 23:27:26,830 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-floats-scientific-comp/loop1-1.c [2020-10-24 23:27:26,915 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b047b08c5/1065d92087fc487b854f541d51b9dd1e/FLAG4bd80f22c [2020-10-24 23:27:27,626 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 23:27:27,627 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-floats-scientific-comp/loop1-1.c [2020-10-24 23:27:27,636 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b047b08c5/1065d92087fc487b854f541d51b9dd1e/FLAG4bd80f22c [2020-10-24 23:27:27,982 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b047b08c5/1065d92087fc487b854f541d51b9dd1e [2020-10-24 23:27:27,985 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 23:27:27,993 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-24 23:27:27,995 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 23:27:27,995 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 23:27:28,001 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 23:27:28,003 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:27:27" (1/1) ... [2020-10-24 23:27:28,007 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c0b2cfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:28, skipping insertion in model container [2020-10-24 23:27:28,008 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:27:27" (1/1) ... [2020-10-24 23:27:28,017 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 23:27:28,034 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-24 23:27:28,222 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 23:27:28,239 INFO L203 MainTranslator]: Completed pre-run [2020-10-24 23:27:28,261 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 23:27:28,281 INFO L208 MainTranslator]: Completed translation [2020-10-24 23:27:28,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:28 WrapperNode [2020-10-24 23:27:28,282 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 23:27:28,284 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-24 23:27:28,284 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-24 23:27:28,284 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-24 23:27:28,293 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:28" (1/1) ... [2020-10-24 23:27:28,305 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:28" (1/1) ... [2020-10-24 23:27:28,336 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-24 23:27:28,338 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 23:27:28,338 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 23:27:28,339 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 23:27:28,348 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:28" (1/1) ... [2020-10-24 23:27:28,349 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:28" (1/1) ... [2020-10-24 23:27:28,358 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:28" (1/1) ... [2020-10-24 23:27:28,359 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:28" (1/1) ... [2020-10-24 23:27:28,379 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:28" (1/1) ... [2020-10-24 23:27:28,387 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:28" (1/1) ... [2020-10-24 23:27:28,391 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:28" (1/1) ... [2020-10-24 23:27:28,403 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 23:27:28,405 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 23:27:28,405 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 23:27:28,405 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 23:27:28,406 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory: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 [2020-10-24 23:27:28,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-10-24 23:27:28,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 23:27:28,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 23:27:28,500 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 23:27:31,498 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 23:27:31,499 INFO L298 CfgBuilder]: Removed 13 assume(true) statements. [2020-10-24 23:27:31,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:27:31 BoogieIcfgContainer [2020-10-24 23:27:31,503 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 23:27:31,515 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 23:27:31,516 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 23:27:31,525 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 23:27:31,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:27:27" (1/3) ... [2020-10-24 23:27:31,527 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3aec3b16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:27:31, skipping insertion in model container [2020-10-24 23:27:31,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:27:28" (2/3) ... [2020-10-24 23:27:31,527 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3aec3b16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:27:31, skipping insertion in model container [2020-10-24 23:27:31,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:27:31" (3/3) ... [2020-10-24 23:27:31,529 INFO L111 eAbstractionObserver]: Analyzing ICFG loop1-1.c [2020-10-24 23:27:31,545 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-24 23:27:31,550 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 23:27:31,565 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 23:27:31,592 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 23:27:31,592 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 23:27:31,593 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-24 23:27:31,593 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 23:27:31,593 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 23:27:31,593 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 23:27:31,593 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 23:27:31,594 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 23:27:31,608 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2020-10-24 23:27:31,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-24 23:27:31,614 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 23:27:31,615 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 23:27:31,615 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 23:27:31,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 23:27:31,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1235864049, now seen corresponding path program 1 times [2020-10-24 23:27:31,635 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 23:27:31,636 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1521384783] [2020-10-24 23:27:31,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-10-24 23:27:31,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 23:27:31,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 1 conjunts are in the unsatisfiable core [2020-10-24 23:27:31,977 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 23:27:31,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 23:27:31,994 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 23:27:31,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 23:27:32,000 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1521384783] [2020-10-24 23:27:32,001 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 23:27:32,001 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-10-24 23:27:32,002 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713740586] [2020-10-24 23:27:32,007 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-24 23:27:32,008 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 23:27:32,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-24 23:27:32,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-24 23:27:32,026 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 2 states. [2020-10-24 23:27:32,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 23:27:32,044 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2020-10-24 23:27:32,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-24 23:27:32,046 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-10-24 23:27:32,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 23:27:32,055 INFO L225 Difference]: With dead ends: 30 [2020-10-24 23:27:32,056 INFO L226 Difference]: Without dead ends: 12 [2020-10-24 23:27:32,059 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-24 23:27:32,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2020-10-24 23:27:32,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2020-10-24 23:27:32,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-10-24 23:27:32,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2020-10-24 23:27:32,097 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2020-10-24 23:27:32,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 23:27:32,098 INFO L481 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2020-10-24 23:27:32,098 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-24 23:27:32,099 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2020-10-24 23:27:32,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-24 23:27:32,099 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 23:27:32,099 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 23:27:32,316 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-10-24 23:27:32,316 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 23:27:32,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 23:27:32,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1503627718, now seen corresponding path program 1 times [2020-10-24 23:27:32,318 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 23:27:32,319 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1970611066] [2020-10-24 23:27:32,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-10-24 23:27:34,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 23:27:34,204 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 16 conjunts are in the unsatisfiable core [2020-10-24 23:27:34,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 23:27:35,127 WARN L193 SmtUtils]: Spent 690.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2020-10-24 23:27:35,144 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 23:27:35,730 WARN L193 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2020-10-24 23:27:36,777 WARN L193 SmtUtils]: Spent 688.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2020-10-24 23:27:36,782 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 23:27:37,653 WARN L193 SmtUtils]: Spent 287.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2020-10-24 23:28:07,143 WARN L193 SmtUtils]: Spent 22.46 s on a formula simplification that was a NOOP. DAG size: 27 [2020-10-24 23:28:09,259 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven ULTIMATE.start_main_~x~0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.lt .cse0 .cse1) (= c_ULTIMATE.start_main_~result~0 (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven .cse2 ULTIMATE.start_main_~x~0))))) (= (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven .cse1))) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) c_ULTIMATE.start_main_~exp~0) (fp.gt .cse0 (fp.neg .cse1))))) is different from false [2020-10-24 23:28:11,325 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven ULTIMATE.start_main_~x~0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.lt .cse0 .cse1) (= c_ULTIMATE.start_main_~result~0 (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven .cse2 ULTIMATE.start_main_~x~0))))) (= (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven .cse1))) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) c_ULTIMATE.start_main_~exp~0) (fp.gt .cse0 (fp.neg .cse1))))) is different from true [2020-10-24 23:28:11,334 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-24 23:28:21,808 WARN L838 $PredicateComparison]: unable to prove that (or (and (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven ULTIMATE.start_main_~x~0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.lt .cse0 .cse1) (not (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven .cse2 ULTIMATE.start_main_~x~0)))) (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven .cse1))) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))))) (fp.gt .cse0 (fp.neg .cse1))))) (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32))) (and (= (bvadd c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven ULTIMATE.start_main_~x~0)) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.lt .cse4 .cse5) (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse6 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse6 (fp.sub roundNearestTiesToEven .cse6 ULTIMATE.start_main_~x~0)))) (let ((.cse7 ((_ to_fp 8 24) roundNearestTiesToEven .cse5))) (fp.add roundNearestTiesToEven .cse7 (fp.mul roundNearestTiesToEven .cse7 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32))))))) (fp.gt .cse4 (fp.neg .cse5))))))) is different from false [2020-10-24 23:28:28,086 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven ULTIMATE.start_main_~x~0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.lt .cse0 .cse1) (not (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven .cse2 ULTIMATE.start_main_~x~0)))) (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven .cse1))) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))))) (fp.gt .cse0 (fp.neg .cse1))))) is different from false [2020-10-24 23:28:30,149 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven ULTIMATE.start_main_~x~0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.lt .cse0 .cse1) (not (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven .cse2 ULTIMATE.start_main_~x~0)))) (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven .cse1))) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))))) (fp.gt .cse0 (fp.neg .cse1))))) is different from true [2020-10-24 23:28:30,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 23:28:30,154 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 23:28:36,915 WARN L838 $PredicateComparison]: unable to prove that (fp.geq c_ULTIMATE.start_main_~result~0 (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~exp~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) is different from false [2020-10-24 23:28:40,316 WARN L838 $PredicateComparison]: unable to prove that (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~x~0)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) (fp.add c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32))))))) is different from false [2020-10-24 23:28:42,390 WARN L860 $PredicateComparison]: unable to prove that (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~x~0)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) (fp.add c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32))))))) is different from true [2020-10-24 23:29:31,549 WARN L193 SmtUtils]: Spent 12.44 s on a formula simplification that was a NOOP. DAG size: 21 [2020-10-24 23:29:31,557 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-24 23:29:33,651 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~x~0)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode .cse2))) (fp.add c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32))))))) (not (fp.lt ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0) .cse2)))) is different from false [2020-10-24 23:29:35,794 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~x~0)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode .cse2))) (fp.add c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32))))))) (not (fp.lt ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0) .cse2)))) is different from true [2020-10-24 23:29:37,882 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~x~0)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode .cse2))) (fp.add c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32))))))) (not (fp.lt ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0) .cse2)) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond))) is different from false [2020-10-24 23:29:39,965 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~x~0)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode .cse2))) (fp.add c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32))))))) (not (fp.lt ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0) .cse2)) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond))) is different from true [2020-10-24 23:29:39,975 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-24 23:29:42,050 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~x~0_7 (_ FloatingPoint 8 24))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode v_ULTIMATE.start_main_~x~0_7)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 v_ULTIMATE.start_main_~x~0_7)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode .cse2))) (fp.add c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_7 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32))))))) (not (fp.lt .cse3 .cse2)) (not (fp.gt .cse3 (fp.neg .cse2)))))) is different from false [2020-10-24 23:29:44,128 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~x~0_7 (_ FloatingPoint 8 24))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode v_ULTIMATE.start_main_~x~0_7)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 v_ULTIMATE.start_main_~x~0_7)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode .cse2))) (fp.add c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_7 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32))))))) (not (fp.lt .cse3 .cse2)) (not (fp.gt .cse3 (fp.neg .cse2)))))) is different from true [2020-10-24 23:29:44,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 23:29:44,131 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1970611066] [2020-10-24 23:29:44,131 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 23:29:44,131 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 18 [2020-10-24 23:29:44,131 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584200705] [2020-10-24 23:29:44,133 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-10-24 23:29:44,133 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 23:29:44,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-10-24 23:29:44,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=32, NotChecked=200, Total=342 [2020-10-24 23:29:44,138 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 19 states. [2020-10-24 23:29:48,424 WARN L838 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (forall ((v_ULTIMATE.start_main_~x~0_7 (_ FloatingPoint 8 24))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode v_ULTIMATE.start_main_~x~0_7)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 v_ULTIMATE.start_main_~x~0_7)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode .cse2))) (fp.add c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_7 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32))))))) (not (fp.lt .cse3 .cse2)) (not (fp.gt .cse3 (fp.neg .cse2))))))) is different from false [2020-10-24 23:29:50,503 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (forall ((v_ULTIMATE.start_main_~x~0_7 (_ FloatingPoint 8 24))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode v_ULTIMATE.start_main_~x~0_7)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 v_ULTIMATE.start_main_~x~0_7)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode .cse2))) (fp.add c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_7 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32))))))) (not (fp.lt .cse3 .cse2)) (not (fp.gt .cse3 (fp.neg .cse2))))))) is different from true [2020-10-24 23:29:54,521 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse4 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (or (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~x~0)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode .cse2))) (fp.add c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32))))))) (not (fp.lt .cse3 .cse2)) .cse4) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse5 (fp.gt .cse3 (fp.neg .cse2)))) (or (and .cse4 (not .cse5)) (and .cse5 (= (_ bv1 32) c_ULTIMATE.start_assume_abort_if_not_~cond)))))) is different from true [2020-10-24 23:29:56,604 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.gt .cse0 (fp.neg .cse1)) (= c_currentRoundingMode roundNearestTiesToEven) (or (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode .cse2 c_ULTIMATE.start_main_~x~0)))) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (fp.add c_currentRoundingMode .cse3 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32))))))) (not (fp.lt .cse0 .cse1))))) is different from false [2020-10-24 23:29:58,684 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.gt .cse0 (fp.neg .cse1)) (= c_currentRoundingMode roundNearestTiesToEven) (or (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode .cse2 c_ULTIMATE.start_main_~x~0)))) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (fp.add c_currentRoundingMode .cse3 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32))))))) (not (fp.lt .cse0 .cse1))))) is different from true [2020-10-24 23:30:00,767 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse1 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond))) (and (let ((.cse0 (fp.lt .cse2 .cse3))) (or (and (= (_ bv1 32) c_ULTIMATE.start_assume_abort_if_not_~cond) .cse0) (and (not .cse0) .cse1))) (fp.gt .cse2 (fp.neg .cse3)) (or (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse4 (fp.sub c_currentRoundingMode .cse4 c_ULTIMATE.start_main_~x~0)))) (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode .cse3))) (fp.add c_currentRoundingMode .cse5 (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32))))))) .cse1) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2020-10-24 23:30:02,850 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse1 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond))) (and (let ((.cse0 (fp.lt .cse2 .cse3))) (or (and (= (_ bv1 32) c_ULTIMATE.start_assume_abort_if_not_~cond) .cse0) (and (not .cse0) .cse1))) (fp.gt .cse2 (fp.neg .cse3)) (or (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse4 (fp.sub c_currentRoundingMode .cse4 c_ULTIMATE.start_main_~x~0)))) (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode .cse3))) (fp.add c_currentRoundingMode .cse5 (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32))))))) .cse1) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2020-10-24 23:30:04,975 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~x~0)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode .cse2))) (fp.add c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32))))))) (fp.gt .cse3 (fp.neg .cse2)) (= c_currentRoundingMode roundNearestTiesToEven) (fp.lt .cse3 .cse2))) is different from false [2020-10-24 23:30:07,058 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~x~0)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode .cse2))) (fp.add c_currentRoundingMode .cse1 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32))))))) (fp.gt .cse3 (fp.neg .cse2)) (= c_currentRoundingMode roundNearestTiesToEven) (fp.lt .cse3 .cse2))) is different from true [2020-10-24 23:30:09,177 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (and (fp.gt .cse0 (fp.neg .cse1)) (= c_ULTIMATE.start_main_~term~0 .cse2) (= (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode .cse3 c_ULTIMATE.start_main_~x~0)))) c_ULTIMATE.start_main_~result~0) (= c_currentRoundingMode roundNearestTiesToEven) (= (_ bv1 32) c_ULTIMATE.start_main_~count~0) (fp.lt .cse0 .cse1) (fp.geq c_ULTIMATE.start_main_~result~0 (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~exp~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (= .cse2 c_ULTIMATE.start_main_~exp~0)))) is different from false [2020-10-24 23:30:11,256 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (and (fp.gt .cse0 (fp.neg .cse1)) (= c_ULTIMATE.start_main_~term~0 .cse2) (= (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode .cse3 c_ULTIMATE.start_main_~x~0)))) c_ULTIMATE.start_main_~result~0) (= c_currentRoundingMode roundNearestTiesToEven) (= (_ bv1 32) c_ULTIMATE.start_main_~count~0) (fp.lt .cse0 .cse1) (fp.geq c_ULTIMATE.start_main_~result~0 (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~exp~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (= .cse2 c_ULTIMATE.start_main_~exp~0)))) is different from true [2020-10-24 23:30:13,337 WARN L838 $PredicateComparison]: unable to prove that (and (fp.geq c_ULTIMATE.start_main_~result~0 c_ULTIMATE.start_main_~exp~0) (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven ULTIMATE.start_main_~x~0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.lt .cse0 .cse1) (= c_ULTIMATE.start_main_~result~0 (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven .cse2 ULTIMATE.start_main_~x~0))))) (= (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven .cse1))) (fp.add roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) c_ULTIMATE.start_main_~exp~0) (fp.gt .cse0 (fp.neg .cse1)))))) is different from false [2020-10-24 23:30:15,422 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) (and (not .cse0) (or (and (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven ULTIMATE.start_main_~x~0)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.lt .cse1 .cse2) (not (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse3 (fp.sub roundNearestTiesToEven .cse3 ULTIMATE.start_main_~x~0)))) (let ((.cse4 ((_ to_fp 8 24) roundNearestTiesToEven .cse2))) (fp.add roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))))) (fp.gt .cse1 (fp.neg .cse2))))) .cse0) (and (= (bvadd c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven ULTIMATE.start_main_~x~0)) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.lt .cse5 .cse6) (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse7 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse7 (fp.sub roundNearestTiesToEven .cse7 ULTIMATE.start_main_~x~0)))) (let ((.cse8 ((_ to_fp 8 24) roundNearestTiesToEven .cse6))) (fp.add roundNearestTiesToEven .cse8 (fp.mul roundNearestTiesToEven .cse8 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32))))))) (fp.gt .cse5 (fp.neg .cse6))))))))) is different from false [2020-10-24 23:30:21,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 23:30:21,757 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2020-10-24 23:30:21,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-24 23:30:21,758 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 11 [2020-10-24 23:30:21,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 23:30:21,759 INFO L225 Difference]: With dead ends: 18 [2020-10-24 23:30:21,759 INFO L226 Difference]: Without dead ends: 14 [2020-10-24 23:30:21,761 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 146.4s TimeCoverageRelationStatistics Valid=60, Invalid=69, Unknown=45, NotChecked=528, Total=702 [2020-10-24 23:30:21,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-10-24 23:30:21,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-10-24 23:30:21,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-10-24 23:30:21,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2020-10-24 23:30:21,766 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2020-10-24 23:30:21,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 23:30:21,766 INFO L481 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2020-10-24 23:30:21,766 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-10-24 23:30:21,766 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2020-10-24 23:30:21,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-24 23:30:21,767 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 23:30:21,767 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 23:30:21,967 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-10-24 23:30:21,968 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 23:30:21,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 23:30:21,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1828550667, now seen corresponding path program 1 times [2020-10-24 23:30:21,971 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 23:30:21,971 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1653488666] [2020-10-24 23:30:21,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-10-24 23:30:27,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 23:30:27,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 19 conjunts are in the unsatisfiable core [2020-10-24 23:30:27,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 23:30:28,656 WARN L193 SmtUtils]: Spent 571.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2020-10-24 23:30:28,660 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 23:30:29,289 WARN L193 SmtUtils]: Spent 272.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2020-10-24 23:30:30,341 WARN L193 SmtUtils]: Spent 711.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2020-10-24 23:30:30,344 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 23:30:31,210 WARN L193 SmtUtils]: Spent 310.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2020-10-24 23:30:33,280 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (and (fp.gt .cse0 (fp.neg .cse1)) (= c_ULTIMATE.start_main_~term~0 .cse2) (= (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode .cse3 c_ULTIMATE.start_main_~x~0)))) c_ULTIMATE.start_main_~result~0) (= c_currentRoundingMode roundNearestTiesToEven) (= (_ bv1 32) c_ULTIMATE.start_main_~count~0) (fp.lt .cse0 .cse1) (= .cse2 c_ULTIMATE.start_main_~exp~0)))) is different from false [2020-10-24 23:30:35,598 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode .cse1)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0))) (and (fp.gt .cse0 (fp.neg .cse1)) (= (fp.add c_currentRoundingMode .cse2 c_ULTIMATE.start_main_~term~0) c_ULTIMATE.start_main_~exp~0) (= (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode .cse3 c_ULTIMATE.start_main_~x~0)))) c_ULTIMATE.start_main_~result~0) (= c_ULTIMATE.start_main_~term~0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32))))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.lt .cse0 .cse1) (= (_ bv2 32) c_ULTIMATE.start_main_~count~0)))) is different from false [2020-10-24 23:30:38,370 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven ULTIMATE.start_main_~x~0)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven .cse2))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse0 .cse1) (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32))))))) c_ULTIMATE.start_main_~exp~0) (fp.lt .cse3 .cse2) (= c_ULTIMATE.start_main_~result~0 (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse4 (fp.sub roundNearestTiesToEven .cse4 ULTIMATE.start_main_~x~0))))) (fp.gt .cse3 (fp.neg .cse2))))) is different from false [2020-10-24 23:30:40,450 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven ULTIMATE.start_main_~x~0)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven .cse2))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse0 .cse1) (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32))))))) c_ULTIMATE.start_main_~exp~0) (fp.lt .cse3 .cse2) (= c_ULTIMATE.start_main_~result~0 (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse4 (fp.sub roundNearestTiesToEven .cse4 ULTIMATE.start_main_~x~0))))) (fp.gt .cse3 (fp.neg .cse2))))) is different from true [2020-10-24 23:30:40,462 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-24 23:30:51,040 WARN L838 $PredicateComparison]: unable to prove that (or (and (= (bvadd c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven ULTIMATE.start_main_~x~0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.lt .cse0 .cse1) (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven .cse2 ULTIMATE.start_main_~x~0)))) (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven .cse1))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 .cse4) (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))))) (fp.gt .cse0 (fp.neg .cse1)))))) (and (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven ULTIMATE.start_main_~x~0)) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.lt .cse5 .cse6) (fp.gt .cse5 (fp.neg .cse6)) (not (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse7 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse7 (fp.sub roundNearestTiesToEven .cse7 ULTIMATE.start_main_~x~0)))) (let ((.cse8 ((_ to_fp 8 24) roundNearestTiesToEven .cse6))) (let ((.cse9 (fp.mul roundNearestTiesToEven .cse8 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse8 .cse9) (fp.mul roundNearestTiesToEven .cse9 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))))))))) (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) is different from false [2020-10-24 23:30:57,353 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven ULTIMATE.start_main_~x~0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.lt .cse0 .cse1) (fp.gt .cse0 (fp.neg .cse1)) (not (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven .cse2 ULTIMATE.start_main_~x~0)))) (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven .cse1))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 .cse4) (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))))))))) is different from false [2020-10-24 23:30:59,428 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven ULTIMATE.start_main_~x~0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.lt .cse0 .cse1) (fp.gt .cse0 (fp.neg .cse1)) (not (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven .cse2 ULTIMATE.start_main_~x~0)))) (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven .cse1))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 .cse4) (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))))))))) is different from true [2020-10-24 23:30:59,432 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2020-10-24 23:30:59,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 23:31:02,015 WARN L838 $PredicateComparison]: unable to prove that (fp.geq c_ULTIMATE.start_main_~result~0 (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~exp~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) is different from false [2020-10-24 23:31:04,088 WARN L860 $PredicateComparison]: unable to prove that (fp.geq c_ULTIMATE.start_main_~result~0 (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~exp~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) is different from true [2020-10-24 23:31:06,243 WARN L838 $PredicateComparison]: unable to prove that (fp.geq c_ULTIMATE.start_main_~result~0 (let ((.cse0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~exp~0 .cse0) (fp.mul c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32)))))))) is different from false [2020-10-24 23:31:08,386 WARN L860 $PredicateComparison]: unable to prove that (fp.geq c_ULTIMATE.start_main_~result~0 (let ((.cse0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~exp~0 .cse0) (fp.mul c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32)))))))) is different from true [2020-10-24 23:31:10,484 WARN L838 $PredicateComparison]: unable to prove that (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~x~0)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 .cse2) (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))))) is different from false [2020-10-24 23:31:12,573 WARN L860 $PredicateComparison]: unable to prove that (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~x~0)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 .cse2) (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))))) is different from true [2020-10-24 23:31:15,586 WARN L860 $PredicateComparison]: unable to prove that (or (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~x~0)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 .cse2) (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))))) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) is different from true [2020-10-24 23:31:15,591 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-24 23:31:17,714 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~x~0)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode .cse3))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 .cse2) (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))))) (not (fp.lt ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0) .cse3)))) is different from false [2020-10-24 23:31:19,815 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~x~0)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode .cse3))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 .cse2) (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))))) (not (fp.lt ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0) .cse3)))) is different from true [2020-10-24 23:31:21,912 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~x~0)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode .cse3))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 .cse2) (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))))) (not (fp.lt ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0) .cse3)) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond))) is different from false [2020-10-24 23:31:24,007 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~x~0)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode .cse3))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 .cse2) (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))))) (not (fp.lt ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0) .cse3)) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond))) is different from true [2020-10-24 23:31:24,013 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-24 23:31:26,115 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~x~0_8 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode v_ULTIMATE.start_main_~x~0_8)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.gt .cse0 (fp.neg .cse1))) (not (fp.lt .cse0 .cse1)) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode .cse2 v_ULTIMATE.start_main_~x~0_8)))) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_8 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 .cse4) (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_8 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32))))))))))) is different from false [2020-10-24 23:31:28,238 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~x~0_8 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode v_ULTIMATE.start_main_~x~0_8)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.gt .cse0 (fp.neg .cse1))) (not (fp.lt .cse0 .cse1)) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode .cse2 v_ULTIMATE.start_main_~x~0_8)))) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_8 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 .cse4) (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_8 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32))))))))))) is different from true [2020-10-24 23:31:28,240 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2020-10-24 23:31:28,240 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1653488666] [2020-10-24 23:31:28,240 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-24 23:31:28,241 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 20 [2020-10-24 23:31:28,241 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533406035] [2020-10-24 23:31:28,241 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-10-24 23:31:28,241 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 23:31:28,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-10-24 23:31:28,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=55, Unknown=20, NotChecked=300, Total=420 [2020-10-24 23:31:28,243 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 21 states. [2020-10-24 23:31:30,508 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~x~0_8 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode v_ULTIMATE.start_main_~x~0_8)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.gt .cse0 (fp.neg .cse1))) (not (fp.lt .cse0 .cse1)) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode .cse2 v_ULTIMATE.start_main_~x~0_8)))) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_8 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 .cse4) (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_8 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32))))))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2020-10-24 23:31:32,603 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~x~0_8 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode v_ULTIMATE.start_main_~x~0_8)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.gt .cse0 (fp.neg .cse1))) (not (fp.lt .cse0 .cse1)) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode .cse2 v_ULTIMATE.start_main_~x~0_8)))) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_8 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 .cse4) (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_8 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32))))))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2020-10-24 23:31:34,704 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (or (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~x~0)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode .cse3))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 .cse2) (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))))) (not (fp.lt .cse4 .cse3)) .cse5) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse6 (fp.gt .cse4 (fp.neg .cse3)))) (or (and .cse5 (not .cse6)) (and .cse6 (= (_ bv1 32) c_ULTIMATE.start_assume_abort_if_not_~cond)))))) is different from false [2020-10-24 23:31:38,753 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.gt .cse0 (fp.neg .cse1)) (= c_currentRoundingMode roundNearestTiesToEven) (or (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode .cse2 c_ULTIMATE.start_main_~x~0)))) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 .cse4) (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))))) (not (fp.lt .cse0 .cse1))))) is different from false [2020-10-24 23:31:40,853 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.gt .cse0 (fp.neg .cse1)) (= c_currentRoundingMode roundNearestTiesToEven) (or (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode .cse2 c_ULTIMATE.start_main_~x~0)))) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 .cse4) (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))))) (not (fp.lt .cse0 .cse1))))) is different from true [2020-10-24 23:31:42,950 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse1 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond))) (and (let ((.cse0 (fp.lt .cse2 .cse3))) (or (and (= (_ bv1 32) c_ULTIMATE.start_assume_abort_if_not_~cond) .cse0) (and (not .cse0) .cse1))) (fp.gt .cse2 (fp.neg .cse3)) (= c_currentRoundingMode roundNearestTiesToEven) (or (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse4 (fp.sub c_currentRoundingMode .cse4 c_ULTIMATE.start_main_~x~0)))) (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode .cse3))) (let ((.cse6 (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse5 .cse6) (fp.mul c_currentRoundingMode .cse6 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))))) .cse1))) is different from false [2020-10-24 23:31:47,012 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.gt .cse0 (fp.neg .cse1)) (= c_currentRoundingMode roundNearestTiesToEven) (fp.lt .cse0 .cse1) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode .cse2 c_ULTIMATE.start_main_~x~0)))) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 .cse4) (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))))))) is different from false [2020-10-24 23:31:50,919 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (and (fp.gt .cse0 (fp.neg .cse1)) (= c_ULTIMATE.start_main_~term~0 .cse2) (= (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode .cse3 c_ULTIMATE.start_main_~x~0)))) c_ULTIMATE.start_main_~result~0) (fp.geq c_ULTIMATE.start_main_~result~0 (let ((.cse4 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~exp~0 .cse4) (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32)))))))) (= c_currentRoundingMode roundNearestTiesToEven) (= (_ bv1 32) c_ULTIMATE.start_main_~count~0) (fp.lt .cse0 .cse1) (= .cse2 c_ULTIMATE.start_main_~exp~0)))) is different from false [2020-10-24 23:31:53,087 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (and (fp.gt .cse0 (fp.neg .cse1)) (= c_ULTIMATE.start_main_~term~0 .cse2) (= (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode .cse3 c_ULTIMATE.start_main_~x~0)))) c_ULTIMATE.start_main_~result~0) (fp.geq c_ULTIMATE.start_main_~result~0 (let ((.cse4 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~exp~0 .cse4) (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32)))))))) (= c_currentRoundingMode roundNearestTiesToEven) (= (_ bv1 32) c_ULTIMATE.start_main_~count~0) (fp.lt .cse0 .cse1) (= .cse2 c_ULTIMATE.start_main_~exp~0)))) is different from true [2020-10-24 23:31:55,188 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode .cse1)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0))) (and (fp.gt .cse0 (fp.neg .cse1)) (= (fp.add c_currentRoundingMode .cse2 c_ULTIMATE.start_main_~term~0) c_ULTIMATE.start_main_~exp~0) (= (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode .cse3 c_ULTIMATE.start_main_~x~0)))) c_ULTIMATE.start_main_~result~0) (= c_ULTIMATE.start_main_~term~0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32))))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.lt .cse0 .cse1) (fp.geq c_ULTIMATE.start_main_~result~0 (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~exp~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (= (_ bv2 32) c_ULTIMATE.start_main_~count~0)))) is different from false [2020-10-24 23:31:57,274 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode .cse1)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0))) (and (fp.gt .cse0 (fp.neg .cse1)) (= (fp.add c_currentRoundingMode .cse2 c_ULTIMATE.start_main_~term~0) c_ULTIMATE.start_main_~exp~0) (= (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode .cse3 c_ULTIMATE.start_main_~x~0)))) c_ULTIMATE.start_main_~result~0) (= c_ULTIMATE.start_main_~term~0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32))))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.lt .cse0 .cse1) (fp.geq c_ULTIMATE.start_main_~result~0 (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~exp~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (= (_ bv2 32) c_ULTIMATE.start_main_~count~0)))) is different from true [2020-10-24 23:31:59,376 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven ULTIMATE.start_main_~x~0)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven .cse2))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse0 .cse1) (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32))))))) c_ULTIMATE.start_main_~exp~0) (fp.lt .cse3 .cse2) (= c_ULTIMATE.start_main_~result~0 (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse4 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse4 (fp.sub roundNearestTiesToEven .cse4 ULTIMATE.start_main_~x~0))))) (fp.gt .cse3 (fp.neg .cse2))))) (fp.geq c_ULTIMATE.start_main_~result~0 c_ULTIMATE.start_main_~exp~0)) is different from false [2020-10-24 23:32:01,486 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) (and (not .cse0) (or (and (= (bvadd c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven ULTIMATE.start_main_~x~0)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.lt .cse1 .cse2) (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse3 (fp.sub roundNearestTiesToEven .cse3 ULTIMATE.start_main_~x~0)))) (let ((.cse4 ((_ to_fp 8 24) roundNearestTiesToEven .cse2))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse4 .cse5) (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))))) (fp.gt .cse1 (fp.neg .cse2)))))) (and (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse6 ((_ to_fp 11 53) roundNearestTiesToEven ULTIMATE.start_main_~x~0)) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.lt .cse6 .cse7) (fp.gt .cse6 (fp.neg .cse7)) (not (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse8 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse8 (fp.sub roundNearestTiesToEven .cse8 ULTIMATE.start_main_~x~0)))) (let ((.cse9 ((_ to_fp 8 24) roundNearestTiesToEven .cse7))) (let ((.cse10 (fp.mul roundNearestTiesToEven .cse9 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse9 .cse10) (fp.mul roundNearestTiesToEven .cse10 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))))))))) .cse0)))) is different from false [2020-10-24 23:32:03,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 23:32:03,344 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2020-10-24 23:32:03,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-24 23:32:03,345 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 13 [2020-10-24 23:32:03,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 23:32:03,346 INFO L225 Difference]: With dead ends: 20 [2020-10-24 23:32:03,346 INFO L226 Difference]: Without dead ends: 16 [2020-10-24 23:32:03,347 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 21 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 80.7s TimeCoverageRelationStatistics Valid=63, Invalid=60, Unknown=33, NotChecked=714, Total=870 [2020-10-24 23:32:03,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-10-24 23:32:03,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-10-24 23:32:03,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-10-24 23:32:03,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2020-10-24 23:32:03,352 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2020-10-24 23:32:03,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 23:32:03,353 INFO L481 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2020-10-24 23:32:03,353 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-10-24 23:32:03,353 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2020-10-24 23:32:03,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-24 23:32:03,354 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 23:32:03,354 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 23:32:03,554 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-10-24 23:32:03,555 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 23:32:03,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 23:32:03,557 INFO L82 PathProgramCache]: Analyzing trace with hash -546892048, now seen corresponding path program 2 times [2020-10-24 23:32:03,558 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 23:32:03,558 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [184994892] [2020-10-24 23:32:03,558 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-10-24 23:32:17,155 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-24 23:32:17,156 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-24 23:32:17,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 22 conjunts are in the unsatisfiable core [2020-10-24 23:32:17,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 23:32:18,076 WARN L193 SmtUtils]: Spent 700.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2020-10-24 23:32:18,078 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 23:32:18,605 WARN L193 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2020-10-24 23:32:19,633 WARN L193 SmtUtils]: Spent 685.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2020-10-24 23:32:19,636 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 23:32:20,505 WARN L193 SmtUtils]: Spent 320.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2020-10-24 23:32:49,649 WARN L193 SmtUtils]: Spent 20.90 s on a formula simplification that was a NOOP. DAG size: 27 [2020-10-24 23:32:51,734 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (and (fp.gt .cse0 (fp.neg .cse1)) (= (fp.add c_currentRoundingMode .cse2 c_ULTIMATE.start_main_~term~0) c_ULTIMATE.start_main_~exp~0) (= (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode .cse3 c_ULTIMATE.start_main_~x~0)))) c_ULTIMATE.start_main_~result~0) (= c_currentRoundingMode roundNearestTiesToEven) (fp.lt .cse0 .cse1) (= c_ULTIMATE.start_main_~term~0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32)))))) (= (_ bv2 32) c_ULTIMATE.start_main_~count~0)))) is different from false [2020-10-24 23:32:53,874 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse3 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967294 32))))))) (and (fp.gt .cse0 (fp.neg .cse1)) (= (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode .cse2 c_ULTIMATE.start_main_~x~0)))) c_ULTIMATE.start_main_~result~0) (= (_ bv3 32) c_ULTIMATE.start_main_~count~0) (= c_currentRoundingMode roundNearestTiesToEven) (fp.lt .cse0 .cse1) (= c_ULTIMATE.start_main_~term~0 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32)))))) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse4 .cse3) c_ULTIMATE.start_main_~term~0) c_ULTIMATE.start_main_~exp~0))))) is different from false [2020-10-24 23:32:58,149 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven ULTIMATE.start_main_~x~0)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= c_ULTIMATE.start_main_~exp~0 (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven .cse3))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse0 .cse1) .cse2) (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))))))) (fp.lt .cse4 .cse3) (= c_ULTIMATE.start_main_~result~0 (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse5 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse5 (fp.sub roundNearestTiesToEven .cse5 ULTIMATE.start_main_~x~0))))) (fp.gt .cse4 (fp.neg .cse3))))) is different from false [2020-10-24 23:33:00,606 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven ULTIMATE.start_main_~x~0)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= c_ULTIMATE.start_main_~exp~0 (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven .cse3))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse0 .cse1) .cse2) (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))))))) (fp.lt .cse4 .cse3) (= c_ULTIMATE.start_main_~result~0 (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse5 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse5 (fp.sub roundNearestTiesToEven .cse5 ULTIMATE.start_main_~x~0))))) (fp.gt .cse4 (fp.neg .cse3))))) is different from true [2020-10-24 23:33:00,611 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-24 23:33:13,562 WARN L838 $PredicateComparison]: unable to prove that (or (and (= (bvadd c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven ULTIMATE.start_main_~x~0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse0 (fp.sub roundNearestTiesToEven .cse0 ULTIMATE.start_main_~x~0)))) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven .cse4))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse1 .cse2) .cse3) (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))))))) (fp.lt .cse5 .cse4) (fp.gt .cse5 (fp.neg .cse4)))))) (and (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse11 ((_ to_fp 11 53) roundNearestTiesToEven ULTIMATE.start_main_~x~0)) (.cse10 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (not (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse6 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse6 (fp.sub roundNearestTiesToEven .cse6 ULTIMATE.start_main_~x~0)))) (let ((.cse7 ((_ to_fp 8 24) roundNearestTiesToEven .cse10))) (let ((.cse8 (fp.mul roundNearestTiesToEven .cse7 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) (let ((.cse9 (fp.mul roundNearestTiesToEven .cse8 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse7 .cse8) .cse9) (fp.mul roundNearestTiesToEven .cse9 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))))))) (fp.lt .cse11 .cse10) (fp.gt .cse11 (fp.neg .cse10))))) (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) is different from false [2020-10-24 23:33:21,048 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven ULTIMATE.start_main_~x~0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (not (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse0 (fp.sub roundNearestTiesToEven .cse0 ULTIMATE.start_main_~x~0)))) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven .cse4))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse1 .cse2) .cse3) (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))))))) (fp.lt .cse5 .cse4) (fp.gt .cse5 (fp.neg .cse4))))) is different from false [2020-10-24 23:33:23,514 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven ULTIMATE.start_main_~x~0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (not (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse0 (fp.sub roundNearestTiesToEven .cse0 ULTIMATE.start_main_~x~0)))) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven .cse4))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse1 .cse2) .cse3) (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))))))) (fp.lt .cse5 .cse4) (fp.gt .cse5 (fp.neg .cse4))))) is different from true [2020-10-24 23:33:23,518 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2020-10-24 23:33:23,518 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 23:33:30,298 WARN L838 $PredicateComparison]: unable to prove that (fp.geq c_ULTIMATE.start_main_~result~0 (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~exp~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) is different from false [2020-10-24 23:33:32,378 WARN L860 $PredicateComparison]: unable to prove that (fp.geq c_ULTIMATE.start_main_~result~0 (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~exp~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) is different from true [2020-10-24 23:33:34,529 WARN L838 $PredicateComparison]: unable to prove that (fp.geq c_ULTIMATE.start_main_~result~0 (let ((.cse0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~exp~0 .cse0) (fp.mul c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32)))))))) is different from false [2020-10-24 23:33:36,686 WARN L860 $PredicateComparison]: unable to prove that (fp.geq c_ULTIMATE.start_main_~result~0 (let ((.cse0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~exp~0 .cse0) (fp.mul c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32)))))))) is different from true [2020-10-24 23:33:38,910 WARN L838 $PredicateComparison]: unable to prove that (fp.geq c_ULTIMATE.start_main_~result~0 (let ((.cse0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (let ((.cse1 (fp.mul c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~exp~0 .cse0) .cse1) (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))))) is different from false [2020-10-24 23:33:41,131 WARN L860 $PredicateComparison]: unable to prove that (fp.geq c_ULTIMATE.start_main_~result~0 (let ((.cse0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (let ((.cse1 (fp.mul c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~exp~0 .cse0) .cse1) (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))))) is different from true [2020-10-24 23:33:43,647 WARN L838 $PredicateComparison]: unable to prove that (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~x~0)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 .cse2) .cse3) (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32))))))))) is different from false [2020-10-24 23:33:46,145 WARN L860 $PredicateComparison]: unable to prove that (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~x~0)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 .cse2) .cse3) (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32))))))))) is different from true [2020-10-24 23:33:48,643 WARN L838 $PredicateComparison]: unable to prove that (or (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~x~0)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 .cse2) .cse3) (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32))))))))) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) is different from false [2020-10-24 23:33:51,138 WARN L860 $PredicateComparison]: unable to prove that (or (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~x~0)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 .cse2) .cse3) (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32))))))))) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) is different from true [2020-10-24 23:33:51,143 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-24 23:33:53,642 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~x~0)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode .cse4))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 .cse2) .cse3) (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32))))))))) (not (fp.lt ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0) .cse4)))) is different from false [2020-10-24 23:33:56,143 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~x~0)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode .cse4))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 .cse2) .cse3) (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32))))))))) (not (fp.lt ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0) .cse4)))) is different from true [2020-10-24 23:33:58,655 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~x~0)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode .cse4))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 .cse2) .cse3) (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32))))))))) (not (fp.lt ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0) .cse4)) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond))) is different from false [2020-10-24 23:34:01,164 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~x~0)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode .cse4))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 .cse2) .cse3) (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32))))))))) (not (fp.lt ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0) .cse4)) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond))) is different from true [2020-10-24 23:34:01,169 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-24 23:34:03,635 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~x~0_9 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode v_ULTIMATE.start_main_~x~0_9)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.gt .cse0 (fp.neg .cse1))) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode .cse2 v_ULTIMATE.start_main_~x~0_9)))) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_9 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (let ((.cse5 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_9 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 .cse4) .cse5) (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_9 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32))))))))) (not (fp.lt .cse0 .cse1))))) is different from false [2020-10-24 23:34:06,111 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~x~0_9 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode v_ULTIMATE.start_main_~x~0_9)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.gt .cse0 (fp.neg .cse1))) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode .cse2 v_ULTIMATE.start_main_~x~0_9)))) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_9 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (let ((.cse5 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_9 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 .cse4) .cse5) (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_9 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32))))))))) (not (fp.lt .cse0 .cse1))))) is different from true [2020-10-24 23:34:06,113 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2020-10-24 23:34:06,114 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [184994892] [2020-10-24 23:34:06,114 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-24 23:34:06,114 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2020-10-24 23:34:06,114 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582357437] [2020-10-24 23:34:06,115 INFO L461 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-10-24 23:34:06,115 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 23:34:06,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-10-24 23:34:06,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=64, Unknown=26, NotChecked=364, Total=506 [2020-10-24 23:34:06,118 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 23 states. [2020-10-24 23:34:08,685 WARN L838 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (forall ((v_ULTIMATE.start_main_~x~0_9 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode v_ULTIMATE.start_main_~x~0_9)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.gt .cse0 (fp.neg .cse1))) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode .cse2 v_ULTIMATE.start_main_~x~0_9)))) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_9 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (let ((.cse5 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_9 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 .cse4) .cse5) (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_9 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32))))))))) (not (fp.lt .cse0 .cse1)))))) is different from false [2020-10-24 23:34:11,139 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (forall ((v_ULTIMATE.start_main_~x~0_9 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode v_ULTIMATE.start_main_~x~0_9)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.gt .cse0 (fp.neg .cse1))) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode .cse2 v_ULTIMATE.start_main_~x~0_9)))) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_9 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (let ((.cse5 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_9 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 .cse4) .cse5) (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_9 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32))))))))) (not (fp.lt .cse0 .cse1)))))) is different from true [2020-10-24 23:34:13,604 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= c_currentRoundingMode roundNearestTiesToEven) (or (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~x~0)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode .cse4))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 .cse2) .cse3) (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32))))))))) (not (fp.lt .cse5 .cse4)) .cse6) (let ((.cse7 (fp.gt .cse5 (fp.neg .cse4)))) (or (and .cse6 (not .cse7)) (and .cse7 (= (_ bv1 32) c_ULTIMATE.start_assume_abort_if_not_~cond)))))) is different from false [2020-10-24 23:34:16,064 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse6 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= c_currentRoundingMode roundNearestTiesToEven) (or (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~x~0)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode .cse4))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 .cse2) .cse3) (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32))))))))) (not (fp.lt .cse5 .cse4)) .cse6) (let ((.cse7 (fp.gt .cse5 (fp.neg .cse4)))) (or (and .cse6 (not .cse7)) (and .cse7 (= (_ bv1 32) c_ULTIMATE.start_assume_abort_if_not_~cond)))))) is different from true [2020-10-24 23:34:18,530 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (or (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~x~0)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode .cse4))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 .cse2) .cse3) (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32))))))))) (not (fp.lt .cse5 .cse4))) (fp.gt .cse5 (fp.neg .cse4)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2020-10-24 23:34:20,994 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (or (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~x~0)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode .cse4))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 .cse2) .cse3) (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32))))))))) (not (fp.lt .cse5 .cse4))) (fp.gt .cse5 (fp.neg .cse4)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2020-10-24 23:34:25,820 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse1 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond))) (and (let ((.cse0 (fp.lt .cse2 .cse3))) (or (and (= (_ bv1 32) c_ULTIMATE.start_assume_abort_if_not_~cond) .cse0) (and (not .cse0) .cse1))) (fp.gt .cse2 (fp.neg .cse3)) (= c_currentRoundingMode roundNearestTiesToEven) (or (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse4 (fp.sub c_currentRoundingMode .cse4 c_ULTIMATE.start_main_~x~0)))) (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode .cse3))) (let ((.cse6 (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (let ((.cse7 (fp.mul c_currentRoundingMode .cse6 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse5 .cse6) .cse7) (fp.mul c_currentRoundingMode .cse7 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32))))))))) .cse1))) is different from true [2020-10-24 23:34:28,288 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.gt .cse0 (fp.neg .cse1)) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode .cse2 c_ULTIMATE.start_main_~x~0)))) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (let ((.cse5 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 .cse4) .cse5) (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32))))))))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.lt .cse0 .cse1))) is different from false [2020-10-24 23:34:30,755 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.gt .cse0 (fp.neg .cse1)) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode .cse2 c_ULTIMATE.start_main_~x~0)))) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (let ((.cse5 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 .cse4) .cse5) (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32))))))))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.lt .cse0 .cse1))) is different from true [2020-10-24 23:34:33,235 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse4 ((_ to_fp 8 24) c_currentRoundingMode .cse3))) (and (fp.geq c_ULTIMATE.start_main_~result~0 (let ((.cse0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (let ((.cse1 (fp.mul c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~exp~0 .cse0) .cse1) (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))))) (fp.gt .cse2 (fp.neg .cse3)) (= c_ULTIMATE.start_main_~term~0 .cse4) (= (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse5 (fp.sub c_currentRoundingMode .cse5 c_ULTIMATE.start_main_~x~0)))) c_ULTIMATE.start_main_~result~0) (= c_currentRoundingMode roundNearestTiesToEven) (= (_ bv1 32) c_ULTIMATE.start_main_~count~0) (fp.lt .cse2 .cse3) (= .cse4 c_ULTIMATE.start_main_~exp~0)))) is different from false [2020-10-24 23:34:35,448 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse4 ((_ to_fp 8 24) c_currentRoundingMode .cse3))) (and (fp.geq c_ULTIMATE.start_main_~result~0 (let ((.cse0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (let ((.cse1 (fp.mul c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~exp~0 .cse0) .cse1) (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))))) (fp.gt .cse2 (fp.neg .cse3)) (= c_ULTIMATE.start_main_~term~0 .cse4) (= (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse5 (fp.sub c_currentRoundingMode .cse5 c_ULTIMATE.start_main_~x~0)))) c_ULTIMATE.start_main_~result~0) (= c_currentRoundingMode roundNearestTiesToEven) (= (_ bv1 32) c_ULTIMATE.start_main_~count~0) (fp.lt .cse2 .cse3) (= .cse4 c_ULTIMATE.start_main_~exp~0)))) is different from true [2020-10-24 23:34:37,906 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (and (fp.gt .cse0 (fp.neg .cse1)) (= (fp.add c_currentRoundingMode .cse2 c_ULTIMATE.start_main_~term~0) c_ULTIMATE.start_main_~exp~0) (= (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode .cse3 c_ULTIMATE.start_main_~x~0)))) c_ULTIMATE.start_main_~result~0) (fp.geq c_ULTIMATE.start_main_~result~0 (let ((.cse4 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~exp~0 .cse4) (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32)))))))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.lt .cse0 .cse1) (= c_ULTIMATE.start_main_~term~0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32)))))) (= (_ bv2 32) c_ULTIMATE.start_main_~count~0)))) is different from false [2020-10-24 23:34:40,055 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (and (fp.gt .cse0 (fp.neg .cse1)) (= (fp.add c_currentRoundingMode .cse2 c_ULTIMATE.start_main_~term~0) c_ULTIMATE.start_main_~exp~0) (= (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode .cse3 c_ULTIMATE.start_main_~x~0)))) c_ULTIMATE.start_main_~result~0) (fp.geq c_ULTIMATE.start_main_~result~0 (let ((.cse4 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~exp~0 .cse4) (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32)))))))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.lt .cse0 .cse1) (= c_ULTIMATE.start_main_~term~0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32)))))) (= (_ bv2 32) c_ULTIMATE.start_main_~count~0)))) is different from true [2020-10-24 23:34:42,535 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse3 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967294 32))))))) (and (fp.gt .cse0 (fp.neg .cse1)) (= (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode .cse2 c_ULTIMATE.start_main_~x~0)))) c_ULTIMATE.start_main_~result~0) (= (_ bv3 32) c_ULTIMATE.start_main_~count~0) (= c_currentRoundingMode roundNearestTiesToEven) (fp.lt .cse0 .cse1) (fp.geq c_ULTIMATE.start_main_~result~0 (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~exp~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (= c_ULTIMATE.start_main_~term~0 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32)))))) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse4 .cse3) c_ULTIMATE.start_main_~term~0) c_ULTIMATE.start_main_~exp~0))))) is different from false [2020-10-24 23:34:44,618 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse3 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967294 32))))))) (and (fp.gt .cse0 (fp.neg .cse1)) (= (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode .cse2 c_ULTIMATE.start_main_~x~0)))) c_ULTIMATE.start_main_~result~0) (= (_ bv3 32) c_ULTIMATE.start_main_~count~0) (= c_currentRoundingMode roundNearestTiesToEven) (fp.lt .cse0 .cse1) (fp.geq c_ULTIMATE.start_main_~result~0 (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~exp~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (= c_ULTIMATE.start_main_~term~0 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32)))))) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse4 .cse3) c_ULTIMATE.start_main_~term~0) c_ULTIMATE.start_main_~exp~0))))) is different from true [2020-10-24 23:34:47,085 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven ULTIMATE.start_main_~x~0)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= c_ULTIMATE.start_main_~exp~0 (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven .cse3))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse0 .cse1) .cse2) (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))))))) (fp.lt .cse4 .cse3) (= c_ULTIMATE.start_main_~result~0 (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse5 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse5 (fp.sub roundNearestTiesToEven .cse5 ULTIMATE.start_main_~x~0))))) (fp.gt .cse4 (fp.neg .cse3))))) (fp.geq c_ULTIMATE.start_main_~result~0 c_ULTIMATE.start_main_~exp~0)) is different from false [2020-10-24 23:34:49,572 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse12 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) (and (or (and (= (bvadd c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven ULTIMATE.start_main_~x~0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse0 (fp.sub roundNearestTiesToEven .cse0 ULTIMATE.start_main_~x~0)))) (let ((.cse1 ((_ to_fp 8 24) roundNearestTiesToEven .cse4))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse1 .cse2) .cse3) (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32))))))))) (fp.lt .cse5 .cse4) (fp.gt .cse5 (fp.neg .cse4)))))) (and (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse11 ((_ to_fp 11 53) roundNearestTiesToEven ULTIMATE.start_main_~x~0)) (.cse10 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (not (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse6 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse6 (fp.sub roundNearestTiesToEven .cse6 ULTIMATE.start_main_~x~0)))) (let ((.cse7 ((_ to_fp 8 24) roundNearestTiesToEven .cse10))) (let ((.cse8 (fp.mul roundNearestTiesToEven .cse7 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) (let ((.cse9 (fp.mul roundNearestTiesToEven .cse8 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse7 .cse8) .cse9) (fp.mul roundNearestTiesToEven .cse9 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))))))) (fp.lt .cse11 .cse10) (fp.gt .cse11 (fp.neg .cse10))))) .cse12)) (not .cse12))) is different from false [2020-10-24 23:34:53,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 23:34:53,658 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2020-10-24 23:34:53,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-24 23:34:53,666 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 15 [2020-10-24 23:34:53,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 23:34:53,667 INFO L225 Difference]: With dead ends: 22 [2020-10-24 23:34:53,667 INFO L226 Difference]: Without dead ends: 18 [2020-10-24 23:34:53,668 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 23 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 137.1s TimeCoverageRelationStatistics Valid=72, Invalid=67, Unknown=43, NotChecked=874, Total=1056 [2020-10-24 23:34:53,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-10-24 23:34:53,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-10-24 23:34:53,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-10-24 23:34:53,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2020-10-24 23:34:53,672 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2020-10-24 23:34:53,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 23:34:53,673 INFO L481 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2020-10-24 23:34:53,673 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-10-24 23:34:53,673 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2020-10-24 23:34:53,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-24 23:34:53,674 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 23:34:53,674 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 23:34:53,874 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-10-24 23:34:53,875 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 23:34:53,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 23:34:53,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1528573141, now seen corresponding path program 3 times [2020-10-24 23:34:53,877 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 23:34:53,877 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1371380841] [2020-10-24 23:34:53,878 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-10-24 23:35:17,722 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-10-24 23:35:17,723 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-24 23:35:17,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 25 conjunts are in the unsatisfiable core [2020-10-24 23:35:17,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 23:35:18,478 WARN L193 SmtUtils]: Spent 512.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2020-10-24 23:35:18,480 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 23:35:19,029 WARN L193 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2020-10-24 23:35:19,796 WARN L193 SmtUtils]: Spent 483.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2020-10-24 23:35:19,799 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 23:35:20,495 WARN L193 SmtUtils]: Spent 282.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2020-10-24 23:35:46,847 WARN L193 SmtUtils]: Spent 19.65 s on a formula simplification that was a NOOP. DAG size: 27 [2020-10-24 23:35:48,927 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (and (fp.gt .cse0 (fp.neg .cse1)) (= (fp.add c_currentRoundingMode .cse2 c_ULTIMATE.start_main_~term~0) c_ULTIMATE.start_main_~exp~0) (= (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode .cse3 c_ULTIMATE.start_main_~x~0)))) c_ULTIMATE.start_main_~result~0) (= c_currentRoundingMode roundNearestTiesToEven) (fp.lt .cse0 .cse1) (= c_ULTIMATE.start_main_~term~0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32)))))) (= (_ bv2 32) c_ULTIMATE.start_main_~count~0)))) is different from false [2020-10-24 23:35:50,994 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (and (fp.gt .cse0 (fp.neg .cse1)) (= (fp.add c_currentRoundingMode .cse2 c_ULTIMATE.start_main_~term~0) c_ULTIMATE.start_main_~exp~0) (= (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode .cse3 c_ULTIMATE.start_main_~x~0)))) c_ULTIMATE.start_main_~result~0) (= c_currentRoundingMode roundNearestTiesToEven) (fp.lt .cse0 .cse1) (= c_ULTIMATE.start_main_~term~0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32)))))) (= (_ bv2 32) c_ULTIMATE.start_main_~count~0)))) is different from true [2020-10-24 23:35:53,095 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse3 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967294 32))))))) (and (fp.gt .cse0 (fp.neg .cse1)) (= (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode .cse2 c_ULTIMATE.start_main_~x~0)))) c_ULTIMATE.start_main_~result~0) (= (_ bv3 32) c_ULTIMATE.start_main_~count~0) (= c_currentRoundingMode roundNearestTiesToEven) (fp.lt .cse0 .cse1) (= c_ULTIMATE.start_main_~term~0 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32)))))) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse4 .cse3) c_ULTIMATE.start_main_~term~0) c_ULTIMATE.start_main_~exp~0))))) is different from false [2020-10-24 23:35:55,382 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse3 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967294 32))))))) (and (fp.gt .cse0 (fp.neg .cse1)) (= (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode .cse2 c_ULTIMATE.start_main_~x~0)))) c_ULTIMATE.start_main_~result~0) (= (_ bv3 32) c_ULTIMATE.start_main_~count~0) (= c_currentRoundingMode roundNearestTiesToEven) (fp.lt .cse0 .cse1) (= c_ULTIMATE.start_main_~term~0 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32)))))) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse4 .cse3) c_ULTIMATE.start_main_~term~0) c_ULTIMATE.start_main_~exp~0))))) is different from true [2020-10-24 23:35:57,871 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967293 32))))))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse5 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967294 32))))))) (and (fp.gt .cse0 (fp.neg .cse1)) (= (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode .cse2 c_ULTIMATE.start_main_~x~0)))) c_ULTIMATE.start_main_~result~0) (= c_currentRoundingMode roundNearestTiesToEven) (fp.lt .cse0 .cse1) (= c_ULTIMATE.start_main_~exp~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 .cse4) .cse5) c_ULTIMATE.start_main_~term~0)) (= c_ULTIMATE.start_main_~term~0 (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32)))))) (= (_ bv4 32) c_ULTIMATE.start_main_~count~0)))))) is different from false [2020-10-24 23:36:00,435 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven ULTIMATE.start_main_~x~0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven .cse4))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse0 .cse1) .cse2) .cse3) (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32))))))))) c_ULTIMATE.start_main_~exp~0) (fp.lt .cse5 .cse4) (= c_ULTIMATE.start_main_~result~0 (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse6 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse6 (fp.sub roundNearestTiesToEven .cse6 ULTIMATE.start_main_~x~0))))) (fp.gt .cse5 (fp.neg .cse4))))) is different from false [2020-10-24 23:36:02,882 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven ULTIMATE.start_main_~x~0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven .cse4))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse0 .cse1) .cse2) .cse3) (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32))))))))) c_ULTIMATE.start_main_~exp~0) (fp.lt .cse5 .cse4) (= c_ULTIMATE.start_main_~result~0 (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse6 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse6 (fp.sub roundNearestTiesToEven .cse6 ULTIMATE.start_main_~x~0))))) (fp.gt .cse5 (fp.neg .cse4))))) is different from true [2020-10-24 23:36:02,887 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-24 23:36:15,871 WARN L838 $PredicateComparison]: unable to prove that (or (and (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven ULTIMATE.start_main_~x~0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.lt .cse0 .cse1) (not (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven .cse2 ULTIMATE.start_main_~x~0)))) (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven .cse1))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse6 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 .cse4) .cse5) .cse6) (fp.mul roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32))))))))))) (fp.gt .cse0 (fp.neg .cse1))))) (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32))) (and (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse7 ((_ to_fp 11 53) roundNearestTiesToEven ULTIMATE.start_main_~x~0)) (.cse8 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.lt .cse7 .cse8) (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse9 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse9 (fp.sub roundNearestTiesToEven .cse9 ULTIMATE.start_main_~x~0)))) (let ((.cse10 ((_ to_fp 8 24) roundNearestTiesToEven .cse8))) (let ((.cse11 (fp.mul roundNearestTiesToEven .cse10 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) (let ((.cse12 (fp.mul roundNearestTiesToEven .cse11 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse13 (fp.mul roundNearestTiesToEven .cse12 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse10 .cse11) .cse12) .cse13) (fp.mul roundNearestTiesToEven .cse13 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))))))) (fp.gt .cse7 (fp.neg .cse8))))) (= (bvadd c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)))) is different from false [2020-10-24 23:36:23,374 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven ULTIMATE.start_main_~x~0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.lt .cse0 .cse1) (not (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven .cse2 ULTIMATE.start_main_~x~0)))) (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven .cse1))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse6 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 .cse4) .cse5) .cse6) (fp.mul roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32))))))))))) (fp.gt .cse0 (fp.neg .cse1))))) is different from false [2020-10-24 23:36:25,828 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven ULTIMATE.start_main_~x~0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.lt .cse0 .cse1) (not (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven .cse2 ULTIMATE.start_main_~x~0)))) (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven .cse1))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse6 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 .cse4) .cse5) .cse6) (fp.mul roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32))))))))))) (fp.gt .cse0 (fp.neg .cse1))))) is different from true [2020-10-24 23:36:25,832 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2020-10-24 23:36:25,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 23:36:32,467 WARN L838 $PredicateComparison]: unable to prove that (fp.geq c_ULTIMATE.start_main_~result~0 (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~exp~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) is different from false [2020-10-24 23:36:34,549 WARN L860 $PredicateComparison]: unable to prove that (fp.geq c_ULTIMATE.start_main_~result~0 (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~exp~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) is different from true [2020-10-24 23:36:36,708 WARN L838 $PredicateComparison]: unable to prove that (fp.geq c_ULTIMATE.start_main_~result~0 (let ((.cse0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~exp~0 .cse0) (fp.mul c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32)))))))) is different from false [2020-10-24 23:36:38,866 WARN L860 $PredicateComparison]: unable to prove that (fp.geq c_ULTIMATE.start_main_~result~0 (let ((.cse0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~exp~0 .cse0) (fp.mul c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32)))))))) is different from true [2020-10-24 23:36:41,123 WARN L838 $PredicateComparison]: unable to prove that (fp.geq c_ULTIMATE.start_main_~result~0 (let ((.cse0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (let ((.cse1 (fp.mul c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~exp~0 .cse0) .cse1) (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))))) is different from false [2020-10-24 23:36:43,356 WARN L860 $PredicateComparison]: unable to prove that (fp.geq c_ULTIMATE.start_main_~result~0 (let ((.cse0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (let ((.cse1 (fp.mul c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~exp~0 .cse0) .cse1) (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))))) is different from true [2020-10-24 23:36:45,691 WARN L838 $PredicateComparison]: unable to prove that (fp.geq c_ULTIMATE.start_main_~result~0 (let ((.cse0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (let ((.cse1 (fp.mul c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~exp~0 .cse0) .cse1) .cse2) (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32)))))))))) is different from false [2020-10-24 23:36:48,001 WARN L860 $PredicateComparison]: unable to prove that (fp.geq c_ULTIMATE.start_main_~result~0 (let ((.cse0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (let ((.cse1 (fp.mul c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~exp~0 .cse0) .cse1) .cse2) (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32)))))))))) is different from true [2020-10-24 23:36:50,492 WARN L838 $PredicateComparison]: unable to prove that (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~x~0)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 .cse2) .cse3) .cse4) (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))))))) is different from false [2020-10-24 23:36:52,981 WARN L860 $PredicateComparison]: unable to prove that (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~x~0)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 .cse2) .cse3) .cse4) (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))))))) is different from true [2020-10-24 23:36:55,477 WARN L838 $PredicateComparison]: unable to prove that (or (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~x~0)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 .cse2) .cse3) .cse4) (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32))))))))))) is different from false [2020-10-24 23:36:57,966 WARN L860 $PredicateComparison]: unable to prove that (or (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~x~0)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 .cse2) .cse3) .cse4) (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32))))))))))) is different from true [2020-10-24 23:36:57,969 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-24 23:37:00,475 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.lt ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0) .cse0)) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode .cse1 c_ULTIMATE.start_main_~x~0)))) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode .cse0))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse5 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 .cse3) .cse4) .cse5) (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))))))))) is different from false [2020-10-24 23:37:02,979 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.lt ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0) .cse0)) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode .cse1 c_ULTIMATE.start_main_~x~0)))) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode .cse0))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse5 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 .cse3) .cse4) .cse5) (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))))))))) is different from true [2020-10-24 23:37:05,479 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.lt ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0) .cse0)) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode .cse1 c_ULTIMATE.start_main_~x~0)))) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode .cse0))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse5 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 .cse3) .cse4) .cse5) (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))))))))) is different from false [2020-10-24 23:37:07,980 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.lt ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0) .cse0)) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode .cse1 c_ULTIMATE.start_main_~x~0)))) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode .cse0))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse5 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 .cse3) .cse4) .cse5) (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))))))))) is different from true [2020-10-24 23:37:07,985 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-24 23:37:10,467 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~x~0_10 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode v_ULTIMATE.start_main_~x~0_10)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.lt .cse0 .cse1)) (not (fp.gt .cse0 (fp.neg .cse1))) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode .cse2 v_ULTIMATE.start_main_~x~0_10)))) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_10 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (let ((.cse5 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_10 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse6 (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_10 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 .cse4) .cse5) .cse6) (fp.mul c_currentRoundingMode .cse6 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_10 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32))))))))))))) is different from false [2020-10-24 23:37:12,972 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~x~0_10 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode v_ULTIMATE.start_main_~x~0_10)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.lt .cse0 .cse1)) (not (fp.gt .cse0 (fp.neg .cse1))) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode .cse2 v_ULTIMATE.start_main_~x~0_10)))) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_10 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (let ((.cse5 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_10 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse6 (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_10 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 .cse4) .cse5) .cse6) (fp.mul c_currentRoundingMode .cse6 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_10 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32))))))))))))) is different from true [2020-10-24 23:37:12,975 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2020-10-24 23:37:12,975 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1371380841] [2020-10-24 23:37:12,975 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-24 23:37:12,976 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 24 [2020-10-24 23:37:12,976 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267571698] [2020-10-24 23:37:12,976 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-10-24 23:37:12,977 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 23:37:12,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-10-24 23:37:12,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=64, Unknown=30, NotChecked=450, Total=600 [2020-10-24 23:37:12,978 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 25 states. [2020-10-24 23:37:15,559 WARN L838 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (forall ((v_ULTIMATE.start_main_~x~0_10 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode v_ULTIMATE.start_main_~x~0_10)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.lt .cse0 .cse1)) (not (fp.gt .cse0 (fp.neg .cse1))) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode .cse2 v_ULTIMATE.start_main_~x~0_10)))) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_10 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (let ((.cse5 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_10 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse6 (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_10 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 .cse4) .cse5) .cse6) (fp.mul c_currentRoundingMode .cse6 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_10 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))))))))))) is different from false [2020-10-24 23:37:18,053 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (forall ((v_ULTIMATE.start_main_~x~0_10 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode v_ULTIMATE.start_main_~x~0_10)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.lt .cse0 .cse1)) (not (fp.gt .cse0 (fp.neg .cse1))) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode .cse2 v_ULTIMATE.start_main_~x~0_10)))) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_10 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (let ((.cse5 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_10 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse6 (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_10 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 .cse4) .cse5) .cse6) (fp.mul c_currentRoundingMode .cse6 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_10 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))))))))))) is different from true [2020-10-24 23:37:20,555 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (or (not (fp.lt .cse0 .cse1)) .cse2 (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode .cse3 c_ULTIMATE.start_main_~x~0)))) (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (let ((.cse5 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (let ((.cse6 (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse7 (fp.mul c_currentRoundingMode .cse6 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse4 .cse5) .cse6) .cse7) (fp.mul c_currentRoundingMode .cse7 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32))))))))))) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse8 (fp.gt .cse0 (fp.neg .cse1)))) (or (and .cse2 (not .cse8)) (and .cse8 (= (_ bv1 32) c_ULTIMATE.start_assume_abort_if_not_~cond)))))) is different from false [2020-10-24 23:37:23,055 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (or (not (fp.lt .cse0 .cse1)) .cse2 (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode .cse3 c_ULTIMATE.start_main_~x~0)))) (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (let ((.cse5 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (let ((.cse6 (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse7 (fp.mul c_currentRoundingMode .cse6 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse4 .cse5) .cse6) .cse7) (fp.mul c_currentRoundingMode .cse7 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32))))))))))) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse8 (fp.gt .cse0 (fp.neg .cse1)))) (or (and .cse2 (not .cse8)) (and .cse8 (= (_ bv1 32) c_ULTIMATE.start_assume_abort_if_not_~cond)))))) is different from true [2020-10-24 23:37:25,555 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.gt .cse0 (fp.neg .cse1)) (= c_currentRoundingMode roundNearestTiesToEven) (or (not (fp.lt .cse0 .cse1)) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode .cse2 c_ULTIMATE.start_main_~x~0)))) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (let ((.cse5 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse6 (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 .cse4) .cse5) .cse6) (fp.mul c_currentRoundingMode .cse6 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32))))))))))))) is different from false [2020-10-24 23:37:28,064 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.gt .cse0 (fp.neg .cse1)) (= c_currentRoundingMode roundNearestTiesToEven) (or (not (fp.lt .cse0 .cse1)) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode .cse2 c_ULTIMATE.start_main_~x~0)))) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (let ((.cse5 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse6 (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 .cse4) .cse5) .cse6) (fp.mul c_currentRoundingMode .cse6 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32))))))))))))) is different from true [2020-10-24 23:37:30,567 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse1 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (let ((.cse0 (fp.lt .cse2 .cse3))) (or (and (= (_ bv1 32) c_ULTIMATE.start_assume_abort_if_not_~cond) .cse0) (and (not .cse0) .cse1))) (fp.gt .cse2 (fp.neg .cse3)) (or .cse1 (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse4 (fp.sub c_currentRoundingMode .cse4 c_ULTIMATE.start_main_~x~0)))) (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode .cse3))) (let ((.cse6 (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (let ((.cse7 (fp.mul c_currentRoundingMode .cse6 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse8 (fp.mul c_currentRoundingMode .cse7 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse5 .cse6) .cse7) .cse8) (fp.mul c_currentRoundingMode .cse8 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32))))))))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2020-10-24 23:37:33,075 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse1 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (let ((.cse0 (fp.lt .cse2 .cse3))) (or (and (= (_ bv1 32) c_ULTIMATE.start_assume_abort_if_not_~cond) .cse0) (and (not .cse0) .cse1))) (fp.gt .cse2 (fp.neg .cse3)) (or .cse1 (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse4 (fp.sub c_currentRoundingMode .cse4 c_ULTIMATE.start_main_~x~0)))) (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode .cse3))) (let ((.cse6 (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (let ((.cse7 (fp.mul c_currentRoundingMode .cse6 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse8 (fp.mul c_currentRoundingMode .cse7 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse5 .cse6) .cse7) .cse8) (fp.mul c_currentRoundingMode .cse8 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32))))))))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2020-10-24 23:37:35,570 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.gt .cse0 (fp.neg .cse1)) (= c_currentRoundingMode roundNearestTiesToEven) (fp.lt .cse0 .cse1) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode .cse2 c_ULTIMATE.start_main_~x~0)))) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (let ((.cse5 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse6 (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 .cse4) .cse5) .cse6) (fp.mul c_currentRoundingMode .cse6 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))))))))) is different from false [2020-10-24 23:37:38,095 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.gt .cse0 (fp.neg .cse1)) (= c_currentRoundingMode roundNearestTiesToEven) (fp.lt .cse0 .cse1) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode .cse2 c_ULTIMATE.start_main_~x~0)))) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (let ((.cse5 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse6 (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 .cse4) .cse5) .cse6) (fp.mul c_currentRoundingMode .cse6 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))))))))) is different from true [2020-10-24 23:37:40,592 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (and (fp.gt .cse0 (fp.neg .cse1)) (= c_ULTIMATE.start_main_~term~0 .cse2) (= (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode .cse3 c_ULTIMATE.start_main_~x~0)))) c_ULTIMATE.start_main_~result~0) (= c_currentRoundingMode roundNearestTiesToEven) (= (_ bv1 32) c_ULTIMATE.start_main_~count~0) (fp.lt .cse0 .cse1) (fp.geq c_ULTIMATE.start_main_~result~0 (let ((.cse4 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (let ((.cse5 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse6 (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~exp~0 .cse4) .cse5) .cse6) (fp.mul c_currentRoundingMode .cse6 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32)))))))))) (= .cse2 c_ULTIMATE.start_main_~exp~0)))) is different from false [2020-10-24 23:37:42,898 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (and (fp.gt .cse0 (fp.neg .cse1)) (= c_ULTIMATE.start_main_~term~0 .cse2) (= (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode .cse3 c_ULTIMATE.start_main_~x~0)))) c_ULTIMATE.start_main_~result~0) (= c_currentRoundingMode roundNearestTiesToEven) (= (_ bv1 32) c_ULTIMATE.start_main_~count~0) (fp.lt .cse0 .cse1) (fp.geq c_ULTIMATE.start_main_~result~0 (let ((.cse4 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (let ((.cse5 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse6 (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~exp~0 .cse4) .cse5) .cse6) (fp.mul c_currentRoundingMode .cse6 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32)))))))))) (= .cse2 c_ULTIMATE.start_main_~exp~0)))) is different from true [2020-10-24 23:37:45,394 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse4 ((_ to_fp 8 24) c_currentRoundingMode .cse3))) (and (fp.geq c_ULTIMATE.start_main_~result~0 (let ((.cse0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (let ((.cse1 (fp.mul c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~exp~0 .cse0) .cse1) (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))))) (fp.gt .cse2 (fp.neg .cse3)) (= (fp.add c_currentRoundingMode .cse4 c_ULTIMATE.start_main_~term~0) c_ULTIMATE.start_main_~exp~0) (= (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse5 (fp.sub c_currentRoundingMode .cse5 c_ULTIMATE.start_main_~x~0)))) c_ULTIMATE.start_main_~result~0) (= c_currentRoundingMode roundNearestTiesToEven) (fp.lt .cse2 .cse3) (= c_ULTIMATE.start_main_~term~0 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32)))))) (= (_ bv2 32) c_ULTIMATE.start_main_~count~0)))) is different from false [2020-10-24 23:37:47,628 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse4 ((_ to_fp 8 24) c_currentRoundingMode .cse3))) (and (fp.geq c_ULTIMATE.start_main_~result~0 (let ((.cse0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (let ((.cse1 (fp.mul c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~exp~0 .cse0) .cse1) (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))))) (fp.gt .cse2 (fp.neg .cse3)) (= (fp.add c_currentRoundingMode .cse4 c_ULTIMATE.start_main_~term~0) c_ULTIMATE.start_main_~exp~0) (= (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse5 (fp.sub c_currentRoundingMode .cse5 c_ULTIMATE.start_main_~x~0)))) c_ULTIMATE.start_main_~result~0) (= c_currentRoundingMode roundNearestTiesToEven) (fp.lt .cse2 .cse3) (= c_ULTIMATE.start_main_~term~0 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32)))))) (= (_ bv2 32) c_ULTIMATE.start_main_~count~0)))) is different from true [2020-10-24 23:37:50,137 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse4 (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967294 32))))))) (and (fp.gt .cse0 (fp.neg .cse1)) (= (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode .cse2 c_ULTIMATE.start_main_~x~0)))) c_ULTIMATE.start_main_~result~0) (fp.geq c_ULTIMATE.start_main_~result~0 (let ((.cse3 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~exp~0 .cse3) (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32)))))))) (= (_ bv3 32) c_ULTIMATE.start_main_~count~0) (= c_currentRoundingMode roundNearestTiesToEven) (fp.lt .cse0 .cse1) (= c_ULTIMATE.start_main_~term~0 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32)))))) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse5 .cse4) c_ULTIMATE.start_main_~term~0) c_ULTIMATE.start_main_~exp~0))))) is different from false [2020-10-24 23:37:52,298 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse4 (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967294 32))))))) (and (fp.gt .cse0 (fp.neg .cse1)) (= (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode .cse2 c_ULTIMATE.start_main_~x~0)))) c_ULTIMATE.start_main_~result~0) (fp.geq c_ULTIMATE.start_main_~result~0 (let ((.cse3 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~exp~0 .cse3) (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32)))))))) (= (_ bv3 32) c_ULTIMATE.start_main_~count~0) (= c_currentRoundingMode roundNearestTiesToEven) (fp.lt .cse0 .cse1) (= c_ULTIMATE.start_main_~term~0 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32)))))) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse5 .cse4) c_ULTIMATE.start_main_~term~0) c_ULTIMATE.start_main_~exp~0))))) is different from true [2020-10-24 23:37:54,782 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967293 32))))))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse5 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967294 32))))))) (and (fp.gt .cse0 (fp.neg .cse1)) (= (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode .cse2 c_ULTIMATE.start_main_~x~0)))) c_ULTIMATE.start_main_~result~0) (= c_currentRoundingMode roundNearestTiesToEven) (fp.lt .cse0 .cse1) (= c_ULTIMATE.start_main_~exp~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 .cse4) .cse5) c_ULTIMATE.start_main_~term~0)) (fp.geq c_ULTIMATE.start_main_~result~0 (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~exp~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (= c_ULTIMATE.start_main_~term~0 (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32)))))) (= (_ bv4 32) c_ULTIMATE.start_main_~count~0)))))) is different from false [2020-10-24 23:37:56,872 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967293 32))))))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse5 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967294 32))))))) (and (fp.gt .cse0 (fp.neg .cse1)) (= (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode .cse2 c_ULTIMATE.start_main_~x~0)))) c_ULTIMATE.start_main_~result~0) (= c_currentRoundingMode roundNearestTiesToEven) (fp.lt .cse0 .cse1) (= c_ULTIMATE.start_main_~exp~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 .cse4) .cse5) c_ULTIMATE.start_main_~term~0)) (fp.geq c_ULTIMATE.start_main_~result~0 (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~exp~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (= c_ULTIMATE.start_main_~term~0 (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv4294967295 32)))))) (= (_ bv4 32) c_ULTIMATE.start_main_~count~0)))))) is different from true [2020-10-24 23:37:59,372 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven ULTIMATE.start_main_~x~0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= (let ((.cse0 ((_ to_fp 8 24) roundNearestTiesToEven .cse4))) (let ((.cse1 (fp.mul roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) (let ((.cse2 (fp.mul roundNearestTiesToEven .cse1 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse3 (fp.mul roundNearestTiesToEven .cse2 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse0 .cse1) .cse2) .cse3) (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32))))))))) c_ULTIMATE.start_main_~exp~0) (fp.lt .cse5 .cse4) (= c_ULTIMATE.start_main_~result~0 (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse6 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse6 (fp.sub roundNearestTiesToEven .cse6 ULTIMATE.start_main_~x~0))))) (fp.gt .cse5 (fp.neg .cse4))))) (fp.geq c_ULTIMATE.start_main_~result~0 c_ULTIMATE.start_main_~exp~0)) is different from false [2020-10-24 23:38:01,865 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) (and (or (and (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven ULTIMATE.start_main_~x~0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.lt .cse0 .cse1) (not (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven .cse2 ULTIMATE.start_main_~x~0)))) (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven .cse1))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse6 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 .cse4) .cse5) .cse6) (fp.mul roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32))))))))))) (fp.gt .cse0 (fp.neg .cse1))))) .cse7) (and (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse8 ((_ to_fp 11 53) roundNearestTiesToEven ULTIMATE.start_main_~x~0)) (.cse9 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.lt .cse8 .cse9) (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse10 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse10 (fp.sub roundNearestTiesToEven .cse10 ULTIMATE.start_main_~x~0)))) (let ((.cse11 ((_ to_fp 8 24) roundNearestTiesToEven .cse9))) (let ((.cse12 (fp.mul roundNearestTiesToEven .cse11 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) (let ((.cse13 (fp.mul roundNearestTiesToEven .cse12 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse14 (fp.mul roundNearestTiesToEven .cse13 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse11 .cse12) .cse13) .cse14) (fp.mul roundNearestTiesToEven .cse14 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))))))) (fp.gt .cse8 (fp.neg .cse9))))) (= (bvadd c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)))) (not .cse7))) is different from false [2020-10-24 23:38:07,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 23:38:07,650 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2020-10-24 23:38:07,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-24 23:38:07,650 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 17 [2020-10-24 23:38:07,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 23:38:07,651 INFO L225 Difference]: With dead ends: 24 [2020-10-24 23:38:07,651 INFO L226 Difference]: Without dead ends: 20 [2020-10-24 23:38:07,652 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 26 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 148.9s TimeCoverageRelationStatistics Valid=78, Invalid=66, Unknown=50, NotChecked=1066, Total=1260 [2020-10-24 23:38:07,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-10-24 23:38:07,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-10-24 23:38:07,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-10-24 23:38:07,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2020-10-24 23:38:07,657 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2020-10-24 23:38:07,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 23:38:07,657 INFO L481 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2020-10-24 23:38:07,657 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-10-24 23:38:07,657 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2020-10-24 23:38:07,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-24 23:38:07,658 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 23:38:07,658 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 23:38:07,859 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-10-24 23:38:07,859 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 23:38:07,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 23:38:07,860 INFO L82 PathProgramCache]: Analyzing trace with hash -31298394, now seen corresponding path program 4 times [2020-10-24 23:38:07,861 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 23:38:07,861 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1991289327] [2020-10-24 23:38:07,862 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2020-10-24 23:39:18,559 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-24 23:39:18,560 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-24 23:39:18,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 28 conjunts are in the unsatisfiable core [2020-10-24 23:39:18,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 23:39:19,472 WARN L193 SmtUtils]: Spent 647.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2020-10-24 23:39:19,474 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 23:39:20,250 WARN L193 SmtUtils]: Spent 406.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2020-10-24 23:39:21,191 WARN L193 SmtUtils]: Spent 581.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2020-10-24 23:39:21,193 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 23:39:22,082 WARN L193 SmtUtils]: Spent 331.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2020-10-24 23:39:24,153 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (and (fp.gt .cse0 (fp.neg .cse1)) (= c_ULTIMATE.start_main_~term~0 .cse2) (= (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode .cse3 c_ULTIMATE.start_main_~x~0)))) c_ULTIMATE.start_main_~result~0) (= c_currentRoundingMode roundNearestTiesToEven) (= (_ bv1 32) c_ULTIMATE.start_main_~count~0) (fp.lt .cse0 .cse1) (= .cse2 c_ULTIMATE.start_main_~exp~0)))) is different from false [2020-10-24 23:39:26,282 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode .cse1)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0))) (and (fp.gt .cse0 (fp.neg .cse1)) (= (fp.add c_currentRoundingMode .cse2 c_ULTIMATE.start_main_~term~0) c_ULTIMATE.start_main_~exp~0) (= (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode .cse3 c_ULTIMATE.start_main_~x~0)))) c_ULTIMATE.start_main_~result~0) (= c_ULTIMATE.start_main_~term~0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32))))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.lt .cse0 .cse1) (= (_ bv2 32) c_ULTIMATE.start_main_~count~0)))) is different from false [2020-10-24 23:39:28,445 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse3 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (and (fp.gt .cse0 (fp.neg .cse1)) (= (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode .cse2 c_ULTIMATE.start_main_~x~0)))) c_ULTIMATE.start_main_~result~0) (= (_ bv3 32) c_ULTIMATE.start_main_~count~0) (= c_currentRoundingMode roundNearestTiesToEven) (fp.lt .cse0 .cse1) (= c_ULTIMATE.start_main_~term~0 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32))))) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse4 .cse3) c_ULTIMATE.start_main_~term~0) c_ULTIMATE.start_main_~exp~0))))) is different from false [2020-10-24 23:39:31,018 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (let ((.cse5 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32))))) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0))) (and (fp.gt .cse0 (fp.neg .cse1)) (= (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode .cse2 c_ULTIMATE.start_main_~x~0)))) c_ULTIMATE.start_main_~result~0) (= (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 .cse4) .cse5) c_ULTIMATE.start_main_~term~0) c_ULTIMATE.start_main_~exp~0) (= c_ULTIMATE.start_main_~term~0 (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32))))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.lt .cse0 .cse1) (= (_ bv4 32) c_ULTIMATE.start_main_~count~0)))))) is different from false [2020-10-24 23:39:34,720 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (let ((.cse5 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse6 (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (and (fp.gt .cse0 (fp.neg .cse1)) (= (_ bv5 32) c_ULTIMATE.start_main_~count~0) (= (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode .cse2 c_ULTIMATE.start_main_~x~0)))) c_ULTIMATE.start_main_~result~0) (= c_ULTIMATE.start_main_~exp~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 .cse4) .cse5) .cse6) c_ULTIMATE.start_main_~term~0)) (= c_currentRoundingMode roundNearestTiesToEven) (fp.lt .cse0 .cse1) (= c_ULTIMATE.start_main_~term~0 (fp.mul c_currentRoundingMode .cse6 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32))))))))))) is different from false [2020-10-24 23:39:37,712 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven ULTIMATE.start_main_~x~0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.lt .cse0 .cse1) (= c_ULTIMATE.start_main_~result~0 (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven .cse2 ULTIMATE.start_main_~x~0))))) (= (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven .cse1))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse6 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse7 (fp.mul roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 .cse4) .cse5) .cse6) .cse7) (fp.mul roundNearestTiesToEven .cse7 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))))))) c_ULTIMATE.start_main_~exp~0) (fp.gt .cse0 (fp.neg .cse1))))) is different from false [2020-10-24 23:39:40,190 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven ULTIMATE.start_main_~x~0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.lt .cse0 .cse1) (= c_ULTIMATE.start_main_~result~0 (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven .cse2 ULTIMATE.start_main_~x~0))))) (= (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven .cse1))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse6 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse7 (fp.mul roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 .cse4) .cse5) .cse6) .cse7) (fp.mul roundNearestTiesToEven .cse7 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))))))) c_ULTIMATE.start_main_~exp~0) (fp.gt .cse0 (fp.neg .cse1))))) is different from true [2020-10-24 23:39:40,193 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-24 23:39:53,300 WARN L838 $PredicateComparison]: unable to prove that (or (and (= (bvadd c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven ULTIMATE.start_main_~x~0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.lt .cse0 .cse1) (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven .cse2 ULTIMATE.start_main_~x~0)))) (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven .cse1))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse6 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse7 (fp.mul roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 .cse4) .cse5) .cse6) .cse7) (fp.mul roundNearestTiesToEven .cse7 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32))))))))))) (fp.gt .cse0 (fp.neg .cse1)))))) (and (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse8 ((_ to_fp 11 53) roundNearestTiesToEven ULTIMATE.start_main_~x~0)) (.cse9 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.lt .cse8 .cse9) (not (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse10 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse10 (fp.sub roundNearestTiesToEven .cse10 ULTIMATE.start_main_~x~0)))) (let ((.cse11 ((_ to_fp 8 24) roundNearestTiesToEven .cse9))) (let ((.cse12 (fp.mul roundNearestTiesToEven .cse11 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) (let ((.cse13 (fp.mul roundNearestTiesToEven .cse12 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse14 (fp.mul roundNearestTiesToEven .cse13 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse15 (fp.mul roundNearestTiesToEven .cse14 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse11 .cse12) .cse13) .cse14) .cse15) (fp.mul roundNearestTiesToEven .cse15 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))))))))) (fp.gt .cse8 (fp.neg .cse9))))) (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) is different from false [2020-10-24 23:40:00,855 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven ULTIMATE.start_main_~x~0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.lt .cse0 .cse1) (not (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven .cse2 ULTIMATE.start_main_~x~0)))) (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven .cse1))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse6 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse7 (fp.mul roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 .cse4) .cse5) .cse6) .cse7) (fp.mul roundNearestTiesToEven .cse7 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))))))))) (fp.gt .cse0 (fp.neg .cse1))))) is different from false [2020-10-24 23:40:03,320 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~x~0 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven ULTIMATE.start_main_~x~0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.lt .cse0 .cse1) (not (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv1 32)))) (fp.div roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven .cse2 ULTIMATE.start_main_~x~0)))) (let ((.cse3 ((_ to_fp 8 24) roundNearestTiesToEven .cse1))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse3 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv1 32)))))) (let ((.cse5 (fp.mul roundNearestTiesToEven .cse4 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv2 32)))))) (let ((.cse6 (fp.mul roundNearestTiesToEven .cse5 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv3 32)))))) (let ((.cse7 (fp.mul roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv4 32)))))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven .cse3 .cse4) .cse5) .cse6) .cse7) (fp.mul roundNearestTiesToEven .cse7 (fp.div roundNearestTiesToEven ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) roundNearestTiesToEven (_ bv5 32)))))))))))) (fp.gt .cse0 (fp.neg .cse1))))) is different from true [2020-10-24 23:40:03,324 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 20 not checked. [2020-10-24 23:40:03,325 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 23:40:07,919 WARN L860 $PredicateComparison]: unable to prove that (fp.geq c_ULTIMATE.start_main_~result~0 (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~exp~0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) is different from true [2020-10-24 23:40:10,074 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~count~0_40 (_ BitVec 32))) (or (not (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32)) v_ULTIMATE.start_main_~count~0_40)) (fp.geq c_ULTIMATE.start_main_~result~0 (let ((.cse0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~exp~0 .cse0) (fp.mul c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode v_ULTIMATE.start_main_~count~0_40)))))))) is different from false [2020-10-24 23:40:12,219 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~count~0_40 (_ BitVec 32))) (or (not (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32)) v_ULTIMATE.start_main_~count~0_40)) (fp.geq c_ULTIMATE.start_main_~result~0 (let ((.cse0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~exp~0 .cse0) (fp.mul c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode v_ULTIMATE.start_main_~count~0_40)))))))) is different from true [2020-10-24 23:40:14,364 WARN L838 $PredicateComparison]: unable to prove that (fp.geq c_ULTIMATE.start_main_~result~0 (let ((.cse0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~exp~0 .cse0) (fp.mul c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32)))))))) is different from false [2020-10-24 23:40:16,508 WARN L860 $PredicateComparison]: unable to prove that (fp.geq c_ULTIMATE.start_main_~result~0 (let ((.cse0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~exp~0 .cse0) (fp.mul c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32)))))))) is different from true [2020-10-24 23:40:18,734 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~count~0_41 (_ BitVec 32))) (or (not (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32)) v_ULTIMATE.start_main_~count~0_41)) (fp.geq c_ULTIMATE.start_main_~result~0 (let ((.cse0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (let ((.cse1 (fp.mul c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode v_ULTIMATE.start_main_~count~0_41))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~exp~0 .cse0) .cse1) (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd v_ULTIMATE.start_main_~count~0_41 (_ bv1 32))))))))))) is different from false [2020-10-24 23:40:20,943 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~count~0_41 (_ BitVec 32))) (or (not (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32)) v_ULTIMATE.start_main_~count~0_41)) (fp.geq c_ULTIMATE.start_main_~result~0 (let ((.cse0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (let ((.cse1 (fp.mul c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode v_ULTIMATE.start_main_~count~0_41))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~exp~0 .cse0) .cse1) (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd v_ULTIMATE.start_main_~count~0_41 (_ bv1 32))))))))))) is different from true [2020-10-24 23:40:23,154 WARN L838 $PredicateComparison]: unable to prove that (fp.geq c_ULTIMATE.start_main_~result~0 (let ((.cse0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (let ((.cse1 (fp.mul c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~exp~0 .cse0) .cse1) (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))))) is different from false [2020-10-24 23:40:25,366 WARN L860 $PredicateComparison]: unable to prove that (fp.geq c_ULTIMATE.start_main_~result~0 (let ((.cse0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (let ((.cse1 (fp.mul c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~exp~0 .cse0) .cse1) (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))))) is different from true [2020-10-24 23:40:27,672 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~count~0_42 (_ BitVec 32))) (or (not (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32)) v_ULTIMATE.start_main_~count~0_42)) (fp.geq c_ULTIMATE.start_main_~result~0 (let ((.cse0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (let ((.cse1 (fp.mul c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode v_ULTIMATE.start_main_~count~0_42))))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd v_ULTIMATE.start_main_~count~0_42 (_ bv1 32))))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~exp~0 .cse0) .cse1) .cse2) (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd v_ULTIMATE.start_main_~count~0_42 (_ bv2 32)))))))))))) is different from false [2020-10-24 23:40:29,956 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~count~0_42 (_ BitVec 32))) (or (not (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32)) v_ULTIMATE.start_main_~count~0_42)) (fp.geq c_ULTIMATE.start_main_~result~0 (let ((.cse0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (let ((.cse1 (fp.mul c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode v_ULTIMATE.start_main_~count~0_42))))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd v_ULTIMATE.start_main_~count~0_42 (_ bv1 32))))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~exp~0 .cse0) .cse1) .cse2) (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd v_ULTIMATE.start_main_~count~0_42 (_ bv2 32)))))))))))) is different from true [2020-10-24 23:40:32,244 WARN L838 $PredicateComparison]: unable to prove that (fp.geq c_ULTIMATE.start_main_~result~0 (let ((.cse0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (let ((.cse1 (fp.mul c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~exp~0 .cse0) .cse1) .cse2) (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32)))))))))) is different from false [2020-10-24 23:40:34,530 WARN L860 $PredicateComparison]: unable to prove that (fp.geq c_ULTIMATE.start_main_~result~0 (let ((.cse0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (let ((.cse1 (fp.mul c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~exp~0 .cse0) .cse1) .cse2) (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32)))))))))) is different from true [2020-10-24 23:40:36,923 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~count~0_43 (_ BitVec 32))) (or (not (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32)) v_ULTIMATE.start_main_~count~0_43)) (fp.geq c_ULTIMATE.start_main_~result~0 (let ((.cse0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (let ((.cse1 (fp.mul c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode v_ULTIMATE.start_main_~count~0_43))))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd v_ULTIMATE.start_main_~count~0_43 (_ bv1 32))))))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd v_ULTIMATE.start_main_~count~0_43 (_ bv2 32))))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~exp~0 .cse0) .cse1) .cse2) .cse3) (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd v_ULTIMATE.start_main_~count~0_43 (_ bv3 32))))))))))))) is different from false [2020-10-24 23:40:39,270 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~count~0_43 (_ BitVec 32))) (or (not (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32)) v_ULTIMATE.start_main_~count~0_43)) (fp.geq c_ULTIMATE.start_main_~result~0 (let ((.cse0 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (let ((.cse1 (fp.mul c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode v_ULTIMATE.start_main_~count~0_43))))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd v_ULTIMATE.start_main_~count~0_43 (_ bv1 32))))))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd v_ULTIMATE.start_main_~count~0_43 (_ bv2 32))))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~exp~0 .cse0) .cse1) .cse2) .cse3) (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd v_ULTIMATE.start_main_~count~0_43 (_ bv3 32))))))))))))) is different from true [2020-10-24 23:40:41,699 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~count~0_43 (_ BitVec 32))) (or (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~x~0)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd v_ULTIMATE.start_main_~count~0_43 (_ bv4294967295 32))))))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode v_ULTIMATE.start_main_~count~0_43))))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd v_ULTIMATE.start_main_~count~0_43 (_ bv1 32))))))) (let ((.cse5 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd v_ULTIMATE.start_main_~count~0_43 (_ bv2 32))))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 .cse2) .cse3) .cse4) .cse5) (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd v_ULTIMATE.start_main_~count~0_43 (_ bv3 32)))))))))))) (not (= (_ bv2 32) v_ULTIMATE.start_main_~count~0_43)))) is different from true [2020-10-24 23:40:44,230 WARN L838 $PredicateComparison]: unable to prove that (or (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~x~0)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse5 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 .cse2) .cse3) .cse4) .cse5) (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32)))))))))))) is different from false [2020-10-24 23:40:46,742 WARN L860 $PredicateComparison]: unable to prove that (or (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~x~0)))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse5 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse1 .cse2) .cse3) .cse4) .cse5) (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32)))))))))))) is different from true [2020-10-24 23:40:46,745 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-24 23:40:49,281 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.lt ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0) .cse0)) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode .cse1 c_ULTIMATE.start_main_~x~0)))) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode .cse0))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse5 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse6 (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 .cse3) .cse4) .cse5) .cse6) (fp.mul c_currentRoundingMode .cse6 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32))))))))))))) is different from false [2020-10-24 23:40:51,794 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.lt ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0) .cse0)) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode .cse1 c_ULTIMATE.start_main_~x~0)))) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode .cse0))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse5 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse6 (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 .cse3) .cse4) .cse5) .cse6) (fp.mul c_currentRoundingMode .cse6 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32))))))))))))) is different from true [2020-10-24 23:40:54,316 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.lt ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0) .cse0)) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode .cse1 c_ULTIMATE.start_main_~x~0)))) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode .cse0))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse5 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse6 (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 .cse3) .cse4) .cse5) .cse6) (fp.mul c_currentRoundingMode .cse6 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32))))))))))))) is different from false [2020-10-24 23:40:56,907 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.lt ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0) .cse0)) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse1 (fp.sub c_currentRoundingMode .cse1 c_ULTIMATE.start_main_~x~0)))) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode .cse0))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse5 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse6 (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse2 .cse3) .cse4) .cse5) .cse6) (fp.mul c_currentRoundingMode .cse6 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32))))))))))))) is different from true [2020-10-24 23:40:56,911 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-24 23:40:59,388 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~x~0_11 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode v_ULTIMATE.start_main_~x~0_11)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.lt .cse0 .cse1)) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode .cse2 v_ULTIMATE.start_main_~x~0_11)))) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_11 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (let ((.cse5 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_11 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse6 (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_11 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse7 (fp.mul c_currentRoundingMode .cse6 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_11 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 .cse4) .cse5) .cse6) .cse7) (fp.mul c_currentRoundingMode .cse7 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_11 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32))))))))))) (not (fp.gt .cse0 (fp.neg .cse1)))))) is different from false [2020-10-24 23:41:01,899 WARN L860 $PredicateComparison]: unable to prove that (forall ((v_ULTIMATE.start_main_~x~0_11 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode v_ULTIMATE.start_main_~x~0_11)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.lt .cse0 .cse1)) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode .cse2 v_ULTIMATE.start_main_~x~0_11)))) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_11 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (let ((.cse5 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_11 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse6 (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_11 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse7 (fp.mul c_currentRoundingMode .cse6 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_11 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 .cse4) .cse5) .cse6) .cse7) (fp.mul c_currentRoundingMode .cse7 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_11 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32))))))))))) (not (fp.gt .cse0 (fp.neg .cse1)))))) is different from true [2020-10-24 23:41:01,903 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 20 not checked. [2020-10-24 23:41:01,904 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1991289327] [2020-10-24 23:41:01,904 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-24 23:41:01,904 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 29 [2020-10-24 23:41:01,904 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232519687] [2020-10-24 23:41:01,905 INFO L461 AbstractCegarLoop]: Interpolant automaton has 30 states [2020-10-24 23:41:01,905 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 23:41:01,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2020-10-24 23:41:01,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=59, Unknown=34, NotChecked=714, Total=870 [2020-10-24 23:41:01,906 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 30 states. [2020-10-24 23:41:04,514 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~x~0_11 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode v_ULTIMATE.start_main_~x~0_11)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.lt .cse0 .cse1)) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode .cse2 v_ULTIMATE.start_main_~x~0_11)))) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_11 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (let ((.cse5 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_11 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse6 (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_11 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse7 (fp.mul c_currentRoundingMode .cse6 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_11 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 .cse4) .cse5) .cse6) .cse7) (fp.mul c_currentRoundingMode .cse7 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_11 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32))))))))))) (not (fp.gt .cse0 (fp.neg .cse1)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2020-10-24 23:41:07,049 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~x~0_11 (_ FloatingPoint 8 24))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode v_ULTIMATE.start_main_~x~0_11)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.lt .cse0 .cse1)) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode .cse2 v_ULTIMATE.start_main_~x~0_11)))) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_11 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (let ((.cse5 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_11 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse6 (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_11 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse7 (fp.mul c_currentRoundingMode .cse6 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_11 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 .cse4) .cse5) .cse6) .cse7) (fp.mul c_currentRoundingMode .cse7 (fp.div c_currentRoundingMode v_ULTIMATE.start_main_~x~0_11 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32))))))))))) (not (fp.gt .cse0 (fp.neg .cse1)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2020-10-24 23:41:09,581 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= c_currentRoundingMode roundNearestTiesToEven) (or (not (fp.lt .cse0 .cse1)) .cse2 (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode .cse3 c_ULTIMATE.start_main_~x~0)))) (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (let ((.cse5 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (let ((.cse6 (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse7 (fp.mul c_currentRoundingMode .cse6 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse8 (fp.mul c_currentRoundingMode .cse7 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse4 .cse5) .cse6) .cse7) .cse8) (fp.mul c_currentRoundingMode .cse8 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32)))))))))))) (let ((.cse9 (fp.gt .cse0 (fp.neg .cse1)))) (or (and .cse2 (not .cse9)) (and .cse9 (= (_ bv1 32) c_ULTIMATE.start_assume_abort_if_not_~cond)))))) is different from false [2020-10-24 23:41:12,114 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= c_currentRoundingMode roundNearestTiesToEven) (or (not (fp.lt .cse0 .cse1)) .cse2 (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode .cse3 c_ULTIMATE.start_main_~x~0)))) (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (let ((.cse5 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (let ((.cse6 (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse7 (fp.mul c_currentRoundingMode .cse6 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse8 (fp.mul c_currentRoundingMode .cse7 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse4 .cse5) .cse6) .cse7) .cse8) (fp.mul c_currentRoundingMode .cse8 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32)))))))))))) (let ((.cse9 (fp.gt .cse0 (fp.neg .cse1)))) (or (and .cse2 (not .cse9)) (and .cse9 (= (_ bv1 32) c_ULTIMATE.start_assume_abort_if_not_~cond)))))) is different from true [2020-10-24 23:41:14,630 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.gt .cse0 (fp.neg .cse1)) (= c_currentRoundingMode roundNearestTiesToEven) (or (not (fp.lt .cse0 .cse1)) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode .cse2 c_ULTIMATE.start_main_~x~0)))) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (let ((.cse5 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse6 (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse7 (fp.mul c_currentRoundingMode .cse6 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 .cse4) .cse5) .cse6) .cse7) (fp.mul c_currentRoundingMode .cse7 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32)))))))))))))) is different from false [2020-10-24 23:41:17,146 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.gt .cse0 (fp.neg .cse1)) (= c_currentRoundingMode roundNearestTiesToEven) (or (not (fp.lt .cse0 .cse1)) (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode .cse2 c_ULTIMATE.start_main_~x~0)))) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (let ((.cse5 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse6 (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse7 (fp.mul c_currentRoundingMode .cse6 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 .cse4) .cse5) .cse6) .cse7) (fp.mul c_currentRoundingMode .cse7 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32)))))))))))))) is different from true [2020-10-24 23:41:19,676 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse1 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (let ((.cse0 (fp.lt .cse2 .cse3))) (or (and (= (_ bv1 32) c_ULTIMATE.start_assume_abort_if_not_~cond) .cse0) (and (not .cse0) .cse1))) (fp.gt .cse2 (fp.neg .cse3)) (or .cse1 (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse4 (fp.sub c_currentRoundingMode .cse4 c_ULTIMATE.start_main_~x~0)))) (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode .cse3))) (let ((.cse6 (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (let ((.cse7 (fp.mul c_currentRoundingMode .cse6 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse8 (fp.mul c_currentRoundingMode .cse7 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse9 (fp.mul c_currentRoundingMode .cse8 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse5 .cse6) .cse7) .cse8) .cse9) (fp.mul c_currentRoundingMode .cse9 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32)))))))))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2020-10-24 23:41:22,205 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse1 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (let ((.cse0 (fp.lt .cse2 .cse3))) (or (and (= (_ bv1 32) c_ULTIMATE.start_assume_abort_if_not_~cond) .cse0) (and (not .cse0) .cse1))) (fp.gt .cse2 (fp.neg .cse3)) (or .cse1 (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse4 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse4 (fp.sub c_currentRoundingMode .cse4 c_ULTIMATE.start_main_~x~0)))) (let ((.cse5 ((_ to_fp 8 24) c_currentRoundingMode .cse3))) (let ((.cse6 (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32)))))) (let ((.cse7 (fp.mul c_currentRoundingMode .cse6 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv2 32)))))) (let ((.cse8 (fp.mul c_currentRoundingMode .cse7 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv3 32)))))) (let ((.cse9 (fp.mul c_currentRoundingMode .cse8 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv4 32)))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse5 .cse6) .cse7) .cse8) .cse9) (fp.mul c_currentRoundingMode .cse9 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv5 32)))))))))))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2020-10-24 23:41:24,676 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.gt .cse0 (fp.neg .cse1)) (= c_currentRoundingMode roundNearestTiesToEven) (fp.lt .cse0 .cse1) (forall ((v_ULTIMATE.start_main_~count~0_43 (_ BitVec 32))) (or (fp.geq (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode .cse2 c_ULTIMATE.start_main_~x~0)))) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse3 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd v_ULTIMATE.start_main_~count~0_43 (_ bv4294967295 32))))))) (let ((.cse5 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode v_ULTIMATE.start_main_~count~0_43))))) (let ((.cse6 (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd v_ULTIMATE.start_main_~count~0_43 (_ bv1 32))))))) (let ((.cse7 (fp.mul c_currentRoundingMode .cse6 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd v_ULTIMATE.start_main_~count~0_43 (_ bv2 32))))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode .cse3 .cse4) .cse5) .cse6) .cse7) (fp.mul c_currentRoundingMode .cse7 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd v_ULTIMATE.start_main_~count~0_43 (_ bv3 32)))))))))))) (not (= (_ bv2 32) v_ULTIMATE.start_main_~count~0_43)))))) is different from true [2020-10-24 23:41:26,995 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (and (fp.gt .cse0 (fp.neg .cse1)) (= c_ULTIMATE.start_main_~term~0 .cse2) (= (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode .cse3 c_ULTIMATE.start_main_~x~0)))) c_ULTIMATE.start_main_~result~0) (= c_currentRoundingMode roundNearestTiesToEven) (forall ((v_ULTIMATE.start_main_~count~0_43 (_ BitVec 32))) (or (not (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32)) v_ULTIMATE.start_main_~count~0_43)) (fp.geq c_ULTIMATE.start_main_~result~0 (let ((.cse4 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (let ((.cse5 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode v_ULTIMATE.start_main_~count~0_43))))) (let ((.cse6 (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd v_ULTIMATE.start_main_~count~0_43 (_ bv1 32))))))) (let ((.cse7 (fp.mul c_currentRoundingMode .cse6 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd v_ULTIMATE.start_main_~count~0_43 (_ bv2 32))))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~exp~0 .cse4) .cse5) .cse6) .cse7) (fp.mul c_currentRoundingMode .cse7 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd v_ULTIMATE.start_main_~count~0_43 (_ bv3 32))))))))))))) (= (_ bv1 32) c_ULTIMATE.start_main_~count~0) (fp.lt .cse0 .cse1) (= .cse2 c_ULTIMATE.start_main_~exp~0)))) is different from false [2020-10-24 23:41:29,352 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0)) (.cse2 ((_ to_fp 8 24) c_currentRoundingMode .cse1))) (and (fp.gt .cse0 (fp.neg .cse1)) (= c_ULTIMATE.start_main_~term~0 .cse2) (= (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode .cse3 c_ULTIMATE.start_main_~x~0)))) c_ULTIMATE.start_main_~result~0) (= c_currentRoundingMode roundNearestTiesToEven) (forall ((v_ULTIMATE.start_main_~count~0_43 (_ BitVec 32))) (or (not (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32)) v_ULTIMATE.start_main_~count~0_43)) (fp.geq c_ULTIMATE.start_main_~result~0 (let ((.cse4 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (let ((.cse5 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode v_ULTIMATE.start_main_~count~0_43))))) (let ((.cse6 (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd v_ULTIMATE.start_main_~count~0_43 (_ bv1 32))))))) (let ((.cse7 (fp.mul c_currentRoundingMode .cse6 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd v_ULTIMATE.start_main_~count~0_43 (_ bv2 32))))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~exp~0 .cse4) .cse5) .cse6) .cse7) (fp.mul c_currentRoundingMode .cse7 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd v_ULTIMATE.start_main_~count~0_43 (_ bv3 32))))))))))))) (= (_ bv1 32) c_ULTIMATE.start_main_~count~0) (fp.lt .cse0 .cse1) (= .cse2 c_ULTIMATE.start_main_~exp~0)))) is different from true [2020-10-24 23:41:31,860 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode .cse1)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0))) (and (fp.gt .cse0 (fp.neg .cse1)) (= (fp.add c_currentRoundingMode .cse2 c_ULTIMATE.start_main_~term~0) c_ULTIMATE.start_main_~exp~0) (= (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode .cse3 c_ULTIMATE.start_main_~x~0)))) c_ULTIMATE.start_main_~result~0) (= c_ULTIMATE.start_main_~term~0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32))))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.lt .cse0 .cse1) (= (_ bv2 32) c_ULTIMATE.start_main_~count~0) (fp.geq c_ULTIMATE.start_main_~result~0 (let ((.cse4 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (let ((.cse5 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse6 (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~exp~0 .cse4) .cse5) .cse6) (fp.mul c_currentRoundingMode .cse6 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32))))))))))))) is different from false [2020-10-24 23:41:34,166 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode .cse1)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0))) (and (fp.gt .cse0 (fp.neg .cse1)) (= (fp.add c_currentRoundingMode .cse2 c_ULTIMATE.start_main_~term~0) c_ULTIMATE.start_main_~exp~0) (= (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode .cse3 c_ULTIMATE.start_main_~x~0)))) c_ULTIMATE.start_main_~result~0) (= c_ULTIMATE.start_main_~term~0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32))))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.lt .cse0 .cse1) (= (_ bv2 32) c_ULTIMATE.start_main_~count~0) (fp.geq c_ULTIMATE.start_main_~result~0 (let ((.cse4 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (let ((.cse5 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32))))))) (let ((.cse6 (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv2 32))))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~exp~0 .cse4) .cse5) .cse6) (fp.mul c_currentRoundingMode .cse6 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd c_ULTIMATE.start_main_~count~0 (_ bv3 32))))))))))))) is different from true [2020-10-24 23:41:36,250 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode .cse1)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0))) (and (fp.gt .cse0 (fp.neg .cse1)) (= (fp.add c_currentRoundingMode .cse2 c_ULTIMATE.start_main_~term~0) c_ULTIMATE.start_main_~exp~0) (= (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode .cse3 c_ULTIMATE.start_main_~x~0)))) c_ULTIMATE.start_main_~result~0) (= c_ULTIMATE.start_main_~term~0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32))))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.lt .cse0 .cse1) (= (_ bv2 32) c_ULTIMATE.start_main_~count~0) (forall ((v_ULTIMATE.start_main_~count~0_42 (_ BitVec 32))) (or (not (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32)) v_ULTIMATE.start_main_~count~0_42)) (fp.geq c_ULTIMATE.start_main_~result~0 (let ((.cse4 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (let ((.cse5 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode v_ULTIMATE.start_main_~count~0_42))))) (let ((.cse6 (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd v_ULTIMATE.start_main_~count~0_42 (_ bv1 32))))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~exp~0 .cse4) .cse5) .cse6) (fp.mul c_currentRoundingMode .cse6 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd v_ULTIMATE.start_main_~count~0_42 (_ bv2 32))))))))))))))) is different from false [2020-10-24 23:41:38,568 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 ((_ to_fp 8 24) c_currentRoundingMode .cse1)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~x~0))) (and (fp.gt .cse0 (fp.neg .cse1)) (= (fp.add c_currentRoundingMode .cse2 c_ULTIMATE.start_main_~term~0) c_ULTIMATE.start_main_~exp~0) (= (fp.mul c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ bv2 32)) (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode (_ bv1 32)))) (fp.div c_currentRoundingMode .cse3 (fp.sub c_currentRoundingMode .cse3 c_ULTIMATE.start_main_~x~0)))) c_ULTIMATE.start_main_~result~0) (= c_ULTIMATE.start_main_~term~0 (fp.mul c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (_ bv1 32))))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.lt .cse0 .cse1) (= (_ bv2 32) c_ULTIMATE.start_main_~count~0) (forall ((v_ULTIMATE.start_main_~count~0_42 (_ BitVec 32))) (or (not (= (bvadd c_ULTIMATE.start_main_~count~0 (_ bv1 32)) v_ULTIMATE.start_main_~count~0_42)) (fp.geq c_ULTIMATE.start_main_~result~0 (let ((.cse4 (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~term~0 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode c_ULTIMATE.start_main_~count~0))))) (let ((.cse5 (fp.mul c_currentRoundingMode .cse4 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode v_ULTIMATE.start_main_~count~0_42))))) (let ((.cse6 (fp.mul c_currentRoundingMode .cse5 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd v_ULTIMATE.start_main_~count~0_42 (_ bv1 32))))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~exp~0 .cse4) .cse5) .cse6) (fp.mul c_currentRoundingMode .cse6 (fp.div c_currentRoundingMode c_ULTIMATE.start_main_~x~0 ((_ to_fp_unsigned 8 24) c_currentRoundingMode (bvadd v_ULTIMATE.start_main_~count~0_42 (_ bv2 32))))))))))))))) is different from true [2020-10-24 23:41:38,879 WARN L195 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2020-10-24 23:41:38,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-24 23:41:39,081 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-10-24 23:41:39,082 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:209) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:226) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:153) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:138) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:829) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:388) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1064) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:966) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:187) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:743) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:674) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:473) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:341) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) 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:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1461) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:654) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:206) ... 45 more [2020-10-24 23:41:39,087 INFO L168 Benchmark]: Toolchain (without parser) took 851099.51 ms. Allocated memory is still 62.9 MB. Free memory was 46.8 MB in the beginning and 18.2 MB in the end (delta: 28.7 MB). Peak memory consumption was 28.2 MB. Max. memory is 16.1 GB. [2020-10-24 23:41:39,088 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 46.1 MB. Free memory was 30.6 MB in the beginning and 30.6 MB in the end (delta: 56.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 23:41:39,089 INFO L168 Benchmark]: CACSL2BoogieTranslator took 288.06 ms. Allocated memory is still 62.9 MB. Free memory was 46.2 MB in the beginning and 36.1 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-10-24 23:41:39,089 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.48 ms. Allocated memory is still 62.9 MB. Free memory was 35.9 MB in the beginning and 34.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-24 23:41:39,090 INFO L168 Benchmark]: Boogie Preprocessor took 65.58 ms. Allocated memory is still 62.9 MB. Free memory was 34.5 MB in the beginning and 33.1 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-24 23:41:39,091 INFO L168 Benchmark]: RCFGBuilder took 3098.98 ms. Allocated memory is still 62.9 MB. Free memory was 33.1 MB in the beginning and 35.9 MB in the end (delta: -2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-10-24 23:41:39,092 INFO L168 Benchmark]: TraceAbstraction took 847570.86 ms. Allocated memory is still 62.9 MB. Free memory was 35.6 MB in the beginning and 18.2 MB in the end (delta: 17.4 MB). Peak memory consumption was 16.4 MB. Max. memory is 16.1 GB. [2020-10-24 23:41:39,096 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31 ms. Allocated memory is still 46.1 MB. Free memory was 30.6 MB in the beginning and 30.6 MB in the end (delta: 56.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 288.06 ms. Allocated memory is still 62.9 MB. Free memory was 46.2 MB in the beginning and 36.1 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 53.48 ms. Allocated memory is still 62.9 MB. Free memory was 35.9 MB in the beginning and 34.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 65.58 ms. Allocated memory is still 62.9 MB. Free memory was 34.5 MB in the beginning and 33.1 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 3098.98 ms. Allocated memory is still 62.9 MB. Free memory was 33.1 MB in the beginning and 35.9 MB in the end (delta: -2.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 847570.86 ms. Allocated memory is still 62.9 MB. Free memory was 35.6 MB in the beginning and 18.2 MB in the end (delta: 17.4 MB). Peak memory consumption was 16.4 MB. Max. memory is 16.1 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:209) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...