./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/filter2_set.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_69ede94c-33d1-4042-bc28-11019a0a168c/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_69ede94c-33d1-4042-bc28-11019a0a168c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_69ede94c-33d1-4042-bc28-11019a0a168c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_69ede94c-33d1-4042-bc28-11019a0a168c/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/filter2_set.c -s /tmp/vcloud-vcloud-master/worker/run_dir_69ede94c-33d1-4042-bc28-11019a0a168c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_69ede94c-33d1-4042-bc28-11019a0a168c/bin/uautomizer --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 d93111d47ee7b05ca67a232b0f3d0d8816844d8f .................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_69ede94c-33d1-4042-bc28-11019a0a168c/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_69ede94c-33d1-4042-bc28-11019a0a168c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_69ede94c-33d1-4042-bc28-11019a0a168c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_69ede94c-33d1-4042-bc28-11019a0a168c/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/filter2_set.c -s /tmp/vcloud-vcloud-master/worker/run_dir_69ede94c-33d1-4042-bc28-11019a0a168c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_69ede94c-33d1-4042-bc28-11019a0a168c/bin/uautomizer --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 d93111d47ee7b05ca67a232b0f3d0d8816844d8f .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-11-29 23:58:37,586 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-29 23:58:37,589 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-29 23:58:37,674 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-29 23:58:37,675 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-29 23:58:37,677 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-29 23:58:37,679 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-29 23:58:37,682 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-29 23:58:37,685 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-29 23:58:37,686 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-29 23:58:37,687 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-29 23:58:37,689 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-29 23:58:37,690 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-29 23:58:37,691 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-29 23:58:37,693 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-29 23:58:37,695 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-29 23:58:37,696 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-29 23:58:37,697 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-29 23:58:37,700 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-29 23:58:37,702 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-29 23:58:37,704 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-29 23:58:37,706 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-29 23:58:37,708 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-29 23:58:37,709 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-29 23:58:37,713 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-29 23:58:37,714 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-29 23:58:37,714 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-29 23:58:37,715 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-29 23:58:37,716 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-29 23:58:37,717 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-29 23:58:37,718 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-29 23:58:37,719 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-29 23:58:37,720 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-29 23:58:37,721 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-29 23:58:37,723 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-29 23:58:37,723 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-29 23:58:37,724 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-29 23:58:37,725 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-29 23:58:37,725 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-29 23:58:37,727 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-29 23:58:37,728 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-29 23:58:37,729 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_69ede94c-33d1-4042-bc28-11019a0a168c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-29 23:58:37,753 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-29 23:58:37,753 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-29 23:58:37,755 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-29 23:58:37,755 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-29 23:58:37,755 INFO L138 SettingsManager]: * Use SBE=true [2020-11-29 23:58:37,756 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-29 23:58:37,756 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-29 23:58:37,756 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-29 23:58:37,757 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-29 23:58:37,757 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-29 23:58:37,757 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-29 23:58:37,757 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-29 23:58:37,758 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-29 23:58:37,758 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-29 23:58:37,758 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-29 23:58:37,759 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-29 23:58:37,759 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-29 23:58:37,759 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-29 23:58:37,759 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-29 23:58:37,760 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-29 23:58:37,760 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-29 23:58:37,760 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-29 23:58:37,760 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-29 23:58:37,761 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-29 23:58:37,761 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-29 23:58:37,761 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-29 23:58:37,762 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-29 23:58:37,762 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-29 23:58:37,762 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-29 23:58:37,762 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:/tmp/vcloud-vcloud-master/worker/run_dir_69ede94c-33d1-4042-bc28-11019a0a168c/bin/uautomizer/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 -> /tmp/vcloud-vcloud-master/worker/run_dir_69ede94c-33d1-4042-bc28-11019a0a168c/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(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 -> d93111d47ee7b05ca67a232b0f3d0d8816844d8f [2020-11-29 23:58:38,019 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-29 23:58:38,056 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-29 23:58:38,061 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-29 23:58:38,063 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-29 23:58:38,065 INFO L275 PluginConnector]: CDTParser initialized [2020-11-29 23:58:38,067 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_69ede94c-33d1-4042-bc28-11019a0a168c/bin/uautomizer/../../sv-benchmarks/c/float-benchs/filter2_set.c [2020-11-29 23:58:38,149 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_69ede94c-33d1-4042-bc28-11019a0a168c/bin/uautomizer/data/7179ec0c2/26bf9d8b6c0e4cd2930ad75d48cea758/FLAG49aef3fc3 [2020-11-29 23:58:38,679 INFO L306 CDTParser]: Found 1 translation units. [2020-11-29 23:58:38,679 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_69ede94c-33d1-4042-bc28-11019a0a168c/sv-benchmarks/c/float-benchs/filter2_set.c [2020-11-29 23:58:38,688 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_69ede94c-33d1-4042-bc28-11019a0a168c/bin/uautomizer/data/7179ec0c2/26bf9d8b6c0e4cd2930ad75d48cea758/FLAG49aef3fc3 [2020-11-29 23:58:39,051 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_69ede94c-33d1-4042-bc28-11019a0a168c/bin/uautomizer/data/7179ec0c2/26bf9d8b6c0e4cd2930ad75d48cea758 [2020-11-29 23:58:39,053 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-29 23:58:39,056 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-29 23:58:39,058 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-29 23:58:39,058 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-29 23:58:39,062 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-29 23:58:39,063 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 11:58:39" (1/1) ... [2020-11-29 23:58:39,065 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34a80733 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:58:39, skipping insertion in model container [2020-11-29 23:58:39,065 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 11:58:39" (1/1) ... [2020-11-29 23:58:39,073 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-29 23:58:39,089 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-29 23:58:39,295 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 23:58:39,305 INFO L203 MainTranslator]: Completed pre-run [2020-11-29 23:58:39,326 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 23:58:39,341 INFO L208 MainTranslator]: Completed translation [2020-11-29 23:58:39,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:58:39 WrapperNode [2020-11-29 23:58:39,342 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-29 23:58:39,343 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-29 23:58:39,344 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-29 23:58:39,344 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-29 23:58:39,352 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:58:39" (1/1) ... [2020-11-29 23:58:39,360 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:58:39" (1/1) ... [2020-11-29 23:58:39,387 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-29 23:58:39,387 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-29 23:58:39,388 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-29 23:58:39,388 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-29 23:58:39,398 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:58:39" (1/1) ... [2020-11-29 23:58:39,398 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:58:39" (1/1) ... [2020-11-29 23:58:39,400 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:58:39" (1/1) ... [2020-11-29 23:58:39,401 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:58:39" (1/1) ... [2020-11-29 23:58:39,407 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:58:39" (1/1) ... [2020-11-29 23:58:39,411 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:58:39" (1/1) ... [2020-11-29 23:58:39,413 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:58:39" (1/1) ... [2020-11-29 23:58:39,416 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-29 23:58:39,417 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-29 23:58:39,417 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-29 23:58:39,417 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-29 23:58:39,418 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:58:39" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_69ede94c-33d1-4042-bc28-11019a0a168c/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-29 23:58:39,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-29 23:58:39,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-29 23:58:39,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-29 23:58:39,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-29 23:58:39,835 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-29 23:58:39,836 INFO L298 CfgBuilder]: Removed 25 assume(true) statements. [2020-11-29 23:58:39,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 11:58:39 BoogieIcfgContainer [2020-11-29 23:58:39,837 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-29 23:58:39,839 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-29 23:58:39,839 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-29 23:58:39,842 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-29 23:58:39,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 11:58:39" (1/3) ... [2020-11-29 23:58:39,843 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75d5b35b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 11:58:39, skipping insertion in model container [2020-11-29 23:58:39,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:58:39" (2/3) ... [2020-11-29 23:58:39,844 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75d5b35b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 11:58:39, skipping insertion in model container [2020-11-29 23:58:39,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 11:58:39" (3/3) ... [2020-11-29 23:58:39,846 INFO L111 eAbstractionObserver]: Analyzing ICFG filter2_set.c [2020-11-29 23:58:39,858 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-29 23:58:39,862 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-29 23:58:39,881 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-29 23:58:39,911 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-29 23:58:39,911 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-29 23:58:39,912 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-29 23:58:39,912 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-29 23:58:39,912 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-29 23:58:39,912 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-29 23:58:39,912 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-29 23:58:39,913 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-29 23:58:39,927 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2020-11-29 23:58:39,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-29 23:58:39,933 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:58:39,934 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 23:58:39,934 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:58:39,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:58:39,941 INFO L82 PathProgramCache]: Analyzing trace with hash 983304290, now seen corresponding path program 1 times [2020-11-29 23:58:39,950 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:58:39,951 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322458071] [2020-11-29 23:58:39,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:58:40,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:58:40,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-11-29 23:58:40,130 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322458071] [2020-11-29 23:58:40,132 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:58:40,132 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-29 23:58:40,133 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455542137] [2020-11-29 23:58:40,140 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-11-29 23:58:40,140 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:58:40,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-11-29 23:58:40,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-11-29 23:58:40,164 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2020-11-29 23:58:40,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:58:40,185 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2020-11-29 23:58:40,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-11-29 23:58:40,187 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2020-11-29 23:58:40,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:58:40,204 INFO L225 Difference]: With dead ends: 52 [2020-11-29 23:58:40,206 INFO L226 Difference]: Without dead ends: 23 [2020-11-29 23:58:40,211 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-11-29 23:58:40,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-11-29 23:58:40,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-11-29 23:58:40,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-11-29 23:58:40,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2020-11-29 23:58:40,297 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2020-11-29 23:58:40,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:58:40,298 INFO L481 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2020-11-29 23:58:40,298 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-11-29 23:58:40,299 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2020-11-29 23:58:40,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-29 23:58:40,301 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:58:40,302 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 23:58:40,303 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-29 23:58:40,304 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:58:40,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:58:40,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1515433198, now seen corresponding path program 1 times [2020-11-29 23:58:40,309 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:58:40,310 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980077329] [2020-11-29 23:58:40,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:58:40,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 23:58:40,396 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 23:58:40,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 23:58:40,438 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 23:58:40,466 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 23:58:40,466 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-29 23:58:40,467 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-29 23:58:40,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 11:58:40 BoogieIcfgContainer [2020-11-29 23:58:40,502 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-29 23:58:40,503 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-29 23:58:40,503 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-29 23:58:40,503 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-29 23:58:40,504 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 11:58:39" (3/4) ... [2020-11-29 23:58:40,508 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-11-29 23:58:40,508 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-29 23:58:40,510 INFO L168 Benchmark]: Toolchain (without parser) took 1452.66 ms. Allocated memory was 90.2 MB in the beginning and 117.4 MB in the end (delta: 27.3 MB). Free memory was 55.9 MB in the beginning and 89.2 MB in the end (delta: -33.3 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 23:58:40,511 INFO L168 Benchmark]: CDTParser took 0.38 ms. Allocated memory is still 90.2 MB. Free memory was 60.2 MB in the beginning and 60.2 MB in the end (delta: 27.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 23:58:40,512 INFO L168 Benchmark]: CACSL2BoogieTranslator took 284.42 ms. Allocated memory is still 90.2 MB. Free memory was 55.8 MB in the beginning and 66.5 MB in the end (delta: -10.7 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-29 23:58:40,513 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.52 ms. Allocated memory is still 90.2 MB. Free memory was 66.5 MB in the beginning and 64.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 23:58:40,514 INFO L168 Benchmark]: Boogie Preprocessor took 28.73 ms. Allocated memory is still 90.2 MB. Free memory was 64.7 MB in the beginning and 63.7 MB in the end (delta: 1.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 23:58:40,515 INFO L168 Benchmark]: RCFGBuilder took 420.53 ms. Allocated memory is still 90.2 MB. Free memory was 63.7 MB in the beginning and 47.9 MB in the end (delta: 15.8 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2020-11-29 23:58:40,516 INFO L168 Benchmark]: TraceAbstraction took 663.30 ms. Allocated memory was 90.2 MB in the beginning and 117.4 MB in the end (delta: 27.3 MB). Free memory was 47.6 MB in the beginning and 89.2 MB in the end (delta: -41.6 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 23:58:40,516 INFO L168 Benchmark]: Witness Printer took 5.20 ms. Allocated memory is still 117.4 MB. Free memory is still 89.2 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 23:58:40,520 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.38 ms. Allocated memory is still 90.2 MB. Free memory was 60.2 MB in the beginning and 60.2 MB in the end (delta: 27.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 284.42 ms. Allocated memory is still 90.2 MB. Free memory was 55.8 MB in the beginning and 66.5 MB in the end (delta: -10.7 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 43.52 ms. Allocated memory is still 90.2 MB. Free memory was 66.5 MB in the beginning and 64.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 28.73 ms. Allocated memory is still 90.2 MB. Free memory was 64.7 MB in the beginning and 63.7 MB in the end (delta: 1.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 420.53 ms. Allocated memory is still 90.2 MB. Free memory was 63.7 MB in the beginning and 47.9 MB in the end (delta: 15.8 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 663.30 ms. Allocated memory was 90.2 MB in the beginning and 117.4 MB in the end (delta: 27.3 MB). Free memory was 47.6 MB in the beginning and 89.2 MB in the end (delta: -41.6 MB). There was no memory consumed. Max. memory is 16.1 GB. * Witness Printer took 5.20 ms. Allocated memory is still 117.4 MB. Free memory is still 89.2 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 3]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 57, overapproximation of to_real at line 43, overapproximation of someBinaryArithmeticDOUBLEoperation at line 55. Possible FailurePath: [L22] double E, E0, E1, S0, S1, S; [L23] double A1, A2, A3, B1, B2; [L24] int i; [L26] A1 = __VERIFIER_nondet_double() [L27] A2 = __VERIFIER_nondet_double() [L28] A3 = __VERIFIER_nondet_double() [L29] B1 = __VERIFIER_nondet_double() [L30] B2 = __VERIFIER_nondet_double() [L15] COND FALSE !(!cond) [L15] COND FALSE !(!cond) [L15] COND FALSE !(!cond) [L15] COND FALSE !(!cond) [L15] COND FALSE !(!cond) [L38] E = __VERIFIER_nondet_double() [L39] E0 = __VERIFIER_nondet_double() [L15] COND FALSE !(!cond) [L15] COND FALSE !(!cond) [L43] S0 = 0 [L44] S = 0 [L46] i = 0 [L46] COND TRUE i <= 1000000 [L47] E1 = E0 [L48] E0 = E [L50] E = __VERIFIER_nondet_double() [L15] COND FALSE !(!cond) [L53] S1 = S0 [L54] S0 = S [L55] S = A1*E - E0*A2 + E1*A3 + S0*B1 + S1*B2 [L17] COND TRUE !(cond) [L3] __assert_fail("0", "filter2_set.c", 3, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 28 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: 27 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=28occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 42 NumberOfCodeBlocks, 42 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 20 ConstructedInterpolants, 0 QuantifiedInterpolants, 400 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-11-29 23:58:43,105 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-29 23:58:43,110 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-29 23:58:43,167 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-29 23:58:43,168 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-29 23:58:43,174 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-29 23:58:43,178 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-29 23:58:43,183 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-29 23:58:43,186 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-29 23:58:43,195 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-29 23:58:43,197 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-29 23:58:43,213 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-29 23:58:43,214 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-29 23:58:43,217 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-29 23:58:43,219 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-29 23:58:43,221 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-29 23:58:43,223 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-29 23:58:43,224 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-29 23:58:43,230 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-29 23:58:43,234 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-29 23:58:43,240 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-29 23:58:43,243 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-29 23:58:43,245 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-29 23:58:43,247 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-29 23:58:43,251 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-29 23:58:43,253 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-29 23:58:43,254 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-29 23:58:43,256 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-29 23:58:43,257 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-29 23:58:43,258 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-29 23:58:43,259 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-29 23:58:43,260 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-29 23:58:43,262 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-29 23:58:43,263 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-29 23:58:43,264 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-29 23:58:43,264 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-29 23:58:43,265 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-29 23:58:43,266 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-29 23:58:43,266 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-29 23:58:43,268 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-29 23:58:43,269 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-29 23:58:43,270 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_69ede94c-33d1-4042-bc28-11019a0a168c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-11-29 23:58:43,316 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-29 23:58:43,317 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-29 23:58:43,320 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-29 23:58:43,320 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-29 23:58:43,321 INFO L138 SettingsManager]: * Use SBE=true [2020-11-29 23:58:43,321 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-29 23:58:43,321 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-29 23:58:43,321 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-29 23:58:43,322 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-29 23:58:43,322 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-29 23:58:43,323 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-29 23:58:43,324 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-29 23:58:43,324 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-11-29 23:58:43,324 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-11-29 23:58:43,324 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-29 23:58:43,325 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-29 23:58:43,325 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-29 23:58:43,325 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-29 23:58:43,325 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-29 23:58:43,326 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-29 23:58:43,326 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-29 23:58:43,326 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-29 23:58:43,326 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-29 23:58:43,327 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-29 23:58:43,327 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-29 23:58:43,327 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-29 23:58:43,327 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-11-29 23:58:43,328 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-11-29 23:58:43,328 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-29 23:58:43,328 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-29 23:58:43,328 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-29 23:58:43,328 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:/tmp/vcloud-vcloud-master/worker/run_dir_69ede94c-33d1-4042-bc28-11019a0a168c/bin/uautomizer/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 -> /tmp/vcloud-vcloud-master/worker/run_dir_69ede94c-33d1-4042-bc28-11019a0a168c/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(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 -> d93111d47ee7b05ca67a232b0f3d0d8816844d8f [2020-11-29 23:58:43,711 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-29 23:58:43,751 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-29 23:58:43,755 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-29 23:58:43,757 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-29 23:58:43,757 INFO L275 PluginConnector]: CDTParser initialized [2020-11-29 23:58:43,758 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_69ede94c-33d1-4042-bc28-11019a0a168c/bin/uautomizer/../../sv-benchmarks/c/float-benchs/filter2_set.c [2020-11-29 23:58:43,841 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_69ede94c-33d1-4042-bc28-11019a0a168c/bin/uautomizer/data/69305e2ff/6d5f91089b7041ce8da3d57a7417c149/FLAG7f2d0e1b1 [2020-11-29 23:58:44,443 INFO L306 CDTParser]: Found 1 translation units. [2020-11-29 23:58:44,443 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_69ede94c-33d1-4042-bc28-11019a0a168c/sv-benchmarks/c/float-benchs/filter2_set.c [2020-11-29 23:58:44,453 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_69ede94c-33d1-4042-bc28-11019a0a168c/bin/uautomizer/data/69305e2ff/6d5f91089b7041ce8da3d57a7417c149/FLAG7f2d0e1b1 [2020-11-29 23:58:44,779 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_69ede94c-33d1-4042-bc28-11019a0a168c/bin/uautomizer/data/69305e2ff/6d5f91089b7041ce8da3d57a7417c149 [2020-11-29 23:58:44,787 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-29 23:58:44,789 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-29 23:58:44,791 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-29 23:58:44,792 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-29 23:58:44,796 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-29 23:58:44,797 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 11:58:44" (1/1) ... [2020-11-29 23:58:44,800 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c8ca7ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:58:44, skipping insertion in model container [2020-11-29 23:58:44,800 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 11:58:44" (1/1) ... [2020-11-29 23:58:44,808 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-29 23:58:44,830 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-29 23:58:44,989 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 23:58:45,004 INFO L203 MainTranslator]: Completed pre-run [2020-11-29 23:58:45,027 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 23:58:45,043 INFO L208 MainTranslator]: Completed translation [2020-11-29 23:58:45,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:58:45 WrapperNode [2020-11-29 23:58:45,048 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-29 23:58:45,049 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-29 23:58:45,050 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-29 23:58:45,050 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-29 23:58:45,061 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:58:45" (1/1) ... [2020-11-29 23:58:45,084 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:58:45" (1/1) ... [2020-11-29 23:58:45,112 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-29 23:58:45,115 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-29 23:58:45,115 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-29 23:58:45,115 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-29 23:58:45,124 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:58:45" (1/1) ... [2020-11-29 23:58:45,124 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:58:45" (1/1) ... [2020-11-29 23:58:45,128 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:58:45" (1/1) ... [2020-11-29 23:58:45,129 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:58:45" (1/1) ... [2020-11-29 23:58:45,136 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:58:45" (1/1) ... [2020-11-29 23:58:45,145 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:58:45" (1/1) ... [2020-11-29 23:58:45,148 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:58:45" (1/1) ... [2020-11-29 23:58:45,151 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-29 23:58:45,152 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-29 23:58:45,152 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-29 23:58:45,152 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-29 23:58:45,153 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:58:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_69ede94c-33d1-4042-bc28-11019a0a168c/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-29 23:58:45,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-11-29 23:58:45,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-29 23:58:45,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-29 23:58:45,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-29 23:58:47,918 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-29 23:58:47,918 INFO L298 CfgBuilder]: Removed 25 assume(true) statements. [2020-11-29 23:58:47,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 11:58:47 BoogieIcfgContainer [2020-11-29 23:58:47,920 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-29 23:58:47,921 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-29 23:58:47,922 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-29 23:58:47,925 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-29 23:58:47,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 11:58:44" (1/3) ... [2020-11-29 23:58:47,926 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f3634f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 11:58:47, skipping insertion in model container [2020-11-29 23:58:47,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:58:45" (2/3) ... [2020-11-29 23:58:47,927 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f3634f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 11:58:47, skipping insertion in model container [2020-11-29 23:58:47,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 11:58:47" (3/3) ... [2020-11-29 23:58:47,928 INFO L111 eAbstractionObserver]: Analyzing ICFG filter2_set.c [2020-11-29 23:58:47,939 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-29 23:58:47,943 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-29 23:58:47,955 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-29 23:58:47,988 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-29 23:58:47,988 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-29 23:58:47,988 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-29 23:58:47,988 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-29 23:58:47,988 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-29 23:58:47,989 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-29 23:58:47,989 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-29 23:58:47,989 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-29 23:58:48,002 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2020-11-29 23:58:48,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-29 23:58:48,008 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:58:48,009 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 23:58:48,009 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:58:48,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:58:48,015 INFO L82 PathProgramCache]: Analyzing trace with hash 983304290, now seen corresponding path program 1 times [2020-11-29 23:58:48,028 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-29 23:58:48,029 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1529896508] [2020-11-29 23:58:48,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_69ede94c-33d1-4042-bc28-11019a0a168c/bin/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-11-29 23:58:49,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:58:49,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 1 conjunts are in the unsatisfiable core [2020-11-29 23:58:49,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 23:58:49,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 23:58:49,746 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-29 23:58:49,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 23:58:49,755 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1529896508] [2020-11-29 23:58:49,756 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:58:49,756 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-11-29 23:58:49,757 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693736983] [2020-11-29 23:58:49,761 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-11-29 23:58:49,762 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-29 23:58:49,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-11-29 23:58:49,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-11-29 23:58:49,776 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2020-11-29 23:58:49,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:58:49,793 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2020-11-29 23:58:49,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-11-29 23:58:49,794 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2020-11-29 23:58:49,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:58:49,803 INFO L225 Difference]: With dead ends: 52 [2020-11-29 23:58:49,803 INFO L226 Difference]: Without dead ends: 23 [2020-11-29 23:58:49,806 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 40 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-11-29 23:58:49,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-11-29 23:58:49,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-11-29 23:58:49,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-11-29 23:58:49,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2020-11-29 23:58:49,837 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2020-11-29 23:58:49,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:58:49,837 INFO L481 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2020-11-29 23:58:49,837 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-11-29 23:58:49,837 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2020-11-29 23:58:49,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-29 23:58:49,838 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:58:49,838 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 23:58:50,047 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-11-29 23:58:50,048 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:58:50,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:58:50,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1515433198, now seen corresponding path program 1 times [2020-11-29 23:58:50,054 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-29 23:58:50,055 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1212454862] [2020-11-29 23:58:50,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_69ede94c-33d1-4042-bc28-11019a0a168c/bin/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-11-29 23:58:55,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:58:56,112 WARN L261 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 35 conjunts are in the unsatisfiable core [2020-11-29 23:58:56,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 23:58:56,282 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:58:56,532 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2020-11-29 23:58:56,537 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:58:57,028 WARN L193 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2020-11-29 23:58:57,032 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:58:57,393 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2020-11-29 23:58:57,799 WARN L193 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2020-11-29 23:58:57,805 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:58:58,050 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2020-11-29 23:58:58,527 WARN L193 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2020-11-29 23:58:58,532 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:58:58,928 WARN L193 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2020-11-29 23:58:59,419 WARN L193 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2020-11-29 23:58:59,426 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:58:59,989 WARN L193 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2020-11-29 23:59:00,806 WARN L193 SmtUtils]: Spent 402.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2020-11-29 23:59:00,815 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:59:01,489 WARN L193 SmtUtils]: Spent 287.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2020-11-29 23:59:02,277 WARN L193 SmtUtils]: Spent 310.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2020-11-29 23:59:03,127 WARN L193 SmtUtils]: Spent 410.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2020-11-29 23:59:03,131 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:59:03,850 WARN L193 SmtUtils]: Spent 290.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-11-29 23:59:03,870 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:03,872 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:03,876 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:03,878 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:03,880 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:03,881 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:03,884 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:03,886 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:03,889 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:03,891 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:03,892 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:03,894 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:03,896 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:03,898 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:03,900 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:03,901 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:03,904 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:03,905 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:03,907 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:03,909 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:03,911 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:03,912 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:03,915 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:03,925 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:03,927 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:03,928 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:03,930 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:03,932 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:03,934 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:03,935 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:03,937 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:03,938 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:03,941 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:03,942 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:03,944 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:03,945 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:03,947 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:03,949 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:03,950 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:03,952 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:03,954 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:03,955 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:03,958 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:03,959 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:03,961 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:03,962 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:03,964 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:03,966 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:03,967 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:03,969 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:03,971 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:03,973 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:03,974 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:03,975 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:03,977 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:03,979 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:03,981 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:03,982 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:03,984 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:03,985 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:03,987 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:03,989 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:03,990 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:03,991 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:03,993 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:03,994 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:03,996 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:03,998 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:03,999 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,000 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,002 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,003 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,005 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,006 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,008 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,009 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,011 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,012 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,014 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,015 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,017 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,018 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,019 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,020 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,022 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,023 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,025 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,026 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,028 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,029 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,031 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,032 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,033 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,034 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,036 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,037 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,039 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,040 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,042 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,043 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,045 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,046 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,048 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,049 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,051 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,052 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,053 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,054 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,056 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,057 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,058 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,059 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,065 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,067 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,069 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,070 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,076 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,082 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,085 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,086 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,087 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,088 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,091 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,092 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,095 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,097 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,098 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,099 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,103 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,110 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,112 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,114 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,118 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,120 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,122 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,124 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,126 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,126 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,129 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,130 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,138 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,139 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,141 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,142 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,143 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,145 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,146 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,147 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,149 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,150 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,151 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,152 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,153 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,154 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,157 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,158 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,161 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,162 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,169 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,171 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,172 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,173 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,176 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,176 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,178 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,178 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,180 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,181 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,182 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,183 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,184 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,185 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,187 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,188 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,191 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,192 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,193 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,194 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,195 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,197 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,198 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,200 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,202 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,202 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,203 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,204 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,206 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,206 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,208 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,208 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,210 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,211 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,212 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,213 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,214 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,215 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,217 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,218 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,219 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,225 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,226 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,227 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,229 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,230 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,231 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,232 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,234 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,235 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,236 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,237 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,238 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,239 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,240 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,241 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,242 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,243 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,244 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,245 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,247 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,248 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,249 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,250 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,251 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,252 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,254 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,254 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,255 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,256 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,258 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,258 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,260 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,261 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,262 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,263 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,264 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,265 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,266 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,267 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,268 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,269 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,271 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,272 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,273 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,273 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,275 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,276 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,277 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,278 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,281 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,282 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,283 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,283 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,285 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,286 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,287 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,288 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,289 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,293 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,294 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,295 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,296 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,297 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,298 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,299 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,300 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,301 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,302 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,307 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,308 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,309 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,310 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,311 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,312 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,313 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,314 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,315 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,316 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,317 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,318 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,319 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,320 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,321 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,322 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,323 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,324 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,332 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,333 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,334 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,336 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,337 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,338 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,339 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,340 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,341 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,342 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,343 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,345 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,345 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,346 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,347 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,348 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,349 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,351 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,352 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,353 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,353 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,355 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,356 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,358 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,359 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,360 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,361 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,362 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,363 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,364 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,365 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,367 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,368 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,369 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,370 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,371 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,372 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,373 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,374 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,375 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,376 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,377 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,378 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,379 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,380 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,382 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,383 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,384 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,384 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,386 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,387 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,388 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,389 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,390 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,391 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,392 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,393 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,394 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,395 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,397 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,398 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,399 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,400 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,401 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,402 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,403 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,404 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,405 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,405 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,407 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,408 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,409 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,409 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,411 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,411 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,413 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,414 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,415 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,416 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,418 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,419 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,420 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,420 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,421 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,422 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,424 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,425 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,426 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,427 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,428 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,429 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,430 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,443 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,444 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,445 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,446 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,447 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,448 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,449 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,450 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,451 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,452 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,453 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,454 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,455 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,456 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,457 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,458 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,459 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,460 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,461 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,462 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,463 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,465 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,465 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,467 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,467 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,468 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,469 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,471 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,472 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,472 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,473 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,475 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,476 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,477 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,477 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,479 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,480 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,481 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,481 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,483 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,484 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,485 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,486 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,489 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,489 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,490 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,490 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,491 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,492 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,493 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,494 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,496 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,497 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,498 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,499 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,500 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,501 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,502 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,503 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,504 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,505 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,506 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,507 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,508 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,509 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,511 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,512 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,513 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,513 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,515 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,516 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,517 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,518 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,519 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,520 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,521 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,522 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,523 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,524 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,525 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,526 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,527 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,528 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,530 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,530 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,532 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,533 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,534 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,535 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,536 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,537 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,538 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,539 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,540 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,541 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,542 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,543 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,544 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,545 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,547 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,548 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,549 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,549 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,551 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,552 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,558 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,559 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,560 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,561 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,562 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,563 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,564 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,565 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,567 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,568 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,569 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,569 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,571 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,572 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,573 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,574 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,575 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,576 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,577 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,578 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,579 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,580 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,582 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,583 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,584 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,585 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,586 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,587 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,588 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,589 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,590 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,591 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,592 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,593 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,594 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,595 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,596 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,597 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,599 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,599 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,600 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,601 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,603 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,603 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,604 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,605 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,607 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,608 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,609 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,610 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,611 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,612 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,613 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,614 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,615 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,616 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,617 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,618 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,619 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,620 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,621 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,622 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,623 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,624 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,625 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,626 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,628 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,628 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,629 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,630 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,632 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,632 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,633 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,634 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,635 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,636 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,637 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,638 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,639 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,640 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,641 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,642 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,643 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,644 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,645 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,646 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,647 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,648 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,649 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,650 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,651 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,652 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,653 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:04,654 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:59:13,680 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse10 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) (or (and (= (bvadd c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (exists ((ULTIMATE.start_main_~A3~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E1~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~A2~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B2~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~A1~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B1~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 69.0 100.0))) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse2 (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~A1~0 ULTIMATE.start_main_~E~0) (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~E0~0 ULTIMATE.start_main_~A2~0)) (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~E1~0 ULTIMATE.start_main_~A3~0)) (fp.mul roundNearestTiesToEven .cse5 ULTIMATE.start_main_~B1~0)) (fp.mul roundNearestTiesToEven .cse5 ULTIMATE.start_main_~B2~0)))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 100.0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 71.0 100.0)))) (and (fp.geq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 109.0 100.0))) (fp.leq ULTIMATE.start_main_~E0~0 .cse0) (fp.leq ULTIMATE.start_main_~B2~0 (fp.neg .cse1)) (fp.leq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 141.0 100.0))) (fp.leq ULTIMATE.start_main_~E~0 .cse0) (fp.geq .cse2 (fp.neg .cse3)) (fp.geq ULTIMATE.start_main_~A1~0 .cse1) (fp.geq ULTIMATE.start_main_~E1~0 (_ +zero 11 53)) (fp.leq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 129.0 100.0)))) (fp.leq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 111.0 100.0))) (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53)) (fp.leq ULTIMATE.start_main_~E1~0 .cse0) (fp.leq .cse2 .cse3) (fp.geq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 131.0 100.0)))) (fp.leq ULTIMATE.start_main_~A1~0 .cse4) (fp.geq ULTIMATE.start_main_~E~0 (_ +zero 11 53)) (fp.geq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 139.0 100.0))) (fp.geq ULTIMATE.start_main_~B2~0 (fp.neg .cse4)))))) (and (exists ((ULTIMATE.start_main_~A3~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E1~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~A2~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B2~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~A1~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B1~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse7 ((_ to_fp 11 53) roundNearestTiesToEven (/ 69.0 100.0))) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse9 ((_ to_fp 11 53) roundNearestTiesToEven (/ 71.0 100.0)))) (and (fp.geq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 109.0 100.0))) (fp.leq ULTIMATE.start_main_~E0~0 .cse6) (fp.leq ULTIMATE.start_main_~B2~0 (fp.neg .cse7)) (fp.leq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 141.0 100.0))) (fp.leq ULTIMATE.start_main_~E~0 .cse6) (fp.geq ULTIMATE.start_main_~A1~0 .cse7) (fp.geq ULTIMATE.start_main_~E1~0 (_ +zero 11 53)) (fp.leq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 129.0 100.0)))) (fp.leq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 111.0 100.0))) (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53)) (fp.leq ULTIMATE.start_main_~E1~0 .cse6) (not (fp.leq (let ((.cse8 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~A1~0 ULTIMATE.start_main_~E~0) (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~E0~0 ULTIMATE.start_main_~A2~0)) (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~E1~0 ULTIMATE.start_main_~A3~0)) (fp.mul roundNearestTiesToEven .cse8 ULTIMATE.start_main_~B1~0)) (fp.mul roundNearestTiesToEven .cse8 ULTIMATE.start_main_~B2~0))) ((_ to_fp 11 53) roundNearestTiesToEven 100.0))) (fp.geq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 131.0 100.0)))) (fp.leq ULTIMATE.start_main_~A1~0 .cse9) (fp.geq ULTIMATE.start_main_~E~0 (_ +zero 11 53)) (fp.geq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 139.0 100.0))) (fp.geq ULTIMATE.start_main_~B2~0 (fp.neg .cse9))))) .cse10) (and (exists ((ULTIMATE.start_main_~A3~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E1~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~A2~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B2~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~A1~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B1~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse12 ((_ to_fp 11 53) roundNearestTiesToEven (/ 69.0 100.0))) (.cse11 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse14 ((_ to_fp 11 53) roundNearestTiesToEven (/ 71.0 100.0)))) (and (fp.geq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 109.0 100.0))) (fp.leq ULTIMATE.start_main_~E0~0 .cse11) (fp.leq ULTIMATE.start_main_~B2~0 (fp.neg .cse12)) (fp.leq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 141.0 100.0))) (fp.leq ULTIMATE.start_main_~E~0 .cse11) (not (fp.geq (let ((.cse13 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~A1~0 ULTIMATE.start_main_~E~0) (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~E0~0 ULTIMATE.start_main_~A2~0)) (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~E1~0 ULTIMATE.start_main_~A3~0)) (fp.mul roundNearestTiesToEven .cse13 ULTIMATE.start_main_~B1~0)) (fp.mul roundNearestTiesToEven .cse13 ULTIMATE.start_main_~B2~0))) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 100.0)))) (fp.geq ULTIMATE.start_main_~A1~0 .cse12) (fp.geq ULTIMATE.start_main_~E1~0 (_ +zero 11 53)) (fp.leq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 129.0 100.0)))) (fp.leq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 111.0 100.0))) (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53)) (fp.leq ULTIMATE.start_main_~E1~0 .cse11) (fp.geq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 131.0 100.0)))) (fp.leq ULTIMATE.start_main_~A1~0 .cse14) (fp.geq ULTIMATE.start_main_~E~0 (_ +zero 11 53)) (fp.geq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 139.0 100.0))) (fp.geq ULTIMATE.start_main_~B2~0 (fp.neg .cse14))))) .cse10))) is different from false [2020-11-29 23:59:24,905 WARN L838 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_5 (_ FloatingPoint 11 53)) (v_prenex_4 (_ FloatingPoint 11 53)) (v_prenex_7 (_ FloatingPoint 11 53)) (v_prenex_6 (_ FloatingPoint 11 53)) (v_prenex_1 (_ FloatingPoint 11 53)) (v_prenex_3 (_ FloatingPoint 11 53)) (v_prenex_2 (_ FloatingPoint 11 53)) (v_prenex_8 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 71.0 100.0))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 69.0 100.0)))) (and (fp.geq v_prenex_2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 109.0 100.0))) (fp.geq v_prenex_3 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 131.0 100.0)))) (fp.geq v_prenex_6 (fp.neg .cse0)) (fp.geq v_prenex_8 (_ +zero 11 53)) (fp.leq v_prenex_4 .cse0) (fp.geq v_prenex_7 ((_ to_fp 11 53) roundNearestTiesToEven (/ 139.0 100.0))) (fp.leq v_prenex_5 .cse1) (fp.leq v_prenex_2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 111.0 100.0))) (fp.geq v_prenex_5 (_ +zero 11 53)) (fp.leq v_prenex_6 (fp.neg .cse2)) (fp.leq v_prenex_7 ((_ to_fp 11 53) roundNearestTiesToEven (/ 141.0 100.0))) (not (fp.geq (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven v_prenex_4 v_prenex_5) (fp.mul roundNearestTiesToEven v_prenex_8 v_prenex_3)) (fp.mul roundNearestTiesToEven v_prenex_1 v_prenex_2)) (fp.mul roundNearestTiesToEven .cse3 v_prenex_7)) (fp.mul roundNearestTiesToEven .cse3 v_prenex_6))) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 100.0)))) (fp.geq v_prenex_1 (_ +zero 11 53)) (fp.leq v_prenex_1 .cse1) (fp.leq v_prenex_8 .cse1) (fp.leq v_prenex_3 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 129.0 100.0)))) (fp.geq v_prenex_4 .cse2)))) (exists ((ULTIMATE.start_main_~E1~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~A3~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~A2~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~A1~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B2~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B1~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 69.0 100.0))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven (/ 71.0 100.0)))) (and (fp.geq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 109.0 100.0))) (fp.leq ULTIMATE.start_main_~E0~0 .cse4) (fp.leq ULTIMATE.start_main_~B2~0 (fp.neg .cse5)) (fp.leq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 141.0 100.0))) (fp.leq ULTIMATE.start_main_~E~0 .cse4) (fp.geq ULTIMATE.start_main_~A1~0 .cse5) (fp.geq ULTIMATE.start_main_~E1~0 (_ +zero 11 53)) (fp.leq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 129.0 100.0)))) (fp.leq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 111.0 100.0))) (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53)) (fp.leq ULTIMATE.start_main_~E1~0 .cse4) (not (fp.leq (let ((.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~A1~0 ULTIMATE.start_main_~E~0) (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~E0~0 ULTIMATE.start_main_~A2~0)) (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~E1~0 ULTIMATE.start_main_~A3~0)) (fp.mul roundNearestTiesToEven .cse6 ULTIMATE.start_main_~B1~0)) (fp.mul roundNearestTiesToEven .cse6 ULTIMATE.start_main_~B2~0))) ((_ to_fp 11 53) roundNearestTiesToEven 100.0))) (fp.geq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 131.0 100.0)))) (fp.leq ULTIMATE.start_main_~A1~0 .cse7) (fp.geq ULTIMATE.start_main_~E~0 (_ +zero 11 53)) (fp.geq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 139.0 100.0))) (fp.geq ULTIMATE.start_main_~B2~0 (fp.neg .cse7)))))) is different from false [2020-11-29 23:59:27,058 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_5 (_ FloatingPoint 11 53)) (v_prenex_4 (_ FloatingPoint 11 53)) (v_prenex_7 (_ FloatingPoint 11 53)) (v_prenex_6 (_ FloatingPoint 11 53)) (v_prenex_1 (_ FloatingPoint 11 53)) (v_prenex_3 (_ FloatingPoint 11 53)) (v_prenex_2 (_ FloatingPoint 11 53)) (v_prenex_8 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 71.0 100.0))) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 69.0 100.0)))) (and (fp.geq v_prenex_2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 109.0 100.0))) (fp.geq v_prenex_3 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 131.0 100.0)))) (fp.geq v_prenex_6 (fp.neg .cse0)) (fp.geq v_prenex_8 (_ +zero 11 53)) (fp.leq v_prenex_4 .cse0) (fp.geq v_prenex_7 ((_ to_fp 11 53) roundNearestTiesToEven (/ 139.0 100.0))) (fp.leq v_prenex_5 .cse1) (fp.leq v_prenex_2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 111.0 100.0))) (fp.geq v_prenex_5 (_ +zero 11 53)) (fp.leq v_prenex_6 (fp.neg .cse2)) (fp.leq v_prenex_7 ((_ to_fp 11 53) roundNearestTiesToEven (/ 141.0 100.0))) (not (fp.geq (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven v_prenex_4 v_prenex_5) (fp.mul roundNearestTiesToEven v_prenex_8 v_prenex_3)) (fp.mul roundNearestTiesToEven v_prenex_1 v_prenex_2)) (fp.mul roundNearestTiesToEven .cse3 v_prenex_7)) (fp.mul roundNearestTiesToEven .cse3 v_prenex_6))) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 100.0)))) (fp.geq v_prenex_1 (_ +zero 11 53)) (fp.leq v_prenex_1 .cse1) (fp.leq v_prenex_8 .cse1) (fp.leq v_prenex_3 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 129.0 100.0)))) (fp.geq v_prenex_4 .cse2)))) (exists ((ULTIMATE.start_main_~E1~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~A3~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~A2~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~A1~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B2~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B1~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 69.0 100.0))) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven (/ 71.0 100.0)))) (and (fp.geq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 109.0 100.0))) (fp.leq ULTIMATE.start_main_~E0~0 .cse4) (fp.leq ULTIMATE.start_main_~B2~0 (fp.neg .cse5)) (fp.leq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 141.0 100.0))) (fp.leq ULTIMATE.start_main_~E~0 .cse4) (fp.geq ULTIMATE.start_main_~A1~0 .cse5) (fp.geq ULTIMATE.start_main_~E1~0 (_ +zero 11 53)) (fp.leq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 129.0 100.0)))) (fp.leq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 111.0 100.0))) (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53)) (fp.leq ULTIMATE.start_main_~E1~0 .cse4) (not (fp.leq (let ((.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~A1~0 ULTIMATE.start_main_~E~0) (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~E0~0 ULTIMATE.start_main_~A2~0)) (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~E1~0 ULTIMATE.start_main_~A3~0)) (fp.mul roundNearestTiesToEven .cse6 ULTIMATE.start_main_~B1~0)) (fp.mul roundNearestTiesToEven .cse6 ULTIMATE.start_main_~B2~0))) ((_ to_fp 11 53) roundNearestTiesToEven 100.0))) (fp.geq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 131.0 100.0)))) (fp.leq ULTIMATE.start_main_~A1~0 .cse7) (fp.geq ULTIMATE.start_main_~E~0 (_ +zero 11 53)) (fp.geq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 139.0 100.0))) (fp.geq ULTIMATE.start_main_~B2~0 (fp.neg .cse7)))))) is different from true [2020-11-29 23:59:27,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 23:59:27,073 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-29 23:59:29,594 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 c_ULTIMATE.start_main_~E~0) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E1~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S~0 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S0~0 c_ULTIMATE.start_main_~B2~0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from false [2020-11-29 23:59:31,803 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 c_ULTIMATE.start_main_~E~0) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E1~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S~0 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S0~0 c_ULTIMATE.start_main_~B2~0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from true [2020-11-29 23:59:33,999 WARN L838 $PredicateComparison]: unable to prove that (or (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 c_ULTIMATE.start_main_~E~0) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E1~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S~0 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S0~0 c_ULTIMATE.start_main_~B2~0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) is different from false [2020-11-29 23:59:36,189 WARN L860 $PredicateComparison]: unable to prove that (or (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 c_ULTIMATE.start_main_~E~0) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E1~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S~0 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S0~0 c_ULTIMATE.start_main_~B2~0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) is different from true [2020-11-29 23:59:36,200 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-29 23:59:36,210 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-29 23:59:38,507 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~E~0_11 (_ FloatingPoint 11 53))) (or (not (fp.leq v_ULTIMATE.start_main_~E~0_11 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_11) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S~0 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S0~0 c_ULTIMATE.start_main_~B2~0)) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (not (fp.geq v_ULTIMATE.start_main_~E~0_11 (_ +zero 11 53))))) (forall ((v_ULTIMATE.start_main_~E~0_11 (_ FloatingPoint 11 53))) (or (not (fp.leq v_ULTIMATE.start_main_~E~0_11 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.leq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_11) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S~0 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S0~0 c_ULTIMATE.start_main_~B2~0)) ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (not (fp.geq v_ULTIMATE.start_main_~E~0_11 (_ +zero 11 53)))))) is different from true [2020-11-29 23:59:40,772 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~E~0_11 (_ FloatingPoint 11 53))) (or (not (fp.leq v_ULTIMATE.start_main_~E~0_11 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.geq (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_11) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~B2~0))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (not (fp.geq v_ULTIMATE.start_main_~E~0_11 (_ +zero 11 53))))) (forall ((v_prenex_9 (_ FloatingPoint 11 53))) (or (not (fp.geq v_prenex_9 (_ +zero 11 53))) (fp.leq (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_9) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse1 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode .cse1 c_ULTIMATE.start_main_~B2~0))) ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (not (fp.leq v_prenex_9 ((_ to_fp 11 53) c_currentRoundingMode 1.0)))))) is different from true [2020-11-29 23:59:43,027 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond))) (and (or (forall ((v_ULTIMATE.start_main_~E~0_11 (_ FloatingPoint 11 53))) (or (not (fp.leq v_ULTIMATE.start_main_~E~0_11 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.geq (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_11) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~B2~0))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (not (fp.geq v_ULTIMATE.start_main_~E~0_11 (_ +zero 11 53))))) .cse1) (or (forall ((v_prenex_9 (_ FloatingPoint 11 53))) (or (not (fp.geq v_prenex_9 (_ +zero 11 53))) (fp.leq (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_9) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse2 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode .cse2 c_ULTIMATE.start_main_~B2~0))) ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (not (fp.leq v_prenex_9 ((_ to_fp 11 53) c_currentRoundingMode 1.0))))) .cse1))) is different from true [2020-11-29 23:59:43,034 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-11-29 23:59:43,035 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-29 23:59:43,048 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-29 23:59:45,403 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~E~0_11 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq v_ULTIMATE.start_main_~E~0_11 .cse0)) (not (fp.leq ULTIMATE.start_main_~E0~0 .cse0)) (fp.geq (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_11) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse1 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode .cse1 c_ULTIMATE.start_main_~B2~0))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (not (fp.geq v_ULTIMATE.start_main_~E~0_11 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53)))))) (forall ((v_prenex_9 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_prenex_9 (_ +zero 11 53))) (not (fp.leq ULTIMATE.start_main_~E0~0 .cse2)) (fp.leq (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_9) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse3 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode .cse3 c_ULTIMATE.start_main_~B2~0))) ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (not (fp.leq v_prenex_9 .cse2)) (not (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53))))))) is different from true [2020-11-29 23:59:47,719 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond))) (and (or (forall ((v_prenex_10 (_ FloatingPoint 11 53)) (v_prenex_9 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_prenex_9 (_ +zero 11 53))) (fp.leq (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_9) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_prenex_10 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~B2~0))) ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (not (fp.geq v_prenex_10 (_ +zero 11 53))) (not (fp.leq v_prenex_10 .cse1)) (not (fp.leq v_prenex_9 .cse1))))) .cse2) (or (forall ((v_ULTIMATE.start_main_~E~0_11 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq v_ULTIMATE.start_main_~E~0_11 .cse3)) (not (fp.leq ULTIMATE.start_main_~E0~0 .cse3)) (fp.geq (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_11) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse4 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode .cse4 c_ULTIMATE.start_main_~B2~0))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (not (fp.geq v_ULTIMATE.start_main_~E~0_11 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53)))))) .cse2))) is different from true [2020-11-29 23:59:47,721 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-11-29 23:59:47,722 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-29 23:59:47,725 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-29 23:59:50,326 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~E~0_12 (_ FloatingPoint 11 53)) (v_prenex_10 (_ FloatingPoint 11 53)) (v_prenex_9 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_prenex_9 (_ +zero 11 53))) (not (fp.geq v_prenex_10 (_ +zero 11 53))) (not (fp.leq v_ULTIMATE.start_main_~E~0_12 .cse0)) (not (fp.leq v_prenex_10 .cse0)) (fp.leq (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_9) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_12 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_prenex_10 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse1 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode .cse1 c_ULTIMATE.start_main_~B2~0))) ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (not (fp.leq v_prenex_9 .cse0)) (not (fp.geq v_ULTIMATE.start_main_~E~0_12 (_ +zero 11 53)))))) (forall ((v_ULTIMATE.start_main_~E~0_12 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_11 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq v_ULTIMATE.start_main_~E~0_11 .cse2)) (fp.geq (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_11) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_12 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse3 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode .cse3 c_ULTIMATE.start_main_~B2~0))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (not (fp.leq ULTIMATE.start_main_~E0~0 .cse2)) (not (fp.leq v_ULTIMATE.start_main_~E~0_12 .cse2)) (not (fp.geq v_ULTIMATE.start_main_~E~0_11 (_ +zero 11 53))) (not (fp.geq v_ULTIMATE.start_main_~E~0_12 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53))))))) is different from true [2020-11-29 23:59:52,643 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond))) (and (or (forall ((v_ULTIMATE.start_main_~E~0_11 (_ FloatingPoint 11 53)) (v_prenex_11 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq v_ULTIMATE.start_main_~E~0_11 .cse0)) (not (fp.leq ULTIMATE.start_main_~E0~0 .cse0)) (not (fp.leq v_prenex_11 .cse0)) (not (fp.geq v_prenex_11 (_ +zero 11 53))) (not (fp.geq v_ULTIMATE.start_main_~E~0_11 (_ +zero 11 53))) (fp.geq (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_11) (fp.mul c_currentRoundingMode v_prenex_11 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse1 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode .cse1 c_ULTIMATE.start_main_~B2~0))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (not (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53)))))) .cse2) (or (forall ((v_ULTIMATE.start_main_~E~0_12 (_ FloatingPoint 11 53)) (v_prenex_10 (_ FloatingPoint 11 53)) (v_prenex_9 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_prenex_9 (_ +zero 11 53))) (not (fp.geq v_prenex_10 (_ +zero 11 53))) (not (fp.leq v_ULTIMATE.start_main_~E~0_12 .cse3)) (not (fp.leq v_prenex_10 .cse3)) (fp.leq (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_9) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_12 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_prenex_10 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse4 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode .cse4 c_ULTIMATE.start_main_~B2~0))) ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (not (fp.leq v_prenex_9 .cse3)) (not (fp.geq v_ULTIMATE.start_main_~E~0_12 (_ +zero 11 53)))))) .cse2))) is different from true [2020-11-29 23:59:52,646 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-11-29 23:59:52,647 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-29 23:59:52,647 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-29 23:59:54,708 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~E~0_12 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B2~0 (_ FloatingPoint 11 53)) (v_prenex_10 (_ FloatingPoint 11 53)) (v_prenex_9 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.geq v_prenex_9 (_ +zero 11 53))) (not (fp.leq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.geq v_prenex_10 (_ +zero 11 53))) (not (fp.leq v_ULTIMATE.start_main_~E~0_12 .cse0)) (not (fp.leq v_prenex_10 .cse0)) (fp.leq (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_9) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_12 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_prenex_10 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse1 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode .cse1 ULTIMATE.start_main_~B2~0))) ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (not (fp.leq v_prenex_9 .cse0)) (not (fp.geq v_ULTIMATE.start_main_~E~0_12 (_ +zero 11 53)))))) (forall ((v_ULTIMATE.start_main_~E~0_11 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B2~0 (_ FloatingPoint 11 53)) (v_prenex_11 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq v_ULTIMATE.start_main_~E~0_11 .cse2)) (not (fp.geq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.leq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.leq ULTIMATE.start_main_~E0~0 .cse2)) (not (fp.leq v_prenex_11 .cse2)) (not (fp.geq v_prenex_11 (_ +zero 11 53))) (not (fp.geq v_ULTIMATE.start_main_~E~0_11 (_ +zero 11 53))) (fp.geq (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_11) (fp.mul c_currentRoundingMode v_prenex_11 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse3 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode .cse3 ULTIMATE.start_main_~B2~0))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (not (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53))))))) is different from false [2020-11-29 23:59:57,002 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~E~0_12 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B2~0 (_ FloatingPoint 11 53)) (v_prenex_10 (_ FloatingPoint 11 53)) (v_prenex_9 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.geq v_prenex_9 (_ +zero 11 53))) (not (fp.leq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.geq v_prenex_10 (_ +zero 11 53))) (not (fp.leq v_ULTIMATE.start_main_~E~0_12 .cse0)) (not (fp.leq v_prenex_10 .cse0)) (fp.leq (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_9) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_12 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_prenex_10 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse1 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode .cse1 ULTIMATE.start_main_~B2~0))) ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (not (fp.leq v_prenex_9 .cse0)) (not (fp.geq v_ULTIMATE.start_main_~E~0_12 (_ +zero 11 53)))))) (forall ((v_ULTIMATE.start_main_~E~0_11 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B2~0 (_ FloatingPoint 11 53)) (v_prenex_11 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq v_ULTIMATE.start_main_~E~0_11 .cse2)) (not (fp.geq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.leq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.leq ULTIMATE.start_main_~E0~0 .cse2)) (not (fp.leq v_prenex_11 .cse2)) (not (fp.geq v_prenex_11 (_ +zero 11 53))) (not (fp.geq v_ULTIMATE.start_main_~E~0_11 (_ +zero 11 53))) (fp.geq (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_11) (fp.mul c_currentRoundingMode v_prenex_11 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse3 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode .cse3 ULTIMATE.start_main_~B2~0))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (not (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53))))))) is different from true [2020-11-29 23:59:59,300 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond))) (and (or (forall ((v_ULTIMATE.start_main_~E~0_12 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B2~0 (_ FloatingPoint 11 53)) (v_prenex_10 (_ FloatingPoint 11 53)) (v_prenex_9 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.geq v_prenex_9 (_ +zero 11 53))) (not (fp.leq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.geq v_prenex_10 (_ +zero 11 53))) (not (fp.leq v_ULTIMATE.start_main_~E~0_12 .cse0)) (not (fp.leq v_prenex_10 .cse0)) (fp.leq (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_9) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_12 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_prenex_10 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse1 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode .cse1 ULTIMATE.start_main_~B2~0))) ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (not (fp.leq v_prenex_9 .cse0)) (not (fp.geq v_ULTIMATE.start_main_~E~0_12 (_ +zero 11 53)))))) .cse2) (or (forall ((v_ULTIMATE.start_main_~E~0_11 (_ FloatingPoint 11 53)) (v_prenex_11 (_ FloatingPoint 11 53)) (v_prenex_12 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq v_ULTIMATE.start_main_~E~0_11 .cse3)) (not (fp.leq v_prenex_12 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.leq ULTIMATE.start_main_~E0~0 .cse3)) (not (fp.leq v_prenex_11 .cse3)) (not (fp.geq v_prenex_11 (_ +zero 11 53))) (not (fp.geq v_prenex_12 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.geq v_ULTIMATE.start_main_~E~0_11 (_ +zero 11 53))) (fp.geq (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_11) (fp.mul c_currentRoundingMode v_prenex_11 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse4 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode .cse4 v_prenex_12))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (not (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53)))))) .cse2))) is different from true [2020-11-29 23:59:59,303 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-11-29 23:59:59,303 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-29 23:59:59,304 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 00:00:02,319 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~E~0_12 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B2~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B1~0 (_ FloatingPoint 11 53)) (v_prenex_10 (_ FloatingPoint 11 53)) (v_prenex_9 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.geq v_prenex_9 (_ +zero 11 53))) (not (fp.leq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.geq v_prenex_10 (_ +zero 11 53))) (not (fp.leq v_ULTIMATE.start_main_~E~0_12 .cse0)) (not (fp.leq v_prenex_10 .cse0)) (fp.leq (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_9) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_12 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_prenex_10 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse1 ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode .cse1 ULTIMATE.start_main_~B2~0))) ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (not (fp.leq v_prenex_9 .cse0)) (not (fp.geq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.leq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0)))) (not (fp.geq v_ULTIMATE.start_main_~E~0_12 (_ +zero 11 53)))))) (forall ((v_ULTIMATE.start_main_~E~0_11 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B1~0 (_ FloatingPoint 11 53)) (v_prenex_11 (_ FloatingPoint 11 53)) (v_prenex_12 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq v_ULTIMATE.start_main_~E~0_11 .cse2)) (not (fp.leq v_prenex_12 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.leq ULTIMATE.start_main_~E0~0 .cse2)) (not (fp.leq v_prenex_11 .cse2)) (not (fp.geq v_prenex_11 (_ +zero 11 53))) (not (fp.geq v_prenex_12 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.geq v_ULTIMATE.start_main_~E~0_11 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.leq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0)))) (fp.geq (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_11) (fp.mul c_currentRoundingMode v_prenex_11 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse3 ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode .cse3 v_prenex_12))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (not (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53))))))) is different from true [2020-11-30 00:00:04,664 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond))) (and (or (forall ((v_ULTIMATE.start_main_~E~0_12 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B2~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B1~0 (_ FloatingPoint 11 53)) (v_prenex_10 (_ FloatingPoint 11 53)) (v_prenex_9 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.geq v_prenex_9 (_ +zero 11 53))) (not (fp.leq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.geq v_prenex_10 (_ +zero 11 53))) (not (fp.leq v_ULTIMATE.start_main_~E~0_12 .cse0)) (not (fp.leq v_prenex_10 .cse0)) (fp.leq (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_9) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_12 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_prenex_10 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse1 ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode .cse1 ULTIMATE.start_main_~B2~0))) ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (not (fp.leq v_prenex_9 .cse0)) (not (fp.geq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.leq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0)))) (not (fp.geq v_ULTIMATE.start_main_~E~0_12 (_ +zero 11 53)))))) .cse2) (or .cse2 (forall ((v_ULTIMATE.start_main_~E~0_11 (_ FloatingPoint 11 53)) (v_prenex_13 (_ FloatingPoint 11 53)) (v_prenex_11 (_ FloatingPoint 11 53)) (v_prenex_12 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq v_ULTIMATE.start_main_~E~0_11 .cse3)) (fp.geq (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_11) (fp.mul c_currentRoundingMode v_prenex_11 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse4 v_prenex_13)) (fp.mul c_currentRoundingMode .cse4 v_prenex_12))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (not (fp.leq v_prenex_12 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.leq ULTIMATE.start_main_~E0~0 .cse3)) (not (fp.leq v_prenex_11 .cse3)) (not (fp.geq v_prenex_13 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.geq v_prenex_11 (_ +zero 11 53))) (not (fp.geq v_prenex_12 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.leq v_prenex_13 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0)))) (not (fp.geq v_ULTIMATE.start_main_~E~0_11 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53))))))))) is different from true [2020-11-30 00:00:04,667 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-11-30 00:00:04,668 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 00:00:04,670 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 00:00:06,838 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((ULTIMATE.start_main_~A3~0 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_11 (_ FloatingPoint 11 53)) (v_prenex_13 (_ FloatingPoint 11 53)) (v_prenex_11 (_ FloatingPoint 11 53)) (v_prenex_12 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_11) (fp.mul c_currentRoundingMode v_prenex_11 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode ULTIMATE.start_main_~E0~0 ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse0 v_prenex_13)) (fp.mul c_currentRoundingMode .cse0 v_prenex_12))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (not (fp.leq ULTIMATE.start_main_~E0~0 .cse1)) (not (fp.leq v_prenex_13 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0)))) (not (fp.geq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0)))) (not (fp.geq v_ULTIMATE.start_main_~E~0_11 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53))) (not (fp.leq v_ULTIMATE.start_main_~E~0_11 .cse1)) (not (fp.leq v_prenex_12 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.leq v_prenex_11 .cse1)) (not (fp.geq v_prenex_13 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.geq v_prenex_11 (_ +zero 11 53))) (not (fp.geq v_prenex_12 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.leq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0))))))) (forall ((v_ULTIMATE.start_main_~E~0_12 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~A3~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B2~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B1~0 (_ FloatingPoint 11 53)) (v_prenex_10 (_ FloatingPoint 11 53)) (v_prenex_9 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.geq v_prenex_10 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0)))) (not (fp.leq v_prenex_10 .cse2)) (not (fp.geq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.geq v_ULTIMATE.start_main_~E~0_12 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.geq v_prenex_9 (_ +zero 11 53))) (not (fp.leq v_ULTIMATE.start_main_~E~0_12 .cse2)) (not (fp.leq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0)))) (fp.leq (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_9) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_12 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_prenex_10 ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse3 ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode .cse3 ULTIMATE.start_main_~B2~0))) ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (not (fp.leq v_prenex_9 .cse2)) (not (fp.leq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0)))))))) is different from false [2020-11-30 00:00:09,109 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((ULTIMATE.start_main_~A3~0 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_11 (_ FloatingPoint 11 53)) (v_prenex_13 (_ FloatingPoint 11 53)) (v_prenex_11 (_ FloatingPoint 11 53)) (v_prenex_12 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_11) (fp.mul c_currentRoundingMode v_prenex_11 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode ULTIMATE.start_main_~E0~0 ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse0 v_prenex_13)) (fp.mul c_currentRoundingMode .cse0 v_prenex_12))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (not (fp.leq ULTIMATE.start_main_~E0~0 .cse1)) (not (fp.leq v_prenex_13 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0)))) (not (fp.geq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0)))) (not (fp.geq v_ULTIMATE.start_main_~E~0_11 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53))) (not (fp.leq v_ULTIMATE.start_main_~E~0_11 .cse1)) (not (fp.leq v_prenex_12 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.leq v_prenex_11 .cse1)) (not (fp.geq v_prenex_13 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.geq v_prenex_11 (_ +zero 11 53))) (not (fp.geq v_prenex_12 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.leq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0))))))) (forall ((v_ULTIMATE.start_main_~E~0_12 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~A3~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B2~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B1~0 (_ FloatingPoint 11 53)) (v_prenex_10 (_ FloatingPoint 11 53)) (v_prenex_9 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.geq v_prenex_10 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0)))) (not (fp.leq v_prenex_10 .cse2)) (not (fp.geq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.geq v_ULTIMATE.start_main_~E~0_12 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.geq v_prenex_9 (_ +zero 11 53))) (not (fp.leq v_ULTIMATE.start_main_~E~0_12 .cse2)) (not (fp.leq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0)))) (fp.leq (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_9) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_12 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_prenex_10 ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse3 ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode .cse3 ULTIMATE.start_main_~B2~0))) ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (not (fp.leq v_prenex_9 .cse2)) (not (fp.leq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0)))))))) is different from true [2020-11-30 00:00:11,454 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond))) (and (or (forall ((v_ULTIMATE.start_main_~E~0_12 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B2~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B1~0 (_ FloatingPoint 11 53)) (v_prenex_14 (_ FloatingPoint 11 53)) (v_prenex_10 (_ FloatingPoint 11 53)) (v_prenex_9 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_prenex_14 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0)))) (not (fp.leq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.geq v_prenex_10 (_ +zero 11 53))) (not (fp.leq v_prenex_10 .cse0)) (not (fp.geq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.geq v_ULTIMATE.start_main_~E~0_12 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.geq v_prenex_9 (_ +zero 11 53))) (not (fp.leq v_ULTIMATE.start_main_~E~0_12 .cse0)) (fp.leq (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_9) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_12 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_prenex_10 v_prenex_14)) (fp.mul c_currentRoundingMode .cse1 ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode .cse1 ULTIMATE.start_main_~B2~0))) ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (not (fp.leq v_prenex_14 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0)))) (not (fp.leq v_prenex_9 .cse0)) (not (fp.leq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0))))))) .cse2) (or (forall ((ULTIMATE.start_main_~A3~0 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_11 (_ FloatingPoint 11 53)) (v_prenex_13 (_ FloatingPoint 11 53)) (v_prenex_11 (_ FloatingPoint 11 53)) (v_prenex_12 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_11) (fp.mul c_currentRoundingMode v_prenex_11 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode ULTIMATE.start_main_~E0~0 ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse3 v_prenex_13)) (fp.mul c_currentRoundingMode .cse3 v_prenex_12))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (not (fp.leq ULTIMATE.start_main_~E0~0 .cse4)) (not (fp.leq v_prenex_13 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0)))) (not (fp.geq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0)))) (not (fp.geq v_ULTIMATE.start_main_~E~0_11 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53))) (not (fp.leq v_ULTIMATE.start_main_~E~0_11 .cse4)) (not (fp.leq v_prenex_12 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.leq v_prenex_11 .cse4)) (not (fp.geq v_prenex_13 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.geq v_prenex_11 (_ +zero 11 53))) (not (fp.geq v_prenex_12 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.leq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0))))))) .cse2))) is different from true [2020-11-30 00:00:11,458 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-11-30 00:00:11,458 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 00:00:11,459 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 00:00:13,708 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((ULTIMATE.start_main_~A3~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~A2~0 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_11 (_ FloatingPoint 11 53)) (v_prenex_13 (_ FloatingPoint 11 53)) (v_prenex_11 (_ FloatingPoint 11 53)) (v_prenex_12 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_11) (fp.mul c_currentRoundingMode v_prenex_11 ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode ULTIMATE.start_main_~E0~0 ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse0 v_prenex_13)) (fp.mul c_currentRoundingMode .cse0 v_prenex_12))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (not (fp.leq ULTIMATE.start_main_~E0~0 .cse1)) (not (fp.leq v_prenex_13 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0)))) (not (fp.geq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0)))) (not (fp.leq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0))))) (not (fp.geq v_ULTIMATE.start_main_~E~0_11 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53))) (not (fp.leq v_ULTIMATE.start_main_~E~0_11 .cse1)) (not (fp.leq v_prenex_12 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.leq v_prenex_11 .cse1)) (not (fp.geq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0))))) (not (fp.geq v_prenex_13 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.geq v_prenex_11 (_ +zero 11 53))) (not (fp.geq v_prenex_12 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.leq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0))))))) (forall ((v_ULTIMATE.start_main_~E~0_12 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~A2~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B2~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B1~0 (_ FloatingPoint 11 53)) (v_prenex_14 (_ FloatingPoint 11 53)) (v_prenex_10 (_ FloatingPoint 11 53)) (v_prenex_9 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_prenex_14 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0)))) (not (fp.leq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.geq v_prenex_10 (_ +zero 11 53))) (not (fp.leq v_prenex_10 .cse2)) (not (fp.leq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0))))) (not (fp.geq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.geq v_ULTIMATE.start_main_~E~0_12 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.geq v_prenex_9 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0))))) (not (fp.leq v_ULTIMATE.start_main_~E~0_12 .cse2)) (fp.leq (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_9) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_12 ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_prenex_10 v_prenex_14)) (fp.mul c_currentRoundingMode .cse3 ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode .cse3 ULTIMATE.start_main_~B2~0))) ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (not (fp.leq v_prenex_14 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0)))) (not (fp.leq v_prenex_9 .cse2)) (not (fp.leq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0)))))))) is different from false [2020-11-30 00:00:16,005 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((ULTIMATE.start_main_~A3~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~A2~0 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_11 (_ FloatingPoint 11 53)) (v_prenex_13 (_ FloatingPoint 11 53)) (v_prenex_11 (_ FloatingPoint 11 53)) (v_prenex_12 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_11) (fp.mul c_currentRoundingMode v_prenex_11 ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode ULTIMATE.start_main_~E0~0 ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse0 v_prenex_13)) (fp.mul c_currentRoundingMode .cse0 v_prenex_12))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (not (fp.leq ULTIMATE.start_main_~E0~0 .cse1)) (not (fp.leq v_prenex_13 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0)))) (not (fp.geq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0)))) (not (fp.leq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0))))) (not (fp.geq v_ULTIMATE.start_main_~E~0_11 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53))) (not (fp.leq v_ULTIMATE.start_main_~E~0_11 .cse1)) (not (fp.leq v_prenex_12 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.leq v_prenex_11 .cse1)) (not (fp.geq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0))))) (not (fp.geq v_prenex_13 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.geq v_prenex_11 (_ +zero 11 53))) (not (fp.geq v_prenex_12 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.leq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0))))))) (forall ((v_ULTIMATE.start_main_~E~0_12 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~A2~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B2~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B1~0 (_ FloatingPoint 11 53)) (v_prenex_14 (_ FloatingPoint 11 53)) (v_prenex_10 (_ FloatingPoint 11 53)) (v_prenex_9 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_prenex_14 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0)))) (not (fp.leq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.geq v_prenex_10 (_ +zero 11 53))) (not (fp.leq v_prenex_10 .cse2)) (not (fp.leq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0))))) (not (fp.geq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.geq v_ULTIMATE.start_main_~E~0_12 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.geq v_prenex_9 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0))))) (not (fp.leq v_ULTIMATE.start_main_~E~0_12 .cse2)) (fp.leq (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_9) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_12 ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_prenex_10 v_prenex_14)) (fp.mul c_currentRoundingMode .cse3 ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode .cse3 ULTIMATE.start_main_~B2~0))) ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (not (fp.leq v_prenex_14 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0)))) (not (fp.leq v_prenex_9 .cse2)) (not (fp.leq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0)))))))) is different from true [2020-11-30 00:00:18,433 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond))) (and (or .cse0 (forall ((v_ULTIMATE.start_main_~E~0_12 (_ FloatingPoint 11 53)) (v_prenex_15 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B2~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B1~0 (_ FloatingPoint 11 53)) (v_prenex_14 (_ FloatingPoint 11 53)) (v_prenex_10 (_ FloatingPoint 11 53)) (v_prenex_9 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_prenex_14 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0)))) (not (fp.leq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.geq v_prenex_10 (_ +zero 11 53))) (fp.leq (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_9) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_12 v_prenex_15)) (fp.mul c_currentRoundingMode v_prenex_10 v_prenex_14)) (fp.mul c_currentRoundingMode .cse1 ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode .cse1 ULTIMATE.start_main_~B2~0))) ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (not (fp.leq v_prenex_10 .cse2)) (not (fp.geq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.geq v_ULTIMATE.start_main_~E~0_12 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.leq v_prenex_15 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0))))) (not (fp.geq v_prenex_9 (_ +zero 11 53))) (not (fp.leq v_ULTIMATE.start_main_~E~0_12 .cse2)) (not (fp.leq v_prenex_14 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0)))) (not (fp.geq v_prenex_15 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0))))) (not (fp.leq v_prenex_9 .cse2)) (not (fp.leq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0)))))))) (or (forall ((ULTIMATE.start_main_~A3~0 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_11 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~A2~0 (_ FloatingPoint 11 53)) (v_prenex_13 (_ FloatingPoint 11 53)) (v_prenex_11 (_ FloatingPoint 11 53)) (v_prenex_12 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_11) (fp.mul c_currentRoundingMode v_prenex_11 ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode ULTIMATE.start_main_~E0~0 ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse3 v_prenex_13)) (fp.mul c_currentRoundingMode .cse3 v_prenex_12))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (not (fp.leq ULTIMATE.start_main_~E0~0 .cse4)) (not (fp.leq v_prenex_13 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0)))) (not (fp.geq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0)))) (not (fp.leq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0))))) (not (fp.geq v_ULTIMATE.start_main_~E~0_11 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53))) (not (fp.leq v_ULTIMATE.start_main_~E~0_11 .cse4)) (not (fp.leq v_prenex_12 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.leq v_prenex_11 .cse4)) (not (fp.geq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0))))) (not (fp.geq v_prenex_13 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.geq v_prenex_11 (_ +zero 11 53))) (not (fp.geq v_prenex_12 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.leq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0))))))) .cse0))) is different from true [2020-11-30 00:00:18,437 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 00:00:18,437 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 00:00:18,673 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 00:00:21,110 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((ULTIMATE.start_main_~A3~0 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_11 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~A2~0 (_ FloatingPoint 11 53)) (v_prenex_13 (_ FloatingPoint 11 53)) (v_prenex_11 (_ FloatingPoint 11 53)) (v_prenex_12 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~A1~0_7 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0)))) (or (not (fp.leq v_ULTIMATE.start_main_~A1~0_7 .cse0)) (not (fp.leq ULTIMATE.start_main_~E0~0 .cse1)) (not (fp.leq v_prenex_13 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0)))) (not (fp.geq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0)))) (not (fp.leq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0))))) (not (fp.geq v_ULTIMATE.start_main_~E~0_11 (_ +zero 11 53))) (not (fp.geq v_ULTIMATE.start_main_~A1~0_7 .cse2)) (not (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53))) (not (fp.leq v_ULTIMATE.start_main_~E~0_11 .cse1)) (not (fp.leq v_prenex_12 (fp.neg .cse2))) (fp.geq (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~A1~0_7 v_ULTIMATE.start_main_~E~0_11) (fp.mul c_currentRoundingMode v_prenex_11 ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode ULTIMATE.start_main_~E0~0 ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse3 v_prenex_13)) (fp.mul c_currentRoundingMode .cse3 v_prenex_12))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (not (fp.leq v_prenex_11 .cse1)) (not (fp.geq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0))))) (not (fp.geq v_prenex_13 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.geq v_prenex_11 (_ +zero 11 53))) (not (fp.geq v_prenex_12 (fp.neg .cse0))) (not (fp.leq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0))))))) (forall ((v_ULTIMATE.start_main_~E~0_12 (_ FloatingPoint 11 53)) (v_prenex_15 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B2~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B1~0 (_ FloatingPoint 11 53)) (v_prenex_14 (_ FloatingPoint 11 53)) (v_prenex_10 (_ FloatingPoint 11 53)) (v_prenex_9 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~A1~0_7 (_ FloatingPoint 11 53))) (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))) (.cse7 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq v_ULTIMATE.start_main_~A1~0_7 .cse4)) (not (fp.geq v_prenex_14 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0)))) (not (fp.leq ULTIMATE.start_main_~B2~0 (fp.neg .cse5))) (not (fp.geq v_prenex_10 (_ +zero 11 53))) (fp.leq (let ((.cse6 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~A1~0_7 v_prenex_9) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_12 v_prenex_15)) (fp.mul c_currentRoundingMode v_prenex_10 v_prenex_14)) (fp.mul c_currentRoundingMode .cse6 ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode .cse6 ULTIMATE.start_main_~B2~0))) ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (not (fp.leq v_prenex_10 .cse7)) (not (fp.geq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.geq v_ULTIMATE.start_main_~A1~0_7 .cse5)) (not (fp.geq v_ULTIMATE.start_main_~E~0_12 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~B2~0 (fp.neg .cse4))) (not (fp.leq v_prenex_15 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0))))) (not (fp.geq v_prenex_9 (_ +zero 11 53))) (not (fp.leq v_ULTIMATE.start_main_~E~0_12 .cse7)) (not (fp.leq v_prenex_14 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0)))) (not (fp.geq v_prenex_15 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0))))) (not (fp.leq v_prenex_9 .cse7)) (not (fp.leq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0)))))))) is different from false [2020-11-30 00:00:23,434 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((ULTIMATE.start_main_~A3~0 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_11 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~A2~0 (_ FloatingPoint 11 53)) (v_prenex_13 (_ FloatingPoint 11 53)) (v_prenex_11 (_ FloatingPoint 11 53)) (v_prenex_12 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~A1~0_7 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0)))) (or (not (fp.leq v_ULTIMATE.start_main_~A1~0_7 .cse0)) (not (fp.leq ULTIMATE.start_main_~E0~0 .cse1)) (not (fp.leq v_prenex_13 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0)))) (not (fp.geq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0)))) (not (fp.leq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0))))) (not (fp.geq v_ULTIMATE.start_main_~E~0_11 (_ +zero 11 53))) (not (fp.geq v_ULTIMATE.start_main_~A1~0_7 .cse2)) (not (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53))) (not (fp.leq v_ULTIMATE.start_main_~E~0_11 .cse1)) (not (fp.leq v_prenex_12 (fp.neg .cse2))) (fp.geq (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~A1~0_7 v_ULTIMATE.start_main_~E~0_11) (fp.mul c_currentRoundingMode v_prenex_11 ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode ULTIMATE.start_main_~E0~0 ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse3 v_prenex_13)) (fp.mul c_currentRoundingMode .cse3 v_prenex_12))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (not (fp.leq v_prenex_11 .cse1)) (not (fp.geq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0))))) (not (fp.geq v_prenex_13 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.geq v_prenex_11 (_ +zero 11 53))) (not (fp.geq v_prenex_12 (fp.neg .cse0))) (not (fp.leq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0))))))) (forall ((v_ULTIMATE.start_main_~E~0_12 (_ FloatingPoint 11 53)) (v_prenex_15 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B2~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B1~0 (_ FloatingPoint 11 53)) (v_prenex_14 (_ FloatingPoint 11 53)) (v_prenex_10 (_ FloatingPoint 11 53)) (v_prenex_9 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~A1~0_7 (_ FloatingPoint 11 53))) (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))) (.cse7 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq v_ULTIMATE.start_main_~A1~0_7 .cse4)) (not (fp.geq v_prenex_14 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0)))) (not (fp.leq ULTIMATE.start_main_~B2~0 (fp.neg .cse5))) (not (fp.geq v_prenex_10 (_ +zero 11 53))) (fp.leq (let ((.cse6 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~A1~0_7 v_prenex_9) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_12 v_prenex_15)) (fp.mul c_currentRoundingMode v_prenex_10 v_prenex_14)) (fp.mul c_currentRoundingMode .cse6 ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode .cse6 ULTIMATE.start_main_~B2~0))) ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (not (fp.leq v_prenex_10 .cse7)) (not (fp.geq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.geq v_ULTIMATE.start_main_~A1~0_7 .cse5)) (not (fp.geq v_ULTIMATE.start_main_~E~0_12 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~B2~0 (fp.neg .cse4))) (not (fp.leq v_prenex_15 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0))))) (not (fp.geq v_prenex_9 (_ +zero 11 53))) (not (fp.leq v_ULTIMATE.start_main_~E~0_12 .cse7)) (not (fp.leq v_prenex_14 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0)))) (not (fp.geq v_prenex_15 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0))))) (not (fp.leq v_prenex_9 .cse7)) (not (fp.leq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0)))))))) is different from true [2020-11-30 00:00:23,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-30 00:00:23,456 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1212454862] [2020-11-30 00:00:23,456 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:00:23,457 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20, 20] imperfect sequences [] total 40 [2020-11-30 00:00:23,457 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804244002] [2020-11-30 00:00:23,458 INFO L461 AbstractCegarLoop]: Interpolant automaton has 41 states [2020-11-30 00:00:23,459 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 00:00:23,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2020-11-30 00:00:23,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=314, Unknown=27, NotChecked=1140, Total=1640 [2020-11-30 00:00:23,463 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 41 states. [2020-11-30 00:00:25,645 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((ULTIMATE.start_main_~A3~0 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_11 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~A2~0 (_ FloatingPoint 11 53)) (v_prenex_13 (_ FloatingPoint 11 53)) (v_prenex_11 (_ FloatingPoint 11 53)) (v_prenex_12 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~A1~0_7 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0)))) (or (not (fp.leq v_ULTIMATE.start_main_~A1~0_7 .cse0)) (not (fp.leq ULTIMATE.start_main_~E0~0 .cse1)) (not (fp.leq v_prenex_13 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0)))) (not (fp.geq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0)))) (not (fp.leq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0))))) (not (fp.geq v_ULTIMATE.start_main_~E~0_11 (_ +zero 11 53))) (not (fp.geq v_ULTIMATE.start_main_~A1~0_7 .cse2)) (not (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53))) (not (fp.leq v_ULTIMATE.start_main_~E~0_11 .cse1)) (not (fp.leq v_prenex_12 (fp.neg .cse2))) (fp.geq (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~A1~0_7 v_ULTIMATE.start_main_~E~0_11) (fp.mul c_currentRoundingMode v_prenex_11 ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode ULTIMATE.start_main_~E0~0 ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse3 v_prenex_13)) (fp.mul c_currentRoundingMode .cse3 v_prenex_12))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (not (fp.leq v_prenex_11 .cse1)) (not (fp.geq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0))))) (not (fp.geq v_prenex_13 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.geq v_prenex_11 (_ +zero 11 53))) (not (fp.geq v_prenex_12 (fp.neg .cse0))) (not (fp.leq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0))))))) (= c_currentRoundingMode roundNearestTiesToEven) (forall ((v_ULTIMATE.start_main_~E~0_12 (_ FloatingPoint 11 53)) (v_prenex_15 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B2~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B1~0 (_ FloatingPoint 11 53)) (v_prenex_14 (_ FloatingPoint 11 53)) (v_prenex_10 (_ FloatingPoint 11 53)) (v_prenex_9 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~A1~0_7 (_ FloatingPoint 11 53))) (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))) (.cse7 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq v_ULTIMATE.start_main_~A1~0_7 .cse4)) (not (fp.geq v_prenex_14 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0)))) (not (fp.leq ULTIMATE.start_main_~B2~0 (fp.neg .cse5))) (not (fp.geq v_prenex_10 (_ +zero 11 53))) (fp.leq (let ((.cse6 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~A1~0_7 v_prenex_9) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_12 v_prenex_15)) (fp.mul c_currentRoundingMode v_prenex_10 v_prenex_14)) (fp.mul c_currentRoundingMode .cse6 ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode .cse6 ULTIMATE.start_main_~B2~0))) ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (not (fp.leq v_prenex_10 .cse7)) (not (fp.geq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.geq v_ULTIMATE.start_main_~A1~0_7 .cse5)) (not (fp.geq v_ULTIMATE.start_main_~E~0_12 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~B2~0 (fp.neg .cse4))) (not (fp.leq v_prenex_15 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0))))) (not (fp.geq v_prenex_9 (_ +zero 11 53))) (not (fp.leq v_ULTIMATE.start_main_~E~0_12 .cse7)) (not (fp.leq v_prenex_14 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0)))) (not (fp.geq v_prenex_15 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0))))) (not (fp.leq v_prenex_9 .cse7)) (not (fp.leq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0)))))))) is different from false [2020-11-30 00:00:27,945 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((ULTIMATE.start_main_~A3~0 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_11 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~A2~0 (_ FloatingPoint 11 53)) (v_prenex_13 (_ FloatingPoint 11 53)) (v_prenex_11 (_ FloatingPoint 11 53)) (v_prenex_12 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~A1~0_7 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0)))) (or (not (fp.leq v_ULTIMATE.start_main_~A1~0_7 .cse0)) (not (fp.leq ULTIMATE.start_main_~E0~0 .cse1)) (not (fp.leq v_prenex_13 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0)))) (not (fp.geq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0)))) (not (fp.leq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0))))) (not (fp.geq v_ULTIMATE.start_main_~E~0_11 (_ +zero 11 53))) (not (fp.geq v_ULTIMATE.start_main_~A1~0_7 .cse2)) (not (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53))) (not (fp.leq v_ULTIMATE.start_main_~E~0_11 .cse1)) (not (fp.leq v_prenex_12 (fp.neg .cse2))) (fp.geq (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~A1~0_7 v_ULTIMATE.start_main_~E~0_11) (fp.mul c_currentRoundingMode v_prenex_11 ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode ULTIMATE.start_main_~E0~0 ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse3 v_prenex_13)) (fp.mul c_currentRoundingMode .cse3 v_prenex_12))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (not (fp.leq v_prenex_11 .cse1)) (not (fp.geq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0))))) (not (fp.geq v_prenex_13 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.geq v_prenex_11 (_ +zero 11 53))) (not (fp.geq v_prenex_12 (fp.neg .cse0))) (not (fp.leq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0))))))) (= c_currentRoundingMode roundNearestTiesToEven) (forall ((v_ULTIMATE.start_main_~E~0_12 (_ FloatingPoint 11 53)) (v_prenex_15 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B2~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B1~0 (_ FloatingPoint 11 53)) (v_prenex_14 (_ FloatingPoint 11 53)) (v_prenex_10 (_ FloatingPoint 11 53)) (v_prenex_9 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~A1~0_7 (_ FloatingPoint 11 53))) (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))) (.cse7 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq v_ULTIMATE.start_main_~A1~0_7 .cse4)) (not (fp.geq v_prenex_14 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0)))) (not (fp.leq ULTIMATE.start_main_~B2~0 (fp.neg .cse5))) (not (fp.geq v_prenex_10 (_ +zero 11 53))) (fp.leq (let ((.cse6 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~A1~0_7 v_prenex_9) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_12 v_prenex_15)) (fp.mul c_currentRoundingMode v_prenex_10 v_prenex_14)) (fp.mul c_currentRoundingMode .cse6 ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode .cse6 ULTIMATE.start_main_~B2~0))) ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (not (fp.leq v_prenex_10 .cse7)) (not (fp.geq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.geq v_ULTIMATE.start_main_~A1~0_7 .cse5)) (not (fp.geq v_ULTIMATE.start_main_~E~0_12 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~B2~0 (fp.neg .cse4))) (not (fp.leq v_prenex_15 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0))))) (not (fp.geq v_prenex_9 (_ +zero 11 53))) (not (fp.leq v_ULTIMATE.start_main_~E~0_12 .cse7)) (not (fp.leq v_prenex_14 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0)))) (not (fp.geq v_prenex_15 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0))))) (not (fp.leq v_prenex_9 .cse7)) (not (fp.leq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0)))))))) is different from true [2020-11-30 00:00:30,232 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond))) (and (or .cse0 (forall ((v_ULTIMATE.start_main_~E~0_12 (_ FloatingPoint 11 53)) (v_prenex_15 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B2~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B1~0 (_ FloatingPoint 11 53)) (v_prenex_14 (_ FloatingPoint 11 53)) (v_prenex_10 (_ FloatingPoint 11 53)) (v_prenex_9 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_prenex_14 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0)))) (not (fp.leq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.geq v_prenex_10 (_ +zero 11 53))) (fp.leq (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_9) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_12 v_prenex_15)) (fp.mul c_currentRoundingMode v_prenex_10 v_prenex_14)) (fp.mul c_currentRoundingMode .cse1 ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode .cse1 ULTIMATE.start_main_~B2~0))) ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (not (fp.leq v_prenex_10 .cse2)) (not (fp.geq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.geq v_ULTIMATE.start_main_~E~0_12 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.leq v_prenex_15 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0))))) (not (fp.geq v_prenex_9 (_ +zero 11 53))) (not (fp.leq v_ULTIMATE.start_main_~E~0_12 .cse2)) (not (fp.leq v_prenex_14 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0)))) (not (fp.geq v_prenex_15 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0))))) (not (fp.leq v_prenex_9 .cse2)) (not (fp.leq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0)))))))) (= c_currentRoundingMode roundNearestTiesToEven) (or (forall ((ULTIMATE.start_main_~A3~0 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_11 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~A2~0 (_ FloatingPoint 11 53)) (v_prenex_13 (_ FloatingPoint 11 53)) (v_prenex_11 (_ FloatingPoint 11 53)) (v_prenex_12 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_11) (fp.mul c_currentRoundingMode v_prenex_11 ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode ULTIMATE.start_main_~E0~0 ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse3 v_prenex_13)) (fp.mul c_currentRoundingMode .cse3 v_prenex_12))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (not (fp.leq ULTIMATE.start_main_~E0~0 .cse4)) (not (fp.leq v_prenex_13 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0)))) (not (fp.geq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0)))) (not (fp.leq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0))))) (not (fp.geq v_ULTIMATE.start_main_~E~0_11 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53))) (not (fp.leq v_ULTIMATE.start_main_~E~0_11 .cse4)) (not (fp.leq v_prenex_12 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.leq v_prenex_11 .cse4)) (not (fp.geq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0))))) (not (fp.geq v_prenex_13 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.geq v_prenex_11 (_ +zero 11 53))) (not (fp.geq v_prenex_12 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.leq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0))))))) .cse0) (let ((.cse6 (fp.leq c_ULTIMATE.start_main_~A1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0)))) (.cse5 (fp.geq c_ULTIMATE.start_main_~A1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (or (and .cse5 (= (_ bv1 32) c_ULTIMATE.start_assume_abort_if_not_~cond) .cse6) (and (or (not .cse6) (not .cse5)) .cse0))))) is different from true [2020-11-30 00:00:32,358 WARN L838 $PredicateComparison]: unable to prove that (and (fp.geq c_ULTIMATE.start_main_~A1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))) (forall ((ULTIMATE.start_main_~A3~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~A2~0 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_11 (_ FloatingPoint 11 53)) (v_prenex_13 (_ FloatingPoint 11 53)) (v_prenex_11 (_ FloatingPoint 11 53)) (v_prenex_12 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_11) (fp.mul c_currentRoundingMode v_prenex_11 ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode ULTIMATE.start_main_~E0~0 ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse0 v_prenex_13)) (fp.mul c_currentRoundingMode .cse0 v_prenex_12))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (not (fp.leq ULTIMATE.start_main_~E0~0 .cse1)) (not (fp.leq v_prenex_13 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0)))) (not (fp.geq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0)))) (not (fp.leq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0))))) (not (fp.geq v_ULTIMATE.start_main_~E~0_11 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53))) (not (fp.leq v_ULTIMATE.start_main_~E~0_11 .cse1)) (not (fp.leq v_prenex_12 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.leq v_prenex_11 .cse1)) (not (fp.geq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0))))) (not (fp.geq v_prenex_13 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.geq v_prenex_11 (_ +zero 11 53))) (not (fp.geq v_prenex_12 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.leq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0))))))) (forall ((v_ULTIMATE.start_main_~E~0_12 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~A2~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B2~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B1~0 (_ FloatingPoint 11 53)) (v_prenex_14 (_ FloatingPoint 11 53)) (v_prenex_10 (_ FloatingPoint 11 53)) (v_prenex_9 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_prenex_14 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0)))) (not (fp.leq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.geq v_prenex_10 (_ +zero 11 53))) (not (fp.leq v_prenex_10 .cse2)) (not (fp.leq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0))))) (not (fp.geq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.geq v_ULTIMATE.start_main_~E~0_12 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.geq v_prenex_9 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0))))) (not (fp.leq v_ULTIMATE.start_main_~E~0_12 .cse2)) (fp.leq (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_9) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_12 ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_prenex_10 v_prenex_14)) (fp.mul c_currentRoundingMode .cse3 ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode .cse3 ULTIMATE.start_main_~B2~0))) ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (not (fp.leq v_prenex_14 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0)))) (not (fp.leq v_prenex_9 .cse2)) (not (fp.leq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0))))))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_ULTIMATE.start_main_~A1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0)))) is different from false [2020-11-30 00:00:34,646 WARN L860 $PredicateComparison]: unable to prove that (and (fp.geq c_ULTIMATE.start_main_~A1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))) (forall ((ULTIMATE.start_main_~A3~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~A2~0 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_11 (_ FloatingPoint 11 53)) (v_prenex_13 (_ FloatingPoint 11 53)) (v_prenex_11 (_ FloatingPoint 11 53)) (v_prenex_12 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_11) (fp.mul c_currentRoundingMode v_prenex_11 ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode ULTIMATE.start_main_~E0~0 ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse0 v_prenex_13)) (fp.mul c_currentRoundingMode .cse0 v_prenex_12))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (not (fp.leq ULTIMATE.start_main_~E0~0 .cse1)) (not (fp.leq v_prenex_13 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0)))) (not (fp.geq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0)))) (not (fp.leq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0))))) (not (fp.geq v_ULTIMATE.start_main_~E~0_11 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53))) (not (fp.leq v_ULTIMATE.start_main_~E~0_11 .cse1)) (not (fp.leq v_prenex_12 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.leq v_prenex_11 .cse1)) (not (fp.geq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0))))) (not (fp.geq v_prenex_13 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.geq v_prenex_11 (_ +zero 11 53))) (not (fp.geq v_prenex_12 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.leq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0))))))) (forall ((v_ULTIMATE.start_main_~E~0_12 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~A2~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B2~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B1~0 (_ FloatingPoint 11 53)) (v_prenex_14 (_ FloatingPoint 11 53)) (v_prenex_10 (_ FloatingPoint 11 53)) (v_prenex_9 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_prenex_14 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0)))) (not (fp.leq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.geq v_prenex_10 (_ +zero 11 53))) (not (fp.leq v_prenex_10 .cse2)) (not (fp.leq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0))))) (not (fp.geq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.geq v_ULTIMATE.start_main_~E~0_12 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.geq v_prenex_9 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0))))) (not (fp.leq v_ULTIMATE.start_main_~E~0_12 .cse2)) (fp.leq (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_9) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_12 ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_prenex_10 v_prenex_14)) (fp.mul c_currentRoundingMode .cse3 ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode .cse3 ULTIMATE.start_main_~B2~0))) ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (not (fp.leq v_prenex_14 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0)))) (not (fp.leq v_prenex_9 .cse2)) (not (fp.leq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0))))))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_ULTIMATE.start_main_~A1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0)))) is different from true [2020-11-30 00:00:36,997 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond))) (and (fp.geq c_ULTIMATE.start_main_~A1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_ULTIMATE.start_main_~A1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))) (let ((.cse0 (fp.geq c_ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0))))) (.cse1 (fp.leq c_ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0)))))) (or (and .cse0 (= (_ bv1 32) c_ULTIMATE.start_assume_abort_if_not_~cond) .cse1) (and (or (not .cse0) (not .cse1)) .cse2))) (or (forall ((v_ULTIMATE.start_main_~E~0_12 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B2~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B1~0 (_ FloatingPoint 11 53)) (v_prenex_14 (_ FloatingPoint 11 53)) (v_prenex_10 (_ FloatingPoint 11 53)) (v_prenex_9 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_prenex_14 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0)))) (not (fp.leq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.geq v_prenex_10 (_ +zero 11 53))) (not (fp.leq v_prenex_10 .cse3)) (not (fp.geq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.geq v_ULTIMATE.start_main_~E~0_12 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.geq v_prenex_9 (_ +zero 11 53))) (not (fp.leq v_ULTIMATE.start_main_~E~0_12 .cse3)) (fp.leq (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_9) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_12 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_prenex_10 v_prenex_14)) (fp.mul c_currentRoundingMode .cse4 ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode .cse4 ULTIMATE.start_main_~B2~0))) ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (not (fp.leq v_prenex_14 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0)))) (not (fp.leq v_prenex_9 .cse3)) (not (fp.leq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0))))))) .cse2) (or (forall ((ULTIMATE.start_main_~A3~0 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_11 (_ FloatingPoint 11 53)) (v_prenex_13 (_ FloatingPoint 11 53)) (v_prenex_11 (_ FloatingPoint 11 53)) (v_prenex_12 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse6 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_11) (fp.mul c_currentRoundingMode v_prenex_11 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode ULTIMATE.start_main_~E0~0 ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse5 v_prenex_13)) (fp.mul c_currentRoundingMode .cse5 v_prenex_12))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (not (fp.leq ULTIMATE.start_main_~E0~0 .cse6)) (not (fp.leq v_prenex_13 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0)))) (not (fp.geq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0)))) (not (fp.geq v_ULTIMATE.start_main_~E~0_11 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53))) (not (fp.leq v_ULTIMATE.start_main_~E~0_11 .cse6)) (not (fp.leq v_prenex_12 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.leq v_prenex_11 .cse6)) (not (fp.geq v_prenex_13 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.geq v_prenex_11 (_ +zero 11 53))) (not (fp.geq v_prenex_12 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.leq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0))))))) .cse2))) is different from true [2020-11-30 00:00:39,109 WARN L838 $PredicateComparison]: unable to prove that (and (fp.geq c_ULTIMATE.start_main_~A1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))) (fp.geq c_ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0)))) (= c_currentRoundingMode roundNearestTiesToEven) (forall ((ULTIMATE.start_main_~A3~0 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_11 (_ FloatingPoint 11 53)) (v_prenex_13 (_ FloatingPoint 11 53)) (v_prenex_11 (_ FloatingPoint 11 53)) (v_prenex_12 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_11) (fp.mul c_currentRoundingMode v_prenex_11 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode ULTIMATE.start_main_~E0~0 ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse0 v_prenex_13)) (fp.mul c_currentRoundingMode .cse0 v_prenex_12))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (not (fp.leq ULTIMATE.start_main_~E0~0 .cse1)) (not (fp.leq v_prenex_13 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0)))) (not (fp.geq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0)))) (not (fp.geq v_ULTIMATE.start_main_~E~0_11 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53))) (not (fp.leq v_ULTIMATE.start_main_~E~0_11 .cse1)) (not (fp.leq v_prenex_12 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.leq v_prenex_11 .cse1)) (not (fp.geq v_prenex_13 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.geq v_prenex_11 (_ +zero 11 53))) (not (fp.geq v_prenex_12 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.leq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0))))))) (fp.leq c_ULTIMATE.start_main_~A1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))) (fp.leq c_ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0)))) (forall ((v_ULTIMATE.start_main_~E~0_12 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~A3~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B2~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B1~0 (_ FloatingPoint 11 53)) (v_prenex_10 (_ FloatingPoint 11 53)) (v_prenex_9 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.geq v_prenex_10 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0)))) (not (fp.leq v_prenex_10 .cse2)) (not (fp.geq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.geq v_ULTIMATE.start_main_~E~0_12 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.geq v_prenex_9 (_ +zero 11 53))) (not (fp.leq v_ULTIMATE.start_main_~E~0_12 .cse2)) (not (fp.leq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0)))) (fp.leq (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_9) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_12 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_prenex_10 ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse3 ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode .cse3 ULTIMATE.start_main_~B2~0))) ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (not (fp.leq v_prenex_9 .cse2)) (not (fp.leq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0)))))))) is different from false [2020-11-30 00:00:41,439 WARN L860 $PredicateComparison]: unable to prove that (and (fp.geq c_ULTIMATE.start_main_~A1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))) (fp.geq c_ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0)))) (= c_currentRoundingMode roundNearestTiesToEven) (forall ((ULTIMATE.start_main_~A3~0 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_11 (_ FloatingPoint 11 53)) (v_prenex_13 (_ FloatingPoint 11 53)) (v_prenex_11 (_ FloatingPoint 11 53)) (v_prenex_12 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_11) (fp.mul c_currentRoundingMode v_prenex_11 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode ULTIMATE.start_main_~E0~0 ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse0 v_prenex_13)) (fp.mul c_currentRoundingMode .cse0 v_prenex_12))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (not (fp.leq ULTIMATE.start_main_~E0~0 .cse1)) (not (fp.leq v_prenex_13 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0)))) (not (fp.geq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0)))) (not (fp.geq v_ULTIMATE.start_main_~E~0_11 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53))) (not (fp.leq v_ULTIMATE.start_main_~E~0_11 .cse1)) (not (fp.leq v_prenex_12 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.leq v_prenex_11 .cse1)) (not (fp.geq v_prenex_13 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.geq v_prenex_11 (_ +zero 11 53))) (not (fp.geq v_prenex_12 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.leq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0))))))) (fp.leq c_ULTIMATE.start_main_~A1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))) (fp.leq c_ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0)))) (forall ((v_ULTIMATE.start_main_~E~0_12 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~A3~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B2~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B1~0 (_ FloatingPoint 11 53)) (v_prenex_10 (_ FloatingPoint 11 53)) (v_prenex_9 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.geq v_prenex_10 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0)))) (not (fp.leq v_prenex_10 .cse2)) (not (fp.geq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.geq v_ULTIMATE.start_main_~E~0_12 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.geq v_prenex_9 (_ +zero 11 53))) (not (fp.leq v_ULTIMATE.start_main_~E~0_12 .cse2)) (not (fp.leq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0)))) (fp.leq (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_9) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_12 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_prenex_10 ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse3 ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode .cse3 ULTIMATE.start_main_~B2~0))) ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (not (fp.leq v_prenex_9 .cse2)) (not (fp.leq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0)))))))) is different from true [2020-11-30 00:00:43,755 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond))) (and (fp.geq c_ULTIMATE.start_main_~A1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))) (or (forall ((v_ULTIMATE.start_main_~E~0_12 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B2~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B1~0 (_ FloatingPoint 11 53)) (v_prenex_10 (_ FloatingPoint 11 53)) (v_prenex_9 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.geq v_prenex_9 (_ +zero 11 53))) (not (fp.leq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.geq v_prenex_10 (_ +zero 11 53))) (not (fp.leq v_ULTIMATE.start_main_~E~0_12 .cse0)) (not (fp.leq v_prenex_10 .cse0)) (fp.leq (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_9) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_12 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_prenex_10 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse1 ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode .cse1 ULTIMATE.start_main_~B2~0))) ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (not (fp.leq v_prenex_9 .cse0)) (not (fp.geq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.leq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0)))) (not (fp.geq v_ULTIMATE.start_main_~E~0_12 (_ +zero 11 53)))))) .cse2) (fp.geq c_ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0)))) (let ((.cse3 (fp.leq c_ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0)))) (.cse4 (fp.geq c_ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0))))) (or (and (or (not .cse3) (not .cse4)) .cse2) (and .cse3 .cse4 (= (_ bv1 32) c_ULTIMATE.start_assume_abort_if_not_~cond)))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_ULTIMATE.start_main_~A1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))) (or .cse2 (forall ((v_ULTIMATE.start_main_~E~0_11 (_ FloatingPoint 11 53)) (v_prenex_13 (_ FloatingPoint 11 53)) (v_prenex_11 (_ FloatingPoint 11 53)) (v_prenex_12 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq v_ULTIMATE.start_main_~E~0_11 .cse5)) (fp.geq (let ((.cse6 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_11) (fp.mul c_currentRoundingMode v_prenex_11 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse6 v_prenex_13)) (fp.mul c_currentRoundingMode .cse6 v_prenex_12))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (not (fp.leq v_prenex_12 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.leq ULTIMATE.start_main_~E0~0 .cse5)) (not (fp.leq v_prenex_11 .cse5)) (not (fp.geq v_prenex_13 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.geq v_prenex_11 (_ +zero 11 53))) (not (fp.geq v_prenex_12 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.leq v_prenex_13 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0)))) (not (fp.geq v_ULTIMATE.start_main_~E~0_11 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53))))))) (fp.leq c_ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0)))))) is different from true [2020-11-30 00:00:45,852 WARN L838 $PredicateComparison]: unable to prove that (and (fp.geq c_ULTIMATE.start_main_~A1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))) (fp.leq c_ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0))) (fp.geq c_ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0)))) (forall ((v_ULTIMATE.start_main_~E~0_12 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B2~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B1~0 (_ FloatingPoint 11 53)) (v_prenex_10 (_ FloatingPoint 11 53)) (v_prenex_9 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.geq v_prenex_9 (_ +zero 11 53))) (not (fp.leq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.geq v_prenex_10 (_ +zero 11 53))) (not (fp.leq v_ULTIMATE.start_main_~E~0_12 .cse0)) (not (fp.leq v_prenex_10 .cse0)) (fp.leq (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_9) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_12 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_prenex_10 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse1 ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode .cse1 ULTIMATE.start_main_~B2~0))) ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (not (fp.leq v_prenex_9 .cse0)) (not (fp.geq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.leq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0)))) (not (fp.geq v_ULTIMATE.start_main_~E~0_12 (_ +zero 11 53)))))) (fp.geq c_ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_ULTIMATE.start_main_~A1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))) (forall ((v_ULTIMATE.start_main_~E~0_11 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B1~0 (_ FloatingPoint 11 53)) (v_prenex_11 (_ FloatingPoint 11 53)) (v_prenex_12 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq v_ULTIMATE.start_main_~E~0_11 .cse2)) (not (fp.leq v_prenex_12 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.leq ULTIMATE.start_main_~E0~0 .cse2)) (not (fp.leq v_prenex_11 .cse2)) (not (fp.geq v_prenex_11 (_ +zero 11 53))) (not (fp.geq v_prenex_12 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.geq v_ULTIMATE.start_main_~E~0_11 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.leq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0)))) (fp.geq (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_11) (fp.mul c_currentRoundingMode v_prenex_11 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse3 ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode .cse3 v_prenex_12))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (not (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53)))))) (fp.leq c_ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0))))) is different from false [2020-11-30 00:00:48,183 WARN L860 $PredicateComparison]: unable to prove that (and (fp.geq c_ULTIMATE.start_main_~A1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))) (fp.leq c_ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0))) (fp.geq c_ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0)))) (forall ((v_ULTIMATE.start_main_~E~0_12 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B2~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B1~0 (_ FloatingPoint 11 53)) (v_prenex_10 (_ FloatingPoint 11 53)) (v_prenex_9 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.geq v_prenex_9 (_ +zero 11 53))) (not (fp.leq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.geq v_prenex_10 (_ +zero 11 53))) (not (fp.leq v_ULTIMATE.start_main_~E~0_12 .cse0)) (not (fp.leq v_prenex_10 .cse0)) (fp.leq (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_9) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_12 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_prenex_10 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse1 ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode .cse1 ULTIMATE.start_main_~B2~0))) ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (not (fp.leq v_prenex_9 .cse0)) (not (fp.geq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.leq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0)))) (not (fp.geq v_ULTIMATE.start_main_~E~0_12 (_ +zero 11 53)))))) (fp.geq c_ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_ULTIMATE.start_main_~A1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))) (forall ((v_ULTIMATE.start_main_~E~0_11 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B1~0 (_ FloatingPoint 11 53)) (v_prenex_11 (_ FloatingPoint 11 53)) (v_prenex_12 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq v_ULTIMATE.start_main_~E~0_11 .cse2)) (not (fp.leq v_prenex_12 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.leq ULTIMATE.start_main_~E0~0 .cse2)) (not (fp.leq v_prenex_11 .cse2)) (not (fp.geq v_prenex_11 (_ +zero 11 53))) (not (fp.geq v_prenex_12 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.geq v_ULTIMATE.start_main_~E~0_11 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.leq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0)))) (fp.geq (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_11) (fp.mul c_currentRoundingMode v_prenex_11 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse3 ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode .cse3 v_prenex_12))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (not (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53)))))) (fp.leq c_ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0))))) is different from true [2020-11-30 00:00:50,506 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond))) (and (fp.geq c_ULTIMATE.start_main_~A1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))) (let ((.cse1 (fp.geq c_ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (.cse0 (fp.leq c_ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0))))) (or (and .cse0 .cse1 (= (_ bv1 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) (and (or (not .cse1) (not .cse0)) .cse2))) (fp.leq c_ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0))) (fp.geq c_ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0)))) (fp.geq c_ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0))) (or (forall ((v_ULTIMATE.start_main_~E~0_12 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B2~0 (_ FloatingPoint 11 53)) (v_prenex_10 (_ FloatingPoint 11 53)) (v_prenex_9 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.geq v_prenex_9 (_ +zero 11 53))) (not (fp.leq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.geq v_prenex_10 (_ +zero 11 53))) (not (fp.leq v_ULTIMATE.start_main_~E~0_12 .cse3)) (not (fp.leq v_prenex_10 .cse3)) (fp.leq (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_9) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_12 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_prenex_10 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse4 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode .cse4 ULTIMATE.start_main_~B2~0))) ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (not (fp.leq v_prenex_9 .cse3)) (not (fp.geq v_ULTIMATE.start_main_~E~0_12 (_ +zero 11 53)))))) .cse2) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_ULTIMATE.start_main_~A1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))) (fp.leq c_ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0)))) (or (forall ((v_ULTIMATE.start_main_~E~0_11 (_ FloatingPoint 11 53)) (v_prenex_11 (_ FloatingPoint 11 53)) (v_prenex_12 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq v_ULTIMATE.start_main_~E~0_11 .cse5)) (not (fp.leq v_prenex_12 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.leq ULTIMATE.start_main_~E0~0 .cse5)) (not (fp.leq v_prenex_11 .cse5)) (not (fp.geq v_prenex_11 (_ +zero 11 53))) (not (fp.geq v_prenex_12 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.geq v_ULTIMATE.start_main_~E~0_11 (_ +zero 11 53))) (fp.geq (let ((.cse6 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_11) (fp.mul c_currentRoundingMode v_prenex_11 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse6 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode .cse6 v_prenex_12))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (not (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53)))))) .cse2))) is different from true [2020-11-30 00:00:52,611 WARN L838 $PredicateComparison]: unable to prove that (and (fp.geq c_ULTIMATE.start_main_~A1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))) (fp.leq c_ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0))) (forall ((v_ULTIMATE.start_main_~E~0_12 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B2~0 (_ FloatingPoint 11 53)) (v_prenex_10 (_ FloatingPoint 11 53)) (v_prenex_9 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.geq v_prenex_9 (_ +zero 11 53))) (not (fp.leq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.geq v_prenex_10 (_ +zero 11 53))) (not (fp.leq v_ULTIMATE.start_main_~E~0_12 .cse0)) (not (fp.leq v_prenex_10 .cse0)) (fp.leq (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_9) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_12 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_prenex_10 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse1 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode .cse1 ULTIMATE.start_main_~B2~0))) ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (not (fp.leq v_prenex_9 .cse0)) (not (fp.geq v_ULTIMATE.start_main_~E~0_12 (_ +zero 11 53)))))) (fp.geq c_ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0)))) (fp.geq c_ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0))) (fp.leq c_ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0))) (fp.geq c_ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_ULTIMATE.start_main_~A1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))) (fp.leq c_ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0)))) (forall ((v_ULTIMATE.start_main_~E~0_11 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B2~0 (_ FloatingPoint 11 53)) (v_prenex_11 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq v_ULTIMATE.start_main_~E~0_11 .cse2)) (not (fp.geq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.leq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.leq ULTIMATE.start_main_~E0~0 .cse2)) (not (fp.leq v_prenex_11 .cse2)) (not (fp.geq v_prenex_11 (_ +zero 11 53))) (not (fp.geq v_ULTIMATE.start_main_~E~0_11 (_ +zero 11 53))) (fp.geq (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_11) (fp.mul c_currentRoundingMode v_prenex_11 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse3 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode .cse3 ULTIMATE.start_main_~B2~0))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (not (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53))))))) is different from false [2020-11-30 00:00:54,944 WARN L860 $PredicateComparison]: unable to prove that (and (fp.geq c_ULTIMATE.start_main_~A1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))) (fp.leq c_ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0))) (forall ((v_ULTIMATE.start_main_~E~0_12 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B2~0 (_ FloatingPoint 11 53)) (v_prenex_10 (_ FloatingPoint 11 53)) (v_prenex_9 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.geq v_prenex_9 (_ +zero 11 53))) (not (fp.leq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.geq v_prenex_10 (_ +zero 11 53))) (not (fp.leq v_ULTIMATE.start_main_~E~0_12 .cse0)) (not (fp.leq v_prenex_10 .cse0)) (fp.leq (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_9) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_12 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_prenex_10 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse1 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode .cse1 ULTIMATE.start_main_~B2~0))) ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (not (fp.leq v_prenex_9 .cse0)) (not (fp.geq v_ULTIMATE.start_main_~E~0_12 (_ +zero 11 53)))))) (fp.geq c_ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0)))) (fp.geq c_ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0))) (fp.leq c_ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0))) (fp.geq c_ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_ULTIMATE.start_main_~A1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))) (fp.leq c_ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0)))) (forall ((v_ULTIMATE.start_main_~E~0_11 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B2~0 (_ FloatingPoint 11 53)) (v_prenex_11 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq v_ULTIMATE.start_main_~E~0_11 .cse2)) (not (fp.geq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.leq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.leq ULTIMATE.start_main_~E0~0 .cse2)) (not (fp.leq v_prenex_11 .cse2)) (not (fp.geq v_prenex_11 (_ +zero 11 53))) (not (fp.geq v_ULTIMATE.start_main_~E~0_11 (_ +zero 11 53))) (fp.geq (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_11) (fp.mul c_currentRoundingMode v_prenex_11 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse3 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode .cse3 ULTIMATE.start_main_~B2~0))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (not (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53))))))) is different from true [2020-11-30 00:00:57,026 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0)))) (and (fp.geq c_ULTIMATE.start_main_~A1~0 .cse0) (fp.leq c_ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0))) (fp.geq c_ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0)))) (fp.geq c_ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0))) (fp.leq c_ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0))) (fp.geq c_ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0))) (or (forall ((v_ULTIMATE.start_main_~E~0_11 (_ FloatingPoint 11 53)) (v_prenex_11 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq v_ULTIMATE.start_main_~E~0_11 .cse1)) (not (fp.leq ULTIMATE.start_main_~E0~0 .cse1)) (not (fp.leq v_prenex_11 .cse1)) (not (fp.geq v_prenex_11 (_ +zero 11 53))) (not (fp.geq v_ULTIMATE.start_main_~E~0_11 (_ +zero 11 53))) (fp.geq (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_11) (fp.mul c_currentRoundingMode v_prenex_11 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse2 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode .cse2 c_ULTIMATE.start_main_~B2~0))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (not (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53)))))) .cse3) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_ULTIMATE.start_main_~A1~0 .cse4) (or (forall ((v_ULTIMATE.start_main_~E~0_12 (_ FloatingPoint 11 53)) (v_prenex_10 (_ FloatingPoint 11 53)) (v_prenex_9 (_ FloatingPoint 11 53))) (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_prenex_9 (_ +zero 11 53))) (not (fp.geq v_prenex_10 (_ +zero 11 53))) (not (fp.leq v_ULTIMATE.start_main_~E~0_12 .cse5)) (not (fp.leq v_prenex_10 .cse5)) (fp.leq (let ((.cse6 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_9) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_12 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_prenex_10 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse6 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode .cse6 c_ULTIMATE.start_main_~B2~0))) ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (not (fp.leq v_prenex_9 .cse5)) (not (fp.geq v_ULTIMATE.start_main_~E~0_12 (_ +zero 11 53)))))) .cse3) (let ((.cse8 (fp.geq c_ULTIMATE.start_main_~B2~0 (fp.neg .cse4))) (.cse7 (fp.leq c_ULTIMATE.start_main_~B2~0 (fp.neg .cse0)))) (or (and (= (_ bv1 32) c_ULTIMATE.start_assume_abort_if_not_~cond) .cse7 .cse8) (and (or (not .cse8) (not .cse7)) .cse3))) (fp.leq c_ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0)))))) is different from false [2020-11-30 00:00:59,352 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0)))) (and (fp.geq c_ULTIMATE.start_main_~A1~0 .cse0) (fp.leq c_ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0))) (fp.geq c_ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0)))) (fp.geq c_ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0))) (fp.leq c_ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0))) (fp.geq c_ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0))) (or (forall ((v_ULTIMATE.start_main_~E~0_11 (_ FloatingPoint 11 53)) (v_prenex_11 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq v_ULTIMATE.start_main_~E~0_11 .cse1)) (not (fp.leq ULTIMATE.start_main_~E0~0 .cse1)) (not (fp.leq v_prenex_11 .cse1)) (not (fp.geq v_prenex_11 (_ +zero 11 53))) (not (fp.geq v_ULTIMATE.start_main_~E~0_11 (_ +zero 11 53))) (fp.geq (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_11) (fp.mul c_currentRoundingMode v_prenex_11 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse2 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode .cse2 c_ULTIMATE.start_main_~B2~0))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (not (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53)))))) .cse3) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_ULTIMATE.start_main_~A1~0 .cse4) (or (forall ((v_ULTIMATE.start_main_~E~0_12 (_ FloatingPoint 11 53)) (v_prenex_10 (_ FloatingPoint 11 53)) (v_prenex_9 (_ FloatingPoint 11 53))) (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_prenex_9 (_ +zero 11 53))) (not (fp.geq v_prenex_10 (_ +zero 11 53))) (not (fp.leq v_ULTIMATE.start_main_~E~0_12 .cse5)) (not (fp.leq v_prenex_10 .cse5)) (fp.leq (let ((.cse6 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_9) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_12 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_prenex_10 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse6 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode .cse6 c_ULTIMATE.start_main_~B2~0))) ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (not (fp.leq v_prenex_9 .cse5)) (not (fp.geq v_ULTIMATE.start_main_~E~0_12 (_ +zero 11 53)))))) .cse3) (let ((.cse8 (fp.geq c_ULTIMATE.start_main_~B2~0 (fp.neg .cse4))) (.cse7 (fp.leq c_ULTIMATE.start_main_~B2~0 (fp.neg .cse0)))) (or (and (= (_ bv1 32) c_ULTIMATE.start_assume_abort_if_not_~cond) .cse7 .cse8) (and (or (not .cse8) (not .cse7)) .cse3))) (fp.leq c_ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0)))))) is different from true [2020-11-30 00:01:01,423 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0)))) (and (fp.geq c_ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0))) (fp.leq c_ULTIMATE.start_main_~B2~0 (fp.neg .cse0)) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_ULTIMATE.start_main_~A1~0 .cse1) (fp.leq c_ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0)))) (fp.geq c_ULTIMATE.start_main_~B2~0 (fp.neg .cse1)) (forall ((v_ULTIMATE.start_main_~E~0_12 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_11 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq v_ULTIMATE.start_main_~E~0_11 .cse2)) (fp.geq (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_11) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_12 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse3 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode .cse3 c_ULTIMATE.start_main_~B2~0))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (not (fp.leq ULTIMATE.start_main_~E0~0 .cse2)) (not (fp.leq v_ULTIMATE.start_main_~E~0_12 .cse2)) (not (fp.geq v_ULTIMATE.start_main_~E~0_11 (_ +zero 11 53))) (not (fp.geq v_ULTIMATE.start_main_~E~0_12 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53)))))) (fp.geq c_ULTIMATE.start_main_~A1~0 .cse0) (fp.leq c_ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0))) (fp.geq c_ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0)))) (fp.geq c_ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0))) (fp.leq c_ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0))) (forall ((v_ULTIMATE.start_main_~E~0_12 (_ FloatingPoint 11 53)) (v_prenex_10 (_ FloatingPoint 11 53)) (v_prenex_9 (_ FloatingPoint 11 53))) (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_prenex_9 (_ +zero 11 53))) (not (fp.geq v_prenex_10 (_ +zero 11 53))) (not (fp.leq v_ULTIMATE.start_main_~E~0_12 .cse4)) (not (fp.leq v_prenex_10 .cse4)) (fp.leq (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_9) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_12 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_prenex_10 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse5 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode .cse5 c_ULTIMATE.start_main_~B2~0))) ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (not (fp.leq v_prenex_9 .cse4)) (not (fp.geq v_ULTIMATE.start_main_~E~0_12 (_ +zero 11 53)))))))) is different from false [2020-11-30 00:01:03,774 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0)))) (and (fp.geq c_ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0))) (fp.leq c_ULTIMATE.start_main_~B2~0 (fp.neg .cse0)) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_ULTIMATE.start_main_~A1~0 .cse1) (fp.leq c_ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0)))) (fp.geq c_ULTIMATE.start_main_~B2~0 (fp.neg .cse1)) (forall ((v_ULTIMATE.start_main_~E~0_12 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_11 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq v_ULTIMATE.start_main_~E~0_11 .cse2)) (fp.geq (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_11) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_12 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse3 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode .cse3 c_ULTIMATE.start_main_~B2~0))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (not (fp.leq ULTIMATE.start_main_~E0~0 .cse2)) (not (fp.leq v_ULTIMATE.start_main_~E~0_12 .cse2)) (not (fp.geq v_ULTIMATE.start_main_~E~0_11 (_ +zero 11 53))) (not (fp.geq v_ULTIMATE.start_main_~E~0_12 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53)))))) (fp.geq c_ULTIMATE.start_main_~A1~0 .cse0) (fp.leq c_ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0))) (fp.geq c_ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0)))) (fp.geq c_ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0))) (fp.leq c_ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0))) (forall ((v_ULTIMATE.start_main_~E~0_12 (_ FloatingPoint 11 53)) (v_prenex_10 (_ FloatingPoint 11 53)) (v_prenex_9 (_ FloatingPoint 11 53))) (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_prenex_9 (_ +zero 11 53))) (not (fp.geq v_prenex_10 (_ +zero 11 53))) (not (fp.leq v_ULTIMATE.start_main_~E~0_12 .cse4)) (not (fp.leq v_prenex_10 .cse4)) (fp.leq (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_9) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_12 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_prenex_10 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse5 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode .cse5 c_ULTIMATE.start_main_~B2~0))) ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (not (fp.leq v_prenex_9 .cse4)) (not (fp.geq v_ULTIMATE.start_main_~E~0_12 (_ +zero 11 53)))))))) is different from true [2020-11-30 00:01:06,064 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0)))) (and (fp.geq c_ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0))) (fp.leq c_ULTIMATE.start_main_~B2~0 (fp.neg .cse0)) (= c_currentRoundingMode roundNearestTiesToEven) (or (forall ((v_prenex_10 (_ FloatingPoint 11 53)) (v_prenex_9 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_prenex_9 (_ +zero 11 53))) (fp.leq (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_9) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_prenex_10 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse1 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode .cse1 c_ULTIMATE.start_main_~B2~0))) ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (not (fp.geq v_prenex_10 (_ +zero 11 53))) (not (fp.leq v_prenex_10 .cse2)) (not (fp.leq v_prenex_9 .cse2))))) .cse3) (fp.leq c_ULTIMATE.start_main_~A1~0 .cse4) (let ((.cse5 (fp.leq c_ULTIMATE.start_main_~E~0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (.cse6 (fp.geq c_ULTIMATE.start_main_~E~0 (_ +zero 11 53)))) (or (and (or (not .cse5) (not .cse6)) .cse3) (and .cse5 (= (_ bv1 32) c_ULTIMATE.start_assume_abort_if_not_~cond) .cse6))) (or (forall ((v_ULTIMATE.start_main_~E~0_11 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse7 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq v_ULTIMATE.start_main_~E~0_11 .cse7)) (not (fp.leq ULTIMATE.start_main_~E0~0 .cse7)) (fp.geq (let ((.cse8 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_11) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse8 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode .cse8 c_ULTIMATE.start_main_~B2~0))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (not (fp.geq v_ULTIMATE.start_main_~E~0_11 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53)))))) .cse3) (fp.leq c_ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0)))) (fp.geq c_ULTIMATE.start_main_~B2~0 (fp.neg .cse4)) (fp.geq c_ULTIMATE.start_main_~A1~0 .cse0) (fp.leq c_ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0))) (fp.geq c_ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0)))) (fp.geq c_ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0))) (fp.leq c_ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0))))) is different from true [2020-11-30 00:01:08,129 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0)))) (and (fp.geq c_ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0))) (fp.leq c_ULTIMATE.start_main_~B2~0 (fp.neg .cse0)) (= c_currentRoundingMode roundNearestTiesToEven) (forall ((v_ULTIMATE.start_main_~E~0_11 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq v_ULTIMATE.start_main_~E~0_11 .cse1)) (not (fp.leq ULTIMATE.start_main_~E0~0 .cse1)) (fp.geq (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_11) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse2 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode .cse2 c_ULTIMATE.start_main_~B2~0))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (not (fp.geq v_ULTIMATE.start_main_~E~0_11 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53)))))) (fp.leq c_ULTIMATE.start_main_~A1~0 .cse3) (fp.leq c_ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0)))) (fp.geq c_ULTIMATE.start_main_~B2~0 (fp.neg .cse3)) (fp.geq c_ULTIMATE.start_main_~A1~0 .cse0) (fp.leq c_ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0))) (fp.geq c_ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0)))) (fp.leq c_ULTIMATE.start_main_~E~0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.geq c_ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0))) (fp.leq c_ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0))) (fp.geq c_ULTIMATE.start_main_~E~0 (_ +zero 11 53)) (forall ((v_prenex_9 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_prenex_9 (_ +zero 11 53))) (not (fp.leq ULTIMATE.start_main_~E0~0 .cse4)) (fp.leq (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_9) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse5 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode .cse5 c_ULTIMATE.start_main_~B2~0))) ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (not (fp.leq v_prenex_9 .cse4)) (not (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53)))))))) is different from false [2020-11-30 00:01:10,459 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0)))) (and (fp.geq c_ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0))) (fp.leq c_ULTIMATE.start_main_~B2~0 (fp.neg .cse0)) (= c_currentRoundingMode roundNearestTiesToEven) (forall ((v_ULTIMATE.start_main_~E~0_11 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq v_ULTIMATE.start_main_~E~0_11 .cse1)) (not (fp.leq ULTIMATE.start_main_~E0~0 .cse1)) (fp.geq (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_11) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse2 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode .cse2 c_ULTIMATE.start_main_~B2~0))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (not (fp.geq v_ULTIMATE.start_main_~E~0_11 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53)))))) (fp.leq c_ULTIMATE.start_main_~A1~0 .cse3) (fp.leq c_ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0)))) (fp.geq c_ULTIMATE.start_main_~B2~0 (fp.neg .cse3)) (fp.geq c_ULTIMATE.start_main_~A1~0 .cse0) (fp.leq c_ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0))) (fp.geq c_ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0)))) (fp.leq c_ULTIMATE.start_main_~E~0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.geq c_ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0))) (fp.leq c_ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0))) (fp.geq c_ULTIMATE.start_main_~E~0 (_ +zero 11 53)) (forall ((v_prenex_9 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_prenex_9 (_ +zero 11 53))) (not (fp.leq ULTIMATE.start_main_~E0~0 .cse4)) (fp.leq (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_9) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse5 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode .cse5 c_ULTIMATE.start_main_~B2~0))) ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (not (fp.leq v_prenex_9 .cse4)) (not (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53)))))))) is different from true [2020-11-30 00:01:12,768 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse3 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond))) (and (fp.geq c_ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0))) (fp.leq c_ULTIMATE.start_main_~B2~0 (fp.neg .cse0)) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_ULTIMATE.start_main_~A1~0 .cse1) (fp.leq c_ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0)))) (fp.geq c_ULTIMATE.start_main_~B2~0 (fp.neg .cse1)) (or (forall ((v_ULTIMATE.start_main_~E~0_11 (_ FloatingPoint 11 53))) (or (not (fp.leq v_ULTIMATE.start_main_~E~0_11 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.geq (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_11) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse2 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode .cse2 c_ULTIMATE.start_main_~B2~0))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (not (fp.geq v_ULTIMATE.start_main_~E~0_11 (_ +zero 11 53))))) .cse3) (let ((.cse5 (fp.leq c_ULTIMATE.start_main_~E0~0 .cse6)) (.cse4 (fp.geq c_ULTIMATE.start_main_~E0~0 (_ +zero 11 53)))) (or (and .cse4 .cse5 (= (_ bv1 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) (and .cse3 (or (not .cse5) (not .cse4))))) (fp.geq c_ULTIMATE.start_main_~A1~0 .cse0) (fp.leq c_ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0))) (fp.geq c_ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0)))) (fp.leq c_ULTIMATE.start_main_~E~0 .cse6) (fp.geq c_ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0))) (fp.leq c_ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0))) (fp.geq c_ULTIMATE.start_main_~E~0 (_ +zero 11 53)) (or (forall ((v_prenex_9 (_ FloatingPoint 11 53))) (or (not (fp.geq v_prenex_9 (_ +zero 11 53))) (fp.leq (let ((.cse7 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_9) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse7 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode .cse7 c_ULTIMATE.start_main_~B2~0))) ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (not (fp.leq v_prenex_9 ((_ to_fp 11 53) c_currentRoundingMode 1.0))))) .cse3))) is different from true [2020-11-30 00:01:14,826 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.leq c_ULTIMATE.start_main_~E0~0 .cse0) (forall ((v_ULTIMATE.start_main_~E~0_11 (_ FloatingPoint 11 53))) (or (not (fp.leq v_ULTIMATE.start_main_~E~0_11 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.geq (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_11) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse1 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode .cse1 c_ULTIMATE.start_main_~B2~0))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (not (fp.geq v_ULTIMATE.start_main_~E~0_11 (_ +zero 11 53))))) (fp.geq c_ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0))) (fp.leq c_ULTIMATE.start_main_~B2~0 (fp.neg .cse2)) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_ULTIMATE.start_main_~A1~0 .cse3) (fp.leq c_ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0)))) (fp.geq c_ULTIMATE.start_main_~B2~0 (fp.neg .cse3)) (fp.geq c_ULTIMATE.start_main_~A1~0 .cse2) (fp.geq c_ULTIMATE.start_main_~E0~0 (_ +zero 11 53)) (fp.leq c_ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0))) (fp.geq c_ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0)))) (fp.leq c_ULTIMATE.start_main_~E~0 .cse0) (fp.geq c_ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0))) (fp.leq c_ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0))) (forall ((v_prenex_9 (_ FloatingPoint 11 53))) (or (not (fp.geq v_prenex_9 (_ +zero 11 53))) (fp.leq (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_9) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse4 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode .cse4 c_ULTIMATE.start_main_~B2~0))) ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (not (fp.leq v_prenex_9 ((_ to_fp 11 53) c_currentRoundingMode 1.0))))) (fp.geq c_ULTIMATE.start_main_~E~0 (_ +zero 11 53)))) is different from false [2020-11-30 00:01:17,126 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.leq c_ULTIMATE.start_main_~E0~0 .cse0) (forall ((v_ULTIMATE.start_main_~E~0_11 (_ FloatingPoint 11 53))) (or (not (fp.leq v_ULTIMATE.start_main_~E~0_11 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.geq (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_11) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse1 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode .cse1 c_ULTIMATE.start_main_~B2~0))) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (not (fp.geq v_ULTIMATE.start_main_~E~0_11 (_ +zero 11 53))))) (fp.geq c_ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0))) (fp.leq c_ULTIMATE.start_main_~B2~0 (fp.neg .cse2)) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_ULTIMATE.start_main_~A1~0 .cse3) (fp.leq c_ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0)))) (fp.geq c_ULTIMATE.start_main_~B2~0 (fp.neg .cse3)) (fp.geq c_ULTIMATE.start_main_~A1~0 .cse2) (fp.geq c_ULTIMATE.start_main_~E0~0 (_ +zero 11 53)) (fp.leq c_ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0))) (fp.geq c_ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0)))) (fp.leq c_ULTIMATE.start_main_~E~0 .cse0) (fp.geq c_ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0))) (fp.leq c_ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0))) (forall ((v_prenex_9 (_ FloatingPoint 11 53))) (or (not (fp.geq v_prenex_9 (_ +zero 11 53))) (fp.leq (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_9) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse4 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode .cse4 c_ULTIMATE.start_main_~B2~0))) ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (not (fp.leq v_prenex_9 ((_ to_fp 11 53) c_currentRoundingMode 1.0))))) (fp.geq c_ULTIMATE.start_main_~E~0 (_ +zero 11 53)))) is different from true [2020-11-30 00:01:19,157 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (and (= c_ULTIMATE.start_main_~S0~0 .cse0) (fp.leq c_ULTIMATE.start_main_~E0~0 .cse1) (fp.geq c_ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0))) (fp.leq c_ULTIMATE.start_main_~B2~0 (fp.neg .cse2)) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_ULTIMATE.start_main_~A1~0 .cse3) (fp.leq c_ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0)))) (forall ((v_ULTIMATE.start_main_~E~0_11 (_ FloatingPoint 11 53))) (or (not (fp.leq v_ULTIMATE.start_main_~E~0_11 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.leq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_11) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S~0 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S0~0 c_ULTIMATE.start_main_~B2~0)) ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (not (fp.geq v_ULTIMATE.start_main_~E~0_11 (_ +zero 11 53))))) (fp.geq c_ULTIMATE.start_main_~B2~0 (fp.neg .cse3)) (fp.geq c_ULTIMATE.start_main_~A1~0 .cse2) (fp.geq c_ULTIMATE.start_main_~E0~0 (_ +zero 11 53)) (fp.leq c_ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0))) (fp.geq c_ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0)))) (fp.leq c_ULTIMATE.start_main_~E~0 .cse1) (fp.geq c_ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0))) (= c_ULTIMATE.start_main_~S~0 .cse0) (fp.leq c_ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0))) (fp.geq c_ULTIMATE.start_main_~E~0 (_ +zero 11 53)) (forall ((v_ULTIMATE.start_main_~E~0_11 (_ FloatingPoint 11 53))) (or (not (fp.leq v_ULTIMATE.start_main_~E~0_11 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_11) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S~0 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S0~0 c_ULTIMATE.start_main_~B2~0)) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (not (fp.geq v_ULTIMATE.start_main_~E~0_11 (_ +zero 11 53))))))) is different from false [2020-11-30 00:01:21,811 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (and (= c_ULTIMATE.start_main_~S0~0 .cse0) (fp.leq c_ULTIMATE.start_main_~E0~0 .cse1) (fp.geq c_ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0))) (fp.leq c_ULTIMATE.start_main_~B2~0 (fp.neg .cse2)) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_ULTIMATE.start_main_~A1~0 .cse3) (fp.leq c_ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0)))) (forall ((v_ULTIMATE.start_main_~E~0_11 (_ FloatingPoint 11 53))) (or (not (fp.leq v_ULTIMATE.start_main_~E~0_11 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.leq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_11) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S~0 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S0~0 c_ULTIMATE.start_main_~B2~0)) ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (not (fp.geq v_ULTIMATE.start_main_~E~0_11 (_ +zero 11 53))))) (fp.geq c_ULTIMATE.start_main_~B2~0 (fp.neg .cse3)) (fp.geq c_ULTIMATE.start_main_~A1~0 .cse2) (fp.geq c_ULTIMATE.start_main_~E0~0 (_ +zero 11 53)) (fp.leq c_ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0))) (fp.geq c_ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0)))) (fp.leq c_ULTIMATE.start_main_~E~0 .cse1) (fp.geq c_ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0))) (= c_ULTIMATE.start_main_~S~0 .cse0) (fp.leq c_ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0))) (fp.geq c_ULTIMATE.start_main_~E~0 (_ +zero 11 53)) (forall ((v_ULTIMATE.start_main_~E~0_11 (_ FloatingPoint 11 53))) (or (not (fp.leq v_ULTIMATE.start_main_~E~0_11 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_11) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S~0 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S0~0 c_ULTIMATE.start_main_~B2~0)) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (not (fp.geq v_ULTIMATE.start_main_~E~0_11 (_ +zero 11 53))))))) is different from true [2020-11-30 00:01:23,986 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))) (.cse6 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (and (= c_ULTIMATE.start_main_~S0~0 .cse0) (fp.leq c_ULTIMATE.start_main_~E0~0 .cse1) (fp.geq c_ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0))) (fp.leq c_ULTIMATE.start_main_~E1~0 .cse1) (fp.leq c_ULTIMATE.start_main_~B2~0 (fp.neg .cse2)) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_ULTIMATE.start_main_~A1~0 .cse3) (let ((.cse4 (fp.leq c_ULTIMATE.start_main_~E~0 .cse1)) (.cse5 (fp.geq c_ULTIMATE.start_main_~E~0 (_ +zero 11 53)))) (or (and (or (not .cse4) (not .cse5)) .cse6) (and .cse4 (= (_ bv1 32) c_ULTIMATE.start_assume_abort_if_not_~cond) .cse5))) (fp.geq c_ULTIMATE.start_main_~E1~0 (_ +zero 11 53)) (fp.leq c_ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0)))) (fp.geq c_ULTIMATE.start_main_~B2~0 (fp.neg .cse3)) (or (let ((.cse7 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 c_ULTIMATE.start_main_~E~0) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E1~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S~0 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S0~0 c_ULTIMATE.start_main_~B2~0))) (.cse8 ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (and (fp.geq .cse7 (fp.neg .cse8)) (fp.leq .cse7 .cse8))) .cse6) (fp.geq c_ULTIMATE.start_main_~A1~0 .cse2) (fp.geq c_ULTIMATE.start_main_~E0~0 (_ +zero 11 53)) (fp.leq c_ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0))) (fp.geq c_ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0)))) (fp.geq c_ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0))) (= c_ULTIMATE.start_main_~S~0 .cse0) (fp.leq c_ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0))))) is different from false [2020-11-30 00:01:26,209 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))) (.cse6 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (and (= c_ULTIMATE.start_main_~S0~0 .cse0) (fp.leq c_ULTIMATE.start_main_~E0~0 .cse1) (fp.geq c_ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0))) (fp.leq c_ULTIMATE.start_main_~E1~0 .cse1) (fp.leq c_ULTIMATE.start_main_~B2~0 (fp.neg .cse2)) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_ULTIMATE.start_main_~A1~0 .cse3) (let ((.cse4 (fp.leq c_ULTIMATE.start_main_~E~0 .cse1)) (.cse5 (fp.geq c_ULTIMATE.start_main_~E~0 (_ +zero 11 53)))) (or (and (or (not .cse4) (not .cse5)) .cse6) (and .cse4 (= (_ bv1 32) c_ULTIMATE.start_assume_abort_if_not_~cond) .cse5))) (fp.geq c_ULTIMATE.start_main_~E1~0 (_ +zero 11 53)) (fp.leq c_ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0)))) (fp.geq c_ULTIMATE.start_main_~B2~0 (fp.neg .cse3)) (or (let ((.cse7 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 c_ULTIMATE.start_main_~E~0) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E1~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S~0 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S0~0 c_ULTIMATE.start_main_~B2~0))) (.cse8 ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (and (fp.geq .cse7 (fp.neg .cse8)) (fp.leq .cse7 .cse8))) .cse6) (fp.geq c_ULTIMATE.start_main_~A1~0 .cse2) (fp.geq c_ULTIMATE.start_main_~E0~0 (_ +zero 11 53)) (fp.leq c_ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0))) (fp.geq c_ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0)))) (fp.geq c_ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0))) (= c_ULTIMATE.start_main_~S~0 .cse0) (fp.leq c_ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0))))) is different from true [2020-11-30 00:01:28,368 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (.cse4 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 c_ULTIMATE.start_main_~E~0) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E1~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S~0 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S0~0 c_ULTIMATE.start_main_~B2~0))) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (and (= c_ULTIMATE.start_main_~S0~0 .cse0) (fp.leq c_ULTIMATE.start_main_~E0~0 .cse1) (fp.geq c_ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0))) (fp.leq c_ULTIMATE.start_main_~E1~0 .cse1) (fp.leq c_ULTIMATE.start_main_~B2~0 (fp.neg .cse2)) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_ULTIMATE.start_main_~A1~0 .cse3) (fp.geq c_ULTIMATE.start_main_~E1~0 (_ +zero 11 53)) (fp.leq c_ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0)))) (fp.geq c_ULTIMATE.start_main_~B2~0 (fp.neg .cse3)) (fp.geq c_ULTIMATE.start_main_~A1~0 .cse2) (fp.geq c_ULTIMATE.start_main_~E0~0 (_ +zero 11 53)) (fp.leq c_ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0))) (fp.geq c_ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0)))) (fp.leq c_ULTIMATE.start_main_~E~0 .cse1) (fp.geq c_ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0))) (= c_ULTIMATE.start_main_~S~0 .cse0) (fp.leq c_ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0))) (fp.geq c_ULTIMATE.start_main_~E~0 (_ +zero 11 53)) (fp.geq .cse4 (fp.neg .cse5)) (fp.leq .cse4 .cse5))) is different from false [2020-11-30 00:01:30,654 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (.cse4 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 c_ULTIMATE.start_main_~E~0) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E1~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S~0 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S0~0 c_ULTIMATE.start_main_~B2~0))) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (and (= c_ULTIMATE.start_main_~S0~0 .cse0) (fp.leq c_ULTIMATE.start_main_~E0~0 .cse1) (fp.geq c_ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0))) (fp.leq c_ULTIMATE.start_main_~E1~0 .cse1) (fp.leq c_ULTIMATE.start_main_~B2~0 (fp.neg .cse2)) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_ULTIMATE.start_main_~A1~0 .cse3) (fp.geq c_ULTIMATE.start_main_~E1~0 (_ +zero 11 53)) (fp.leq c_ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0)))) (fp.geq c_ULTIMATE.start_main_~B2~0 (fp.neg .cse3)) (fp.geq c_ULTIMATE.start_main_~A1~0 .cse2) (fp.geq c_ULTIMATE.start_main_~E0~0 (_ +zero 11 53)) (fp.leq c_ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0))) (fp.geq c_ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0)))) (fp.leq c_ULTIMATE.start_main_~E~0 .cse1) (fp.geq c_ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0))) (= c_ULTIMATE.start_main_~S~0 .cse0) (fp.leq c_ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0))) (fp.geq c_ULTIMATE.start_main_~E~0 (_ +zero 11 53)) (fp.geq .cse4 (fp.neg .cse5)) (fp.leq .cse4 .cse5))) is different from true [2020-11-30 00:01:32,849 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse10 (= 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_~A3~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E1~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~A2~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B2~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~A1~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B1~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 69.0 100.0))) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse2 (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~A1~0 ULTIMATE.start_main_~E~0) (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~E0~0 ULTIMATE.start_main_~A2~0)) (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~E1~0 ULTIMATE.start_main_~A3~0)) (fp.mul roundNearestTiesToEven .cse5 ULTIMATE.start_main_~B1~0)) (fp.mul roundNearestTiesToEven .cse5 ULTIMATE.start_main_~B2~0)))) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 100.0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 71.0 100.0)))) (and (fp.geq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 109.0 100.0))) (fp.leq ULTIMATE.start_main_~E0~0 .cse0) (fp.leq ULTIMATE.start_main_~B2~0 (fp.neg .cse1)) (fp.leq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 141.0 100.0))) (fp.leq ULTIMATE.start_main_~E~0 .cse0) (fp.geq .cse2 (fp.neg .cse3)) (fp.geq ULTIMATE.start_main_~A1~0 .cse1) (fp.geq ULTIMATE.start_main_~E1~0 (_ +zero 11 53)) (fp.leq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 129.0 100.0)))) (fp.leq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 111.0 100.0))) (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53)) (fp.leq ULTIMATE.start_main_~E1~0 .cse0) (fp.leq .cse2 .cse3) (fp.geq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 131.0 100.0)))) (fp.leq ULTIMATE.start_main_~A1~0 .cse4) (fp.geq ULTIMATE.start_main_~E~0 (_ +zero 11 53)) (fp.geq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 139.0 100.0))) (fp.geq ULTIMATE.start_main_~B2~0 (fp.neg .cse4)))))) (and (exists ((ULTIMATE.start_main_~A3~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E1~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~A2~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B2~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~A1~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B1~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse7 ((_ to_fp 11 53) roundNearestTiesToEven (/ 69.0 100.0))) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse9 ((_ to_fp 11 53) roundNearestTiesToEven (/ 71.0 100.0)))) (and (fp.geq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 109.0 100.0))) (fp.leq ULTIMATE.start_main_~E0~0 .cse6) (fp.leq ULTIMATE.start_main_~B2~0 (fp.neg .cse7)) (fp.leq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 141.0 100.0))) (fp.leq ULTIMATE.start_main_~E~0 .cse6) (fp.geq ULTIMATE.start_main_~A1~0 .cse7) (fp.geq ULTIMATE.start_main_~E1~0 (_ +zero 11 53)) (fp.leq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 129.0 100.0)))) (fp.leq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 111.0 100.0))) (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53)) (fp.leq ULTIMATE.start_main_~E1~0 .cse6) (not (fp.leq (let ((.cse8 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~A1~0 ULTIMATE.start_main_~E~0) (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~E0~0 ULTIMATE.start_main_~A2~0)) (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~E1~0 ULTIMATE.start_main_~A3~0)) (fp.mul roundNearestTiesToEven .cse8 ULTIMATE.start_main_~B1~0)) (fp.mul roundNearestTiesToEven .cse8 ULTIMATE.start_main_~B2~0))) ((_ to_fp 11 53) roundNearestTiesToEven 100.0))) (fp.geq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 131.0 100.0)))) (fp.leq ULTIMATE.start_main_~A1~0 .cse9) (fp.geq ULTIMATE.start_main_~E~0 (_ +zero 11 53)) (fp.geq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 139.0 100.0))) (fp.geq ULTIMATE.start_main_~B2~0 (fp.neg .cse9))))) .cse10) (and (exists ((ULTIMATE.start_main_~A3~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E1~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~A2~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B2~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~A1~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B1~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse12 ((_ to_fp 11 53) roundNearestTiesToEven (/ 69.0 100.0))) (.cse11 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse14 ((_ to_fp 11 53) roundNearestTiesToEven (/ 71.0 100.0)))) (and (fp.geq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 109.0 100.0))) (fp.leq ULTIMATE.start_main_~E0~0 .cse11) (fp.leq ULTIMATE.start_main_~B2~0 (fp.neg .cse12)) (fp.leq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 141.0 100.0))) (fp.leq ULTIMATE.start_main_~E~0 .cse11) (not (fp.geq (let ((.cse13 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~A1~0 ULTIMATE.start_main_~E~0) (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~E0~0 ULTIMATE.start_main_~A2~0)) (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~E1~0 ULTIMATE.start_main_~A3~0)) (fp.mul roundNearestTiesToEven .cse13 ULTIMATE.start_main_~B1~0)) (fp.mul roundNearestTiesToEven .cse13 ULTIMATE.start_main_~B2~0))) (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 100.0)))) (fp.geq ULTIMATE.start_main_~A1~0 .cse12) (fp.geq ULTIMATE.start_main_~E1~0 (_ +zero 11 53)) (fp.leq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 129.0 100.0)))) (fp.leq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 111.0 100.0))) (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53)) (fp.leq ULTIMATE.start_main_~E1~0 .cse11) (fp.geq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 131.0 100.0)))) (fp.leq ULTIMATE.start_main_~A1~0 .cse14) (fp.geq ULTIMATE.start_main_~E~0 (_ +zero 11 53)) (fp.geq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 139.0 100.0))) (fp.geq ULTIMATE.start_main_~B2~0 (fp.neg .cse14))))) .cse10)) (not .cse10))) is different from false [2020-11-30 00:01:40,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:01:40,182 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2020-11-30 00:01:40,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-11-30 00:01:40,478 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 21 [2020-11-30 00:01:40,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:01:40,479 INFO L225 Difference]: With dead ends: 33 [2020-11-30 00:01:40,479 INFO L226 Difference]: Without dead ends: 31 [2020-11-30 00:01:40,482 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 39 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 139.0s TimeCoverageRelationStatistics Valid=197, Invalid=321, Unknown=58, NotChecked=2964, Total=3540 [2020-11-30 00:01:40,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-11-30 00:01:40,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2020-11-30 00:01:40,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-11-30 00:01:40,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2020-11-30 00:01:40,494 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 21 [2020-11-30 00:01:40,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:01:40,494 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2020-11-30 00:01:40,494 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2020-11-30 00:01:40,494 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2020-11-30 00:01:40,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-11-30 00:01:40,495 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:01:40,496 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:01:40,703 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-11-30 00:01:40,704 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:01:40,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:01:40,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1103235313, now seen corresponding path program 1 times [2020-11-30 00:01:40,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-30 00:01:40,705 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [728085816] [2020-11-30 00:01:40,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_69ede94c-33d1-4042-bc28-11019a0a168c/bin/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-11-30 00:05:23,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:05:24,397 WARN L261 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 46 conjunts are in the unsatisfiable core [2020-11-30 00:05:24,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:05:24,563 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2020-11-30 00:05:24,566 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:05:24,782 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2020-11-30 00:05:24,784 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:05:25,229 WARN L193 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2020-11-30 00:05:25,231 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:05:25,481 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2020-11-30 00:05:25,801 WARN L193 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2020-11-30 00:05:25,802 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:05:26,057 WARN L193 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2020-11-30 00:05:26,557 WARN L193 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2020-11-30 00:05:26,559 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:05:27,090 WARN L193 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2020-11-30 00:05:27,823 WARN L193 SmtUtils]: Spent 299.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2020-11-30 00:05:27,824 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:05:28,500 WARN L193 SmtUtils]: Spent 280.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2020-11-30 00:05:29,345 WARN L193 SmtUtils]: Spent 410.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2020-11-30 00:05:29,346 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:05:30,096 WARN L193 SmtUtils]: Spent 309.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2020-11-30 00:05:31,033 WARN L193 SmtUtils]: Spent 403.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2020-11-30 00:05:32,121 WARN L193 SmtUtils]: Spent 562.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2020-11-30 00:05:32,124 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-30 00:05:33,174 WARN L193 SmtUtils]: Spent 444.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-11-30 00:05:35,487 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse22 ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))) (.cse21 ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))) (.cse20 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse23 ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (let ((.cse18 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32))) (.cse16 (fp.geq c_ULTIMATE.start_main_~S~0 (fp.neg .cse23))) (.cse0 (exists ((ULTIMATE.start_main_~E1~0 (_ FloatingPoint 11 53))) (and (fp.leq ULTIMATE.start_main_~E1~0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.geq ULTIMATE.start_main_~E1~0 (_ +zero 11 53)) (= c_ULTIMATE.start_main_~S~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 c_ULTIMATE.start_main_~E~0) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode ULTIMATE.start_main_~E1~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S0~0 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)) c_ULTIMATE.start_main_~B2~0)))))) (.cse1 (= c_ULTIMATE.start_main_~S0~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (.cse2 (fp.leq c_ULTIMATE.start_main_~E0~0 .cse20)) (.cse19 (fp.leq c_ULTIMATE.start_main_~S~0 .cse23)) (.cse3 (fp.geq c_ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (.cse4 (fp.leq c_ULTIMATE.start_main_~B2~0 (fp.neg .cse21))) (.cse5 (= c_currentRoundingMode roundNearestTiesToEven)) (.cse6 (fp.leq c_ULTIMATE.start_main_~A1~0 .cse22)) (.cse7 (fp.leq c_ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0))))) (.cse8 (fp.geq c_ULTIMATE.start_main_~B2~0 (fp.neg .cse22))) (.cse9 (fp.geq c_ULTIMATE.start_main_~A1~0 .cse21)) (.cse10 (fp.geq c_ULTIMATE.start_main_~E0~0 (_ +zero 11 53))) (.cse11 (fp.leq c_ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0)))) (.cse12 (fp.geq c_ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0))))) (.cse13 (fp.leq c_ULTIMATE.start_main_~E~0 .cse20)) (.cse14 (fp.geq c_ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0)))) (.cse15 (fp.leq c_ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0)))) (.cse17 (fp.geq c_ULTIMATE.start_main_~E~0 (_ +zero 11 53)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (not .cse16) .cse17 .cse18) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not .cse19) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17 .cse18) (and .cse16 .cse0 (= (bvadd c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) .cse1 .cse2 .cse19 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse17)))) is different from false [2020-11-30 00:05:35,549 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 20, 1] term [2020-11-30 00:05:35,550 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-30 00:05:37,793 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.geq c_ULTIMATE.start_main_~S~0 (fp.neg .cse0)) (exists ((ULTIMATE.start_main_~E1~0 (_ FloatingPoint 11 53))) (and (fp.leq ULTIMATE.start_main_~E1~0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (fp.geq ULTIMATE.start_main_~E1~0 (_ +zero 11 53)) (= c_ULTIMATE.start_main_~S~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 c_ULTIMATE.start_main_~E~0) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode ULTIMATE.start_main_~E1~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S0~0 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)) c_ULTIMATE.start_main_~B2~0))))) (= c_ULTIMATE.start_main_~S0~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.leq c_ULTIMATE.start_main_~E0~0 .cse1) (fp.leq c_ULTIMATE.start_main_~S~0 .cse0) (fp.geq c_ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0))) (fp.leq c_ULTIMATE.start_main_~B2~0 (fp.neg .cse2)) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_ULTIMATE.start_main_~A1~0 .cse3) (fp.leq c_ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0)))) (fp.geq c_ULTIMATE.start_main_~B2~0 (fp.neg .cse3)) (fp.geq c_ULTIMATE.start_main_~A1~0 .cse2) (fp.geq c_ULTIMATE.start_main_~E0~0 (_ +zero 11 53)) (fp.leq c_ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0))) (fp.geq c_ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0)))) (fp.leq c_ULTIMATE.start_main_~E~0 .cse1) (fp.geq c_ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0))) (fp.leq c_ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0))) (fp.geq c_ULTIMATE.start_main_~E~0 (_ +zero 11 53)))) is different from false [2020-11-30 00:05:40,088 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse23 ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))) (.cse22 ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))) (.cse25 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (.cse24 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse17 (fp.leq c_ULTIMATE.start_main_~E~0 .cse24)) (.cse0 (fp.geq c_ULTIMATE.start_main_~S~0 (fp.neg .cse25))) (.cse1 (= c_ULTIMATE.start_main_~S0~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (.cse2 (fp.leq c_ULTIMATE.start_main_~E0~0 .cse24)) (.cse3 (fp.leq c_ULTIMATE.start_main_~S~0 .cse25)) (.cse4 (fp.geq c_ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (.cse5 (fp.leq c_ULTIMATE.start_main_~E1~0 .cse24)) (.cse6 (exists ((v_ULTIMATE.start_main_~E1~0_9 (_ FloatingPoint 11 53))) (and (fp.geq v_ULTIMATE.start_main_~E1~0_9 (_ +zero 11 53)) (fp.leq v_ULTIMATE.start_main_~E1~0_9 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (= c_ULTIMATE.start_main_~S~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 c_ULTIMATE.start_main_~E0~0) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E1~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E1~0_9 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S0~0 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)) c_ULTIMATE.start_main_~B2~0)))))) (.cse7 (fp.leq c_ULTIMATE.start_main_~B2~0 (fp.neg .cse22))) (.cse8 (= c_currentRoundingMode roundNearestTiesToEven)) (.cse9 (fp.leq c_ULTIMATE.start_main_~A1~0 .cse23)) (.cse10 (fp.geq c_ULTIMATE.start_main_~E1~0 (_ +zero 11 53))) (.cse11 (fp.leq c_ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0))))) (.cse12 (fp.geq c_ULTIMATE.start_main_~B2~0 (fp.neg .cse23))) (.cse13 (fp.geq c_ULTIMATE.start_main_~A1~0 .cse22)) (.cse14 (fp.geq c_ULTIMATE.start_main_~E0~0 (_ +zero 11 53))) (.cse15 (fp.leq c_ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0)))) (.cse16 (fp.geq c_ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0))))) (.cse18 (fp.geq c_ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0)))) (.cse19 (fp.leq c_ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0)))) (.cse21 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) (.cse20 (fp.geq c_ULTIMATE.start_main_~E~0 (_ +zero 11 53)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (_ bv1 32) c_ULTIMATE.start_assume_abort_if_not_~cond) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (not .cse17) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse21) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse18 .cse19 .cse21 (not .cse20))))) is different from false [2020-11-30 00:05:40,123 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-11-30 00:05:42,315 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (fp.geq c_ULTIMATE.start_main_~S~0 (fp.neg .cse0)) (= c_ULTIMATE.start_main_~S0~0 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32))) (fp.leq c_ULTIMATE.start_main_~E0~0 .cse1) (fp.leq c_ULTIMATE.start_main_~S~0 .cse0) (fp.geq c_ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0))) (fp.leq c_ULTIMATE.start_main_~E1~0 .cse1) (exists ((v_ULTIMATE.start_main_~E1~0_9 (_ FloatingPoint 11 53))) (and (fp.geq v_ULTIMATE.start_main_~E1~0_9 (_ +zero 11 53)) (fp.leq v_ULTIMATE.start_main_~E1~0_9 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (= c_ULTIMATE.start_main_~S~0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 c_ULTIMATE.start_main_~E0~0) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E1~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E1~0_9 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S0~0 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)) c_ULTIMATE.start_main_~B2~0))))) (fp.leq c_ULTIMATE.start_main_~B2~0 (fp.neg .cse2)) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_ULTIMATE.start_main_~A1~0 .cse3) (fp.geq c_ULTIMATE.start_main_~E1~0 (_ +zero 11 53)) (fp.leq c_ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0)))) (fp.geq c_ULTIMATE.start_main_~B2~0 (fp.neg .cse3)) (fp.geq c_ULTIMATE.start_main_~A1~0 .cse2) (fp.geq c_ULTIMATE.start_main_~E0~0 (_ +zero 11 53)) (fp.leq c_ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0))) (fp.geq c_ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0)))) (fp.leq c_ULTIMATE.start_main_~E~0 .cse1) (fp.geq c_ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0))) (fp.leq c_ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0))) (fp.geq c_ULTIMATE.start_main_~E~0 (_ +zero 11 53)))) is different from false [2020-11-30 00:05:42,359 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,359 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,361 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,361 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,362 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,362 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,363 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,364 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,365 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,366 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,367 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,367 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,368 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,369 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,370 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,370 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,371 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,372 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,373 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,373 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,375 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,375 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,376 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,377 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,378 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,378 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,379 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,380 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,381 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,381 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,382 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,383 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,384 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,385 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,386 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,386 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,387 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,388 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,389 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,389 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,391 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,391 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,392 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,393 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,394 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,394 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,395 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,396 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,397 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,397 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,399 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,399 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,400 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,401 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,402 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,403 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,404 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,404 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,406 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,406 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,407 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,408 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,409 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,409 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,411 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,411 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,413 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,413 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,419 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,419 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,420 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,421 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,422 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,423 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,424 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,425 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,425 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,426 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,427 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,428 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,429 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,429 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,430 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,431 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,432 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,433 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,434 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,434 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,435 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,436 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,437 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,438 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,439 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,439 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,441 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,441 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,442 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,443 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,444 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,445 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,446 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,446 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,447 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,448 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,449 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,450 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,451 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,451 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,452 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,453 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,454 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,454 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,455 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,456 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,457 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,458 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,459 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,459 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,460 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,461 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,462 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,462 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,464 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,464 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,465 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,466 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,467 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,468 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,469 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,469 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,471 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,471 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,472 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,473 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,474 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,475 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,476 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,477 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,478 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,479 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,480 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,480 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,482 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,482 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,483 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,484 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,485 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,486 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,487 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,488 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,489 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,489 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,491 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,491 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,492 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,493 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,494 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,495 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,496 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,497 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,498 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,498 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,500 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,500 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,501 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,502 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,503 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,504 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,505 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,505 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,506 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,507 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,508 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,509 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,510 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,510 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,512 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,512 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,513 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,514 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,515 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,516 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,520 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,521 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,522 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,522 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,524 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,524 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,525 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,526 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,527 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,528 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,529 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,529 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,530 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,531 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,532 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,533 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,534 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,534 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,536 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,536 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,537 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,538 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,539 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,540 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,541 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,541 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,543 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,543 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,544 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,545 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,546 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,546 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,548 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,548 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,550 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,550 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,551 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,552 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,553 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,554 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,555 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,555 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,556 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,557 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,558 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,558 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,559 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,560 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,561 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,562 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,563 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,563 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,565 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,565 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,566 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,567 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,568 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,569 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,570 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,571 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,572 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,573 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,574 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,574 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,576 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,576 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,578 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,578 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,579 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,580 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,581 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,582 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,583 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,584 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,585 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,586 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,587 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,588 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,589 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,589 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,590 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,591 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,592 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,593 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,594 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,595 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,596 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,597 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,598 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,599 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,600 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,601 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,602 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,603 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,604 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,605 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,606 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,606 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,608 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,608 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,609 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,610 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,611 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,611 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,612 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,613 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,614 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,615 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,616 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,616 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,617 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,618 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,621 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,622 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,623 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,624 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,625 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,625 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,626 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,627 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,628 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,629 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,630 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,630 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,631 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,632 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,633 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,633 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,634 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,634 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,636 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,636 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,637 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,637 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,638 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,639 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,640 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,640 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,641 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,642 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,643 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,643 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,644 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,645 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,646 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,646 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,647 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,648 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,649 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,649 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,650 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,651 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,652 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,652 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,653 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,654 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,655 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,655 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,656 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,657 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,658 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,658 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,659 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,660 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,661 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,661 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,662 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,663 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,664 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,664 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,665 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,666 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,667 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,667 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,668 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,669 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,670 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,670 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,671 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,672 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,673 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,673 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,675 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,675 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,676 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,676 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,677 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,678 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,679 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,679 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,680 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,681 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,682 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,682 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,683 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,684 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,685 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,685 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,686 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,687 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,688 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,688 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,689 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,690 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,691 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,691 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,693 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,693 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,694 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,694 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,695 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,696 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,697 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,698 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,699 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,699 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,707 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,708 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,709 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,709 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,710 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,716 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,717 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,718 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,719 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,719 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,720 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,721 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,722 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,722 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,724 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,724 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,725 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,726 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,727 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,727 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,729 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,729 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,730 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,731 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,732 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,733 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,734 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,734 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,735 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,736 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,737 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,737 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,738 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,739 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,740 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,741 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,741 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,742 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,743 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,744 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,745 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,745 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,746 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,746 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,748 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,748 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,749 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,750 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,751 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,751 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,752 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,753 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,754 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,754 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,755 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,756 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,757 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,757 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,759 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,759 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,760 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,761 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,762 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,762 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,764 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,764 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,765 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,766 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,767 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,767 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,768 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,769 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,770 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,771 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,772 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,772 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,773 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,774 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,775 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,776 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,777 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,777 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,778 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,779 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,780 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,780 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,781 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,782 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,783 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,784 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,785 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,785 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,786 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,787 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,788 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,788 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,790 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,790 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,791 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,792 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,793 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,793 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,795 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,795 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,796 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,797 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,798 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,798 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,799 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,800 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,801 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,801 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,803 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,803 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,809 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,809 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,811 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,811 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,812 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,813 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,814 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,814 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,816 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,816 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,817 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,817 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,819 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,819 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,820 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,821 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,822 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,822 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,823 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,824 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,825 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,826 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,827 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,827 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,828 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,829 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,830 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,831 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,832 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,832 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,833 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,834 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,835 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,836 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,837 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,837 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,838 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,839 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,840 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,840 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,841 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,842 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,843 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,844 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,845 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,845 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,846 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,847 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,848 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,848 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,850 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,850 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,851 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,851 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,852 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,853 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,854 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,855 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,856 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,856 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,857 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,858 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,859 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,859 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,861 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,861 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,862 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,862 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,863 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,864 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,865 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,866 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,866 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,867 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,868 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,869 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,870 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,870 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,871 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,871 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,873 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,873 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,874 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,874 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,876 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,876 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,877 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,877 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,878 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,879 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,880 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,881 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,882 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,882 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,884 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,884 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,885 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,886 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,887 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,887 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,888 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,889 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,890 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,890 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,892 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,892 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,893 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,894 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,895 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,896 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,901 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,902 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,903 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,903 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,904 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,905 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,906 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,906 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,908 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,908 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,909 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,909 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,911 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,911 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,912 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,913 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,914 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,914 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,916 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,916 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,917 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,918 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,919 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,919 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,920 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,921 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,922 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,922 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,924 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,924 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,925 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,926 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,927 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,927 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,928 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,929 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,930 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,930 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,932 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,932 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,933 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,933 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,935 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,935 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,936 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,937 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,938 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,938 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,939 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,940 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,941 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,942 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,943 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,944 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,945 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,945 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,946 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,947 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,948 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,948 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,949 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,950 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,951 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,951 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,952 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,953 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,954 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,955 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,956 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,956 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,957 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,958 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,959 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,959 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,960 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,961 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,962 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,963 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,964 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,964 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,965 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,966 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,967 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,967 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,968 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,969 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,970 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,970 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,971 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,972 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,973 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,973 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,974 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,975 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,976 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,977 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,978 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,978 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,979 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,980 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,981 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,982 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,983 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,983 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,984 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,985 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,986 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,987 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,988 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,992 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,994 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,994 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,995 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,996 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,997 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,998 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,999 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:42,999 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,000 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,001 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,002 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,002 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,003 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,004 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,005 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,006 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,007 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,007 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,009 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,009 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,010 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,011 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,012 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,013 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,014 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,014 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,016 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,016 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,017 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,018 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,019 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,019 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,020 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,021 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,022 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,022 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,023 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,024 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,025 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,025 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,026 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,027 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,028 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,029 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,030 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,030 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,031 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,032 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,033 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,034 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,035 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,035 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,037 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,037 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,038 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,039 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,040 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,040 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,042 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,042 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,043 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,044 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,045 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,045 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,046 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,047 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,048 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,049 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,050 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,050 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,051 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,052 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,053 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,054 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,055 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,055 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,057 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,057 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,058 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,059 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,060 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,060 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,062 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,062 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,063 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,064 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,065 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,066 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,067 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,067 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,068 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,069 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,070 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,071 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,072 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,072 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,073 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,074 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,075 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,075 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,077 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,077 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,078 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,079 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,080 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,080 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,084 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,085 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,086 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,087 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,088 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,089 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,090 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,090 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,091 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,092 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,093 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,094 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,095 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,095 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,097 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,097 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,098 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,099 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,100 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,101 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,102 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,103 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,104 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,104 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,106 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,106 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,107 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,108 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,109 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,110 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,111 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,111 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,112 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,113 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,114 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,115 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,116 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,116 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,118 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,118 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,119 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,120 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,121 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,121 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,123 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,123 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,124 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,125 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,126 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,127 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,128 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,128 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,130 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,130 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,131 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,132 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,133 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,133 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,135 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,135 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,136 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,137 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,138 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,139 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,140 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,140 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,141 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,142 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,143 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,144 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,145 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,145 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,146 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,147 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,148 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,149 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,150 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,150 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,151 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,152 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,153 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,153 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,154 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,155 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,156 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,156 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,158 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,158 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,159 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,160 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,161 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,161 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,162 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,163 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,164 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,164 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,165 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,166 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,167 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,167 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,168 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,169 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,170 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,170 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,171 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,172 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,176 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,177 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,178 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,179 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,180 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,181 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,182 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,182 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,183 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,184 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,185 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,186 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,187 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,187 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,189 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,189 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,190 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,191 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,192 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,192 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,193 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,194 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,195 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,196 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,197 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,197 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,198 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,199 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,200 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,200 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,201 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,202 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,203 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,204 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,205 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,206 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,207 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,207 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,208 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,209 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,210 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,210 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,211 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,212 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,213 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,213 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,214 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,215 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,216 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,216 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,217 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,218 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,219 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,219 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,220 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,221 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,222 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,222 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,223 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,223 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,224 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,225 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,226 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,226 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,227 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,228 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,229 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,229 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,230 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,231 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,232 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,232 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,233 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,234 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,235 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,235 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,236 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,236 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,237 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,238 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,239 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,239 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,240 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,241 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,242 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,242 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,243 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,243 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,244 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,245 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,246 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,246 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,247 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,248 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,249 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,249 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,250 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,251 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,251 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,252 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,253 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,253 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,254 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,255 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,256 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,256 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,261 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,262 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,263 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,263 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,264 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,265 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,266 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,266 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,267 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,268 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,269 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,269 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,270 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,270 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,271 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,272 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,273 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,273 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,274 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,274 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,275 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,276 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,277 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,277 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,278 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,279 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,280 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,280 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,281 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,281 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,282 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,283 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,284 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,284 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,285 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,286 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,287 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,287 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,288 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,288 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,289 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,290 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,291 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,291 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,292 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,293 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,294 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,294 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,295 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,296 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,296 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,297 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,298 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,298 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,299 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,300 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,301 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,301 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,302 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,303 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,304 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,304 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,305 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,306 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,307 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,307 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,308 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,309 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,310 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,310 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,311 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,312 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,313 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,313 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,314 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,315 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,316 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,316 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,317 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,318 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,319 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,319 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,320 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,321 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,322 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,322 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,323 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,324 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,325 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,325 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,326 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,327 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,328 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,328 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,329 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,329 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,331 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,331 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,332 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,332 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,333 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,334 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,335 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,336 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,337 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,337 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,338 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,339 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,344 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,344 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,345 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,346 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,347 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,347 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,348 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,349 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,350 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,350 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,351 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,352 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,353 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,353 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,354 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,355 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,356 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,356 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,357 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,358 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,359 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,360 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,361 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,361 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,362 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,363 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,364 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,364 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,365 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,366 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,367 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,367 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,368 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,369 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,370 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,370 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,371 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,372 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,373 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,373 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,374 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,375 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,376 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,376 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,377 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,378 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,379 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,380 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,381 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,381 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,382 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,383 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,384 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,384 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,385 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,386 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,387 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,387 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,388 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,389 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,390 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,391 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,392 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,392 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,393 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,394 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,395 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,395 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,396 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,397 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,398 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,399 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,399 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,400 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,401 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,402 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,403 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,403 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,404 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,405 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,406 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,406 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,407 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,408 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,409 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,409 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,410 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,411 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,412 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,412 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,413 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,414 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,415 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,415 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,417 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,417 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,418 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,419 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,420 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,420 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,422 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,422 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,423 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,424 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,425 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,425 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,429 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,429 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,430 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,431 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,432 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,433 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,434 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,434 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,435 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,436 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,437 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,437 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,439 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,439 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,440 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,441 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,442 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,442 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,443 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,444 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,445 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,445 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,447 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,447 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,448 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,449 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,450 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,450 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,451 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,452 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,453 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,454 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,455 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,455 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,456 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,457 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,458 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,458 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,460 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,460 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,461 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,462 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,463 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,463 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,464 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,465 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,466 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,466 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,467 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,468 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,469 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,470 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,471 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,471 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,472 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,473 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,474 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,475 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,476 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,476 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,477 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,478 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,479 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,479 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,480 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,481 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,482 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,482 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,483 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,484 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,485 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,485 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,487 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,487 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,488 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,489 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,490 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,490 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,491 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,492 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,493 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,494 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,495 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,495 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,496 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,497 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,498 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,498 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,499 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,500 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,501 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,502 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,503 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,503 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,504 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,505 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,506 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,506 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,507 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,508 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,509 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,510 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,511 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,511 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,512 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,513 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,514 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,514 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,519 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,519 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,520 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,521 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,522 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,523 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,524 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,524 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,525 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,526 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,527 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,527 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,529 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,529 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,530 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,531 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,532 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,532 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,533 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:43,534 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-30 00:05:54,106 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse8 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) (or (and (exists ((ULTIMATE.start_main_~A3~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E1~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~A2~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B2~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~A1~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B1~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E1~0_9 (_ FloatingPoint 11 53))) (let ((.cse7 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 100.0)) (.cse4 (fp.mul roundNearestTiesToEven .cse7 ULTIMATE.start_main_~B2~0))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 69.0 100.0))) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse2 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~A1~0 ULTIMATE.start_main_~E0~0) (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~E1~0 ULTIMATE.start_main_~A2~0)) (fp.mul roundNearestTiesToEven v_ULTIMATE.start_main_~E1~0_9 ULTIMATE.start_main_~A3~0)) (fp.mul roundNearestTiesToEven .cse7 ULTIMATE.start_main_~B1~0)) .cse4)) (.cse5 (fp.neg .cse3)) (.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (/ 71.0 100.0)))) (and (fp.geq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 109.0 100.0))) (fp.leq ULTIMATE.start_main_~E0~0 .cse0) (fp.leq ULTIMATE.start_main_~B2~0 (fp.neg .cse1)) (fp.leq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 141.0 100.0))) (fp.leq ULTIMATE.start_main_~E~0 .cse0) (fp.leq .cse2 .cse3) (fp.geq v_ULTIMATE.start_main_~E1~0_9 (_ +zero 11 53)) (fp.geq ULTIMATE.start_main_~A1~0 .cse1) (fp.geq ULTIMATE.start_main_~E1~0 (_ +zero 11 53)) (fp.leq v_ULTIMATE.start_main_~E1~0_9 .cse0) (fp.leq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 129.0 100.0)))) (not (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~A1~0 ULTIMATE.start_main_~E~0) (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~E0~0 ULTIMATE.start_main_~A2~0)) (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~E1~0 ULTIMATE.start_main_~A3~0)) (fp.mul roundNearestTiesToEven .cse2 ULTIMATE.start_main_~B1~0)) .cse4) .cse5)) (fp.leq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 111.0 100.0))) (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53)) (fp.leq ULTIMATE.start_main_~E1~0 .cse0) (fp.geq .cse2 .cse5) (fp.geq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 131.0 100.0)))) (fp.leq ULTIMATE.start_main_~A1~0 .cse6) (fp.geq ULTIMATE.start_main_~E~0 (_ +zero 11 53)) (fp.geq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 139.0 100.0))) (fp.geq ULTIMATE.start_main_~B2~0 (fp.neg .cse6))))))) .cse8) (and (exists ((ULTIMATE.start_main_~A3~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E1~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~A2~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B2~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~A1~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B1~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E1~0_9 (_ FloatingPoint 11 53))) (let ((.cse15 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (let ((.cse13 (fp.mul roundNearestTiesToEven .cse15 ULTIMATE.start_main_~B2~0))) (let ((.cse10 ((_ to_fp 11 53) roundNearestTiesToEven (/ 69.0 100.0))) (.cse9 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse11 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~A1~0 ULTIMATE.start_main_~E0~0) (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~E1~0 ULTIMATE.start_main_~A2~0)) (fp.mul roundNearestTiesToEven v_ULTIMATE.start_main_~E1~0_9 ULTIMATE.start_main_~A3~0)) (fp.mul roundNearestTiesToEven .cse15 ULTIMATE.start_main_~B1~0)) .cse13)) (.cse12 ((_ to_fp 11 53) roundNearestTiesToEven 100.0)) (.cse14 ((_ to_fp 11 53) roundNearestTiesToEven (/ 71.0 100.0)))) (and (fp.geq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 109.0 100.0))) (fp.leq ULTIMATE.start_main_~E0~0 .cse9) (fp.leq ULTIMATE.start_main_~B2~0 (fp.neg .cse10)) (fp.leq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 141.0 100.0))) (fp.leq ULTIMATE.start_main_~E~0 .cse9) (fp.leq .cse11 .cse12) (fp.geq v_ULTIMATE.start_main_~E1~0_9 (_ +zero 11 53)) (fp.geq ULTIMATE.start_main_~A1~0 .cse10) (fp.geq ULTIMATE.start_main_~E1~0 (_ +zero 11 53)) (fp.leq v_ULTIMATE.start_main_~E1~0_9 .cse9) (fp.leq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 129.0 100.0)))) (not (fp.leq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~A1~0 ULTIMATE.start_main_~E~0) (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~E0~0 ULTIMATE.start_main_~A2~0)) (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~E1~0 ULTIMATE.start_main_~A3~0)) (fp.mul roundNearestTiesToEven .cse11 ULTIMATE.start_main_~B1~0)) .cse13) .cse12)) (fp.leq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 111.0 100.0))) (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53)) (fp.leq ULTIMATE.start_main_~E1~0 .cse9) (fp.geq .cse11 (fp.neg .cse12)) (fp.geq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 131.0 100.0)))) (fp.leq ULTIMATE.start_main_~A1~0 .cse14) (fp.geq ULTIMATE.start_main_~E~0 (_ +zero 11 53)) (fp.geq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 139.0 100.0))) (fp.geq ULTIMATE.start_main_~B2~0 (fp.neg .cse14))))))) .cse8) (and (exists ((ULTIMATE.start_main_~A3~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E1~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~A2~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B2~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~A1~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B1~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E1~0_9 (_ FloatingPoint 11 53))) (let ((.cse24 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (let ((.cse23 (fp.mul roundNearestTiesToEven .cse24 ULTIMATE.start_main_~B2~0))) (let ((.cse19 ((_ to_fp 11 53) roundNearestTiesToEven 100.0)) (.cse18 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~A1~0 ULTIMATE.start_main_~E0~0) (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~E1~0 ULTIMATE.start_main_~A2~0)) (fp.mul roundNearestTiesToEven v_ULTIMATE.start_main_~E1~0_9 ULTIMATE.start_main_~A3~0)) (fp.mul roundNearestTiesToEven .cse24 ULTIMATE.start_main_~B1~0)) .cse23))) (let ((.cse17 ((_ to_fp 11 53) roundNearestTiesToEven (/ 69.0 100.0))) (.cse16 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse20 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~A1~0 ULTIMATE.start_main_~E~0) (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~E0~0 ULTIMATE.start_main_~A2~0)) (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~E1~0 ULTIMATE.start_main_~A3~0)) (fp.mul roundNearestTiesToEven .cse18 ULTIMATE.start_main_~B1~0)) .cse23)) (.cse21 (fp.neg .cse19)) (.cse22 ((_ to_fp 11 53) roundNearestTiesToEven (/ 71.0 100.0)))) (and (fp.geq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 109.0 100.0))) (fp.leq ULTIMATE.start_main_~E0~0 .cse16) (fp.leq ULTIMATE.start_main_~B2~0 (fp.neg .cse17)) (fp.leq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 141.0 100.0))) (fp.leq ULTIMATE.start_main_~E~0 .cse16) (fp.leq .cse18 .cse19) (fp.geq v_ULTIMATE.start_main_~E1~0_9 (_ +zero 11 53)) (fp.geq ULTIMATE.start_main_~A1~0 .cse17) (fp.geq ULTIMATE.start_main_~E1~0 (_ +zero 11 53)) (fp.leq v_ULTIMATE.start_main_~E1~0_9 .cse16) (fp.leq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 129.0 100.0)))) (fp.leq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 111.0 100.0))) (fp.geq .cse20 .cse21) (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53)) (fp.leq ULTIMATE.start_main_~E1~0 .cse16) (fp.leq .cse20 .cse19) (fp.geq .cse18 .cse21) (fp.geq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 131.0 100.0)))) (fp.leq ULTIMATE.start_main_~A1~0 .cse22) (fp.geq ULTIMATE.start_main_~E~0 (_ +zero 11 53)) (fp.geq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 139.0 100.0))) (fp.geq ULTIMATE.start_main_~B2~0 (fp.neg .cse22)))))))) (= (bvadd c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))))) is different from false [2020-11-30 00:06:07,242 WARN L838 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_main_~E1~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~A3~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~A2~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~A1~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B2~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B1~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E1~0_9 (_ FloatingPoint 11 53))) (let ((.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse6 ULTIMATE.start_main_~B2~0))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 69.0 100.0))) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse2 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~A1~0 ULTIMATE.start_main_~E0~0) (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~E1~0 ULTIMATE.start_main_~A2~0)) (fp.mul roundNearestTiesToEven v_ULTIMATE.start_main_~E1~0_9 ULTIMATE.start_main_~A3~0)) (fp.mul roundNearestTiesToEven .cse6 ULTIMATE.start_main_~B1~0)) .cse4)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 100.0)) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 71.0 100.0)))) (and (fp.geq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 109.0 100.0))) (fp.leq ULTIMATE.start_main_~E0~0 .cse0) (fp.leq ULTIMATE.start_main_~B2~0 (fp.neg .cse1)) (fp.leq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 141.0 100.0))) (fp.leq ULTIMATE.start_main_~E~0 .cse0) (fp.leq .cse2 .cse3) (fp.geq v_ULTIMATE.start_main_~E1~0_9 (_ +zero 11 53)) (fp.geq ULTIMATE.start_main_~A1~0 .cse1) (fp.geq ULTIMATE.start_main_~E1~0 (_ +zero 11 53)) (fp.leq v_ULTIMATE.start_main_~E1~0_9 .cse0) (fp.leq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 129.0 100.0)))) (not (fp.leq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~A1~0 ULTIMATE.start_main_~E~0) (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~E0~0 ULTIMATE.start_main_~A2~0)) (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~E1~0 ULTIMATE.start_main_~A3~0)) (fp.mul roundNearestTiesToEven .cse2 ULTIMATE.start_main_~B1~0)) .cse4) .cse3)) (fp.leq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 111.0 100.0))) (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53)) (fp.leq ULTIMATE.start_main_~E1~0 .cse0) (fp.geq .cse2 (fp.neg .cse3)) (fp.geq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 131.0 100.0)))) (fp.leq ULTIMATE.start_main_~A1~0 .cse5) (fp.geq ULTIMATE.start_main_~E~0 (_ +zero 11 53)) (fp.geq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 139.0 100.0))) (fp.geq ULTIMATE.start_main_~B2~0 (fp.neg .cse5))))))) (exists ((v_prenex_17 (_ FloatingPoint 11 53)) (v_prenex_18 (_ FloatingPoint 11 53)) (v_prenex_16 (_ FloatingPoint 11 53)) (v_prenex_24 (_ FloatingPoint 11 53)) (v_prenex_22 (_ FloatingPoint 11 53)) (v_prenex_23 (_ FloatingPoint 11 53)) (v_prenex_20 (_ FloatingPoint 11 53)) (v_prenex_21 (_ FloatingPoint 11 53)) (v_prenex_19 (_ FloatingPoint 11 53))) (let ((.cse14 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (let ((.cse12 ((_ to_fp 11 53) roundNearestTiesToEven 100.0)) (.cse13 (fp.mul roundNearestTiesToEven .cse14 v_prenex_20))) (let ((.cse8 ((_ to_fp 11 53) roundNearestTiesToEven (/ 71.0 100.0))) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse11 ((_ to_fp 11 53) roundNearestTiesToEven (/ 69.0 100.0))) (.cse9 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven v_prenex_19 v_prenex_23) (fp.mul roundNearestTiesToEven v_prenex_16 v_prenex_18)) (fp.mul roundNearestTiesToEven v_prenex_24 v_prenex_17)) (fp.mul roundNearestTiesToEven .cse14 v_prenex_22)) .cse13)) (.cse10 (fp.neg .cse12))) (and (fp.geq v_prenex_24 (_ +zero 11 53)) (fp.leq v_prenex_23 .cse7) (fp.geq v_prenex_21 (_ +zero 11 53)) (fp.geq v_prenex_18 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 131.0 100.0)))) (fp.geq v_prenex_20 (fp.neg .cse8)) (fp.geq .cse9 .cse10) (fp.leq v_prenex_18 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 129.0 100.0)))) (fp.geq v_prenex_22 ((_ to_fp 11 53) roundNearestTiesToEven (/ 139.0 100.0))) (fp.geq v_prenex_19 .cse11) (fp.leq v_prenex_17 ((_ to_fp 11 53) roundNearestTiesToEven (/ 111.0 100.0))) (fp.leq .cse9 .cse12) (fp.leq v_prenex_24 .cse7) (fp.geq v_prenex_16 (_ +zero 11 53)) (fp.geq v_prenex_23 (_ +zero 11 53)) (fp.leq v_prenex_21 .cse7) (fp.leq v_prenex_19 .cse8) (fp.leq v_prenex_22 ((_ to_fp 11 53) roundNearestTiesToEven (/ 141.0 100.0))) (fp.geq v_prenex_17 ((_ to_fp 11 53) roundNearestTiesToEven (/ 109.0 100.0))) (fp.leq v_prenex_16 .cse7) (fp.leq v_prenex_20 (fp.neg .cse11)) (not (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven v_prenex_19 v_prenex_21) (fp.mul roundNearestTiesToEven v_prenex_23 v_prenex_18)) (fp.mul roundNearestTiesToEven v_prenex_16 v_prenex_17)) (fp.mul roundNearestTiesToEven .cse9 v_prenex_22)) .cse13) .cse10)))))))) is different from false [2020-11-30 00:06:09,554 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_main_~E1~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~A3~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~A2~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~A1~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B2~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B1~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E1~0_9 (_ FloatingPoint 11 53))) (let ((.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (let ((.cse4 (fp.mul roundNearestTiesToEven .cse6 ULTIMATE.start_main_~B2~0))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 69.0 100.0))) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse2 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~A1~0 ULTIMATE.start_main_~E0~0) (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~E1~0 ULTIMATE.start_main_~A2~0)) (fp.mul roundNearestTiesToEven v_ULTIMATE.start_main_~E1~0_9 ULTIMATE.start_main_~A3~0)) (fp.mul roundNearestTiesToEven .cse6 ULTIMATE.start_main_~B1~0)) .cse4)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 100.0)) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 71.0 100.0)))) (and (fp.geq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 109.0 100.0))) (fp.leq ULTIMATE.start_main_~E0~0 .cse0) (fp.leq ULTIMATE.start_main_~B2~0 (fp.neg .cse1)) (fp.leq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 141.0 100.0))) (fp.leq ULTIMATE.start_main_~E~0 .cse0) (fp.leq .cse2 .cse3) (fp.geq v_ULTIMATE.start_main_~E1~0_9 (_ +zero 11 53)) (fp.geq ULTIMATE.start_main_~A1~0 .cse1) (fp.geq ULTIMATE.start_main_~E1~0 (_ +zero 11 53)) (fp.leq v_ULTIMATE.start_main_~E1~0_9 .cse0) (fp.leq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 129.0 100.0)))) (not (fp.leq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~A1~0 ULTIMATE.start_main_~E~0) (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~E0~0 ULTIMATE.start_main_~A2~0)) (fp.mul roundNearestTiesToEven ULTIMATE.start_main_~E1~0 ULTIMATE.start_main_~A3~0)) (fp.mul roundNearestTiesToEven .cse2 ULTIMATE.start_main_~B1~0)) .cse4) .cse3)) (fp.leq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 111.0 100.0))) (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53)) (fp.leq ULTIMATE.start_main_~E1~0 .cse0) (fp.geq .cse2 (fp.neg .cse3)) (fp.geq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 131.0 100.0)))) (fp.leq ULTIMATE.start_main_~A1~0 .cse5) (fp.geq ULTIMATE.start_main_~E~0 (_ +zero 11 53)) (fp.geq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 139.0 100.0))) (fp.geq ULTIMATE.start_main_~B2~0 (fp.neg .cse5))))))) (exists ((v_prenex_17 (_ FloatingPoint 11 53)) (v_prenex_18 (_ FloatingPoint 11 53)) (v_prenex_16 (_ FloatingPoint 11 53)) (v_prenex_24 (_ FloatingPoint 11 53)) (v_prenex_22 (_ FloatingPoint 11 53)) (v_prenex_23 (_ FloatingPoint 11 53)) (v_prenex_20 (_ FloatingPoint 11 53)) (v_prenex_21 (_ FloatingPoint 11 53)) (v_prenex_19 (_ FloatingPoint 11 53))) (let ((.cse14 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (let ((.cse12 ((_ to_fp 11 53) roundNearestTiesToEven 100.0)) (.cse13 (fp.mul roundNearestTiesToEven .cse14 v_prenex_20))) (let ((.cse8 ((_ to_fp 11 53) roundNearestTiesToEven (/ 71.0 100.0))) (.cse7 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse11 ((_ to_fp 11 53) roundNearestTiesToEven (/ 69.0 100.0))) (.cse9 (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven v_prenex_19 v_prenex_23) (fp.mul roundNearestTiesToEven v_prenex_16 v_prenex_18)) (fp.mul roundNearestTiesToEven v_prenex_24 v_prenex_17)) (fp.mul roundNearestTiesToEven .cse14 v_prenex_22)) .cse13)) (.cse10 (fp.neg .cse12))) (and (fp.geq v_prenex_24 (_ +zero 11 53)) (fp.leq v_prenex_23 .cse7) (fp.geq v_prenex_21 (_ +zero 11 53)) (fp.geq v_prenex_18 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 131.0 100.0)))) (fp.geq v_prenex_20 (fp.neg .cse8)) (fp.geq .cse9 .cse10) (fp.leq v_prenex_18 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 129.0 100.0)))) (fp.geq v_prenex_22 ((_ to_fp 11 53) roundNearestTiesToEven (/ 139.0 100.0))) (fp.geq v_prenex_19 .cse11) (fp.leq v_prenex_17 ((_ to_fp 11 53) roundNearestTiesToEven (/ 111.0 100.0))) (fp.leq .cse9 .cse12) (fp.leq v_prenex_24 .cse7) (fp.geq v_prenex_16 (_ +zero 11 53)) (fp.geq v_prenex_23 (_ +zero 11 53)) (fp.leq v_prenex_21 .cse7) (fp.leq v_prenex_19 .cse8) (fp.leq v_prenex_22 ((_ to_fp 11 53) roundNearestTiesToEven (/ 141.0 100.0))) (fp.geq v_prenex_17 ((_ to_fp 11 53) roundNearestTiesToEven (/ 109.0 100.0))) (fp.leq v_prenex_16 .cse7) (fp.leq v_prenex_20 (fp.neg .cse11)) (not (fp.geq (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven v_prenex_19 v_prenex_21) (fp.mul roundNearestTiesToEven v_prenex_23 v_prenex_18)) (fp.mul roundNearestTiesToEven v_prenex_16 v_prenex_17)) (fp.mul roundNearestTiesToEven .cse9 v_prenex_22)) .cse13) .cse10)))))))) is different from true [2020-11-30 00:06:09,571 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2020-11-30 00:06:09,571 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-30 00:06:12,053 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 c_ULTIMATE.start_main_~E~0) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E1~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S~0 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S0~0 c_ULTIMATE.start_main_~B2~0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from false [2020-11-30 00:06:14,330 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 c_ULTIMATE.start_main_~E~0) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E1~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S~0 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S0~0 c_ULTIMATE.start_main_~B2~0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) is different from true [2020-11-30 00:06:16,615 WARN L838 $PredicateComparison]: unable to prove that (or (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 c_ULTIMATE.start_main_~E~0) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E1~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S~0 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S0~0 c_ULTIMATE.start_main_~B2~0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) is different from false [2020-11-30 00:06:18,855 WARN L860 $PredicateComparison]: unable to prove that (or (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 c_ULTIMATE.start_main_~E~0) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E1~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S~0 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S0~0 c_ULTIMATE.start_main_~B2~0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (and (fp.geq .cse0 (fp.neg .cse1)) (fp.leq .cse0 .cse1))) (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) is different from true [2020-11-30 00:06:18,860 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-11-30 00:06:18,861 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 00:06:18,869 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 00:06:21,265 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~E~0_16 (_ FloatingPoint 11 53))) (or (not (fp.geq v_ULTIMATE.start_main_~E~0_16 (_ +zero 11 53))) (fp.leq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_16) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S~0 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S0~0 c_ULTIMATE.start_main_~B2~0)) ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (not (fp.leq v_ULTIMATE.start_main_~E~0_16 ((_ to_fp 11 53) c_currentRoundingMode 1.0))))) (forall ((v_ULTIMATE.start_main_~E~0_16 (_ FloatingPoint 11 53))) (or (not (fp.geq v_ULTIMATE.start_main_~E~0_16 (_ +zero 11 53))) (not (fp.leq v_ULTIMATE.start_main_~E~0_16 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_16) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S~0 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S0~0 c_ULTIMATE.start_main_~B2~0)) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 100.0)))))) is different from true [2020-11-30 00:06:23,644 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_25 (_ FloatingPoint 11 53))) (or (not (fp.leq v_prenex_25 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_25) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S~0 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S0~0 c_ULTIMATE.start_main_~B2~0)) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (not (fp.geq v_prenex_25 (_ +zero 11 53))))) (forall ((v_ULTIMATE.start_main_~E~0_16 (_ FloatingPoint 11 53))) (or (not (fp.geq v_ULTIMATE.start_main_~E~0_16 (_ +zero 11 53))) (fp.leq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_16) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S~0 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S0~0 c_ULTIMATE.start_main_~B2~0)) ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (not (fp.leq v_ULTIMATE.start_main_~E~0_16 ((_ to_fp 11 53) c_currentRoundingMode 1.0)))))) is different from true [2020-11-30 00:06:25,982 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) (and (or (forall ((v_prenex_25 (_ FloatingPoint 11 53))) (or (not (fp.leq v_prenex_25 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_25) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S~0 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S0~0 c_ULTIMATE.start_main_~B2~0)) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (not (fp.geq v_prenex_25 (_ +zero 11 53))))) .cse0) (or (forall ((v_ULTIMATE.start_main_~E~0_16 (_ FloatingPoint 11 53))) (or (not (fp.geq v_ULTIMATE.start_main_~E~0_16 (_ +zero 11 53))) (fp.leq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_16) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S~0 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S0~0 c_ULTIMATE.start_main_~B2~0)) ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (not (fp.leq v_ULTIMATE.start_main_~E~0_16 ((_ to_fp 11 53) c_currentRoundingMode 1.0))))) .cse0))) is different from true [2020-11-30 00:06:25,984 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 00:06:25,984 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 00:06:28,327 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 c_ULTIMATE.start_main_~E~0) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E1~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S~0 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S0~0 c_ULTIMATE.start_main_~B2~0))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (let ((.cse0 (not (fp.geq .cse2 (fp.neg .cse3)))) (.cse1 (not (fp.leq .cse2 .cse3)))) (and (or (forall ((v_ULTIMATE.start_main_~E~0_16 (_ FloatingPoint 11 53))) (or (not (fp.geq v_ULTIMATE.start_main_~E~0_16 (_ +zero 11 53))) (fp.leq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_16) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 c_ULTIMATE.start_main_~E~0) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E1~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S~0 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S0~0 c_ULTIMATE.start_main_~B2~0)) c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S~0 c_ULTIMATE.start_main_~B2~0)) ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (not (fp.leq v_ULTIMATE.start_main_~E~0_16 ((_ to_fp 11 53) c_currentRoundingMode 1.0))))) .cse0 .cse1) (or .cse0 .cse1 (forall ((v_prenex_25 (_ FloatingPoint 11 53))) (or (not (fp.leq v_prenex_25 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_25) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 c_ULTIMATE.start_main_~E~0) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E1~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S~0 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S0~0 c_ULTIMATE.start_main_~B2~0)) c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S~0 c_ULTIMATE.start_main_~B2~0)) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (not (fp.geq v_prenex_25 (_ +zero 11 53))))))))) is different from false [2020-11-30 00:06:31,022 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 c_ULTIMATE.start_main_~E~0) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E1~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S~0 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S0~0 c_ULTIMATE.start_main_~B2~0))) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (let ((.cse0 (not (fp.geq .cse2 (fp.neg .cse3)))) (.cse1 (not (fp.leq .cse2 .cse3)))) (and (or (forall ((v_ULTIMATE.start_main_~E~0_16 (_ FloatingPoint 11 53))) (or (not (fp.geq v_ULTIMATE.start_main_~E~0_16 (_ +zero 11 53))) (fp.leq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_16) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 c_ULTIMATE.start_main_~E~0) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E1~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S~0 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S0~0 c_ULTIMATE.start_main_~B2~0)) c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S~0 c_ULTIMATE.start_main_~B2~0)) ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (not (fp.leq v_ULTIMATE.start_main_~E~0_16 ((_ to_fp 11 53) c_currentRoundingMode 1.0))))) .cse0 .cse1) (or .cse0 .cse1 (forall ((v_prenex_25 (_ FloatingPoint 11 53))) (or (not (fp.leq v_prenex_25 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_25) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 c_ULTIMATE.start_main_~E~0) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E1~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S~0 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S0~0 c_ULTIMATE.start_main_~B2~0)) c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S~0 c_ULTIMATE.start_main_~B2~0)) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (not (fp.geq v_prenex_25 (_ +zero 11 53))))))))) is different from true [2020-11-30 00:06:33,315 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 c_ULTIMATE.start_main_~E~0) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E1~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S~0 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S0~0 c_ULTIMATE.start_main_~B2~0))) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (let ((.cse0 (not (fp.geq .cse3 (fp.neg .cse4)))) (.cse1 (not (fp.leq .cse3 .cse4))) (.cse2 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond))) (and (or .cse0 .cse1 .cse2 (forall ((v_prenex_25 (_ FloatingPoint 11 53))) (or (not (fp.leq v_prenex_25 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_25) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 c_ULTIMATE.start_main_~E~0) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E1~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S~0 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S0~0 c_ULTIMATE.start_main_~B2~0)) c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S~0 c_ULTIMATE.start_main_~B2~0)) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (not (fp.geq v_prenex_25 (_ +zero 11 53)))))) (or (forall ((v_ULTIMATE.start_main_~E~0_16 (_ FloatingPoint 11 53))) (or (not (fp.geq v_ULTIMATE.start_main_~E~0_16 (_ +zero 11 53))) (fp.leq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_16) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 c_ULTIMATE.start_main_~E~0) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E1~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S~0 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S0~0 c_ULTIMATE.start_main_~B2~0)) c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S~0 c_ULTIMATE.start_main_~B2~0)) ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (not (fp.leq v_ULTIMATE.start_main_~E~0_16 ((_ to_fp 11 53) c_currentRoundingMode 1.0))))) .cse0 .cse1 .cse2)))) is different from false [2020-11-30 00:06:35,966 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse3 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 c_ULTIMATE.start_main_~E~0) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E1~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S~0 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S0~0 c_ULTIMATE.start_main_~B2~0))) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (let ((.cse0 (not (fp.geq .cse3 (fp.neg .cse4)))) (.cse1 (not (fp.leq .cse3 .cse4))) (.cse2 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond))) (and (or .cse0 .cse1 .cse2 (forall ((v_prenex_25 (_ FloatingPoint 11 53))) (or (not (fp.leq v_prenex_25 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_25) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 c_ULTIMATE.start_main_~E~0) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E1~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S~0 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S0~0 c_ULTIMATE.start_main_~B2~0)) c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S~0 c_ULTIMATE.start_main_~B2~0)) (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (not (fp.geq v_prenex_25 (_ +zero 11 53)))))) (or (forall ((v_ULTIMATE.start_main_~E~0_16 (_ FloatingPoint 11 53))) (or (not (fp.geq v_ULTIMATE.start_main_~E~0_16 (_ +zero 11 53))) (fp.leq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_16) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 c_ULTIMATE.start_main_~E~0) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E1~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S~0 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S0~0 c_ULTIMATE.start_main_~B2~0)) c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S~0 c_ULTIMATE.start_main_~B2~0)) ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (not (fp.leq v_ULTIMATE.start_main_~E~0_16 ((_ to_fp 11 53) c_currentRoundingMode 1.0))))) .cse0 .cse1 .cse2)))) is different from true [2020-11-30 00:06:35,969 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 2, 1] term [2020-11-30 00:06:35,969 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 00:06:35,973 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 00:06:39,239 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~E~0_17 (_ FloatingPoint 11 53)) (v_prenex_25 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_17) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S~0 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S0~0 c_ULTIMATE.start_main_~B2~0))) (.cse1 (fp.neg .cse3)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq .cse0 .cse1)) (not (fp.leq v_prenex_25 .cse2)) (not (fp.geq v_ULTIMATE.start_main_~E~0_17 (_ +zero 11 53))) (not (fp.leq .cse0 .cse3)) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_25) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_17 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S~0 c_ULTIMATE.start_main_~B2~0)) .cse1) (not (fp.leq v_ULTIMATE.start_main_~E~0_17 .cse2)) (not (fp.geq v_prenex_25 (_ +zero 11 53))))))) (forall ((v_ULTIMATE.start_main_~E~0_17 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_16 (_ FloatingPoint 11 53))) (let ((.cse4 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_17) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S~0 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S0~0 c_ULTIMATE.start_main_~B2~0))) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (.cse6 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq .cse4 (fp.neg .cse5))) (not (fp.geq v_ULTIMATE.start_main_~E~0_16 (_ +zero 11 53))) (not (fp.geq v_ULTIMATE.start_main_~E~0_17 (_ +zero 11 53))) (not (fp.leq .cse4 .cse5)) (fp.leq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_16) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_17 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse4 c_ULTIMATE.start_main_~B1~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~S~0 c_ULTIMATE.start_main_~B2~0)) .cse5) (not (fp.leq v_ULTIMATE.start_main_~E~0_16 .cse6)) (not (fp.leq v_ULTIMATE.start_main_~E~0_17 .cse6)))))) is different from true [2020-11-30 00:06:42,281 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_26 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_16 (_ FloatingPoint 11 53))) (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse4 c_ULTIMATE.start_main_~B2~0))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse1 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_26) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse4 c_ULTIMATE.start_main_~B1~0)) .cse3)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (or (not (fp.geq v_ULTIMATE.start_main_~E~0_16 (_ +zero 11 53))) (not (fp.geq v_prenex_26 (_ +zero 11 53))) (not (fp.leq v_prenex_26 .cse0)) (not (fp.leq v_ULTIMATE.start_main_~E~0_16 .cse0)) (not (fp.geq .cse1 (fp.neg .cse2))) (not (fp.leq .cse1 .cse2)) (fp.leq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_16) (fp.mul c_currentRoundingMode v_prenex_26 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse1 c_ULTIMATE.start_main_~B1~0)) .cse3) .cse2)))))) (forall ((v_ULTIMATE.start_main_~E~0_17 (_ FloatingPoint 11 53)) (v_prenex_25 (_ FloatingPoint 11 53))) (let ((.cse10 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse8 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (.cse6 (fp.mul c_currentRoundingMode .cse10 c_ULTIMATE.start_main_~B2~0))) (let ((.cse5 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_17) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse10 c_ULTIMATE.start_main_~B1~0)) .cse6)) (.cse7 (fp.neg .cse8)) (.cse9 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_25) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_17 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse5 c_ULTIMATE.start_main_~B1~0)) .cse6) .cse7) (not (fp.leq .cse5 .cse8)) (not (fp.leq v_prenex_25 .cse9)) (not (fp.geq v_ULTIMATE.start_main_~E~0_17 (_ +zero 11 53))) (not (fp.geq .cse5 .cse7)) (not (fp.leq v_ULTIMATE.start_main_~E~0_17 .cse9)) (not (fp.geq v_prenex_25 (_ +zero 11 53))))))))) is different from true [2020-11-30 00:06:45,004 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond))) (and (or .cse0 (forall ((v_prenex_26 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_16 (_ FloatingPoint 11 53))) (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse4 (fp.mul c_currentRoundingMode .cse5 c_ULTIMATE.start_main_~B2~0))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse2 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_26) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse5 c_ULTIMATE.start_main_~B1~0)) .cse4)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (or (not (fp.geq v_ULTIMATE.start_main_~E~0_16 (_ +zero 11 53))) (not (fp.geq v_prenex_26 (_ +zero 11 53))) (not (fp.leq v_prenex_26 .cse1)) (not (fp.leq v_ULTIMATE.start_main_~E~0_16 .cse1)) (not (fp.geq .cse2 (fp.neg .cse3))) (not (fp.leq .cse2 .cse3)) (fp.leq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_16) (fp.mul c_currentRoundingMode v_prenex_26 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse2 c_ULTIMATE.start_main_~B1~0)) .cse4) .cse3))))))) (or .cse0 (forall ((v_ULTIMATE.start_main_~E~0_17 (_ FloatingPoint 11 53)) (v_prenex_25 (_ FloatingPoint 11 53))) (let ((.cse11 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse9 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (.cse7 (fp.mul c_currentRoundingMode .cse11 c_ULTIMATE.start_main_~B2~0))) (let ((.cse6 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_17) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse11 c_ULTIMATE.start_main_~B1~0)) .cse7)) (.cse8 (fp.neg .cse9)) (.cse10 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_25) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_17 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse6 c_ULTIMATE.start_main_~B1~0)) .cse7) .cse8) (not (fp.leq .cse6 .cse9)) (not (fp.leq v_prenex_25 .cse10)) (not (fp.geq v_ULTIMATE.start_main_~E~0_17 (_ +zero 11 53))) (not (fp.geq .cse6 .cse8)) (not (fp.leq v_ULTIMATE.start_main_~E~0_17 .cse10)) (not (fp.geq v_prenex_25 (_ +zero 11 53))))))))))) is different from true [2020-11-30 00:06:45,006 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-11-30 00:06:45,006 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 00:06:45,007 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 00:06:48,319 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_26 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_16 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse4 c_ULTIMATE.start_main_~B2~0))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse1 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_26) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse4 c_ULTIMATE.start_main_~B1~0)) .cse3)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (or (not (fp.geq v_ULTIMATE.start_main_~E~0_16 (_ +zero 11 53))) (not (fp.leq ULTIMATE.start_main_~E0~0 .cse0)) (not (fp.geq v_prenex_26 (_ +zero 11 53))) (not (fp.leq v_prenex_26 .cse0)) (not (fp.leq v_ULTIMATE.start_main_~E~0_16 .cse0)) (not (fp.geq .cse1 (fp.neg .cse2))) (not (fp.leq .cse1 .cse2)) (fp.leq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_16) (fp.mul c_currentRoundingMode v_prenex_26 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse1 c_ULTIMATE.start_main_~B1~0)) .cse3) .cse2) (not (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53)))))))) (forall ((v_ULTIMATE.start_main_~E~0_17 (_ FloatingPoint 11 53)) (v_prenex_25 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse10 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse8 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (.cse6 (fp.mul c_currentRoundingMode .cse10 c_ULTIMATE.start_main_~B2~0))) (let ((.cse5 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_17) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse10 c_ULTIMATE.start_main_~B1~0)) .cse6)) (.cse7 (fp.neg .cse8)) (.cse9 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_25) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_17 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse5 c_ULTIMATE.start_main_~B1~0)) .cse6) .cse7) (not (fp.leq .cse5 .cse8)) (not (fp.leq v_prenex_25 .cse9)) (not (fp.geq v_ULTIMATE.start_main_~E~0_17 (_ +zero 11 53))) (not (fp.leq ULTIMATE.start_main_~E0~0 .cse9)) (not (fp.geq .cse5 .cse7)) (not (fp.leq v_ULTIMATE.start_main_~E~0_17 .cse9)) (not (fp.geq v_prenex_25 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53))))))))) is different from true [2020-11-30 00:06:51,088 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse5 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond))) (and (or (forall ((v_prenex_26 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_16 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse3 (fp.mul c_currentRoundingMode .cse4 c_ULTIMATE.start_main_~B2~0))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse1 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_26) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse4 c_ULTIMATE.start_main_~B1~0)) .cse3)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (or (not (fp.geq v_ULTIMATE.start_main_~E~0_16 (_ +zero 11 53))) (not (fp.leq ULTIMATE.start_main_~E0~0 .cse0)) (not (fp.geq v_prenex_26 (_ +zero 11 53))) (not (fp.leq v_prenex_26 .cse0)) (not (fp.leq v_ULTIMATE.start_main_~E~0_16 .cse0)) (not (fp.geq .cse1 (fp.neg .cse2))) (not (fp.leq .cse1 .cse2)) (fp.leq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_16) (fp.mul c_currentRoundingMode v_prenex_26 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse1 c_ULTIMATE.start_main_~B1~0)) .cse3) .cse2) (not (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53)))))))) .cse5) (or (forall ((v_prenex_27 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_17 (_ FloatingPoint 11 53)) (v_prenex_25 (_ FloatingPoint 11 53))) (let ((.cse11 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse7 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (.cse10 (fp.mul c_currentRoundingMode .cse11 c_ULTIMATE.start_main_~B2~0))) (let ((.cse6 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_17) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E~0 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_prenex_27 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse11 c_ULTIMATE.start_main_~B1~0)) .cse10)) (.cse9 (fp.neg .cse7)) (.cse8 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.leq .cse6 .cse7)) (not (fp.geq v_prenex_27 (_ +zero 11 53))) (not (fp.leq v_prenex_25 .cse8)) (not (fp.geq .cse6 .cse9)) (not (fp.geq v_ULTIMATE.start_main_~E~0_17 (_ +zero 11 53))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_25) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_17 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~E~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse6 c_ULTIMATE.start_main_~B1~0)) .cse10) .cse9) (not (fp.leq v_ULTIMATE.start_main_~E~0_17 .cse8)) (not (fp.leq v_prenex_27 .cse8)) (not (fp.geq v_prenex_25 (_ +zero 11 53)))))))) .cse5))) is different from true [2020-11-30 00:06:51,091 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-11-30 00:06:51,091 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 00:06:51,092 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 00:06:54,915 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_26 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_16 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_18 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse1 (fp.mul c_currentRoundingMode .cse4 c_ULTIMATE.start_main_~B2~0))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_26) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_18 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse4 c_ULTIMATE.start_main_~B1~0)) .cse1)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_ULTIMATE.start_main_~E~0_16 (_ +zero 11 53))) (fp.leq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_16) (fp.mul c_currentRoundingMode v_prenex_26 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_18 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~B1~0)) .cse1) .cse2) (not (fp.leq ULTIMATE.start_main_~E0~0 .cse3)) (not (fp.geq v_prenex_26 (_ +zero 11 53))) (not (fp.leq v_ULTIMATE.start_main_~E~0_18 .cse3)) (not (fp.leq .cse0 .cse2)) (not (fp.geq .cse0 (fp.neg .cse2))) (not (fp.leq v_prenex_26 .cse3)) (not (fp.leq v_ULTIMATE.start_main_~E~0_16 .cse3)) (not (fp.geq v_ULTIMATE.start_main_~E~0_18 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53)))))))) (forall ((v_prenex_27 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_17 (_ FloatingPoint 11 53)) (v_prenex_25 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_18 (_ FloatingPoint 11 53))) (let ((.cse10 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse9 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (.cse7 (fp.mul c_currentRoundingMode .cse10 c_ULTIMATE.start_main_~B2~0))) (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse6 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_17) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_18 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_prenex_27 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse10 c_ULTIMATE.start_main_~B1~0)) .cse7)) (.cse8 (fp.neg .cse9))) (or (not (fp.geq v_prenex_27 (_ +zero 11 53))) (not (fp.leq v_prenex_25 .cse5)) (not (fp.geq v_ULTIMATE.start_main_~E~0_17 (_ +zero 11 53))) (not (fp.leq v_ULTIMATE.start_main_~E~0_18 .cse5)) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_25) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_17 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_18 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse6 c_ULTIMATE.start_main_~B1~0)) .cse7) .cse8) (not (fp.geq v_ULTIMATE.start_main_~E~0_18 (_ +zero 11 53))) (not (fp.leq .cse6 .cse9)) (not (fp.leq v_ULTIMATE.start_main_~E~0_17 .cse5)) (not (fp.leq v_prenex_27 .cse5)) (not (fp.geq v_prenex_25 (_ +zero 11 53))) (not (fp.geq .cse6 .cse8)))))))) is different from true [2020-11-30 00:06:57,884 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse5 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond))) (and (or (forall ((v_prenex_26 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_16 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_18 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse1 (fp.mul c_currentRoundingMode .cse4 c_ULTIMATE.start_main_~B2~0))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_26) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_18 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse4 c_ULTIMATE.start_main_~B1~0)) .cse1)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_ULTIMATE.start_main_~E~0_16 (_ +zero 11 53))) (fp.leq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_16) (fp.mul c_currentRoundingMode v_prenex_26 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_18 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~B1~0)) .cse1) .cse2) (not (fp.leq ULTIMATE.start_main_~E0~0 .cse3)) (not (fp.geq v_prenex_26 (_ +zero 11 53))) (not (fp.leq v_ULTIMATE.start_main_~E~0_18 .cse3)) (not (fp.leq .cse0 .cse2)) (not (fp.geq .cse0 (fp.neg .cse2))) (not (fp.leq v_prenex_26 .cse3)) (not (fp.leq v_ULTIMATE.start_main_~E~0_16 .cse3)) (not (fp.geq v_ULTIMATE.start_main_~E~0_18 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53)))))))) .cse5) (or (forall ((v_prenex_28 (_ FloatingPoint 11 53)) (v_prenex_27 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_17 (_ FloatingPoint 11 53)) (v_prenex_25 (_ FloatingPoint 11 53))) (let ((.cse11 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse8 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (.cse10 (fp.mul c_currentRoundingMode .cse11 c_ULTIMATE.start_main_~B2~0))) (let ((.cse6 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_17) (fp.mul c_currentRoundingMode v_prenex_28 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_prenex_27 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse11 c_ULTIMATE.start_main_~B1~0)) .cse10)) (.cse7 (fp.neg .cse8)) (.cse9 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_prenex_28 (_ +zero 11 53))) (not (fp.geq .cse6 .cse7)) (not (fp.leq .cse6 .cse8)) (not (fp.geq v_prenex_27 (_ +zero 11 53))) (not (fp.leq v_prenex_25 .cse9)) (not (fp.geq v_ULTIMATE.start_main_~E~0_17 (_ +zero 11 53))) (not (fp.leq v_prenex_28 .cse9)) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_25) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_17 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_prenex_28 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse6 c_ULTIMATE.start_main_~B1~0)) .cse10) .cse7) (not (fp.leq v_ULTIMATE.start_main_~E~0_17 .cse9)) (not (fp.leq v_prenex_27 .cse9)) (not (fp.geq v_prenex_25 (_ +zero 11 53)))))))) .cse5))) is different from true [2020-11-30 00:06:57,886 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-11-30 00:06:57,887 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 00:06:57,887 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 00:06:59,993 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_26 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B2~0 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_16 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_18 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse1 (fp.mul c_currentRoundingMode .cse4 ULTIMATE.start_main_~B2~0))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_26) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_18 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse4 c_ULTIMATE.start_main_~B1~0)) .cse1)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_ULTIMATE.start_main_~E~0_16 (_ +zero 11 53))) (not (fp.leq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (fp.leq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_16) (fp.mul c_currentRoundingMode v_prenex_26 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_18 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~B1~0)) .cse1) .cse2) (not (fp.leq ULTIMATE.start_main_~E0~0 .cse3)) (not (fp.geq v_prenex_26 (_ +zero 11 53))) (not (fp.leq v_ULTIMATE.start_main_~E~0_18 .cse3)) (not (fp.leq .cse0 .cse2)) (not (fp.geq v_ULTIMATE.start_main_~E~0_18 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.geq .cse0 (fp.neg .cse2))) (not (fp.leq v_prenex_26 .cse3)) (not (fp.leq v_ULTIMATE.start_main_~E~0_16 .cse3))))))) (forall ((v_prenex_28 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B2~0 (_ FloatingPoint 11 53)) (v_prenex_27 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_17 (_ FloatingPoint 11 53)) (v_prenex_25 (_ FloatingPoint 11 53))) (let ((.cse10 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse7 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (.cse9 (fp.mul c_currentRoundingMode .cse10 ULTIMATE.start_main_~B2~0))) (let ((.cse5 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_17) (fp.mul c_currentRoundingMode v_prenex_28 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_prenex_27 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse10 c_ULTIMATE.start_main_~B1~0)) .cse9)) (.cse6 (fp.neg .cse7)) (.cse8 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq .cse5 .cse6)) (not (fp.leq .cse5 .cse7)) (not (fp.leq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.geq v_prenex_27 (_ +zero 11 53))) (not (fp.leq v_prenex_27 .cse8)) (not (fp.geq v_prenex_25 (_ +zero 11 53))) (not (fp.geq v_prenex_28 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.leq v_prenex_25 .cse8)) (not (fp.geq v_ULTIMATE.start_main_~E~0_17 (_ +zero 11 53))) (not (fp.leq v_prenex_28 .cse8)) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_25) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_17 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_prenex_28 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse5 c_ULTIMATE.start_main_~B1~0)) .cse9) .cse6) (not (fp.leq v_ULTIMATE.start_main_~E~0_17 .cse8)))))))) is different from false [2020-11-30 00:07:02,914 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_26 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B2~0 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_16 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_18 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse1 (fp.mul c_currentRoundingMode .cse4 ULTIMATE.start_main_~B2~0))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_26) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_18 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse4 c_ULTIMATE.start_main_~B1~0)) .cse1)) (.cse2 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_ULTIMATE.start_main_~E~0_16 (_ +zero 11 53))) (not (fp.leq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (fp.leq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_16) (fp.mul c_currentRoundingMode v_prenex_26 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_18 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~B1~0)) .cse1) .cse2) (not (fp.leq ULTIMATE.start_main_~E0~0 .cse3)) (not (fp.geq v_prenex_26 (_ +zero 11 53))) (not (fp.leq v_ULTIMATE.start_main_~E~0_18 .cse3)) (not (fp.leq .cse0 .cse2)) (not (fp.geq v_ULTIMATE.start_main_~E~0_18 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.geq .cse0 (fp.neg .cse2))) (not (fp.leq v_prenex_26 .cse3)) (not (fp.leq v_ULTIMATE.start_main_~E~0_16 .cse3))))))) (forall ((v_prenex_28 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B2~0 (_ FloatingPoint 11 53)) (v_prenex_27 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_17 (_ FloatingPoint 11 53)) (v_prenex_25 (_ FloatingPoint 11 53))) (let ((.cse10 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse7 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (.cse9 (fp.mul c_currentRoundingMode .cse10 ULTIMATE.start_main_~B2~0))) (let ((.cse5 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_17) (fp.mul c_currentRoundingMode v_prenex_28 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_prenex_27 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse10 c_ULTIMATE.start_main_~B1~0)) .cse9)) (.cse6 (fp.neg .cse7)) (.cse8 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq .cse5 .cse6)) (not (fp.leq .cse5 .cse7)) (not (fp.leq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.geq v_prenex_27 (_ +zero 11 53))) (not (fp.leq v_prenex_27 .cse8)) (not (fp.geq v_prenex_25 (_ +zero 11 53))) (not (fp.geq v_prenex_28 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.leq v_prenex_25 .cse8)) (not (fp.geq v_ULTIMATE.start_main_~E~0_17 (_ +zero 11 53))) (not (fp.leq v_prenex_28 .cse8)) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_25) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_17 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_prenex_28 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse5 c_ULTIMATE.start_main_~B1~0)) .cse9) .cse6) (not (fp.leq v_ULTIMATE.start_main_~E~0_17 .cse8)))))))) is different from true [2020-11-30 00:07:05,849 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse6 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond))) (and (or (forall ((v_prenex_28 (_ FloatingPoint 11 53)) (v_prenex_29 (_ FloatingPoint 11 53)) (v_prenex_27 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_17 (_ FloatingPoint 11 53)) (v_prenex_25 (_ FloatingPoint 11 53))) (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (.cse2 (fp.mul c_currentRoundingMode .cse5 v_prenex_29))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_17) (fp.mul c_currentRoundingMode v_prenex_28 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_prenex_27 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse5 c_ULTIMATE.start_main_~B1~0)) .cse2)) (.cse3 (fp.neg .cse1)) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_prenex_27 (_ +zero 11 53))) (not (fp.leq .cse0 .cse1)) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_25) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_17 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_prenex_28 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse0 c_ULTIMATE.start_main_~B1~0)) .cse2) .cse3) (not (fp.geq .cse0 .cse3)) (not (fp.leq v_prenex_27 .cse4)) (not (fp.geq v_prenex_25 (_ +zero 11 53))) (not (fp.geq v_prenex_28 (_ +zero 11 53))) (not (fp.leq v_prenex_25 .cse4)) (not (fp.geq v_ULTIMATE.start_main_~E~0_17 (_ +zero 11 53))) (not (fp.leq v_prenex_29 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.geq v_prenex_29 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.leq v_prenex_28 .cse4)) (not (fp.leq v_ULTIMATE.start_main_~E~0_17 .cse4))))))) .cse6) (or (forall ((v_prenex_26 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B2~0 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_16 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_18 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse11 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse8 (fp.mul c_currentRoundingMode .cse11 ULTIMATE.start_main_~B2~0))) (let ((.cse7 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_26) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_18 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse11 c_ULTIMATE.start_main_~B1~0)) .cse8)) (.cse9 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (.cse10 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_ULTIMATE.start_main_~E~0_16 (_ +zero 11 53))) (not (fp.leq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (fp.leq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_16) (fp.mul c_currentRoundingMode v_prenex_26 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_18 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse7 c_ULTIMATE.start_main_~B1~0)) .cse8) .cse9) (not (fp.leq ULTIMATE.start_main_~E0~0 .cse10)) (not (fp.geq v_prenex_26 (_ +zero 11 53))) (not (fp.leq v_ULTIMATE.start_main_~E~0_18 .cse10)) (not (fp.leq .cse7 .cse9)) (not (fp.geq v_ULTIMATE.start_main_~E~0_18 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.geq .cse7 (fp.neg .cse9))) (not (fp.leq v_prenex_26 .cse10)) (not (fp.leq v_ULTIMATE.start_main_~E~0_16 .cse10))))))) .cse6))) is different from true [2020-11-30 00:07:05,852 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-11-30 00:07:05,852 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 00:07:05,853 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 00:07:08,041 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_28 (_ FloatingPoint 11 53)) (v_prenex_29 (_ FloatingPoint 11 53)) (v_prenex_27 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B1~0 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_17 (_ FloatingPoint 11 53)) (v_prenex_25 (_ FloatingPoint 11 53))) (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (.cse2 (fp.mul c_currentRoundingMode .cse5 v_prenex_29))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_17) (fp.mul c_currentRoundingMode v_prenex_28 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_prenex_27 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse5 ULTIMATE.start_main_~B1~0)) .cse2)) (.cse3 (fp.neg .cse1)) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_prenex_27 (_ +zero 11 53))) (not (fp.leq .cse0 .cse1)) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_25) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_17 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_prenex_28 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse0 ULTIMATE.start_main_~B1~0)) .cse2) .cse3) (not (fp.geq .cse0 .cse3)) (not (fp.leq v_prenex_27 .cse4)) (not (fp.geq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.geq v_prenex_25 (_ +zero 11 53))) (not (fp.geq v_prenex_28 (_ +zero 11 53))) (not (fp.leq v_prenex_25 .cse4)) (not (fp.geq v_ULTIMATE.start_main_~E~0_17 (_ +zero 11 53))) (not (fp.leq v_prenex_29 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.geq v_prenex_29 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.leq v_prenex_28 .cse4)) (not (fp.leq v_ULTIMATE.start_main_~E~0_17 .cse4)) (not (fp.leq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0))))))))) (forall ((v_prenex_26 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B2~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B1~0 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_16 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_18 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse10 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse7 (fp.mul c_currentRoundingMode .cse10 ULTIMATE.start_main_~B2~0))) (let ((.cse6 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_26) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_18 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse10 ULTIMATE.start_main_~B1~0)) .cse7)) (.cse8 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (.cse9 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_ULTIMATE.start_main_~E~0_16 (_ +zero 11 53))) (not (fp.leq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (fp.leq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_16) (fp.mul c_currentRoundingMode v_prenex_26 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_18 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse6 ULTIMATE.start_main_~B1~0)) .cse7) .cse8) (not (fp.leq ULTIMATE.start_main_~E0~0 .cse9)) (not (fp.geq v_prenex_26 (_ +zero 11 53))) (not (fp.leq v_ULTIMATE.start_main_~E~0_18 .cse9)) (not (fp.leq .cse6 .cse8)) (not (fp.geq v_ULTIMATE.start_main_~E~0_18 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.geq .cse6 (fp.neg .cse8))) (not (fp.leq v_prenex_26 .cse9)) (not (fp.leq v_ULTIMATE.start_main_~E~0_16 .cse9)) (not (fp.leq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0)))))))))) is different from false [2020-11-30 00:07:11,001 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_28 (_ FloatingPoint 11 53)) (v_prenex_29 (_ FloatingPoint 11 53)) (v_prenex_27 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B1~0 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_17 (_ FloatingPoint 11 53)) (v_prenex_25 (_ FloatingPoint 11 53))) (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (.cse2 (fp.mul c_currentRoundingMode .cse5 v_prenex_29))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_17) (fp.mul c_currentRoundingMode v_prenex_28 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_prenex_27 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse5 ULTIMATE.start_main_~B1~0)) .cse2)) (.cse3 (fp.neg .cse1)) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_prenex_27 (_ +zero 11 53))) (not (fp.leq .cse0 .cse1)) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_25) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_17 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_prenex_28 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse0 ULTIMATE.start_main_~B1~0)) .cse2) .cse3) (not (fp.geq .cse0 .cse3)) (not (fp.leq v_prenex_27 .cse4)) (not (fp.geq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.geq v_prenex_25 (_ +zero 11 53))) (not (fp.geq v_prenex_28 (_ +zero 11 53))) (not (fp.leq v_prenex_25 .cse4)) (not (fp.geq v_ULTIMATE.start_main_~E~0_17 (_ +zero 11 53))) (not (fp.leq v_prenex_29 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.geq v_prenex_29 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.leq v_prenex_28 .cse4)) (not (fp.leq v_ULTIMATE.start_main_~E~0_17 .cse4)) (not (fp.leq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0))))))))) (forall ((v_prenex_26 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B2~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B1~0 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_16 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_18 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse10 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse7 (fp.mul c_currentRoundingMode .cse10 ULTIMATE.start_main_~B2~0))) (let ((.cse6 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_26) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_18 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse10 ULTIMATE.start_main_~B1~0)) .cse7)) (.cse8 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (.cse9 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_ULTIMATE.start_main_~E~0_16 (_ +zero 11 53))) (not (fp.leq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (fp.leq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_16) (fp.mul c_currentRoundingMode v_prenex_26 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_18 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse6 ULTIMATE.start_main_~B1~0)) .cse7) .cse8) (not (fp.leq ULTIMATE.start_main_~E0~0 .cse9)) (not (fp.geq v_prenex_26 (_ +zero 11 53))) (not (fp.leq v_ULTIMATE.start_main_~E~0_18 .cse9)) (not (fp.leq .cse6 .cse8)) (not (fp.geq v_ULTIMATE.start_main_~E~0_18 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.geq .cse6 (fp.neg .cse8))) (not (fp.leq v_prenex_26 .cse9)) (not (fp.leq v_ULTIMATE.start_main_~E~0_16 .cse9)) (not (fp.leq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0)))))))))) is different from true [2020-11-30 00:07:13,987 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse6 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond))) (and (or (forall ((v_prenex_28 (_ FloatingPoint 11 53)) (v_prenex_29 (_ FloatingPoint 11 53)) (v_prenex_27 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_17 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B1~0 (_ FloatingPoint 11 53)) (v_prenex_25 (_ FloatingPoint 11 53))) (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (.cse2 (fp.mul c_currentRoundingMode .cse5 v_prenex_29))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_17) (fp.mul c_currentRoundingMode v_prenex_28 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_prenex_27 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse5 ULTIMATE.start_main_~B1~0)) .cse2)) (.cse3 (fp.neg .cse1)) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_prenex_27 (_ +zero 11 53))) (not (fp.leq .cse0 .cse1)) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_25) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_17 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_prenex_28 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse0 ULTIMATE.start_main_~B1~0)) .cse2) .cse3) (not (fp.geq .cse0 .cse3)) (not (fp.leq v_prenex_27 .cse4)) (not (fp.geq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.geq v_prenex_25 (_ +zero 11 53))) (not (fp.geq v_prenex_28 (_ +zero 11 53))) (not (fp.leq v_prenex_25 .cse4)) (not (fp.geq v_ULTIMATE.start_main_~E~0_17 (_ +zero 11 53))) (not (fp.leq v_prenex_29 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.geq v_prenex_29 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.leq v_prenex_28 .cse4)) (not (fp.leq v_ULTIMATE.start_main_~E~0_17 .cse4)) (not (fp.leq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0))))))))) .cse6) (or .cse6 (forall ((v_prenex_26 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B2~0 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_16 (_ FloatingPoint 11 53)) (v_prenex_30 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_18 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse11 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse9 (fp.mul c_currentRoundingMode .cse11 ULTIMATE.start_main_~B2~0))) (let ((.cse8 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_26) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_18 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse11 v_prenex_30)) .cse9)) (.cse10 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (.cse7 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_ULTIMATE.start_main_~E~0_16 (_ +zero 11 53))) (not (fp.leq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.geq v_prenex_30 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.leq ULTIMATE.start_main_~E0~0 .cse7)) (not (fp.geq v_prenex_26 (_ +zero 11 53))) (not (fp.leq v_ULTIMATE.start_main_~E~0_18 .cse7)) (fp.leq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_16) (fp.mul c_currentRoundingMode v_prenex_26 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_18 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse8 v_prenex_30)) .cse9) .cse10) (not (fp.leq .cse8 .cse10)) (not (fp.geq v_ULTIMATE.start_main_~E~0_18 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.leq v_prenex_26 .cse7)) (not (fp.geq .cse8 (fp.neg .cse10))) (not (fp.leq v_ULTIMATE.start_main_~E~0_16 .cse7)) (not (fp.leq v_prenex_30 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0)))))))))))) is different from true [2020-11-30 00:07:13,990 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-11-30 00:07:13,990 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 00:07:13,994 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 00:07:16,319 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((ULTIMATE.start_main_~A3~0 (_ FloatingPoint 11 53)) (v_prenex_26 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B2~0 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_16 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_18 (_ FloatingPoint 11 53)) (v_prenex_30 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse4 ULTIMATE.start_main_~B2~0))) (let ((.cse1 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_26) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_18 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode ULTIMATE.start_main_~E0~0 ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse4 v_prenex_30)) .cse2)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_ULTIMATE.start_main_~E~0_16 (_ +zero 11 53))) (not (fp.leq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.geq v_prenex_30 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.leq ULTIMATE.start_main_~E0~0 .cse0)) (not (fp.geq v_prenex_26 (_ +zero 11 53))) (not (fp.leq v_ULTIMATE.start_main_~E~0_18 .cse0)) (fp.leq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_16) (fp.mul c_currentRoundingMode v_prenex_26 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_18 ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse1 v_prenex_30)) .cse2) .cse3) (not (fp.leq .cse1 .cse3)) (not (fp.geq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0)))) (not (fp.geq v_ULTIMATE.start_main_~E~0_18 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.leq v_prenex_26 .cse0)) (not (fp.geq .cse1 (fp.neg .cse3))) (not (fp.leq v_ULTIMATE.start_main_~E~0_16 .cse0)) (not (fp.leq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0)))) (not (fp.leq v_prenex_30 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0))))))))) (forall ((v_prenex_28 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~A3~0 (_ FloatingPoint 11 53)) (v_prenex_29 (_ FloatingPoint 11 53)) (v_prenex_27 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_17 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B1~0 (_ FloatingPoint 11 53)) (v_prenex_25 (_ FloatingPoint 11 53))) (let ((.cse10 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse6 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (.cse7 (fp.mul c_currentRoundingMode .cse10 v_prenex_29))) (let ((.cse5 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_17) (fp.mul c_currentRoundingMode v_prenex_28 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_prenex_27 ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse10 ULTIMATE.start_main_~B1~0)) .cse7)) (.cse8 (fp.neg .cse6)) (.cse9 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_prenex_27 (_ +zero 11 53))) (not (fp.leq .cse5 .cse6)) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_25) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_17 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_prenex_28 ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse5 ULTIMATE.start_main_~B1~0)) .cse7) .cse8) (not (fp.geq .cse5 .cse8)) (not (fp.geq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0)))) (not (fp.leq v_prenex_27 .cse9)) (not (fp.geq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.geq v_prenex_25 (_ +zero 11 53))) (not (fp.geq v_prenex_28 (_ +zero 11 53))) (not (fp.leq v_prenex_25 .cse9)) (not (fp.geq v_ULTIMATE.start_main_~E~0_17 (_ +zero 11 53))) (not (fp.leq v_prenex_29 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.geq v_prenex_29 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.leq v_prenex_28 .cse9)) (not (fp.leq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0)))) (not (fp.leq v_ULTIMATE.start_main_~E~0_17 .cse9)) (not (fp.leq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0)))))))))) is different from false [2020-11-30 00:07:19,233 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((ULTIMATE.start_main_~A3~0 (_ FloatingPoint 11 53)) (v_prenex_26 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B2~0 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_16 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_18 (_ FloatingPoint 11 53)) (v_prenex_30 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse4 ULTIMATE.start_main_~B2~0))) (let ((.cse1 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_26) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_18 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode ULTIMATE.start_main_~E0~0 ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse4 v_prenex_30)) .cse2)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_ULTIMATE.start_main_~E~0_16 (_ +zero 11 53))) (not (fp.leq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.geq v_prenex_30 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.leq ULTIMATE.start_main_~E0~0 .cse0)) (not (fp.geq v_prenex_26 (_ +zero 11 53))) (not (fp.leq v_ULTIMATE.start_main_~E~0_18 .cse0)) (fp.leq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_16) (fp.mul c_currentRoundingMode v_prenex_26 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_18 ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse1 v_prenex_30)) .cse2) .cse3) (not (fp.leq .cse1 .cse3)) (not (fp.geq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0)))) (not (fp.geq v_ULTIMATE.start_main_~E~0_18 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.leq v_prenex_26 .cse0)) (not (fp.geq .cse1 (fp.neg .cse3))) (not (fp.leq v_ULTIMATE.start_main_~E~0_16 .cse0)) (not (fp.leq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0)))) (not (fp.leq v_prenex_30 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0))))))))) (forall ((v_prenex_28 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~A3~0 (_ FloatingPoint 11 53)) (v_prenex_29 (_ FloatingPoint 11 53)) (v_prenex_27 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_17 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B1~0 (_ FloatingPoint 11 53)) (v_prenex_25 (_ FloatingPoint 11 53))) (let ((.cse10 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse6 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (.cse7 (fp.mul c_currentRoundingMode .cse10 v_prenex_29))) (let ((.cse5 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_17) (fp.mul c_currentRoundingMode v_prenex_28 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_prenex_27 ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse10 ULTIMATE.start_main_~B1~0)) .cse7)) (.cse8 (fp.neg .cse6)) (.cse9 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_prenex_27 (_ +zero 11 53))) (not (fp.leq .cse5 .cse6)) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_25) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_17 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_prenex_28 ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse5 ULTIMATE.start_main_~B1~0)) .cse7) .cse8) (not (fp.geq .cse5 .cse8)) (not (fp.geq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0)))) (not (fp.leq v_prenex_27 .cse9)) (not (fp.geq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.geq v_prenex_25 (_ +zero 11 53))) (not (fp.geq v_prenex_28 (_ +zero 11 53))) (not (fp.leq v_prenex_25 .cse9)) (not (fp.geq v_ULTIMATE.start_main_~E~0_17 (_ +zero 11 53))) (not (fp.leq v_prenex_29 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.geq v_prenex_29 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.leq v_prenex_28 .cse9)) (not (fp.leq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0)))) (not (fp.leq v_ULTIMATE.start_main_~E~0_17 .cse9)) (not (fp.leq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0)))))))))) is different from true [2020-11-30 00:07:22,427 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse6 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond))) (and (or (forall ((v_prenex_28 (_ FloatingPoint 11 53)) (v_prenex_29 (_ FloatingPoint 11 53)) (v_prenex_27 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B1~0 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_17 (_ FloatingPoint 11 53)) (v_prenex_25 (_ FloatingPoint 11 53)) (v_prenex_31 (_ FloatingPoint 11 53))) (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (.cse3 (fp.mul c_currentRoundingMode .cse5 v_prenex_29))) (let ((.cse1 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_17) (fp.mul c_currentRoundingMode v_prenex_28 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_prenex_27 v_prenex_31)) (fp.mul c_currentRoundingMode .cse5 ULTIMATE.start_main_~B1~0)) .cse3)) (.cse4 (fp.neg .cse2)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_prenex_27 (_ +zero 11 53))) (not (fp.leq v_prenex_27 .cse0)) (not (fp.geq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.geq v_prenex_25 (_ +zero 11 53))) (not (fp.geq v_prenex_31 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0)))) (not (fp.geq v_prenex_28 (_ +zero 11 53))) (not (fp.leq .cse1 .cse2)) (not (fp.leq v_prenex_25 .cse0)) (not (fp.geq v_ULTIMATE.start_main_~E~0_17 (_ +zero 11 53))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_25) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_17 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_prenex_28 v_prenex_31)) (fp.mul c_currentRoundingMode .cse1 ULTIMATE.start_main_~B1~0)) .cse3) .cse4) (not (fp.leq v_prenex_29 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.geq v_prenex_29 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.leq v_prenex_28 .cse0)) (not (fp.geq .cse1 .cse4)) (not (fp.leq v_prenex_31 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0)))) (not (fp.leq v_ULTIMATE.start_main_~E~0_17 .cse0)) (not (fp.leq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0))))))))) .cse6) (or (forall ((ULTIMATE.start_main_~A3~0 (_ FloatingPoint 11 53)) (v_prenex_26 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B2~0 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_16 (_ FloatingPoint 11 53)) (v_prenex_30 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_18 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse11 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse9 (fp.mul c_currentRoundingMode .cse11 ULTIMATE.start_main_~B2~0))) (let ((.cse8 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_26) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_18 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode ULTIMATE.start_main_~E0~0 ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse11 v_prenex_30)) .cse9)) (.cse10 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (.cse7 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_ULTIMATE.start_main_~E~0_16 (_ +zero 11 53))) (not (fp.leq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.geq v_prenex_30 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.leq ULTIMATE.start_main_~E0~0 .cse7)) (not (fp.geq v_prenex_26 (_ +zero 11 53))) (not (fp.leq v_ULTIMATE.start_main_~E~0_18 .cse7)) (fp.leq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_16) (fp.mul c_currentRoundingMode v_prenex_26 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_18 ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse8 v_prenex_30)) .cse9) .cse10) (not (fp.leq .cse8 .cse10)) (not (fp.geq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0)))) (not (fp.geq v_ULTIMATE.start_main_~E~0_18 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.leq v_prenex_26 .cse7)) (not (fp.geq .cse8 (fp.neg .cse10))) (not (fp.leq v_ULTIMATE.start_main_~E~0_16 .cse7)) (not (fp.leq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0)))) (not (fp.leq v_prenex_30 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0))))))))) .cse6))) is different from true [2020-11-30 00:07:22,430 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-11-30 00:07:22,430 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 00:07:22,431 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 00:07:24,966 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((ULTIMATE.start_main_~A3~0 (_ FloatingPoint 11 53)) (v_prenex_26 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~A2~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B2~0 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_16 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_18 (_ FloatingPoint 11 53)) (v_prenex_30 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse4 ULTIMATE.start_main_~B2~0))) (let ((.cse1 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_26) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_18 ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode ULTIMATE.start_main_~E0~0 ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse4 v_prenex_30)) .cse2)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_ULTIMATE.start_main_~E~0_16 (_ +zero 11 53))) (not (fp.leq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.geq v_prenex_30 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.leq ULTIMATE.start_main_~E0~0 .cse0)) (not (fp.geq v_prenex_26 (_ +zero 11 53))) (not (fp.leq v_ULTIMATE.start_main_~E~0_18 .cse0)) (fp.leq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_16) (fp.mul c_currentRoundingMode v_prenex_26 ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_18 ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse1 v_prenex_30)) .cse2) .cse3) (not (fp.leq .cse1 .cse3)) (not (fp.geq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0)))) (not (fp.geq v_ULTIMATE.start_main_~E~0_18 (_ +zero 11 53))) (not (fp.leq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0))))) (not (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.geq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0))))) (not (fp.leq v_prenex_26 .cse0)) (not (fp.geq .cse1 (fp.neg .cse3))) (not (fp.leq v_ULTIMATE.start_main_~E~0_16 .cse0)) (not (fp.leq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0)))) (not (fp.leq v_prenex_30 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0))))))))) (forall ((v_prenex_28 (_ FloatingPoint 11 53)) (v_prenex_29 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~A2~0 (_ FloatingPoint 11 53)) (v_prenex_27 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_17 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B1~0 (_ FloatingPoint 11 53)) (v_prenex_25 (_ FloatingPoint 11 53)) (v_prenex_31 (_ FloatingPoint 11 53))) (let ((.cse10 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse7 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (.cse8 (fp.mul c_currentRoundingMode .cse10 v_prenex_29))) (let ((.cse6 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_17) (fp.mul c_currentRoundingMode v_prenex_28 ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_prenex_27 v_prenex_31)) (fp.mul c_currentRoundingMode .cse10 ULTIMATE.start_main_~B1~0)) .cse8)) (.cse9 (fp.neg .cse7)) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_prenex_27 (_ +zero 11 53))) (not (fp.leq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0))))) (not (fp.leq v_prenex_27 .cse5)) (not (fp.geq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.geq v_prenex_25 (_ +zero 11 53))) (not (fp.geq v_prenex_31 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0)))) (not (fp.geq v_prenex_28 (_ +zero 11 53))) (not (fp.leq .cse6 .cse7)) (not (fp.leq v_prenex_25 .cse5)) (not (fp.geq v_ULTIMATE.start_main_~E~0_17 (_ +zero 11 53))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_25) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_17 ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_prenex_28 v_prenex_31)) (fp.mul c_currentRoundingMode .cse6 ULTIMATE.start_main_~B1~0)) .cse8) .cse9) (not (fp.leq v_prenex_29 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.geq v_prenex_29 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.leq v_prenex_28 .cse5)) (not (fp.geq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0))))) (not (fp.geq .cse6 .cse9)) (not (fp.leq v_prenex_31 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0)))) (not (fp.leq v_ULTIMATE.start_main_~E~0_17 .cse5)) (not (fp.leq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0)))))))))) is different from false [2020-11-30 00:07:27,700 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((ULTIMATE.start_main_~A3~0 (_ FloatingPoint 11 53)) (v_prenex_26 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~A2~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B2~0 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_16 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_18 (_ FloatingPoint 11 53)) (v_prenex_30 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse4 ULTIMATE.start_main_~B2~0))) (let ((.cse1 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_26) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_18 ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode ULTIMATE.start_main_~E0~0 ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse4 v_prenex_30)) .cse2)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_ULTIMATE.start_main_~E~0_16 (_ +zero 11 53))) (not (fp.leq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.geq v_prenex_30 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.leq ULTIMATE.start_main_~E0~0 .cse0)) (not (fp.geq v_prenex_26 (_ +zero 11 53))) (not (fp.leq v_ULTIMATE.start_main_~E~0_18 .cse0)) (fp.leq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_16) (fp.mul c_currentRoundingMode v_prenex_26 ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_18 ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse1 v_prenex_30)) .cse2) .cse3) (not (fp.leq .cse1 .cse3)) (not (fp.geq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0)))) (not (fp.geq v_ULTIMATE.start_main_~E~0_18 (_ +zero 11 53))) (not (fp.leq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0))))) (not (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.geq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0))))) (not (fp.leq v_prenex_26 .cse0)) (not (fp.geq .cse1 (fp.neg .cse3))) (not (fp.leq v_ULTIMATE.start_main_~E~0_16 .cse0)) (not (fp.leq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0)))) (not (fp.leq v_prenex_30 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0))))))))) (forall ((v_prenex_28 (_ FloatingPoint 11 53)) (v_prenex_29 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~A2~0 (_ FloatingPoint 11 53)) (v_prenex_27 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_17 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B1~0 (_ FloatingPoint 11 53)) (v_prenex_25 (_ FloatingPoint 11 53)) (v_prenex_31 (_ FloatingPoint 11 53))) (let ((.cse10 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse7 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (.cse8 (fp.mul c_currentRoundingMode .cse10 v_prenex_29))) (let ((.cse6 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_17) (fp.mul c_currentRoundingMode v_prenex_28 ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_prenex_27 v_prenex_31)) (fp.mul c_currentRoundingMode .cse10 ULTIMATE.start_main_~B1~0)) .cse8)) (.cse9 (fp.neg .cse7)) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_prenex_27 (_ +zero 11 53))) (not (fp.leq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0))))) (not (fp.leq v_prenex_27 .cse5)) (not (fp.geq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.geq v_prenex_25 (_ +zero 11 53))) (not (fp.geq v_prenex_31 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0)))) (not (fp.geq v_prenex_28 (_ +zero 11 53))) (not (fp.leq .cse6 .cse7)) (not (fp.leq v_prenex_25 .cse5)) (not (fp.geq v_ULTIMATE.start_main_~E~0_17 (_ +zero 11 53))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_25) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_17 ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_prenex_28 v_prenex_31)) (fp.mul c_currentRoundingMode .cse6 ULTIMATE.start_main_~B1~0)) .cse8) .cse9) (not (fp.leq v_prenex_29 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.geq v_prenex_29 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.leq v_prenex_28 .cse5)) (not (fp.geq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0))))) (not (fp.geq .cse6 .cse9)) (not (fp.leq v_prenex_31 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0)))) (not (fp.leq v_ULTIMATE.start_main_~E~0_17 .cse5)) (not (fp.leq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0)))))))))) is different from true [2020-11-30 00:07:30,800 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse5 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond))) (and (or (forall ((ULTIMATE.start_main_~A3~0 (_ FloatingPoint 11 53)) (v_prenex_26 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~A2~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B2~0 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_16 (_ FloatingPoint 11 53)) (v_prenex_30 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_18 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse4 ULTIMATE.start_main_~B2~0))) (let ((.cse1 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_26) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_18 ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode ULTIMATE.start_main_~E0~0 ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse4 v_prenex_30)) .cse2)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_ULTIMATE.start_main_~E~0_16 (_ +zero 11 53))) (not (fp.leq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.geq v_prenex_30 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.leq ULTIMATE.start_main_~E0~0 .cse0)) (not (fp.geq v_prenex_26 (_ +zero 11 53))) (not (fp.leq v_ULTIMATE.start_main_~E~0_18 .cse0)) (fp.leq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_16) (fp.mul c_currentRoundingMode v_prenex_26 ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_18 ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse1 v_prenex_30)) .cse2) .cse3) (not (fp.leq .cse1 .cse3)) (not (fp.geq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0)))) (not (fp.geq v_ULTIMATE.start_main_~E~0_18 (_ +zero 11 53))) (not (fp.leq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0))))) (not (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.geq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0))))) (not (fp.leq v_prenex_26 .cse0)) (not (fp.geq .cse1 (fp.neg .cse3))) (not (fp.leq v_ULTIMATE.start_main_~E~0_16 .cse0)) (not (fp.leq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0)))) (not (fp.leq v_prenex_30 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0))))))))) .cse5) (or (forall ((v_prenex_28 (_ FloatingPoint 11 53)) (v_prenex_29 (_ FloatingPoint 11 53)) (v_prenex_27 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_17 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B1~0 (_ FloatingPoint 11 53)) (v_prenex_25 (_ FloatingPoint 11 53)) (v_prenex_31 (_ FloatingPoint 11 53)) (v_prenex_32 (_ FloatingPoint 11 53))) (let ((.cse11 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse9 (fp.mul c_currentRoundingMode .cse11 v_prenex_29)) (.cse10 ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (let ((.cse7 (fp.neg .cse10)) (.cse6 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_17) (fp.mul c_currentRoundingMode v_prenex_28 v_prenex_32)) (fp.mul c_currentRoundingMode v_prenex_27 v_prenex_31)) (fp.mul c_currentRoundingMode .cse11 ULTIMATE.start_main_~B1~0)) .cse9)) (.cse8 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_prenex_27 (_ +zero 11 53))) (not (fp.geq .cse6 .cse7)) (not (fp.leq v_prenex_27 .cse8)) (not (fp.geq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.geq v_prenex_25 (_ +zero 11 53))) (not (fp.geq v_prenex_31 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0)))) (not (fp.leq v_prenex_32 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0))))) (not (fp.geq v_prenex_28 (_ +zero 11 53))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_25) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_17 v_prenex_32)) (fp.mul c_currentRoundingMode v_prenex_28 v_prenex_31)) (fp.mul c_currentRoundingMode .cse6 ULTIMATE.start_main_~B1~0)) .cse9) .cse7) (not (fp.leq v_prenex_25 .cse8)) (not (fp.geq v_ULTIMATE.start_main_~E~0_17 (_ +zero 11 53))) (not (fp.leq v_prenex_29 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.geq v_prenex_29 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.leq v_prenex_28 .cse8)) (not (fp.leq .cse6 .cse10)) (not (fp.leq v_prenex_31 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0)))) (not (fp.geq v_prenex_32 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0))))) (not (fp.leq v_ULTIMATE.start_main_~E~0_17 .cse8)) (not (fp.leq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0))))))))) .cse5))) is different from true [2020-11-30 00:07:30,803 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-11-30 00:07:30,803 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-30 00:07:30,804 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-30 00:07:33,758 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((ULTIMATE.start_main_~A3~0 (_ FloatingPoint 11 53)) (v_prenex_26 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~A2~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B2~0 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_16 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~A1~0_8 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_18 (_ FloatingPoint 11 53)) (v_prenex_30 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse6 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse5 (fp.mul c_currentRoundingMode .cse6 ULTIMATE.start_main_~B2~0))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse2 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~A1~0_8 v_prenex_26) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_18 ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode ULTIMATE.start_main_~E0~0 ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse6 v_prenex_30)) .cse5)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0)))) (or (not (fp.geq v_ULTIMATE.start_main_~E~0_16 (_ +zero 11 53))) (not (fp.leq ULTIMATE.start_main_~B2~0 (fp.neg .cse0))) (not (fp.geq v_prenex_30 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.leq ULTIMATE.start_main_~E0~0 .cse1)) (not (fp.geq v_prenex_26 (_ +zero 11 53))) (not (fp.leq v_ULTIMATE.start_main_~E~0_18 .cse1)) (not (fp.geq v_ULTIMATE.start_main_~A1~0_8 .cse0)) (not (fp.geq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0)))) (not (fp.geq v_ULTIMATE.start_main_~E~0_18 (_ +zero 11 53))) (not (fp.leq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0))))) (not (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53))) (not (fp.leq .cse2 .cse3)) (not (fp.geq ULTIMATE.start_main_~B2~0 (fp.neg .cse4))) (not (fp.geq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0))))) (not (fp.leq v_prenex_26 .cse1)) (not (fp.leq v_ULTIMATE.start_main_~E~0_16 .cse1)) (fp.leq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~A1~0_8 v_ULTIMATE.start_main_~E~0_16) (fp.mul c_currentRoundingMode v_prenex_26 ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_18 ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse2 v_prenex_30)) .cse5) .cse3) (not (fp.leq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0)))) (not (fp.geq .cse2 (fp.neg .cse3))) (not (fp.leq v_ULTIMATE.start_main_~A1~0_8 .cse4)) (not (fp.leq v_prenex_30 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0))))))))) (forall ((v_prenex_28 (_ FloatingPoint 11 53)) (v_prenex_29 (_ FloatingPoint 11 53)) (v_prenex_27 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_17 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B1~0 (_ FloatingPoint 11 53)) (v_prenex_25 (_ FloatingPoint 11 53)) (v_prenex_31 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~A1~0_8 (_ FloatingPoint 11 53)) (v_prenex_32 (_ FloatingPoint 11 53))) (let ((.cse14 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse12 (fp.mul c_currentRoundingMode .cse14 v_prenex_29)) (.cse13 ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (let ((.cse9 ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))) (.cse8 (fp.neg .cse13)) (.cse10 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse11 ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))) (.cse7 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~A1~0_8 v_ULTIMATE.start_main_~E~0_17) (fp.mul c_currentRoundingMode v_prenex_28 v_prenex_32)) (fp.mul c_currentRoundingMode v_prenex_27 v_prenex_31)) (fp.mul c_currentRoundingMode .cse14 ULTIMATE.start_main_~B1~0)) .cse12))) (or (not (fp.geq v_prenex_27 (_ +zero 11 53))) (not (fp.geq .cse7 .cse8)) (not (fp.geq v_ULTIMATE.start_main_~A1~0_8 .cse9)) (not (fp.leq v_prenex_27 .cse10)) (not (fp.geq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.geq v_prenex_25 (_ +zero 11 53))) (not (fp.geq v_prenex_31 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0)))) (not (fp.leq v_prenex_32 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0))))) (not (fp.geq v_prenex_28 (_ +zero 11 53))) (not (fp.leq v_prenex_25 .cse10)) (not (fp.geq v_ULTIMATE.start_main_~E~0_17 (_ +zero 11 53))) (not (fp.leq v_prenex_29 (fp.neg .cse9))) (not (fp.geq v_prenex_29 (fp.neg .cse11))) (not (fp.leq v_prenex_28 .cse10)) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~A1~0_8 v_prenex_25) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_17 v_prenex_32)) (fp.mul c_currentRoundingMode v_prenex_28 v_prenex_31)) (fp.mul c_currentRoundingMode .cse7 ULTIMATE.start_main_~B1~0)) .cse12) .cse8) (not (fp.leq v_prenex_31 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0)))) (not (fp.geq v_prenex_32 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0))))) (not (fp.leq v_ULTIMATE.start_main_~E~0_17 .cse10)) (not (fp.leq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0)))) (not (fp.leq v_ULTIMATE.start_main_~A1~0_8 .cse11)) (not (fp.leq .cse7 .cse13)))))))) is different from false [2020-11-30 00:07:36,664 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((ULTIMATE.start_main_~A3~0 (_ FloatingPoint 11 53)) (v_prenex_26 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~A2~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B2~0 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_16 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~A1~0_8 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_18 (_ FloatingPoint 11 53)) (v_prenex_30 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse6 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse5 (fp.mul c_currentRoundingMode .cse6 ULTIMATE.start_main_~B2~0))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse2 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~A1~0_8 v_prenex_26) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_18 ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode ULTIMATE.start_main_~E0~0 ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse6 v_prenex_30)) .cse5)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0)))) (or (not (fp.geq v_ULTIMATE.start_main_~E~0_16 (_ +zero 11 53))) (not (fp.leq ULTIMATE.start_main_~B2~0 (fp.neg .cse0))) (not (fp.geq v_prenex_30 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.leq ULTIMATE.start_main_~E0~0 .cse1)) (not (fp.geq v_prenex_26 (_ +zero 11 53))) (not (fp.leq v_ULTIMATE.start_main_~E~0_18 .cse1)) (not (fp.geq v_ULTIMATE.start_main_~A1~0_8 .cse0)) (not (fp.geq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0)))) (not (fp.geq v_ULTIMATE.start_main_~E~0_18 (_ +zero 11 53))) (not (fp.leq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0))))) (not (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53))) (not (fp.leq .cse2 .cse3)) (not (fp.geq ULTIMATE.start_main_~B2~0 (fp.neg .cse4))) (not (fp.geq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0))))) (not (fp.leq v_prenex_26 .cse1)) (not (fp.leq v_ULTIMATE.start_main_~E~0_16 .cse1)) (fp.leq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~A1~0_8 v_ULTIMATE.start_main_~E~0_16) (fp.mul c_currentRoundingMode v_prenex_26 ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_18 ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse2 v_prenex_30)) .cse5) .cse3) (not (fp.leq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0)))) (not (fp.geq .cse2 (fp.neg .cse3))) (not (fp.leq v_ULTIMATE.start_main_~A1~0_8 .cse4)) (not (fp.leq v_prenex_30 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0))))))))) (forall ((v_prenex_28 (_ FloatingPoint 11 53)) (v_prenex_29 (_ FloatingPoint 11 53)) (v_prenex_27 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_17 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B1~0 (_ FloatingPoint 11 53)) (v_prenex_25 (_ FloatingPoint 11 53)) (v_prenex_31 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~A1~0_8 (_ FloatingPoint 11 53)) (v_prenex_32 (_ FloatingPoint 11 53))) (let ((.cse14 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse12 (fp.mul c_currentRoundingMode .cse14 v_prenex_29)) (.cse13 ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (let ((.cse9 ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))) (.cse8 (fp.neg .cse13)) (.cse10 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse11 ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))) (.cse7 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~A1~0_8 v_ULTIMATE.start_main_~E~0_17) (fp.mul c_currentRoundingMode v_prenex_28 v_prenex_32)) (fp.mul c_currentRoundingMode v_prenex_27 v_prenex_31)) (fp.mul c_currentRoundingMode .cse14 ULTIMATE.start_main_~B1~0)) .cse12))) (or (not (fp.geq v_prenex_27 (_ +zero 11 53))) (not (fp.geq .cse7 .cse8)) (not (fp.geq v_ULTIMATE.start_main_~A1~0_8 .cse9)) (not (fp.leq v_prenex_27 .cse10)) (not (fp.geq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.geq v_prenex_25 (_ +zero 11 53))) (not (fp.geq v_prenex_31 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0)))) (not (fp.leq v_prenex_32 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0))))) (not (fp.geq v_prenex_28 (_ +zero 11 53))) (not (fp.leq v_prenex_25 .cse10)) (not (fp.geq v_ULTIMATE.start_main_~E~0_17 (_ +zero 11 53))) (not (fp.leq v_prenex_29 (fp.neg .cse9))) (not (fp.geq v_prenex_29 (fp.neg .cse11))) (not (fp.leq v_prenex_28 .cse10)) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~A1~0_8 v_prenex_25) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_17 v_prenex_32)) (fp.mul c_currentRoundingMode v_prenex_28 v_prenex_31)) (fp.mul c_currentRoundingMode .cse7 ULTIMATE.start_main_~B1~0)) .cse12) .cse8) (not (fp.leq v_prenex_31 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0)))) (not (fp.geq v_prenex_32 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0))))) (not (fp.leq v_ULTIMATE.start_main_~E~0_17 .cse10)) (not (fp.leq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0)))) (not (fp.leq v_ULTIMATE.start_main_~A1~0_8 .cse11)) (not (fp.leq .cse7 .cse13)))))))) is different from true [2020-11-30 00:07:36,693 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2020-11-30 00:07:36,694 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [728085816] [2020-11-30 00:07:36,694 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:07:36,694 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 49 [2020-11-30 00:07:36,694 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137933646] [2020-11-30 00:07:36,695 INFO L461 AbstractCegarLoop]: Interpolant automaton has 50 states [2020-11-30 00:07:36,695 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-30 00:07:36,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2020-11-30 00:07:36,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=320, Unknown=39, NotChecked=1914, Total=2450 [2020-11-30 00:07:36,697 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 50 states. [2020-11-30 00:07:39,131 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((ULTIMATE.start_main_~A3~0 (_ FloatingPoint 11 53)) (v_prenex_26 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~A2~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B2~0 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_16 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~A1~0_8 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_18 (_ FloatingPoint 11 53)) (v_prenex_30 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse6 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse5 (fp.mul c_currentRoundingMode .cse6 ULTIMATE.start_main_~B2~0))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse2 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~A1~0_8 v_prenex_26) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_18 ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode ULTIMATE.start_main_~E0~0 ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse6 v_prenex_30)) .cse5)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0)))) (or (not (fp.geq v_ULTIMATE.start_main_~E~0_16 (_ +zero 11 53))) (not (fp.leq ULTIMATE.start_main_~B2~0 (fp.neg .cse0))) (not (fp.geq v_prenex_30 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.leq ULTIMATE.start_main_~E0~0 .cse1)) (not (fp.geq v_prenex_26 (_ +zero 11 53))) (not (fp.leq v_ULTIMATE.start_main_~E~0_18 .cse1)) (not (fp.geq v_ULTIMATE.start_main_~A1~0_8 .cse0)) (not (fp.geq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0)))) (not (fp.geq v_ULTIMATE.start_main_~E~0_18 (_ +zero 11 53))) (not (fp.leq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0))))) (not (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53))) (not (fp.leq .cse2 .cse3)) (not (fp.geq ULTIMATE.start_main_~B2~0 (fp.neg .cse4))) (not (fp.geq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0))))) (not (fp.leq v_prenex_26 .cse1)) (not (fp.leq v_ULTIMATE.start_main_~E~0_16 .cse1)) (fp.leq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~A1~0_8 v_ULTIMATE.start_main_~E~0_16) (fp.mul c_currentRoundingMode v_prenex_26 ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_18 ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse2 v_prenex_30)) .cse5) .cse3) (not (fp.leq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0)))) (not (fp.geq .cse2 (fp.neg .cse3))) (not (fp.leq v_ULTIMATE.start_main_~A1~0_8 .cse4)) (not (fp.leq v_prenex_30 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0))))))))) (= c_currentRoundingMode roundNearestTiesToEven) (forall ((v_prenex_28 (_ FloatingPoint 11 53)) (v_prenex_29 (_ FloatingPoint 11 53)) (v_prenex_27 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_17 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B1~0 (_ FloatingPoint 11 53)) (v_prenex_25 (_ FloatingPoint 11 53)) (v_prenex_31 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~A1~0_8 (_ FloatingPoint 11 53)) (v_prenex_32 (_ FloatingPoint 11 53))) (let ((.cse14 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse12 (fp.mul c_currentRoundingMode .cse14 v_prenex_29)) (.cse13 ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (let ((.cse9 ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))) (.cse8 (fp.neg .cse13)) (.cse10 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse11 ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))) (.cse7 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~A1~0_8 v_ULTIMATE.start_main_~E~0_17) (fp.mul c_currentRoundingMode v_prenex_28 v_prenex_32)) (fp.mul c_currentRoundingMode v_prenex_27 v_prenex_31)) (fp.mul c_currentRoundingMode .cse14 ULTIMATE.start_main_~B1~0)) .cse12))) (or (not (fp.geq v_prenex_27 (_ +zero 11 53))) (not (fp.geq .cse7 .cse8)) (not (fp.geq v_ULTIMATE.start_main_~A1~0_8 .cse9)) (not (fp.leq v_prenex_27 .cse10)) (not (fp.geq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.geq v_prenex_25 (_ +zero 11 53))) (not (fp.geq v_prenex_31 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0)))) (not (fp.leq v_prenex_32 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0))))) (not (fp.geq v_prenex_28 (_ +zero 11 53))) (not (fp.leq v_prenex_25 .cse10)) (not (fp.geq v_ULTIMATE.start_main_~E~0_17 (_ +zero 11 53))) (not (fp.leq v_prenex_29 (fp.neg .cse9))) (not (fp.geq v_prenex_29 (fp.neg .cse11))) (not (fp.leq v_prenex_28 .cse10)) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~A1~0_8 v_prenex_25) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_17 v_prenex_32)) (fp.mul c_currentRoundingMode v_prenex_28 v_prenex_31)) (fp.mul c_currentRoundingMode .cse7 ULTIMATE.start_main_~B1~0)) .cse12) .cse8) (not (fp.leq v_prenex_31 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0)))) (not (fp.geq v_prenex_32 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0))))) (not (fp.leq v_ULTIMATE.start_main_~E~0_17 .cse10)) (not (fp.leq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0)))) (not (fp.leq v_ULTIMATE.start_main_~A1~0_8 .cse11)) (not (fp.leq .cse7 .cse13)))))))) is different from false [2020-11-30 00:07:42,687 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((ULTIMATE.start_main_~A3~0 (_ FloatingPoint 11 53)) (v_prenex_26 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~A2~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B2~0 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_16 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~A1~0_8 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_18 (_ FloatingPoint 11 53)) (v_prenex_30 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse6 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse5 (fp.mul c_currentRoundingMode .cse6 ULTIMATE.start_main_~B2~0))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse2 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~A1~0_8 v_prenex_26) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_18 ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode ULTIMATE.start_main_~E0~0 ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse6 v_prenex_30)) .cse5)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0)))) (or (not (fp.geq v_ULTIMATE.start_main_~E~0_16 (_ +zero 11 53))) (not (fp.leq ULTIMATE.start_main_~B2~0 (fp.neg .cse0))) (not (fp.geq v_prenex_30 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.leq ULTIMATE.start_main_~E0~0 .cse1)) (not (fp.geq v_prenex_26 (_ +zero 11 53))) (not (fp.leq v_ULTIMATE.start_main_~E~0_18 .cse1)) (not (fp.geq v_ULTIMATE.start_main_~A1~0_8 .cse0)) (not (fp.geq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0)))) (not (fp.geq v_ULTIMATE.start_main_~E~0_18 (_ +zero 11 53))) (not (fp.leq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0))))) (not (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53))) (not (fp.leq .cse2 .cse3)) (not (fp.geq ULTIMATE.start_main_~B2~0 (fp.neg .cse4))) (not (fp.geq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0))))) (not (fp.leq v_prenex_26 .cse1)) (not (fp.leq v_ULTIMATE.start_main_~E~0_16 .cse1)) (fp.leq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~A1~0_8 v_ULTIMATE.start_main_~E~0_16) (fp.mul c_currentRoundingMode v_prenex_26 ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_18 ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse2 v_prenex_30)) .cse5) .cse3) (not (fp.leq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0)))) (not (fp.geq .cse2 (fp.neg .cse3))) (not (fp.leq v_ULTIMATE.start_main_~A1~0_8 .cse4)) (not (fp.leq v_prenex_30 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0))))))))) (= c_currentRoundingMode roundNearestTiesToEven) (forall ((v_prenex_28 (_ FloatingPoint 11 53)) (v_prenex_29 (_ FloatingPoint 11 53)) (v_prenex_27 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_17 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B1~0 (_ FloatingPoint 11 53)) (v_prenex_25 (_ FloatingPoint 11 53)) (v_prenex_31 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~A1~0_8 (_ FloatingPoint 11 53)) (v_prenex_32 (_ FloatingPoint 11 53))) (let ((.cse14 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse12 (fp.mul c_currentRoundingMode .cse14 v_prenex_29)) (.cse13 ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (let ((.cse9 ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))) (.cse8 (fp.neg .cse13)) (.cse10 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse11 ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))) (.cse7 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~A1~0_8 v_ULTIMATE.start_main_~E~0_17) (fp.mul c_currentRoundingMode v_prenex_28 v_prenex_32)) (fp.mul c_currentRoundingMode v_prenex_27 v_prenex_31)) (fp.mul c_currentRoundingMode .cse14 ULTIMATE.start_main_~B1~0)) .cse12))) (or (not (fp.geq v_prenex_27 (_ +zero 11 53))) (not (fp.geq .cse7 .cse8)) (not (fp.geq v_ULTIMATE.start_main_~A1~0_8 .cse9)) (not (fp.leq v_prenex_27 .cse10)) (not (fp.geq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.geq v_prenex_25 (_ +zero 11 53))) (not (fp.geq v_prenex_31 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0)))) (not (fp.leq v_prenex_32 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0))))) (not (fp.geq v_prenex_28 (_ +zero 11 53))) (not (fp.leq v_prenex_25 .cse10)) (not (fp.geq v_ULTIMATE.start_main_~E~0_17 (_ +zero 11 53))) (not (fp.leq v_prenex_29 (fp.neg .cse9))) (not (fp.geq v_prenex_29 (fp.neg .cse11))) (not (fp.leq v_prenex_28 .cse10)) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~A1~0_8 v_prenex_25) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_17 v_prenex_32)) (fp.mul c_currentRoundingMode v_prenex_28 v_prenex_31)) (fp.mul c_currentRoundingMode .cse7 ULTIMATE.start_main_~B1~0)) .cse12) .cse8) (not (fp.leq v_prenex_31 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0)))) (not (fp.geq v_prenex_32 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0))))) (not (fp.leq v_ULTIMATE.start_main_~E~0_17 .cse10)) (not (fp.leq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0)))) (not (fp.leq v_ULTIMATE.start_main_~A1~0_8 .cse11)) (not (fp.leq .cse7 .cse13)))))))) is different from true [2020-11-30 00:07:45,025 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond))) (and (= c_currentRoundingMode roundNearestTiesToEven) (or (forall ((ULTIMATE.start_main_~A3~0 (_ FloatingPoint 11 53)) (v_prenex_26 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~A2~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B2~0 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_16 (_ FloatingPoint 11 53)) (v_prenex_30 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_18 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse4 ULTIMATE.start_main_~B2~0))) (let ((.cse1 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_26) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_18 ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode ULTIMATE.start_main_~E0~0 ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse4 v_prenex_30)) .cse2)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_ULTIMATE.start_main_~E~0_16 (_ +zero 11 53))) (not (fp.leq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.geq v_prenex_30 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.leq ULTIMATE.start_main_~E0~0 .cse0)) (not (fp.geq v_prenex_26 (_ +zero 11 53))) (not (fp.leq v_ULTIMATE.start_main_~E~0_18 .cse0)) (fp.leq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_16) (fp.mul c_currentRoundingMode v_prenex_26 ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_18 ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse1 v_prenex_30)) .cse2) .cse3) (not (fp.leq .cse1 .cse3)) (not (fp.geq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0)))) (not (fp.geq v_ULTIMATE.start_main_~E~0_18 (_ +zero 11 53))) (not (fp.leq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0))))) (not (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.geq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0))))) (not (fp.leq v_prenex_26 .cse0)) (not (fp.geq .cse1 (fp.neg .cse3))) (not (fp.leq v_ULTIMATE.start_main_~E~0_16 .cse0)) (not (fp.leq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0)))) (not (fp.leq v_prenex_30 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0))))))))) .cse5) (or (forall ((v_prenex_28 (_ FloatingPoint 11 53)) (v_prenex_29 (_ FloatingPoint 11 53)) (v_prenex_27 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_17 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B1~0 (_ FloatingPoint 11 53)) (v_prenex_25 (_ FloatingPoint 11 53)) (v_prenex_31 (_ FloatingPoint 11 53)) (v_prenex_32 (_ FloatingPoint 11 53))) (let ((.cse11 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse9 (fp.mul c_currentRoundingMode .cse11 v_prenex_29)) (.cse10 ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (let ((.cse7 (fp.neg .cse10)) (.cse6 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_17) (fp.mul c_currentRoundingMode v_prenex_28 v_prenex_32)) (fp.mul c_currentRoundingMode v_prenex_27 v_prenex_31)) (fp.mul c_currentRoundingMode .cse11 ULTIMATE.start_main_~B1~0)) .cse9)) (.cse8 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_prenex_27 (_ +zero 11 53))) (not (fp.geq .cse6 .cse7)) (not (fp.leq v_prenex_27 .cse8)) (not (fp.geq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.geq v_prenex_25 (_ +zero 11 53))) (not (fp.geq v_prenex_31 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0)))) (not (fp.leq v_prenex_32 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0))))) (not (fp.geq v_prenex_28 (_ +zero 11 53))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_25) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_17 v_prenex_32)) (fp.mul c_currentRoundingMode v_prenex_28 v_prenex_31)) (fp.mul c_currentRoundingMode .cse6 ULTIMATE.start_main_~B1~0)) .cse9) .cse7) (not (fp.leq v_prenex_25 .cse8)) (not (fp.geq v_ULTIMATE.start_main_~E~0_17 (_ +zero 11 53))) (not (fp.leq v_prenex_29 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.geq v_prenex_29 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.leq v_prenex_28 .cse8)) (not (fp.leq .cse6 .cse10)) (not (fp.leq v_prenex_31 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0)))) (not (fp.geq v_prenex_32 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0))))) (not (fp.leq v_ULTIMATE.start_main_~E~0_17 .cse8)) (not (fp.leq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0))))))))) .cse5) (let ((.cse13 (fp.leq c_ULTIMATE.start_main_~A1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0)))) (.cse12 (fp.geq c_ULTIMATE.start_main_~A1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (or (and .cse12 (= (_ bv1 32) c_ULTIMATE.start_assume_abort_if_not_~cond) .cse13) (and (or (not .cse13) (not .cse12)) .cse5))))) is different from false [2020-11-30 00:07:47,968 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse5 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond))) (and (= c_currentRoundingMode roundNearestTiesToEven) (or (forall ((ULTIMATE.start_main_~A3~0 (_ FloatingPoint 11 53)) (v_prenex_26 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~A2~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B2~0 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_16 (_ FloatingPoint 11 53)) (v_prenex_30 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_18 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse4 ULTIMATE.start_main_~B2~0))) (let ((.cse1 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_26) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_18 ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode ULTIMATE.start_main_~E0~0 ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse4 v_prenex_30)) .cse2)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_ULTIMATE.start_main_~E~0_16 (_ +zero 11 53))) (not (fp.leq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.geq v_prenex_30 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.leq ULTIMATE.start_main_~E0~0 .cse0)) (not (fp.geq v_prenex_26 (_ +zero 11 53))) (not (fp.leq v_ULTIMATE.start_main_~E~0_18 .cse0)) (fp.leq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_16) (fp.mul c_currentRoundingMode v_prenex_26 ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_18 ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse1 v_prenex_30)) .cse2) .cse3) (not (fp.leq .cse1 .cse3)) (not (fp.geq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0)))) (not (fp.geq v_ULTIMATE.start_main_~E~0_18 (_ +zero 11 53))) (not (fp.leq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0))))) (not (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.geq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0))))) (not (fp.leq v_prenex_26 .cse0)) (not (fp.geq .cse1 (fp.neg .cse3))) (not (fp.leq v_ULTIMATE.start_main_~E~0_16 .cse0)) (not (fp.leq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0)))) (not (fp.leq v_prenex_30 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0))))))))) .cse5) (or (forall ((v_prenex_28 (_ FloatingPoint 11 53)) (v_prenex_29 (_ FloatingPoint 11 53)) (v_prenex_27 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_17 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B1~0 (_ FloatingPoint 11 53)) (v_prenex_25 (_ FloatingPoint 11 53)) (v_prenex_31 (_ FloatingPoint 11 53)) (v_prenex_32 (_ FloatingPoint 11 53))) (let ((.cse11 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse9 (fp.mul c_currentRoundingMode .cse11 v_prenex_29)) (.cse10 ((_ to_fp 11 53) c_currentRoundingMode 100.0))) (let ((.cse7 (fp.neg .cse10)) (.cse6 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_17) (fp.mul c_currentRoundingMode v_prenex_28 v_prenex_32)) (fp.mul c_currentRoundingMode v_prenex_27 v_prenex_31)) (fp.mul c_currentRoundingMode .cse11 ULTIMATE.start_main_~B1~0)) .cse9)) (.cse8 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_prenex_27 (_ +zero 11 53))) (not (fp.geq .cse6 .cse7)) (not (fp.leq v_prenex_27 .cse8)) (not (fp.geq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.geq v_prenex_25 (_ +zero 11 53))) (not (fp.geq v_prenex_31 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0)))) (not (fp.leq v_prenex_32 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0))))) (not (fp.geq v_prenex_28 (_ +zero 11 53))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_25) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_17 v_prenex_32)) (fp.mul c_currentRoundingMode v_prenex_28 v_prenex_31)) (fp.mul c_currentRoundingMode .cse6 ULTIMATE.start_main_~B1~0)) .cse9) .cse7) (not (fp.leq v_prenex_25 .cse8)) (not (fp.geq v_ULTIMATE.start_main_~E~0_17 (_ +zero 11 53))) (not (fp.leq v_prenex_29 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.geq v_prenex_29 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.leq v_prenex_28 .cse8)) (not (fp.leq .cse6 .cse10)) (not (fp.leq v_prenex_31 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0)))) (not (fp.geq v_prenex_32 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0))))) (not (fp.leq v_ULTIMATE.start_main_~E~0_17 .cse8)) (not (fp.leq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0))))))))) .cse5) (let ((.cse13 (fp.leq c_ULTIMATE.start_main_~A1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0)))) (.cse12 (fp.geq c_ULTIMATE.start_main_~A1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (or (and .cse12 (= (_ bv1 32) c_ULTIMATE.start_assume_abort_if_not_~cond) .cse13) (and (or (not .cse13) (not .cse12)) .cse5))))) is different from true [2020-11-30 00:07:50,307 WARN L838 $PredicateComparison]: unable to prove that (and (fp.geq c_ULTIMATE.start_main_~A1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_ULTIMATE.start_main_~A1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))) (forall ((ULTIMATE.start_main_~A3~0 (_ FloatingPoint 11 53)) (v_prenex_26 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~A2~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B2~0 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_16 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_18 (_ FloatingPoint 11 53)) (v_prenex_30 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse4 ULTIMATE.start_main_~B2~0))) (let ((.cse1 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_26) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_18 ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode ULTIMATE.start_main_~E0~0 ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse4 v_prenex_30)) .cse2)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_ULTIMATE.start_main_~E~0_16 (_ +zero 11 53))) (not (fp.leq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.geq v_prenex_30 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.leq ULTIMATE.start_main_~E0~0 .cse0)) (not (fp.geq v_prenex_26 (_ +zero 11 53))) (not (fp.leq v_ULTIMATE.start_main_~E~0_18 .cse0)) (fp.leq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_16) (fp.mul c_currentRoundingMode v_prenex_26 ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_18 ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse1 v_prenex_30)) .cse2) .cse3) (not (fp.leq .cse1 .cse3)) (not (fp.geq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0)))) (not (fp.geq v_ULTIMATE.start_main_~E~0_18 (_ +zero 11 53))) (not (fp.leq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0))))) (not (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.geq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0))))) (not (fp.leq v_prenex_26 .cse0)) (not (fp.geq .cse1 (fp.neg .cse3))) (not (fp.leq v_ULTIMATE.start_main_~E~0_16 .cse0)) (not (fp.leq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0)))) (not (fp.leq v_prenex_30 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0))))))))) (forall ((v_prenex_28 (_ FloatingPoint 11 53)) (v_prenex_29 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~A2~0 (_ FloatingPoint 11 53)) (v_prenex_27 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_17 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B1~0 (_ FloatingPoint 11 53)) (v_prenex_25 (_ FloatingPoint 11 53)) (v_prenex_31 (_ FloatingPoint 11 53))) (let ((.cse10 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse7 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (.cse8 (fp.mul c_currentRoundingMode .cse10 v_prenex_29))) (let ((.cse6 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_17) (fp.mul c_currentRoundingMode v_prenex_28 ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_prenex_27 v_prenex_31)) (fp.mul c_currentRoundingMode .cse10 ULTIMATE.start_main_~B1~0)) .cse8)) (.cse9 (fp.neg .cse7)) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_prenex_27 (_ +zero 11 53))) (not (fp.leq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0))))) (not (fp.leq v_prenex_27 .cse5)) (not (fp.geq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.geq v_prenex_25 (_ +zero 11 53))) (not (fp.geq v_prenex_31 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0)))) (not (fp.geq v_prenex_28 (_ +zero 11 53))) (not (fp.leq .cse6 .cse7)) (not (fp.leq v_prenex_25 .cse5)) (not (fp.geq v_ULTIMATE.start_main_~E~0_17 (_ +zero 11 53))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_25) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_17 ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_prenex_28 v_prenex_31)) (fp.mul c_currentRoundingMode .cse6 ULTIMATE.start_main_~B1~0)) .cse8) .cse9) (not (fp.leq v_prenex_29 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.geq v_prenex_29 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.leq v_prenex_28 .cse5)) (not (fp.geq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0))))) (not (fp.geq .cse6 .cse9)) (not (fp.leq v_prenex_31 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0)))) (not (fp.leq v_ULTIMATE.start_main_~E~0_17 .cse5)) (not (fp.leq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0)))))))))) is different from false [2020-11-30 00:07:53,257 WARN L860 $PredicateComparison]: unable to prove that (and (fp.geq c_ULTIMATE.start_main_~A1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_ULTIMATE.start_main_~A1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))) (forall ((ULTIMATE.start_main_~A3~0 (_ FloatingPoint 11 53)) (v_prenex_26 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~A2~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B2~0 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_16 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_18 (_ FloatingPoint 11 53)) (v_prenex_30 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse4 ULTIMATE.start_main_~B2~0))) (let ((.cse1 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_26) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_18 ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode ULTIMATE.start_main_~E0~0 ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse4 v_prenex_30)) .cse2)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_ULTIMATE.start_main_~E~0_16 (_ +zero 11 53))) (not (fp.leq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.geq v_prenex_30 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.leq ULTIMATE.start_main_~E0~0 .cse0)) (not (fp.geq v_prenex_26 (_ +zero 11 53))) (not (fp.leq v_ULTIMATE.start_main_~E~0_18 .cse0)) (fp.leq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_16) (fp.mul c_currentRoundingMode v_prenex_26 ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_18 ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse1 v_prenex_30)) .cse2) .cse3) (not (fp.leq .cse1 .cse3)) (not (fp.geq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0)))) (not (fp.geq v_ULTIMATE.start_main_~E~0_18 (_ +zero 11 53))) (not (fp.leq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0))))) (not (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.geq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0))))) (not (fp.leq v_prenex_26 .cse0)) (not (fp.geq .cse1 (fp.neg .cse3))) (not (fp.leq v_ULTIMATE.start_main_~E~0_16 .cse0)) (not (fp.leq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0)))) (not (fp.leq v_prenex_30 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0))))))))) (forall ((v_prenex_28 (_ FloatingPoint 11 53)) (v_prenex_29 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~A2~0 (_ FloatingPoint 11 53)) (v_prenex_27 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_17 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B1~0 (_ FloatingPoint 11 53)) (v_prenex_25 (_ FloatingPoint 11 53)) (v_prenex_31 (_ FloatingPoint 11 53))) (let ((.cse10 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse7 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (.cse8 (fp.mul c_currentRoundingMode .cse10 v_prenex_29))) (let ((.cse6 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_17) (fp.mul c_currentRoundingMode v_prenex_28 ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_prenex_27 v_prenex_31)) (fp.mul c_currentRoundingMode .cse10 ULTIMATE.start_main_~B1~0)) .cse8)) (.cse9 (fp.neg .cse7)) (.cse5 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_prenex_27 (_ +zero 11 53))) (not (fp.leq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0))))) (not (fp.leq v_prenex_27 .cse5)) (not (fp.geq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.geq v_prenex_25 (_ +zero 11 53))) (not (fp.geq v_prenex_31 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0)))) (not (fp.geq v_prenex_28 (_ +zero 11 53))) (not (fp.leq .cse6 .cse7)) (not (fp.leq v_prenex_25 .cse5)) (not (fp.geq v_ULTIMATE.start_main_~E~0_17 (_ +zero 11 53))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_25) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_17 ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_prenex_28 v_prenex_31)) (fp.mul c_currentRoundingMode .cse6 ULTIMATE.start_main_~B1~0)) .cse8) .cse9) (not (fp.leq v_prenex_29 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.geq v_prenex_29 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.leq v_prenex_28 .cse5)) (not (fp.geq ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0))))) (not (fp.geq .cse6 .cse9)) (not (fp.leq v_prenex_31 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0)))) (not (fp.leq v_ULTIMATE.start_main_~E~0_17 .cse5)) (not (fp.leq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0)))))))))) is different from true [2020-11-30 00:07:55,539 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond))) (and (fp.geq c_ULTIMATE.start_main_~A1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))) (or (forall ((v_prenex_28 (_ FloatingPoint 11 53)) (v_prenex_29 (_ FloatingPoint 11 53)) (v_prenex_27 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B1~0 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_17 (_ FloatingPoint 11 53)) (v_prenex_25 (_ FloatingPoint 11 53)) (v_prenex_31 (_ FloatingPoint 11 53))) (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (.cse3 (fp.mul c_currentRoundingMode .cse5 v_prenex_29))) (let ((.cse1 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_17) (fp.mul c_currentRoundingMode v_prenex_28 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_prenex_27 v_prenex_31)) (fp.mul c_currentRoundingMode .cse5 ULTIMATE.start_main_~B1~0)) .cse3)) (.cse4 (fp.neg .cse2)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_prenex_27 (_ +zero 11 53))) (not (fp.leq v_prenex_27 .cse0)) (not (fp.geq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.geq v_prenex_25 (_ +zero 11 53))) (not (fp.geq v_prenex_31 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0)))) (not (fp.geq v_prenex_28 (_ +zero 11 53))) (not (fp.leq .cse1 .cse2)) (not (fp.leq v_prenex_25 .cse0)) (not (fp.geq v_ULTIMATE.start_main_~E~0_17 (_ +zero 11 53))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_25) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_17 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_prenex_28 v_prenex_31)) (fp.mul c_currentRoundingMode .cse1 ULTIMATE.start_main_~B1~0)) .cse3) .cse4) (not (fp.leq v_prenex_29 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.geq v_prenex_29 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.leq v_prenex_28 .cse0)) (not (fp.geq .cse1 .cse4)) (not (fp.leq v_prenex_31 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0)))) (not (fp.leq v_ULTIMATE.start_main_~E~0_17 .cse0)) (not (fp.leq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0))))))))) .cse6) (or (forall ((ULTIMATE.start_main_~A3~0 (_ FloatingPoint 11 53)) (v_prenex_26 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B2~0 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_16 (_ FloatingPoint 11 53)) (v_prenex_30 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_18 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse11 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse9 (fp.mul c_currentRoundingMode .cse11 ULTIMATE.start_main_~B2~0))) (let ((.cse8 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_26) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_18 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode ULTIMATE.start_main_~E0~0 ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse11 v_prenex_30)) .cse9)) (.cse10 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (.cse7 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_ULTIMATE.start_main_~E~0_16 (_ +zero 11 53))) (not (fp.leq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.geq v_prenex_30 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.leq ULTIMATE.start_main_~E0~0 .cse7)) (not (fp.geq v_prenex_26 (_ +zero 11 53))) (not (fp.leq v_ULTIMATE.start_main_~E~0_18 .cse7)) (fp.leq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_16) (fp.mul c_currentRoundingMode v_prenex_26 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_18 ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse8 v_prenex_30)) .cse9) .cse10) (not (fp.leq .cse8 .cse10)) (not (fp.geq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0)))) (not (fp.geq v_ULTIMATE.start_main_~E~0_18 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.leq v_prenex_26 .cse7)) (not (fp.geq .cse8 (fp.neg .cse10))) (not (fp.leq v_ULTIMATE.start_main_~E~0_16 .cse7)) (not (fp.leq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0)))) (not (fp.leq v_prenex_30 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0))))))))) .cse6) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_ULTIMATE.start_main_~A1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))) (let ((.cse12 (fp.geq c_ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0))))) (.cse13 (fp.leq c_ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0)))))) (or (and .cse12 (= (_ bv1 32) c_ULTIMATE.start_assume_abort_if_not_~cond) .cse13) (and (or (not .cse12) (not .cse13)) .cse6))))) is different from false [2020-11-30 00:07:58,442 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse6 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond))) (and (fp.geq c_ULTIMATE.start_main_~A1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))) (or (forall ((v_prenex_28 (_ FloatingPoint 11 53)) (v_prenex_29 (_ FloatingPoint 11 53)) (v_prenex_27 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B1~0 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_17 (_ FloatingPoint 11 53)) (v_prenex_25 (_ FloatingPoint 11 53)) (v_prenex_31 (_ FloatingPoint 11 53))) (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (.cse3 (fp.mul c_currentRoundingMode .cse5 v_prenex_29))) (let ((.cse1 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_17) (fp.mul c_currentRoundingMode v_prenex_28 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_prenex_27 v_prenex_31)) (fp.mul c_currentRoundingMode .cse5 ULTIMATE.start_main_~B1~0)) .cse3)) (.cse4 (fp.neg .cse2)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_prenex_27 (_ +zero 11 53))) (not (fp.leq v_prenex_27 .cse0)) (not (fp.geq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.geq v_prenex_25 (_ +zero 11 53))) (not (fp.geq v_prenex_31 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0)))) (not (fp.geq v_prenex_28 (_ +zero 11 53))) (not (fp.leq .cse1 .cse2)) (not (fp.leq v_prenex_25 .cse0)) (not (fp.geq v_ULTIMATE.start_main_~E~0_17 (_ +zero 11 53))) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_25) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_17 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_prenex_28 v_prenex_31)) (fp.mul c_currentRoundingMode .cse1 ULTIMATE.start_main_~B1~0)) .cse3) .cse4) (not (fp.leq v_prenex_29 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.geq v_prenex_29 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.leq v_prenex_28 .cse0)) (not (fp.geq .cse1 .cse4)) (not (fp.leq v_prenex_31 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0)))) (not (fp.leq v_ULTIMATE.start_main_~E~0_17 .cse0)) (not (fp.leq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0))))))))) .cse6) (or (forall ((ULTIMATE.start_main_~A3~0 (_ FloatingPoint 11 53)) (v_prenex_26 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B2~0 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_16 (_ FloatingPoint 11 53)) (v_prenex_30 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_18 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse11 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse9 (fp.mul c_currentRoundingMode .cse11 ULTIMATE.start_main_~B2~0))) (let ((.cse8 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_26) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_18 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode ULTIMATE.start_main_~E0~0 ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse11 v_prenex_30)) .cse9)) (.cse10 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (.cse7 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_ULTIMATE.start_main_~E~0_16 (_ +zero 11 53))) (not (fp.leq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.geq v_prenex_30 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.leq ULTIMATE.start_main_~E0~0 .cse7)) (not (fp.geq v_prenex_26 (_ +zero 11 53))) (not (fp.leq v_ULTIMATE.start_main_~E~0_18 .cse7)) (fp.leq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_16) (fp.mul c_currentRoundingMode v_prenex_26 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_18 ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse8 v_prenex_30)) .cse9) .cse10) (not (fp.leq .cse8 .cse10)) (not (fp.geq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0)))) (not (fp.geq v_ULTIMATE.start_main_~E~0_18 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.leq v_prenex_26 .cse7)) (not (fp.geq .cse8 (fp.neg .cse10))) (not (fp.leq v_ULTIMATE.start_main_~E~0_16 .cse7)) (not (fp.leq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0)))) (not (fp.leq v_prenex_30 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0))))))))) .cse6) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_ULTIMATE.start_main_~A1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))) (let ((.cse12 (fp.geq c_ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0))))) (.cse13 (fp.leq c_ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0)))))) (or (and .cse12 (= (_ bv1 32) c_ULTIMATE.start_assume_abort_if_not_~cond) .cse13) (and (or (not .cse12) (not .cse13)) .cse6))))) is different from true [2020-11-30 00:08:00,750 WARN L838 $PredicateComparison]: unable to prove that (and (fp.geq c_ULTIMATE.start_main_~A1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))) (forall ((ULTIMATE.start_main_~A3~0 (_ FloatingPoint 11 53)) (v_prenex_26 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B2~0 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_16 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_18 (_ FloatingPoint 11 53)) (v_prenex_30 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse4 ULTIMATE.start_main_~B2~0))) (let ((.cse1 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_26) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_18 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode ULTIMATE.start_main_~E0~0 ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse4 v_prenex_30)) .cse2)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_ULTIMATE.start_main_~E~0_16 (_ +zero 11 53))) (not (fp.leq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.geq v_prenex_30 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.leq ULTIMATE.start_main_~E0~0 .cse0)) (not (fp.geq v_prenex_26 (_ +zero 11 53))) (not (fp.leq v_ULTIMATE.start_main_~E~0_18 .cse0)) (fp.leq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_16) (fp.mul c_currentRoundingMode v_prenex_26 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_18 ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse1 v_prenex_30)) .cse2) .cse3) (not (fp.leq .cse1 .cse3)) (not (fp.geq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0)))) (not (fp.geq v_ULTIMATE.start_main_~E~0_18 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.leq v_prenex_26 .cse0)) (not (fp.geq .cse1 (fp.neg .cse3))) (not (fp.leq v_ULTIMATE.start_main_~E~0_16 .cse0)) (not (fp.leq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0)))) (not (fp.leq v_prenex_30 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0))))))))) (fp.geq c_ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0)))) (forall ((v_prenex_28 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~A3~0 (_ FloatingPoint 11 53)) (v_prenex_29 (_ FloatingPoint 11 53)) (v_prenex_27 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_17 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B1~0 (_ FloatingPoint 11 53)) (v_prenex_25 (_ FloatingPoint 11 53))) (let ((.cse10 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse6 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (.cse7 (fp.mul c_currentRoundingMode .cse10 v_prenex_29))) (let ((.cse5 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_17) (fp.mul c_currentRoundingMode v_prenex_28 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_prenex_27 ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse10 ULTIMATE.start_main_~B1~0)) .cse7)) (.cse8 (fp.neg .cse6)) (.cse9 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_prenex_27 (_ +zero 11 53))) (not (fp.leq .cse5 .cse6)) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_25) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_17 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_prenex_28 ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse5 ULTIMATE.start_main_~B1~0)) .cse7) .cse8) (not (fp.geq .cse5 .cse8)) (not (fp.geq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0)))) (not (fp.leq v_prenex_27 .cse9)) (not (fp.geq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.geq v_prenex_25 (_ +zero 11 53))) (not (fp.geq v_prenex_28 (_ +zero 11 53))) (not (fp.leq v_prenex_25 .cse9)) (not (fp.geq v_ULTIMATE.start_main_~E~0_17 (_ +zero 11 53))) (not (fp.leq v_prenex_29 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.geq v_prenex_29 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.leq v_prenex_28 .cse9)) (not (fp.leq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0)))) (not (fp.leq v_ULTIMATE.start_main_~E~0_17 .cse9)) (not (fp.leq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0))))))))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_ULTIMATE.start_main_~A1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))) (fp.leq c_ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0))))) is different from false [2020-11-30 00:08:03,687 WARN L860 $PredicateComparison]: unable to prove that (and (fp.geq c_ULTIMATE.start_main_~A1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))) (forall ((ULTIMATE.start_main_~A3~0 (_ FloatingPoint 11 53)) (v_prenex_26 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B2~0 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_16 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_18 (_ FloatingPoint 11 53)) (v_prenex_30 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse4 ULTIMATE.start_main_~B2~0))) (let ((.cse1 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_26) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_18 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode ULTIMATE.start_main_~E0~0 ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse4 v_prenex_30)) .cse2)) (.cse3 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_ULTIMATE.start_main_~E~0_16 (_ +zero 11 53))) (not (fp.leq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.geq v_prenex_30 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.leq ULTIMATE.start_main_~E0~0 .cse0)) (not (fp.geq v_prenex_26 (_ +zero 11 53))) (not (fp.leq v_ULTIMATE.start_main_~E~0_18 .cse0)) (fp.leq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_16) (fp.mul c_currentRoundingMode v_prenex_26 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_18 ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse1 v_prenex_30)) .cse2) .cse3) (not (fp.leq .cse1 .cse3)) (not (fp.geq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0)))) (not (fp.geq v_ULTIMATE.start_main_~E~0_18 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.leq v_prenex_26 .cse0)) (not (fp.geq .cse1 (fp.neg .cse3))) (not (fp.leq v_ULTIMATE.start_main_~E~0_16 .cse0)) (not (fp.leq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0)))) (not (fp.leq v_prenex_30 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0))))))))) (fp.geq c_ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0)))) (forall ((v_prenex_28 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~A3~0 (_ FloatingPoint 11 53)) (v_prenex_29 (_ FloatingPoint 11 53)) (v_prenex_27 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_17 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B1~0 (_ FloatingPoint 11 53)) (v_prenex_25 (_ FloatingPoint 11 53))) (let ((.cse10 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse6 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (.cse7 (fp.mul c_currentRoundingMode .cse10 v_prenex_29))) (let ((.cse5 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_17) (fp.mul c_currentRoundingMode v_prenex_28 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_prenex_27 ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse10 ULTIMATE.start_main_~B1~0)) .cse7)) (.cse8 (fp.neg .cse6)) (.cse9 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_prenex_27 (_ +zero 11 53))) (not (fp.leq .cse5 .cse6)) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_25) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_17 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_prenex_28 ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse5 ULTIMATE.start_main_~B1~0)) .cse7) .cse8) (not (fp.geq .cse5 .cse8)) (not (fp.geq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0)))) (not (fp.leq v_prenex_27 .cse9)) (not (fp.geq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.geq v_prenex_25 (_ +zero 11 53))) (not (fp.geq v_prenex_28 (_ +zero 11 53))) (not (fp.leq v_prenex_25 .cse9)) (not (fp.geq v_ULTIMATE.start_main_~E~0_17 (_ +zero 11 53))) (not (fp.leq v_prenex_29 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.geq v_prenex_29 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.leq v_prenex_28 .cse9)) (not (fp.leq ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0)))) (not (fp.leq v_ULTIMATE.start_main_~E~0_17 .cse9)) (not (fp.leq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0))))))))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_ULTIMATE.start_main_~A1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))) (fp.leq c_ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0))))) is different from true [2020-11-30 00:08:06,561 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse6 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond))) (and (fp.geq c_ULTIMATE.start_main_~A1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))) (or (forall ((v_prenex_28 (_ FloatingPoint 11 53)) (v_prenex_29 (_ FloatingPoint 11 53)) (v_prenex_27 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_17 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B1~0 (_ FloatingPoint 11 53)) (v_prenex_25 (_ FloatingPoint 11 53))) (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (.cse2 (fp.mul c_currentRoundingMode .cse5 v_prenex_29))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_17) (fp.mul c_currentRoundingMode v_prenex_28 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_prenex_27 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse5 ULTIMATE.start_main_~B1~0)) .cse2)) (.cse3 (fp.neg .cse1)) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_prenex_27 (_ +zero 11 53))) (not (fp.leq .cse0 .cse1)) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_25) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_17 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_prenex_28 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse0 ULTIMATE.start_main_~B1~0)) .cse2) .cse3) (not (fp.geq .cse0 .cse3)) (not (fp.leq v_prenex_27 .cse4)) (not (fp.geq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.geq v_prenex_25 (_ +zero 11 53))) (not (fp.geq v_prenex_28 (_ +zero 11 53))) (not (fp.leq v_prenex_25 .cse4)) (not (fp.geq v_ULTIMATE.start_main_~E~0_17 (_ +zero 11 53))) (not (fp.leq v_prenex_29 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.geq v_prenex_29 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.leq v_prenex_28 .cse4)) (not (fp.leq v_ULTIMATE.start_main_~E~0_17 .cse4)) (not (fp.leq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0))))))))) .cse6) (fp.geq c_ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0)))) (let ((.cse7 (fp.leq c_ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0)))) (.cse8 (fp.geq c_ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0))))) (or (and (or (not .cse7) (not .cse8)) .cse6) (and .cse7 .cse8 (= (_ bv1 32) c_ULTIMATE.start_assume_abort_if_not_~cond)))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_ULTIMATE.start_main_~A1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))) (or .cse6 (forall ((v_prenex_26 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B2~0 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_16 (_ FloatingPoint 11 53)) (v_prenex_30 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_18 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse13 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse11 (fp.mul c_currentRoundingMode .cse13 ULTIMATE.start_main_~B2~0))) (let ((.cse10 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_26) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_18 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse13 v_prenex_30)) .cse11)) (.cse12 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (.cse9 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_ULTIMATE.start_main_~E~0_16 (_ +zero 11 53))) (not (fp.leq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.geq v_prenex_30 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.leq ULTIMATE.start_main_~E0~0 .cse9)) (not (fp.geq v_prenex_26 (_ +zero 11 53))) (not (fp.leq v_ULTIMATE.start_main_~E~0_18 .cse9)) (fp.leq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_16) (fp.mul c_currentRoundingMode v_prenex_26 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_18 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse10 v_prenex_30)) .cse11) .cse12) (not (fp.leq .cse10 .cse12)) (not (fp.geq v_ULTIMATE.start_main_~E~0_18 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.leq v_prenex_26 .cse9)) (not (fp.geq .cse10 (fp.neg .cse12))) (not (fp.leq v_ULTIMATE.start_main_~E~0_16 .cse9)) (not (fp.leq v_prenex_30 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0)))))))))) (fp.leq c_ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0)))))) is different from true [2020-11-30 00:08:08,774 WARN L838 $PredicateComparison]: unable to prove that (and (fp.geq c_ULTIMATE.start_main_~A1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))) (fp.leq c_ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 111.0 100.0))) (fp.geq c_ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 131.0 100.0)))) (fp.geq c_ULTIMATE.start_main_~A3~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 109.0 100.0))) (= c_currentRoundingMode roundNearestTiesToEven) (fp.leq c_ULTIMATE.start_main_~A1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))) (fp.leq c_ULTIMATE.start_main_~A2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 129.0 100.0)))) (forall ((v_prenex_28 (_ FloatingPoint 11 53)) (v_prenex_29 (_ FloatingPoint 11 53)) (v_prenex_27 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B1~0 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_17 (_ FloatingPoint 11 53)) (v_prenex_25 (_ FloatingPoint 11 53))) (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (.cse2 (fp.mul c_currentRoundingMode .cse5 v_prenex_29))) (let ((.cse0 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_17) (fp.mul c_currentRoundingMode v_prenex_28 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_prenex_27 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse5 ULTIMATE.start_main_~B1~0)) .cse2)) (.cse3 (fp.neg .cse1)) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_prenex_27 (_ +zero 11 53))) (not (fp.leq .cse0 .cse1)) (fp.geq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_25) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_17 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_prenex_28 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse0 ULTIMATE.start_main_~B1~0)) .cse2) .cse3) (not (fp.geq .cse0 .cse3)) (not (fp.leq v_prenex_27 .cse4)) (not (fp.geq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.geq v_prenex_25 (_ +zero 11 53))) (not (fp.geq v_prenex_28 (_ +zero 11 53))) (not (fp.leq v_prenex_25 .cse4)) (not (fp.geq v_ULTIMATE.start_main_~E~0_17 (_ +zero 11 53))) (not (fp.leq v_prenex_29 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (not (fp.geq v_prenex_29 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.leq v_prenex_28 .cse4)) (not (fp.leq v_ULTIMATE.start_main_~E~0_17 .cse4)) (not (fp.leq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0))))))))) (forall ((v_prenex_26 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B2~0 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~B1~0 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_16 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_main_~E~0_18 (_ FloatingPoint 11 53)) (ULTIMATE.start_main_~E0~0 (_ FloatingPoint 11 53))) (let ((.cse10 ((_ to_fp 11 53) c_currentRoundingMode (_ bv0 32)))) (let ((.cse7 (fp.mul c_currentRoundingMode .cse10 ULTIMATE.start_main_~B2~0))) (let ((.cse6 (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_prenex_26) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_18 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode ULTIMATE.start_main_~E0~0 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse10 ULTIMATE.start_main_~B1~0)) .cse7)) (.cse8 ((_ to_fp 11 53) c_currentRoundingMode 100.0)) (.cse9 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (or (not (fp.geq v_ULTIMATE.start_main_~E~0_16 (_ +zero 11 53))) (not (fp.leq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 69.0 100.0))))) (fp.leq (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.mul c_currentRoundingMode c_ULTIMATE.start_main_~A1~0 v_ULTIMATE.start_main_~E~0_16) (fp.mul c_currentRoundingMode v_prenex_26 c_ULTIMATE.start_main_~A2~0)) (fp.mul c_currentRoundingMode v_ULTIMATE.start_main_~E~0_18 c_ULTIMATE.start_main_~A3~0)) (fp.mul c_currentRoundingMode .cse6 ULTIMATE.start_main_~B1~0)) .cse7) .cse8) (not (fp.leq ULTIMATE.start_main_~E0~0 .cse9)) (not (fp.geq v_prenex_26 (_ +zero 11 53))) (not (fp.leq v_ULTIMATE.start_main_~E~0_18 .cse9)) (not (fp.leq .cse6 .cse8)) (not (fp.geq v_ULTIMATE.start_main_~E~0_18 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 139.0 100.0)))) (not (fp.geq ULTIMATE.start_main_~E0~0 (_ +zero 11 53))) (not (fp.geq ULTIMATE.start_main_~B2~0 (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 71.0 100.0))))) (not (fp.geq .cse6 (fp.neg .cse8))) (not (fp.leq v_prenex_26 .cse9)) (not (fp.leq v_ULTIMATE.start_main_~E~0_16 .cse9)) (not (fp.leq ULTIMATE.start_main_~B1~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 141.0 100.0)))))))))) is different from false [2020-11-30 00:08:10,552 WARN L195 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2020-11-30 00:08:10,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-30 00:08:10,754 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-11-30 00:08:10,754 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:851) 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-11-30 00:08:10,760 INFO L168 Benchmark]: Toolchain (without parser) took 565969.98 ms. Allocated memory was 56.6 MB in the beginning and 69.2 MB in the end (delta: 12.6 MB). Free memory was 35.8 MB in the beginning and 29.0 MB in the end (delta: 6.8 MB). Peak memory consumption was 21.7 MB. Max. memory is 16.1 GB. [2020-11-30 00:08:10,760 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 56.6 MB. Free memory was 39.1 MB in the beginning and 39.1 MB in the end (delta: 44.8 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 00:08:10,761 INFO L168 Benchmark]: CACSL2BoogieTranslator took 256.80 ms. Allocated memory is still 56.6 MB. Free memory was 35.6 MB in the beginning and 24.8 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-11-30 00:08:10,763 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.22 ms. Allocated memory is still 56.6 MB. Free memory was 24.8 MB in the beginning and 23.0 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-30 00:08:10,764 INFO L168 Benchmark]: Boogie Preprocessor took 36.07 ms. Allocated memory is still 56.6 MB. Free memory was 23.0 MB in the beginning and 21.5 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 00:08:10,764 INFO L168 Benchmark]: RCFGBuilder took 2768.33 ms. Allocated memory is still 56.6 MB. Free memory was 21.5 MB in the beginning and 25.0 MB in the end (delta: -3.5 MB). Peak memory consumption was 5.7 MB. Max. memory is 16.1 GB. [2020-11-30 00:08:10,765 INFO L168 Benchmark]: TraceAbstraction took 562836.81 ms. Allocated memory was 56.6 MB in the beginning and 69.2 MB in the end (delta: 12.6 MB). Free memory was 24.6 MB in the beginning and 29.0 MB in the end (delta: -4.4 MB). Peak memory consumption was 7.7 MB. Max. memory is 16.1 GB. [2020-11-30 00:08:10,771 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.36 ms. Allocated memory is still 56.6 MB. Free memory was 39.1 MB in the beginning and 39.1 MB in the end (delta: 44.8 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 256.80 ms. Allocated memory is still 56.6 MB. Free memory was 35.6 MB in the beginning and 24.8 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 63.22 ms. Allocated memory is still 56.6 MB. Free memory was 24.8 MB in the beginning and 23.0 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 36.07 ms. Allocated memory is still 56.6 MB. Free memory was 23.0 MB in the beginning and 21.5 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 2768.33 ms. Allocated memory is still 56.6 MB. Free memory was 21.5 MB in the beginning and 25.0 MB in the end (delta: -3.5 MB). Peak memory consumption was 5.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 562836.81 ms. Allocated memory was 56.6 MB in the beginning and 69.2 MB in the end (delta: 12.6 MB). Free memory was 24.6 MB in the beginning and 29.0 MB in the end (delta: -4.4 MB). Peak memory consumption was 7.7 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...