./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/cos_polynomial.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_035e4936-ad14-4dd1-a306-cba52ada564d/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_035e4936-ad14-4dd1-a306-cba52ada564d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_035e4936-ad14-4dd1-a306-cba52ada564d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_035e4936-ad14-4dd1-a306-cba52ada564d/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/cos_polynomial.c -s /tmp/vcloud-vcloud-master/worker/run_dir_035e4936-ad14-4dd1-a306-cba52ada564d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_035e4936-ad14-4dd1-a306-cba52ada564d/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2507b56afd4c82d08388837f279920ee2254841f ............................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_035e4936-ad14-4dd1-a306-cba52ada564d/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_035e4936-ad14-4dd1-a306-cba52ada564d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_035e4936-ad14-4dd1-a306-cba52ada564d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_035e4936-ad14-4dd1-a306-cba52ada564d/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/cos_polynomial.c -s /tmp/vcloud-vcloud-master/worker/run_dir_035e4936-ad14-4dd1-a306-cba52ada564d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_035e4936-ad14-4dd1-a306-cba52ada564d/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2507b56afd4c82d08388837f279920ee2254841f ........................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 11:19:42,973 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 11:19:42,974 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 11:19:42,989 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 11:19:42,989 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 11:19:42,990 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 11:19:42,992 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 11:19:43,004 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 11:19:43,006 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 11:19:43,007 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 11:19:43,008 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 11:19:43,009 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 11:19:43,009 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 11:19:43,010 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 11:19:43,011 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 11:19:43,012 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 11:19:43,012 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 11:19:43,013 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 11:19:43,018 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 11:19:43,026 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 11:19:43,032 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 11:19:43,033 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 11:19:43,034 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 11:19:43,035 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 11:19:43,037 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 11:19:43,037 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 11:19:43,038 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 11:19:43,038 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 11:19:43,039 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 11:19:43,040 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 11:19:43,040 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 11:19:43,040 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 11:19:43,041 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 11:19:43,042 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 11:19:43,042 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 11:19:43,043 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 11:19:43,043 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 11:19:43,043 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 11:19:43,044 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 11:19:43,044 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 11:19:43,045 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 11:19:43,046 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_035e4936-ad14-4dd1-a306-cba52ada564d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 11:19:43,058 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 11:19:43,059 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 11:19:43,060 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 11:19:43,060 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 11:19:43,060 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 11:19:43,061 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 11:19:43,061 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 11:19:43,061 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 11:19:43,061 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 11:19:43,061 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 11:19:43,062 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 11:19:43,062 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 11:19:43,062 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 11:19:43,062 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 11:19:43,062 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 11:19:43,063 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 11:19:43,063 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 11:19:43,063 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 11:19:43,063 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 11:19:43,063 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 11:19:43,064 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 11:19:43,064 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 11:19:43,064 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 11:19:43,064 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 11:19:43,065 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 11:19:43,065 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 11:19:43,065 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 11:19:43,065 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 11:19:43,065 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_035e4936-ad14-4dd1-a306-cba52ada564d/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2507b56afd4c82d08388837f279920ee2254841f [2019-11-20 11:19:43,200 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 11:19:43,210 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 11:19:43,213 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 11:19:43,215 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 11:19:43,215 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 11:19:43,216 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_035e4936-ad14-4dd1-a306-cba52ada564d/bin/uautomizer/../../sv-benchmarks/c/float-benchs/cos_polynomial.c [2019-11-20 11:19:43,266 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_035e4936-ad14-4dd1-a306-cba52ada564d/bin/uautomizer/data/cdf5655bc/41407ba23ef541ce9d64bb79f37a0a17/FLAG2a0831559 [2019-11-20 11:19:43,681 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 11:19:43,682 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_035e4936-ad14-4dd1-a306-cba52ada564d/sv-benchmarks/c/float-benchs/cos_polynomial.c [2019-11-20 11:19:43,688 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_035e4936-ad14-4dd1-a306-cba52ada564d/bin/uautomizer/data/cdf5655bc/41407ba23ef541ce9d64bb79f37a0a17/FLAG2a0831559 [2019-11-20 11:19:43,700 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_035e4936-ad14-4dd1-a306-cba52ada564d/bin/uautomizer/data/cdf5655bc/41407ba23ef541ce9d64bb79f37a0a17 [2019-11-20 11:19:43,703 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 11:19:43,704 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 11:19:43,705 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 11:19:43,705 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 11:19:43,708 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 11:19:43,708 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:19:43" (1/1) ... [2019-11-20 11:19:43,711 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67674555 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:19:43, skipping insertion in model container [2019-11-20 11:19:43,711 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:19:43" (1/1) ... [2019-11-20 11:19:43,718 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 11:19:43,735 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 11:19:43,941 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 11:19:43,946 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 11:19:43,965 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 11:19:43,977 INFO L192 MainTranslator]: Completed translation [2019-11-20 11:19:43,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:19:43 WrapperNode [2019-11-20 11:19:43,978 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 11:19:43,979 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 11:19:43,979 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 11:19:43,979 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 11:19:43,987 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:19:43" (1/1) ... [2019-11-20 11:19:43,993 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:19:43" (1/1) ... [2019-11-20 11:19:44,012 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 11:19:44,012 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 11:19:44,012 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 11:19:44,012 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 11:19:44,021 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:19:43" (1/1) ... [2019-11-20 11:19:44,021 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:19:43" (1/1) ... [2019-11-20 11:19:44,022 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:19:43" (1/1) ... [2019-11-20 11:19:44,022 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:19:43" (1/1) ... [2019-11-20 11:19:44,026 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:19:43" (1/1) ... [2019-11-20 11:19:44,029 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:19:43" (1/1) ... [2019-11-20 11:19:44,030 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:19:43" (1/1) ... [2019-11-20 11:19:44,031 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 11:19:44,032 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 11:19:44,032 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 11:19:44,032 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 11:19:44,033 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:19:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_035e4936-ad14-4dd1-a306-cba52ada564d/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 11:19:44,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 11:19:44,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 11:19:44,353 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 11:19:44,353 INFO L285 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-20 11:19:44,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:19:44 BoogieIcfgContainer [2019-11-20 11:19:44,355 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 11:19:44,356 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 11:19:44,356 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 11:19:44,359 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 11:19:44,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 11:19:43" (1/3) ... [2019-11-20 11:19:44,364 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35d139bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:19:44, skipping insertion in model container [2019-11-20 11:19:44,364 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:19:43" (2/3) ... [2019-11-20 11:19:44,364 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35d139bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:19:44, skipping insertion in model container [2019-11-20 11:19:44,365 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:19:44" (3/3) ... [2019-11-20 11:19:44,367 INFO L109 eAbstractionObserver]: Analyzing ICFG cos_polynomial.c [2019-11-20 11:19:44,378 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 11:19:44,384 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 11:19:44,396 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 11:19:44,421 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 11:19:44,421 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 11:19:44,422 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 11:19:44,422 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 11:19:44,422 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 11:19:44,422 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 11:19:44,422 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 11:19:44,422 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 11:19:44,441 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2019-11-20 11:19:44,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-20 11:19:44,446 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:19:44,447 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:19:44,447 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:19:44,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:19:44,454 INFO L82 PathProgramCache]: Analyzing trace with hash 119390772, now seen corresponding path program 1 times [2019-11-20 11:19:44,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:19:44,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690791846] [2019-11-20 11:19:44,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:19:44,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:19:44,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 11:19:44,570 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 11:19:44,571 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 11:19:44,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 11:19:44 BoogieIcfgContainer [2019-11-20 11:19:44,595 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 11:19:44,595 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 11:19:44,595 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 11:19:44,596 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 11:19:44,596 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:19:44" (3/4) ... [2019-11-20 11:19:44,600 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-20 11:19:44,600 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 11:19:44,602 INFO L168 Benchmark]: Toolchain (without parser) took 897.76 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -135.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 11:19:44,603 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 11:19:44,604 INFO L168 Benchmark]: CACSL2BoogieTranslator took 273.84 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -169.7 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. [2019-11-20 11:19:44,604 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.00 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 11:19:44,605 INFO L168 Benchmark]: Boogie Preprocessor took 19.44 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 11:19:44,606 INFO L168 Benchmark]: RCFGBuilder took 323.30 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2019-11-20 11:19:44,606 INFO L168 Benchmark]: TraceAbstraction took 239.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-20 11:19:44,607 INFO L168 Benchmark]: Witness Printer took 4.91 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 11:19:44,610 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 273.84 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -169.7 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 33.00 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.44 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 323.30 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 239.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Witness Printer took 4.91 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 9]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 51, overapproximation of someUnaryDOUBLEoperation at line 22, overapproximation of someBinaryArithmeticDOUBLEoperation at line 27. Possible FailurePath: [L11] double C1 = 4.16666666666666019037e-02; [L12] double C2 = -1.38888888888741095749e-03; [L13] double C3 = 2.48015872894767294178e-05; [L14] double C4 = -2.75573143513906633035e-07; [L15] double C5 = 2.08757232129817482790e-09; [L16] double C6 = -1.13596475577881948265e-11; VAL [C1=416666666666666019037/10000000000000000000000, C3=124007936447383647089/5000000000000000000000000, C5=20875723212981748279/10000000000000000000000000000] [L44] double a, r; [L46] a = __VERIFIER_nondet_double() [L20] double a, hz, z, r, qx, zr; [L21] z = x*x VAL [C1=416666666666666019037/10000000000000000000000, C3=124007936447383647089/5000000000000000000000000, C5=20875723212981748279/10000000000000000000000000000] [L22] COND TRUE x < 0. [L22] x = -x VAL [C1=416666666666666019037/10000000000000000000000, C3=124007936447383647089/5000000000000000000000000, C5=20875723212981748279/10000000000000000000000000000] [L23] hz = 0.5 * z [L24] r = z*(C1+z*(C2+z*(C3+z*(C4+z*(C5+z*C6))))) [L25] zr = z*r VAL [C1=416666666666666019037/10000000000000000000000, C3=124007936447383647089/5000000000000000000000000, C5=20875723212981748279/10000000000000000000000000000] [L26] COND TRUE x < 0.3 [L27] return 1.-(hz-zr); VAL [C1=416666666666666019037/10000000000000000000000, C3=124007936447383647089/5000000000000000000000000, C5=20875723212981748279/10000000000000000000000000000] [L49] r = mcos(a) [L9] COND TRUE !(cond) VAL [C1=416666666666666019037/10000000000000000000000, C3=124007936447383647089/5000000000000000000000000, C5=20875723212981748279/10000000000000000000000000000] [L9] __VERIFIER_error() VAL [C1=416666666666666019037/10000000000000000000000, C3=124007936447383647089/5000000000000000000000000, C5=20875723212981748279/10000000000000000000000000000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 15 locations, 1 error locations. Result: UNSAFE, OverallTime: 0.1s, OverallIterations: 1, TraceHistogramMax: 1, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15occurred 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: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 8 NumberOfCodeBlocks, 8 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-678e011 [2019-11-20 11:19:46,551 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 11:19:46,554 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 11:19:46,570 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 11:19:46,571 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 11:19:46,572 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 11:19:46,574 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 11:19:46,583 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 11:19:46,588 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 11:19:46,591 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 11:19:46,592 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 11:19:46,594 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 11:19:46,594 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 11:19:46,596 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 11:19:46,598 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 11:19:46,599 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 11:19:46,601 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 11:19:46,601 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 11:19:46,604 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 11:19:46,608 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 11:19:46,611 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 11:19:46,614 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 11:19:46,616 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 11:19:46,618 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 11:19:46,620 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 11:19:46,620 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 11:19:46,621 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 11:19:46,622 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 11:19:46,623 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 11:19:46,624 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 11:19:46,624 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 11:19:46,625 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 11:19:46,625 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 11:19:46,626 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 11:19:46,627 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 11:19:46,627 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 11:19:46,628 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 11:19:46,629 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 11:19:46,629 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 11:19:46,630 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 11:19:46,631 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 11:19:46,632 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_035e4936-ad14-4dd1-a306-cba52ada564d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-20 11:19:46,657 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 11:19:46,667 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 11:19:46,668 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 11:19:46,669 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 11:19:46,669 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 11:19:46,669 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 11:19:46,669 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 11:19:46,670 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 11:19:46,670 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 11:19:46,670 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 11:19:46,670 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 11:19:46,671 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 11:19:46,671 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 11:19:46,671 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 11:19:46,671 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 11:19:46,671 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 11:19:46,672 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 11:19:46,672 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 11:19:46,672 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 11:19:46,672 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 11:19:46,673 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 11:19:46,673 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 11:19:46,673 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 11:19:46,674 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 11:19:46,674 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 11:19:46,674 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 11:19:46,674 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 11:19:46,674 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 11:19:46,675 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 11:19:46,675 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 11:19:46,675 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_035e4936-ad14-4dd1-a306-cba52ada564d/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2507b56afd4c82d08388837f279920ee2254841f [2019-11-20 11:19:46,969 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 11:19:46,989 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 11:19:46,994 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 11:19:46,997 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 11:19:46,997 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 11:19:46,999 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_035e4936-ad14-4dd1-a306-cba52ada564d/bin/uautomizer/../../sv-benchmarks/c/float-benchs/cos_polynomial.c [2019-11-20 11:19:47,059 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_035e4936-ad14-4dd1-a306-cba52ada564d/bin/uautomizer/data/554d45189/2b5025c70cc74dfaab41f67aae99bb7d/FLAG83d787a6e [2019-11-20 11:19:47,457 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 11:19:47,458 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_035e4936-ad14-4dd1-a306-cba52ada564d/sv-benchmarks/c/float-benchs/cos_polynomial.c [2019-11-20 11:19:47,465 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_035e4936-ad14-4dd1-a306-cba52ada564d/bin/uautomizer/data/554d45189/2b5025c70cc74dfaab41f67aae99bb7d/FLAG83d787a6e [2019-11-20 11:19:47,861 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_035e4936-ad14-4dd1-a306-cba52ada564d/bin/uautomizer/data/554d45189/2b5025c70cc74dfaab41f67aae99bb7d [2019-11-20 11:19:47,863 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 11:19:47,864 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 11:19:47,865 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 11:19:47,865 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 11:19:47,869 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 11:19:47,870 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:19:47" (1/1) ... [2019-11-20 11:19:47,873 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ff7b248 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:19:47, skipping insertion in model container [2019-11-20 11:19:47,873 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:19:47" (1/1) ... [2019-11-20 11:19:47,880 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 11:19:47,900 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 11:19:48,075 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 11:19:48,086 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 11:19:48,107 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 11:19:48,121 INFO L192 MainTranslator]: Completed translation [2019-11-20 11:19:48,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:19:48 WrapperNode [2019-11-20 11:19:48,121 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 11:19:48,122 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 11:19:48,122 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 11:19:48,122 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 11:19:48,130 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:19:48" (1/1) ... [2019-11-20 11:19:48,137 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:19:48" (1/1) ... [2019-11-20 11:19:48,212 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 11:19:48,213 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 11:19:48,213 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 11:19:48,213 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 11:19:48,220 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:19:48" (1/1) ... [2019-11-20 11:19:48,220 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:19:48" (1/1) ... [2019-11-20 11:19:48,223 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:19:48" (1/1) ... [2019-11-20 11:19:48,223 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:19:48" (1/1) ... [2019-11-20 11:19:48,229 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:19:48" (1/1) ... [2019-11-20 11:19:48,232 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:19:48" (1/1) ... [2019-11-20 11:19:48,234 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:19:48" (1/1) ... [2019-11-20 11:19:48,237 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 11:19:48,238 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 11:19:48,238 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 11:19:48,238 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 11:19:48,239 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:19:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_035e4936-ad14-4dd1-a306-cba52ada564d/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 11:19:48,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 11:19:48,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 11:19:54,081 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 11:19:54,081 INFO L285 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-20 11:19:54,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:19:54 BoogieIcfgContainer [2019-11-20 11:19:54,082 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 11:19:54,083 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 11:19:54,083 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 11:19:54,087 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 11:19:54,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 11:19:47" (1/3) ... [2019-11-20 11:19:54,090 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d6991ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:19:54, skipping insertion in model container [2019-11-20 11:19:54,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:19:48" (2/3) ... [2019-11-20 11:19:54,091 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d6991ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:19:54, skipping insertion in model container [2019-11-20 11:19:54,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:19:54" (3/3) ... [2019-11-20 11:19:54,093 INFO L109 eAbstractionObserver]: Analyzing ICFG cos_polynomial.c [2019-11-20 11:19:54,104 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 11:19:54,111 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 11:19:54,123 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 11:19:54,151 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 11:19:54,151 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 11:19:54,152 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 11:19:54,152 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 11:19:54,152 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 11:19:54,152 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 11:19:54,153 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 11:19:54,153 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 11:19:54,181 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2019-11-20 11:19:54,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-20 11:19:54,192 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:19:54,193 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:19:54,194 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:19:54,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:19:54,201 INFO L82 PathProgramCache]: Analyzing trace with hash 119390772, now seen corresponding path program 1 times [2019-11-20 11:19:54,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:19:54,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1584542457] [2019-11-20 11:19:54,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_035e4936-ad14-4dd1-a306-cba52ada564d/bin/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-11-20 11:21:51,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:21:51,570 WARN L253 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-20 11:21:51,574 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:22:03,369 WARN L191 SmtUtils]: Spent 10.97 s on a formula simplification that was a NOOP. DAG size: 40 [2019-11-20 11:22:13,917 WARN L191 SmtUtils]: Spent 5.35 s on a formula simplification that was a NOOP. DAG size: 47 [2019-11-20 11:22:16,424 WARN L838 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_mcos_~x_10 (_ FloatingPoint 11 53))) (let ((.cse0 (fp.mul roundNearestTiesToEven v_ULTIMATE.start_mcos_~x_10 v_ULTIMATE.start_mcos_~x_10)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)))) (and (fp.leq v_ULTIMATE.start_mcos_~x_10 ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 4.0))) (= c_ULTIMATE.start_mcos_~zr~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 416666666666666019037.0 10000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 138888888888741095749.0 100000000000000000000000.0))) (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 124007936447383647089.0 5000000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 55114628702781326607.0 200000000000000000000000000.0))) (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 20875723212981748279.0 10000000000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 22719295115576389653.0 2000000000000000000000000000000.0)))))))))))))))) (fp.lt v_ULTIMATE.start_mcos_~x_10 (_ +zero 11 53)) (= (fp.neg v_ULTIMATE.start_mcos_~x_10) c_ULTIMATE.start_mcos_~x) (= c_ULTIMATE.start_mcos_~hz~0 (fp.mul roundNearestTiesToEven .cse1 .cse0)) (fp.geq v_ULTIMATE.start_mcos_~x_10 (fp.neg .cse1))))) is different from false [2019-11-20 11:22:19,610 WARN L838 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_mcos_~x_10 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)))) (and (fp.leq v_ULTIMATE.start_mcos_~x_10 ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 4.0))) (= (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (let ((.cse1 (fp.mul roundNearestTiesToEven v_ULTIMATE.start_mcos_~x_10 v_ULTIMATE.start_mcos_~x_10))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse1) (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 416666666666666019037.0 10000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 138888888888741095749.0 100000000000000000000000.0))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 124007936447383647089.0 5000000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 55114628702781326607.0 200000000000000000000000000.0))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 20875723212981748279.0 10000000000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse1 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 22719295115576389653.0 2000000000000000000000000000000.0)))))))))))))))))) |c_ULTIMATE.start_mcos_#res|) (fp.lt v_ULTIMATE.start_mcos_~x_10 (_ +zero 11 53)) (fp.lt (fp.neg v_ULTIMATE.start_mcos_~x_10) ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 10.0))) (fp.geq v_ULTIMATE.start_mcos_~x_10 (fp.neg .cse0))))) is different from false [2019-11-20 11:22:21,862 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_ULTIMATE.start_mcos_~x_10 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)))) (and (fp.leq v_ULTIMATE.start_mcos_~x_10 ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 4.0))) (= (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (let ((.cse1 (fp.mul roundNearestTiesToEven v_ULTIMATE.start_mcos_~x_10 v_ULTIMATE.start_mcos_~x_10))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse1) (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 416666666666666019037.0 10000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 138888888888741095749.0 100000000000000000000000.0))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 124007936447383647089.0 5000000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 55114628702781326607.0 200000000000000000000000000.0))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 20875723212981748279.0 10000000000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse1 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 22719295115576389653.0 2000000000000000000000000000000.0)))))))))))))))))) |c_ULTIMATE.start_mcos_#res|) (fp.lt v_ULTIMATE.start_mcos_~x_10 (_ +zero 11 53)) (fp.lt (fp.neg v_ULTIMATE.start_mcos_~x_10) ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 10.0))) (fp.geq v_ULTIMATE.start_mcos_~x_10 (fp.neg .cse0))))) is different from true [2019-11-20 11:22:21,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:22:26,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:22:41,271 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) (or (and (exists ((v_ULTIMATE.start_mcos_~x_10 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)))) (let ((.cse0 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (let ((.cse2 (fp.mul roundNearestTiesToEven v_ULTIMATE.start_mcos_~x_10 v_ULTIMATE.start_mcos_~x_10))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) (fp.mul roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 416666666666666019037.0 10000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 138888888888741095749.0 100000000000000000000000.0))) (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 124007936447383647089.0 5000000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 55114628702781326607.0 200000000000000000000000000.0))) (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 20875723212981748279.0 10000000000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse2 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 22719295115576389653.0 2000000000000000000000000000000.0)))))))))))))))))))) (and (fp.leq v_ULTIMATE.start_mcos_~x_10 ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 4.0))) (fp.geq .cse0 (_ +zero 11 53)) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0))) (fp.lt v_ULTIMATE.start_mcos_~x_10 (_ +zero 11 53)) (fp.lt (fp.neg v_ULTIMATE.start_mcos_~x_10) ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 10.0))) (fp.geq v_ULTIMATE.start_mcos_~x_10 (fp.neg .cse1)))))) (= (bvadd c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))) (and (exists ((v_ULTIMATE.start_mcos_~x_10 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)))) (and (fp.leq v_ULTIMATE.start_mcos_~x_10 ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 4.0))) (not (fp.geq (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (let ((.cse4 (fp.mul roundNearestTiesToEven v_ULTIMATE.start_mcos_~x_10 v_ULTIMATE.start_mcos_~x_10))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse4) (fp.mul roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 416666666666666019037.0 10000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 138888888888741095749.0 100000000000000000000000.0))) (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 124007936447383647089.0 5000000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 55114628702781326607.0 200000000000000000000000000.0))) (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 20875723212981748279.0 10000000000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse4 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 22719295115576389653.0 2000000000000000000000000000000.0)))))))))))))))))) (_ +zero 11 53))) (fp.lt v_ULTIMATE.start_mcos_~x_10 (_ +zero 11 53)) (fp.lt (fp.neg v_ULTIMATE.start_mcos_~x_10) ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 10.0))) (fp.geq v_ULTIMATE.start_mcos_~x_10 (fp.neg .cse3))))) .cse5) (and (exists ((v_ULTIMATE.start_mcos_~x_10 (_ FloatingPoint 11 53))) (let ((.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)))) (and (fp.leq v_ULTIMATE.start_mcos_~x_10 ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 4.0))) (fp.lt v_ULTIMATE.start_mcos_~x_10 (_ +zero 11 53)) (fp.lt (fp.neg v_ULTIMATE.start_mcos_~x_10) ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 10.0))) (not (fp.leq (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (let ((.cse7 (fp.mul roundNearestTiesToEven v_ULTIMATE.start_mcos_~x_10 v_ULTIMATE.start_mcos_~x_10))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 .cse7) (fp.mul roundNearestTiesToEven .cse7 (fp.mul roundNearestTiesToEven .cse7 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 416666666666666019037.0 10000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse7 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 138888888888741095749.0 100000000000000000000000.0))) (fp.mul roundNearestTiesToEven .cse7 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 124007936447383647089.0 5000000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse7 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 55114628702781326607.0 200000000000000000000000000.0))) (fp.mul roundNearestTiesToEven .cse7 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 20875723212981748279.0 10000000000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse7 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 22719295115576389653.0 2000000000000000000000000000000.0)))))))))))))))))) ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0)))) (fp.geq v_ULTIMATE.start_mcos_~x_10 (fp.neg .cse6))))) .cse5))) is different from false [2019-11-20 11:22:53,426 WARN L838 $PredicateComparison]: unable to prove that (or (exists ((v_ULTIMATE.start_mcos_~x_10 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)))) (and (fp.leq v_ULTIMATE.start_mcos_~x_10 ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 4.0))) (fp.lt v_ULTIMATE.start_mcos_~x_10 (_ +zero 11 53)) (fp.lt (fp.neg v_ULTIMATE.start_mcos_~x_10) ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 10.0))) (not (fp.leq (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (let ((.cse1 (fp.mul roundNearestTiesToEven v_ULTIMATE.start_mcos_~x_10 v_ULTIMATE.start_mcos_~x_10))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse1) (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 416666666666666019037.0 10000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 138888888888741095749.0 100000000000000000000000.0))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 124007936447383647089.0 5000000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 55114628702781326607.0 200000000000000000000000000.0))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 20875723212981748279.0 10000000000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse1 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 22719295115576389653.0 2000000000000000000000000000000.0)))))))))))))))))) ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0)))) (fp.geq v_ULTIMATE.start_mcos_~x_10 (fp.neg .cse0))))) (exists ((v_prenex_1 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)))) (and (fp.lt v_prenex_1 (_ +zero 11 53)) (fp.lt (fp.neg v_prenex_1) ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 10.0))) (fp.leq v_prenex_1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 4.0))) (not (fp.geq (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (let ((.cse3 (fp.mul roundNearestTiesToEven v_prenex_1 v_prenex_1))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse3) (fp.mul roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 416666666666666019037.0 10000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 138888888888741095749.0 100000000000000000000000.0))) (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 124007936447383647089.0 5000000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 55114628702781326607.0 200000000000000000000000000.0))) (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 20875723212981748279.0 10000000000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse3 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 22719295115576389653.0 2000000000000000000000000000000.0)))))))))))))))))) (_ +zero 11 53))) (fp.geq v_prenex_1 (fp.neg .cse2)))))) is different from false [2019-11-20 11:22:55,699 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_ULTIMATE.start_mcos_~x_10 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)))) (and (fp.leq v_ULTIMATE.start_mcos_~x_10 ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 4.0))) (fp.lt v_ULTIMATE.start_mcos_~x_10 (_ +zero 11 53)) (fp.lt (fp.neg v_ULTIMATE.start_mcos_~x_10) ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 10.0))) (not (fp.leq (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (let ((.cse1 (fp.mul roundNearestTiesToEven v_ULTIMATE.start_mcos_~x_10 v_ULTIMATE.start_mcos_~x_10))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse1) (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 416666666666666019037.0 10000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 138888888888741095749.0 100000000000000000000000.0))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 124007936447383647089.0 5000000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 55114628702781326607.0 200000000000000000000000000.0))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 20875723212981748279.0 10000000000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse1 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 22719295115576389653.0 2000000000000000000000000000000.0)))))))))))))))))) ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0)))) (fp.geq v_ULTIMATE.start_mcos_~x_10 (fp.neg .cse0))))) (exists ((v_prenex_1 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)))) (and (fp.lt v_prenex_1 (_ +zero 11 53)) (fp.lt (fp.neg v_prenex_1) ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 10.0))) (fp.leq v_prenex_1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 4.0))) (not (fp.geq (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (let ((.cse3 (fp.mul roundNearestTiesToEven v_prenex_1 v_prenex_1))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse3) (fp.mul roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 416666666666666019037.0 10000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 138888888888741095749.0 100000000000000000000000.0))) (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 124007936447383647089.0 5000000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 55114628702781326607.0 200000000000000000000000000.0))) (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 20875723212981748279.0 10000000000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse3 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 22719295115576389653.0 2000000000000000000000000000000.0)))))))))))))))))) (_ +zero 11 53))) (fp.geq v_prenex_1 (fp.neg .cse2)))))) is different from true [2019-11-20 11:22:55,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:22:55,706 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:23:08,226 WARN L191 SmtUtils]: Spent 3.45 s on a formula simplification that was a NOOP. DAG size: 19 [2019-11-20 11:23:10,602 WARN L838 $PredicateComparison]: unable to prove that (or (not (fp.lt c_ULTIMATE.start_mcos_~x ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 10.0)))) (let ((.cse0 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) c_ULTIMATE.start_mcos_~z~0) (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 (fp.add roundNearestTiesToEven c_~C1~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 (fp.add roundNearestTiesToEven c_~C2~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 (fp.add roundNearestTiesToEven c_~C3~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 (fp.add roundNearestTiesToEven c_~C4~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 (fp.add roundNearestTiesToEven c_~C5~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 c_~C6~0)))))))))))))))) (and (fp.geq .cse0 (_ +zero 11 53)) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0)))))) is different from false [2019-11-20 11:23:12,982 WARN L860 $PredicateComparison]: unable to prove that (or (not (fp.lt c_ULTIMATE.start_mcos_~x ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 10.0)))) (let ((.cse0 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) c_ULTIMATE.start_mcos_~z~0) (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 (fp.add roundNearestTiesToEven c_~C1~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 (fp.add roundNearestTiesToEven c_~C2~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 (fp.add roundNearestTiesToEven c_~C3~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 (fp.add roundNearestTiesToEven c_~C4~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 (fp.add roundNearestTiesToEven c_~C5~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 c_~C6~0)))))))))))))))) (and (fp.geq .cse0 (_ +zero 11 53)) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0)))))) is different from true [2019-11-20 11:23:15,360 WARN L838 $PredicateComparison]: unable to prove that (or (not (fp.lt c_ULTIMATE.start_mcos_~x (_ +zero 11 53))) (not (fp.lt (fp.neg c_ULTIMATE.start_mcos_~x) ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 10.0)))) (let ((.cse0 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) c_ULTIMATE.start_mcos_~z~0) (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 (fp.add roundNearestTiesToEven c_~C1~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 (fp.add roundNearestTiesToEven c_~C2~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 (fp.add roundNearestTiesToEven c_~C3~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 (fp.add roundNearestTiesToEven c_~C4~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 (fp.add roundNearestTiesToEven c_~C5~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 c_~C6~0)))))))))))))))) (and (fp.geq .cse0 (_ +zero 11 53)) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0)))))) is different from false [2019-11-20 11:23:17,740 WARN L860 $PredicateComparison]: unable to prove that (or (not (fp.lt c_ULTIMATE.start_mcos_~x (_ +zero 11 53))) (not (fp.lt (fp.neg c_ULTIMATE.start_mcos_~x) ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 10.0)))) (let ((.cse0 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) c_ULTIMATE.start_mcos_~z~0) (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 (fp.add roundNearestTiesToEven c_~C1~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 (fp.add roundNearestTiesToEven c_~C2~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 (fp.add roundNearestTiesToEven c_~C3~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 (fp.add roundNearestTiesToEven c_~C4~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 (fp.add roundNearestTiesToEven c_~C5~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 c_~C6~0)))))))))))))))) (and (fp.geq .cse0 (_ +zero 11 53)) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0)))))) is different from true [2019-11-20 11:23:17,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:23:19,980 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_mcos_#in~x_2| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)))) (or (not (fp.leq |v_ULTIMATE.start_mcos_#in~x_2| ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 4.0)))) (fp.leq (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (let ((.cse1 (fp.mul roundNearestTiesToEven |v_ULTIMATE.start_mcos_#in~x_2| |v_ULTIMATE.start_mcos_#in~x_2|))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse1) (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven c_~C1~0 (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven c_~C2~0 (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven c_~C3~0 (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven c_~C4~0 (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven c_~C5~0 (fp.mul roundNearestTiesToEven .cse1 c_~C6~0))))))))))))))) ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0))) (not (fp.lt (fp.neg |v_ULTIMATE.start_mcos_#in~x_2|) ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 10.0)))) (not (fp.lt |v_ULTIMATE.start_mcos_#in~x_2| (_ +zero 11 53))) (not (fp.geq |v_ULTIMATE.start_mcos_#in~x_2| (fp.neg .cse0)))))) (forall ((|v_ULTIMATE.start_mcos_#in~x_2| (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)))) (or (not (fp.leq |v_ULTIMATE.start_mcos_#in~x_2| ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 4.0)))) (not (fp.lt (fp.neg |v_ULTIMATE.start_mcos_#in~x_2|) ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 10.0)))) (fp.geq (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (let ((.cse3 (fp.mul roundNearestTiesToEven |v_ULTIMATE.start_mcos_#in~x_2| |v_ULTIMATE.start_mcos_#in~x_2|))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse3) (fp.mul roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven c_~C1~0 (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven c_~C2~0 (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven c_~C3~0 (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven c_~C4~0 (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven c_~C5~0 (fp.mul roundNearestTiesToEven .cse3 c_~C6~0))))))))))))))) (_ +zero 11 53)) (not (fp.lt |v_ULTIMATE.start_mcos_#in~x_2| (_ +zero 11 53))) (not (fp.geq |v_ULTIMATE.start_mcos_#in~x_2| (fp.neg .cse2))))))) is different from false [2019-11-20 11:23:22,886 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_mcos_#in~x_2| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)))) (or (not (fp.leq |v_ULTIMATE.start_mcos_#in~x_2| ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 4.0)))) (fp.leq (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (let ((.cse1 (fp.mul roundNearestTiesToEven |v_ULTIMATE.start_mcos_#in~x_2| |v_ULTIMATE.start_mcos_#in~x_2|))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse1) (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven c_~C1~0 (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven c_~C2~0 (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven c_~C3~0 (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven c_~C4~0 (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven c_~C5~0 (fp.mul roundNearestTiesToEven .cse1 c_~C6~0))))))))))))))) ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0))) (not (fp.lt (fp.neg |v_ULTIMATE.start_mcos_#in~x_2|) ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 10.0)))) (not (fp.lt |v_ULTIMATE.start_mcos_#in~x_2| (_ +zero 11 53))) (not (fp.geq |v_ULTIMATE.start_mcos_#in~x_2| (fp.neg .cse0)))))) (forall ((|v_ULTIMATE.start_mcos_#in~x_2| (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)))) (or (not (fp.leq |v_ULTIMATE.start_mcos_#in~x_2| ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 4.0)))) (not (fp.lt (fp.neg |v_ULTIMATE.start_mcos_#in~x_2|) ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 10.0)))) (fp.geq (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (let ((.cse3 (fp.mul roundNearestTiesToEven |v_ULTIMATE.start_mcos_#in~x_2| |v_ULTIMATE.start_mcos_#in~x_2|))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse3) (fp.mul roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven c_~C1~0 (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven c_~C2~0 (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven c_~C3~0 (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven c_~C4~0 (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven c_~C5~0 (fp.mul roundNearestTiesToEven .cse3 c_~C6~0))))))))))))))) (_ +zero 11 53)) (not (fp.lt |v_ULTIMATE.start_mcos_#in~x_2| (_ +zero 11 53))) (not (fp.geq |v_ULTIMATE.start_mcos_#in~x_2| (fp.neg .cse2))))))) is different from true [2019-11-20 11:23:22,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:23:22,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1584542457] [2019-11-20 11:23:22,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:23:22,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 14 [2019-11-20 11:23:22,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880526683] [2019-11-20 11:23:22,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-20 11:23:22,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:23:22,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-20 11:23:22,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=40, Unknown=15, NotChecked=126, Total=210 [2019-11-20 11:23:22,911 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2019-11-20 11:23:25,498 WARN L838 $PredicateComparison]: unable to prove that (and (= c_~C5~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 20875723212981748279.0 10000000000000000000000000000.0))) (= c_~C4~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 55114628702781326607.0 200000000000000000000000000.0)))) (= c_~C2~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 138888888888741095749.0 100000000000000000000000.0)))) (forall ((|v_ULTIMATE.start_mcos_#in~x_2| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)))) (or (not (fp.leq |v_ULTIMATE.start_mcos_#in~x_2| ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 4.0)))) (fp.leq (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (let ((.cse1 (fp.mul roundNearestTiesToEven |v_ULTIMATE.start_mcos_#in~x_2| |v_ULTIMATE.start_mcos_#in~x_2|))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse1) (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven c_~C1~0 (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven c_~C2~0 (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven c_~C3~0 (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven c_~C4~0 (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven c_~C5~0 (fp.mul roundNearestTiesToEven .cse1 c_~C6~0))))))))))))))) ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0))) (not (fp.lt (fp.neg |v_ULTIMATE.start_mcos_#in~x_2|) ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 10.0)))) (not (fp.lt |v_ULTIMATE.start_mcos_#in~x_2| (_ +zero 11 53))) (not (fp.geq |v_ULTIMATE.start_mcos_#in~x_2| (fp.neg .cse0)))))) (forall ((|v_ULTIMATE.start_mcos_#in~x_2| (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)))) (or (not (fp.leq |v_ULTIMATE.start_mcos_#in~x_2| ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 4.0)))) (not (fp.lt (fp.neg |v_ULTIMATE.start_mcos_#in~x_2|) ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 10.0)))) (fp.geq (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (let ((.cse3 (fp.mul roundNearestTiesToEven |v_ULTIMATE.start_mcos_#in~x_2| |v_ULTIMATE.start_mcos_#in~x_2|))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse3) (fp.mul roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven c_~C1~0 (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven c_~C2~0 (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven c_~C3~0 (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven c_~C4~0 (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven c_~C5~0 (fp.mul roundNearestTiesToEven .cse3 c_~C6~0))))))))))))))) (_ +zero 11 53)) (not (fp.lt |v_ULTIMATE.start_mcos_#in~x_2| (_ +zero 11 53))) (not (fp.geq |v_ULTIMATE.start_mcos_#in~x_2| (fp.neg .cse2)))))) (= c_~C1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 416666666666666019037.0 10000000000000000000000.0))) (= c_~C6~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 22719295115576389653.0 2000000000000000000000000000000.0)))) (= c_~C3~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 124007936447383647089.0 5000000000000000000000000.0)))) is different from false [2019-11-20 11:23:28,428 WARN L860 $PredicateComparison]: unable to prove that (and (= c_~C5~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 20875723212981748279.0 10000000000000000000000000000.0))) (= c_~C4~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 55114628702781326607.0 200000000000000000000000000.0)))) (= c_~C2~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 138888888888741095749.0 100000000000000000000000.0)))) (forall ((|v_ULTIMATE.start_mcos_#in~x_2| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)))) (or (not (fp.leq |v_ULTIMATE.start_mcos_#in~x_2| ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 4.0)))) (fp.leq (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (let ((.cse1 (fp.mul roundNearestTiesToEven |v_ULTIMATE.start_mcos_#in~x_2| |v_ULTIMATE.start_mcos_#in~x_2|))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse1) (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven c_~C1~0 (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven c_~C2~0 (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven c_~C3~0 (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven c_~C4~0 (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven c_~C5~0 (fp.mul roundNearestTiesToEven .cse1 c_~C6~0))))))))))))))) ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0))) (not (fp.lt (fp.neg |v_ULTIMATE.start_mcos_#in~x_2|) ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 10.0)))) (not (fp.lt |v_ULTIMATE.start_mcos_#in~x_2| (_ +zero 11 53))) (not (fp.geq |v_ULTIMATE.start_mcos_#in~x_2| (fp.neg .cse0)))))) (forall ((|v_ULTIMATE.start_mcos_#in~x_2| (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)))) (or (not (fp.leq |v_ULTIMATE.start_mcos_#in~x_2| ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 4.0)))) (not (fp.lt (fp.neg |v_ULTIMATE.start_mcos_#in~x_2|) ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 10.0)))) (fp.geq (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (let ((.cse3 (fp.mul roundNearestTiesToEven |v_ULTIMATE.start_mcos_#in~x_2| |v_ULTIMATE.start_mcos_#in~x_2|))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse2 .cse3) (fp.mul roundNearestTiesToEven .cse3 (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven c_~C1~0 (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven c_~C2~0 (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven c_~C3~0 (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven c_~C4~0 (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven c_~C5~0 (fp.mul roundNearestTiesToEven .cse3 c_~C6~0))))))))))))))) (_ +zero 11 53)) (not (fp.lt |v_ULTIMATE.start_mcos_#in~x_2| (_ +zero 11 53))) (not (fp.geq |v_ULTIMATE.start_mcos_#in~x_2| (fp.neg .cse2)))))) (= c_~C1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 416666666666666019037.0 10000000000000000000000.0))) (= c_~C6~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 22719295115576389653.0 2000000000000000000000000000000.0)))) (= c_~C3~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 124007936447383647089.0 5000000000000000000000000.0)))) is different from true [2019-11-20 11:23:30,838 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)))) (and (= (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~x c_ULTIMATE.start_mcos_~x) c_ULTIMATE.start_mcos_~z~0) (= c_~C5~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 20875723212981748279.0 10000000000000000000000000000.0))) (= c_~C4~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 55114628702781326607.0 200000000000000000000000000.0)))) (fp.geq c_ULTIMATE.start_mcos_~x (fp.neg .cse0)) (or (not (fp.lt c_ULTIMATE.start_mcos_~x (_ +zero 11 53))) (not (fp.lt (fp.neg c_ULTIMATE.start_mcos_~x) ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 10.0)))) (let ((.cse1 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_mcos_~z~0) (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 (fp.add roundNearestTiesToEven c_~C1~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 (fp.add roundNearestTiesToEven c_~C2~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 (fp.add roundNearestTiesToEven c_~C3~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 (fp.add roundNearestTiesToEven c_~C4~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 (fp.add roundNearestTiesToEven c_~C5~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 c_~C6~0)))))))))))))))) (and (fp.geq .cse1 (_ +zero 11 53)) (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0)))))) (= c_~C2~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 138888888888741095749.0 100000000000000000000000.0)))) (fp.leq c_ULTIMATE.start_mcos_~x ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 4.0))) (= c_~C1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 416666666666666019037.0 10000000000000000000000.0))) (= c_~C6~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 22719295115576389653.0 2000000000000000000000000000000.0)))) (= c_~C3~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 124007936447383647089.0 5000000000000000000000000.0))))) is different from false [2019-11-20 11:23:33,207 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)))) (and (= (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~x c_ULTIMATE.start_mcos_~x) c_ULTIMATE.start_mcos_~z~0) (= c_~C5~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 20875723212981748279.0 10000000000000000000000000000.0))) (= c_~C4~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 55114628702781326607.0 200000000000000000000000000.0)))) (fp.geq c_ULTIMATE.start_mcos_~x (fp.neg .cse0)) (or (not (fp.lt c_ULTIMATE.start_mcos_~x (_ +zero 11 53))) (not (fp.lt (fp.neg c_ULTIMATE.start_mcos_~x) ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 10.0)))) (let ((.cse1 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 c_ULTIMATE.start_mcos_~z~0) (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 (fp.add roundNearestTiesToEven c_~C1~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 (fp.add roundNearestTiesToEven c_~C2~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 (fp.add roundNearestTiesToEven c_~C3~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 (fp.add roundNearestTiesToEven c_~C4~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 (fp.add roundNearestTiesToEven c_~C5~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 c_~C6~0)))))))))))))))) (and (fp.geq .cse1 (_ +zero 11 53)) (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0)))))) (= c_~C2~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 138888888888741095749.0 100000000000000000000000.0)))) (fp.leq c_ULTIMATE.start_mcos_~x ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 4.0))) (= c_~C1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 416666666666666019037.0 10000000000000000000000.0))) (= c_~C6~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 22719295115576389653.0 2000000000000000000000000000000.0)))) (= c_~C3~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 124007936447383647089.0 5000000000000000000000000.0))))) is different from true [2019-11-20 11:23:35,630 WARN L838 $PredicateComparison]: unable to prove that (and (= c_~C5~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 20875723212981748279.0 10000000000000000000000000000.0))) (= c_~C4~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 55114628702781326607.0 200000000000000000000000000.0)))) (or (not (fp.lt c_ULTIMATE.start_mcos_~x ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 10.0)))) (let ((.cse0 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) c_ULTIMATE.start_mcos_~z~0) (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 (fp.add roundNearestTiesToEven c_~C1~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 (fp.add roundNearestTiesToEven c_~C2~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 (fp.add roundNearestTiesToEven c_~C3~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 (fp.add roundNearestTiesToEven c_~C4~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 (fp.add roundNearestTiesToEven c_~C5~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 c_~C6~0)))))))))))))))) (and (fp.geq .cse0 (_ +zero 11 53)) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0)))))) (= c_~C2~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 138888888888741095749.0 100000000000000000000000.0)))) (exists ((v_ULTIMATE.start_mcos_~x_10 (_ FloatingPoint 11 53))) (and (fp.leq v_ULTIMATE.start_mcos_~x_10 ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 4.0))) (= (fp.mul roundNearestTiesToEven v_ULTIMATE.start_mcos_~x_10 v_ULTIMATE.start_mcos_~x_10) c_ULTIMATE.start_mcos_~z~0) (fp.lt v_ULTIMATE.start_mcos_~x_10 (_ +zero 11 53)) (= (fp.neg v_ULTIMATE.start_mcos_~x_10) c_ULTIMATE.start_mcos_~x) (fp.geq v_ULTIMATE.start_mcos_~x_10 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)))))) (= c_~C1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 416666666666666019037.0 10000000000000000000000.0))) (= c_~C6~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 22719295115576389653.0 2000000000000000000000000000000.0)))) (= c_~C3~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 124007936447383647089.0 5000000000000000000000000.0)))) is different from false [2019-11-20 11:23:38,009 WARN L860 $PredicateComparison]: unable to prove that (and (= c_~C5~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 20875723212981748279.0 10000000000000000000000000000.0))) (= c_~C4~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 55114628702781326607.0 200000000000000000000000000.0)))) (or (not (fp.lt c_ULTIMATE.start_mcos_~x ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 10.0)))) (let ((.cse0 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) c_ULTIMATE.start_mcos_~z~0) (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 (fp.add roundNearestTiesToEven c_~C1~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 (fp.add roundNearestTiesToEven c_~C2~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 (fp.add roundNearestTiesToEven c_~C3~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 (fp.add roundNearestTiesToEven c_~C4~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 (fp.add roundNearestTiesToEven c_~C5~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 c_~C6~0)))))))))))))))) (and (fp.geq .cse0 (_ +zero 11 53)) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0)))))) (= c_~C2~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 138888888888741095749.0 100000000000000000000000.0)))) (exists ((v_ULTIMATE.start_mcos_~x_10 (_ FloatingPoint 11 53))) (and (fp.leq v_ULTIMATE.start_mcos_~x_10 ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 4.0))) (= (fp.mul roundNearestTiesToEven v_ULTIMATE.start_mcos_~x_10 v_ULTIMATE.start_mcos_~x_10) c_ULTIMATE.start_mcos_~z~0) (fp.lt v_ULTIMATE.start_mcos_~x_10 (_ +zero 11 53)) (= (fp.neg v_ULTIMATE.start_mcos_~x_10) c_ULTIMATE.start_mcos_~x) (fp.geq v_ULTIMATE.start_mcos_~x_10 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)))))) (= c_~C1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 416666666666666019037.0 10000000000000000000000.0))) (= c_~C6~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 22719295115576389653.0 2000000000000000000000000000000.0)))) (= c_~C3~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 124007936447383647089.0 5000000000000000000000000.0)))) is different from true [2019-11-20 11:23:40,544 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((v_ULTIMATE.start_mcos_~x_10 (_ FloatingPoint 11 53))) (let ((.cse0 (fp.mul roundNearestTiesToEven v_ULTIMATE.start_mcos_~x_10 v_ULTIMATE.start_mcos_~x_10)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)))) (and (fp.leq v_ULTIMATE.start_mcos_~x_10 ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 4.0))) (= c_ULTIMATE.start_mcos_~zr~0 (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 416666666666666019037.0 10000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 138888888888741095749.0 100000000000000000000000.0))) (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 124007936447383647089.0 5000000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 55114628702781326607.0 200000000000000000000000000.0))) (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 20875723212981748279.0 10000000000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 22719295115576389653.0 2000000000000000000000000000000.0)))))))))))))))) (fp.lt v_ULTIMATE.start_mcos_~x_10 (_ +zero 11 53)) (= (fp.neg v_ULTIMATE.start_mcos_~x_10) c_ULTIMATE.start_mcos_~x) (= c_ULTIMATE.start_mcos_~hz~0 (fp.mul roundNearestTiesToEven .cse1 .cse0)) (fp.geq v_ULTIMATE.start_mcos_~x_10 (fp.neg .cse1))))) (or (not (fp.lt c_ULTIMATE.start_mcos_~x ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 10.0)))) (let ((.cse2 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (fp.sub roundNearestTiesToEven c_ULTIMATE.start_mcos_~hz~0 c_ULTIMATE.start_mcos_~zr~0)))) (and (fp.leq .cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0))) (fp.geq .cse2 (_ +zero 11 53)))))) is different from false [2019-11-20 11:23:52,311 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((v_ULTIMATE.start_mcos_~x_10 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)))) (and (fp.leq v_ULTIMATE.start_mcos_~x_10 ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 4.0))) (= (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (let ((.cse1 (fp.mul roundNearestTiesToEven v_ULTIMATE.start_mcos_~x_10 v_ULTIMATE.start_mcos_~x_10))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse1) (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 416666666666666019037.0 10000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 138888888888741095749.0 100000000000000000000000.0))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 124007936447383647089.0 5000000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 55114628702781326607.0 200000000000000000000000000.0))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 20875723212981748279.0 10000000000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse1 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 22719295115576389653.0 2000000000000000000000000000000.0)))))))))))))))))) |c_ULTIMATE.start_mcos_#res|) (fp.lt v_ULTIMATE.start_mcos_~x_10 (_ +zero 11 53)) (fp.lt (fp.neg v_ULTIMATE.start_mcos_~x_10) ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 10.0))) (fp.geq v_ULTIMATE.start_mcos_~x_10 (fp.neg .cse0))))) (fp.geq |c_ULTIMATE.start_mcos_#res| (_ +zero 11 53)) (fp.leq |c_ULTIMATE.start_mcos_#res| ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0)))) is different from false [2019-11-20 11:23:55,187 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) (and (or (and (exists ((v_ULTIMATE.start_mcos_~x_10 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)))) (let ((.cse0 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (let ((.cse2 (fp.mul roundNearestTiesToEven v_ULTIMATE.start_mcos_~x_10 v_ULTIMATE.start_mcos_~x_10))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse1 .cse2) (fp.mul roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 416666666666666019037.0 10000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 138888888888741095749.0 100000000000000000000000.0))) (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 124007936447383647089.0 5000000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 55114628702781326607.0 200000000000000000000000000.0))) (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 20875723212981748279.0 10000000000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse2 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 22719295115576389653.0 2000000000000000000000000000000.0)))))))))))))))))))) (and (fp.leq v_ULTIMATE.start_mcos_~x_10 ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 4.0))) (fp.geq .cse0 (_ +zero 11 53)) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0))) (fp.lt v_ULTIMATE.start_mcos_~x_10 (_ +zero 11 53)) (fp.lt (fp.neg v_ULTIMATE.start_mcos_~x_10) ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 10.0))) (fp.geq v_ULTIMATE.start_mcos_~x_10 (fp.neg .cse1)))))) (= (bvadd c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))) (and (exists ((v_ULTIMATE.start_mcos_~x_10 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)))) (and (fp.leq v_ULTIMATE.start_mcos_~x_10 ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 4.0))) (not (fp.geq (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (let ((.cse4 (fp.mul roundNearestTiesToEven v_ULTIMATE.start_mcos_~x_10 v_ULTIMATE.start_mcos_~x_10))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse3 .cse4) (fp.mul roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 416666666666666019037.0 10000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 138888888888741095749.0 100000000000000000000000.0))) (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 124007936447383647089.0 5000000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 55114628702781326607.0 200000000000000000000000000.0))) (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 20875723212981748279.0 10000000000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse4 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 22719295115576389653.0 2000000000000000000000000000000.0)))))))))))))))))) (_ +zero 11 53))) (fp.lt v_ULTIMATE.start_mcos_~x_10 (_ +zero 11 53)) (fp.lt (fp.neg v_ULTIMATE.start_mcos_~x_10) ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 10.0))) (fp.geq v_ULTIMATE.start_mcos_~x_10 (fp.neg .cse3))))) .cse5) (and (exists ((v_ULTIMATE.start_mcos_~x_10 (_ FloatingPoint 11 53))) (let ((.cse6 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)))) (and (fp.leq v_ULTIMATE.start_mcos_~x_10 ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 4.0))) (fp.lt v_ULTIMATE.start_mcos_~x_10 (_ +zero 11 53)) (fp.lt (fp.neg v_ULTIMATE.start_mcos_~x_10) ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 10.0))) (not (fp.leq (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (let ((.cse7 (fp.mul roundNearestTiesToEven v_ULTIMATE.start_mcos_~x_10 v_ULTIMATE.start_mcos_~x_10))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 .cse7) (fp.mul roundNearestTiesToEven .cse7 (fp.mul roundNearestTiesToEven .cse7 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 416666666666666019037.0 10000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse7 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 138888888888741095749.0 100000000000000000000000.0))) (fp.mul roundNearestTiesToEven .cse7 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 124007936447383647089.0 5000000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse7 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 55114628702781326607.0 200000000000000000000000000.0))) (fp.mul roundNearestTiesToEven .cse7 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 20875723212981748279.0 10000000000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse7 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 22719295115576389653.0 2000000000000000000000000000000.0)))))))))))))))))) ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0)))) (fp.geq v_ULTIMATE.start_mcos_~x_10 (fp.neg .cse6))))) .cse5)) (not .cse5))) is different from false [2019-11-20 11:24:02,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:24:02,287 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2019-11-20 11:24:02,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 11:24:02,289 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 8 [2019-11-20 11:24:02,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:24:02,300 INFO L225 Difference]: With dead ends: 31 [2019-11-20 11:24:02,300 INFO L226 Difference]: Without dead ends: 15 [2019-11-20 11:24:02,304 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 88.0s TimeCoverageRelationStatistics Valid=41, Invalid=43, Unknown=24, NotChecked=312, Total=420 [2019-11-20 11:24:02,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-11-20 11:24:02,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2019-11-20 11:24:02,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-11-20 11:24:02,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2019-11-20 11:24:02,338 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 8 [2019-11-20 11:24:02,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:24:02,339 INFO L462 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2019-11-20 11:24:02,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-20 11:24:02,340 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2019-11-20 11:24:02,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-20 11:24:02,340 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:24:02,340 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:24:02,555 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-20 11:24:02,556 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:24:02,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:24:02,556 INFO L82 PathProgramCache]: Analyzing trace with hash 176649074, now seen corresponding path program 1 times [2019-11-20 11:24:02,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:24:02,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1895630950] [2019-11-20 11:24:02,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_035e4936-ad14-4dd1-a306-cba52ada564d/bin/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-11-20 11:26:15,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:26:15,908 WARN L253 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-20 11:26:15,910 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:26:24,258 WARN L191 SmtUtils]: Spent 6.90 s on a formula simplification that was a NOOP. DAG size: 33 [2019-11-20 11:26:35,609 WARN L191 SmtUtils]: Spent 8.28 s on a formula simplification that was a NOOP. DAG size: 36 [2019-11-20 11:26:38,175 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~x c_ULTIMATE.start_mcos_~x))) (and (= (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) .cse0) c_ULTIMATE.start_mcos_~hz~0) (not (fp.lt c_ULTIMATE.start_mcos_~x (_ +zero 11 53))) (= (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 416666666666666019037.0 10000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 138888888888741095749.0 100000000000000000000000.0))) (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 124007936447383647089.0 5000000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 55114628702781326607.0 200000000000000000000000000.0))) (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 20875723212981748279.0 10000000000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 22719295115576389653.0 2000000000000000000000000000000.0))))))))))))))) c_ULTIMATE.start_mcos_~zr~0))) is different from false [2019-11-20 11:26:41,162 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~x c_ULTIMATE.start_mcos_~x))) (and (= (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) .cse0) c_ULTIMATE.start_mcos_~hz~0) (not (fp.lt c_ULTIMATE.start_mcos_~x (_ +zero 11 53))) (= (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 416666666666666019037.0 10000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 138888888888741095749.0 100000000000000000000000.0))) (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 124007936447383647089.0 5000000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 55114628702781326607.0 200000000000000000000000000.0))) (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 20875723212981748279.0 10000000000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 22719295115576389653.0 2000000000000000000000000000000.0))))))))))))))) c_ULTIMATE.start_mcos_~zr~0))) is different from true [2019-11-20 11:26:43,780 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_mcos_~x (_ FloatingPoint 11 53))) (and (fp.lt ULTIMATE.start_mcos_~x ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 10.0))) (= (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (let ((.cse0 (fp.mul roundNearestTiesToEven ULTIMATE.start_mcos_~x ULTIMATE.start_mcos_~x))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) .cse0) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 416666666666666019037.0 10000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 138888888888741095749.0 100000000000000000000000.0))) (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 124007936447383647089.0 5000000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 55114628702781326607.0 200000000000000000000000000.0))) (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 20875723212981748279.0 10000000000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 22719295115576389653.0 2000000000000000000000000000000.0)))))))))))))))))) |c_ULTIMATE.start_mcos_#res|) (not (fp.lt ULTIMATE.start_mcos_~x (_ +zero 11 53))))) is different from false [2019-11-20 11:26:46,055 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_mcos_~x (_ FloatingPoint 11 53))) (and (fp.lt ULTIMATE.start_mcos_~x ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 10.0))) (= (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (let ((.cse0 (fp.mul roundNearestTiesToEven ULTIMATE.start_mcos_~x ULTIMATE.start_mcos_~x))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) .cse0) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 416666666666666019037.0 10000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 138888888888741095749.0 100000000000000000000000.0))) (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 124007936447383647089.0 5000000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 55114628702781326607.0 200000000000000000000000000.0))) (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 20875723212981748279.0 10000000000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 22719295115576389653.0 2000000000000000000000000000000.0)))))))))))))))))) |c_ULTIMATE.start_mcos_#res|) (not (fp.lt ULTIMATE.start_mcos_~x (_ +zero 11 53))))) is different from true [2019-11-20 11:26:46,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:26:50,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:27:06,440 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) (or (and (= (bvadd c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (exists ((ULTIMATE.start_mcos_~x (_ FloatingPoint 11 53))) (let ((.cse0 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (let ((.cse1 (fp.mul roundNearestTiesToEven ULTIMATE.start_mcos_~x ULTIMATE.start_mcos_~x))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) .cse1) (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 416666666666666019037.0 10000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 138888888888741095749.0 100000000000000000000000.0))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 124007936447383647089.0 5000000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 55114628702781326607.0 200000000000000000000000000.0))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 20875723212981748279.0 10000000000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse1 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 22719295115576389653.0 2000000000000000000000000000000.0)))))))))))))))))))) (and (fp.lt ULTIMATE.start_mcos_~x ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 10.0))) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0))) (not (fp.lt ULTIMATE.start_mcos_~x (_ +zero 11 53))) (fp.geq .cse0 (_ +zero 11 53)))))) (and (exists ((ULTIMATE.start_mcos_~x (_ FloatingPoint 11 53))) (and (fp.lt ULTIMATE.start_mcos_~x ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 10.0))) (not (fp.leq (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (let ((.cse2 (fp.mul roundNearestTiesToEven ULTIMATE.start_mcos_~x ULTIMATE.start_mcos_~x))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) .cse2) (fp.mul roundNearestTiesToEven .cse2 (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 416666666666666019037.0 10000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 138888888888741095749.0 100000000000000000000000.0))) (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 124007936447383647089.0 5000000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 55114628702781326607.0 200000000000000000000000000.0))) (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 20875723212981748279.0 10000000000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse2 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 22719295115576389653.0 2000000000000000000000000000000.0)))))))))))))))))) ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0)))) (not (fp.lt ULTIMATE.start_mcos_~x (_ +zero 11 53))))) .cse3) (and (exists ((ULTIMATE.start_mcos_~x (_ FloatingPoint 11 53))) (and (fp.lt ULTIMATE.start_mcos_~x ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 10.0))) (not (fp.geq (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (let ((.cse4 (fp.mul roundNearestTiesToEven ULTIMATE.start_mcos_~x ULTIMATE.start_mcos_~x))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) .cse4) (fp.mul roundNearestTiesToEven .cse4 (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 416666666666666019037.0 10000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 138888888888741095749.0 100000000000000000000000.0))) (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 124007936447383647089.0 5000000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 55114628702781326607.0 200000000000000000000000000.0))) (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 20875723212981748279.0 10000000000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse4 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 22719295115576389653.0 2000000000000000000000000000000.0)))))))))))))))))) (_ +zero 11 53))) (not (fp.lt ULTIMATE.start_mcos_~x (_ +zero 11 53))))) .cse3))) is different from false [2019-11-20 11:27:18,988 WARN L838 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_mcos_~x (_ FloatingPoint 11 53))) (and (fp.lt ULTIMATE.start_mcos_~x ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 10.0))) (not (fp.leq (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (let ((.cse0 (fp.mul roundNearestTiesToEven ULTIMATE.start_mcos_~x ULTIMATE.start_mcos_~x))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) .cse0) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 416666666666666019037.0 10000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 138888888888741095749.0 100000000000000000000000.0))) (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 124007936447383647089.0 5000000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 55114628702781326607.0 200000000000000000000000000.0))) (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 20875723212981748279.0 10000000000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 22719295115576389653.0 2000000000000000000000000000000.0)))))))))))))))))) ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0)))) (not (fp.lt ULTIMATE.start_mcos_~x (_ +zero 11 53))))) (exists ((v_prenex_2 (_ FloatingPoint 11 53))) (and (fp.lt v_prenex_2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 10.0))) (not (fp.lt v_prenex_2 (_ +zero 11 53))) (not (fp.geq (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (let ((.cse1 (fp.mul roundNearestTiesToEven v_prenex_2 v_prenex_2))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) .cse1) (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 416666666666666019037.0 10000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 138888888888741095749.0 100000000000000000000000.0))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 124007936447383647089.0 5000000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 55114628702781326607.0 200000000000000000000000000.0))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 20875723212981748279.0 10000000000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse1 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 22719295115576389653.0 2000000000000000000000000000000.0)))))))))))))))))) (_ +zero 11 53)))))) is different from false [2019-11-20 11:27:21,251 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_mcos_~x (_ FloatingPoint 11 53))) (and (fp.lt ULTIMATE.start_mcos_~x ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 10.0))) (not (fp.leq (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (let ((.cse0 (fp.mul roundNearestTiesToEven ULTIMATE.start_mcos_~x ULTIMATE.start_mcos_~x))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) .cse0) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 416666666666666019037.0 10000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 138888888888741095749.0 100000000000000000000000.0))) (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 124007936447383647089.0 5000000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 55114628702781326607.0 200000000000000000000000000.0))) (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 20875723212981748279.0 10000000000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 22719295115576389653.0 2000000000000000000000000000000.0)))))))))))))))))) ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0)))) (not (fp.lt ULTIMATE.start_mcos_~x (_ +zero 11 53))))) (exists ((v_prenex_2 (_ FloatingPoint 11 53))) (and (fp.lt v_prenex_2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 10.0))) (not (fp.lt v_prenex_2 (_ +zero 11 53))) (not (fp.geq (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (let ((.cse1 (fp.mul roundNearestTiesToEven v_prenex_2 v_prenex_2))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) .cse1) (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 416666666666666019037.0 10000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 138888888888741095749.0 100000000000000000000000.0))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 124007936447383647089.0 5000000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 55114628702781326607.0 200000000000000000000000000.0))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 20875723212981748279.0 10000000000000000000000000000.0)) (fp.mul roundNearestTiesToEven .cse1 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 22719295115576389653.0 2000000000000000000000000000000.0)))))))))))))))))) (_ +zero 11 53)))))) is different from true [2019-11-20 11:27:21,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:27:21,254 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:27:35,542 WARN L191 SmtUtils]: Spent 4.15 s on a formula simplification that was a NOOP. DAG size: 19 [2019-11-20 11:27:37,949 WARN L838 $PredicateComparison]: unable to prove that (or (not (fp.lt c_ULTIMATE.start_mcos_~x ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 10.0)))) (let ((.cse0 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) c_ULTIMATE.start_mcos_~z~0) (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 (fp.add roundNearestTiesToEven c_~C1~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 (fp.add roundNearestTiesToEven c_~C2~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 (fp.add roundNearestTiesToEven c_~C3~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 (fp.add roundNearestTiesToEven c_~C4~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 (fp.add roundNearestTiesToEven c_~C5~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 c_~C6~0)))))))))))))))) (and (fp.geq .cse0 (_ +zero 11 53)) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0)))))) is different from false [2019-11-20 11:27:40,363 WARN L860 $PredicateComparison]: unable to prove that (or (not (fp.lt c_ULTIMATE.start_mcos_~x ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 10.0)))) (let ((.cse0 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) c_ULTIMATE.start_mcos_~z~0) (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 (fp.add roundNearestTiesToEven c_~C1~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 (fp.add roundNearestTiesToEven c_~C2~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 (fp.add roundNearestTiesToEven c_~C3~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 (fp.add roundNearestTiesToEven c_~C4~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 (fp.add roundNearestTiesToEven c_~C5~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 c_~C6~0)))))))))))))))) (and (fp.geq .cse0 (_ +zero 11 53)) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0)))))) is different from true [2019-11-20 11:27:42,767 WARN L838 $PredicateComparison]: unable to prove that (or (not (fp.lt c_ULTIMATE.start_mcos_~x ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 10.0)))) (fp.lt c_ULTIMATE.start_mcos_~x (_ +zero 11 53)) (let ((.cse0 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) c_ULTIMATE.start_mcos_~z~0) (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 (fp.add roundNearestTiesToEven c_~C1~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 (fp.add roundNearestTiesToEven c_~C2~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 (fp.add roundNearestTiesToEven c_~C3~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 (fp.add roundNearestTiesToEven c_~C4~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 (fp.add roundNearestTiesToEven c_~C5~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 c_~C6~0)))))))))))))))) (and (fp.geq .cse0 (_ +zero 11 53)) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0)))))) is different from false [2019-11-20 11:27:45,185 WARN L860 $PredicateComparison]: unable to prove that (or (not (fp.lt c_ULTIMATE.start_mcos_~x ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 10.0)))) (fp.lt c_ULTIMATE.start_mcos_~x (_ +zero 11 53)) (let ((.cse0 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) c_ULTIMATE.start_mcos_~z~0) (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 (fp.add roundNearestTiesToEven c_~C1~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 (fp.add roundNearestTiesToEven c_~C2~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 (fp.add roundNearestTiesToEven c_~C3~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 (fp.add roundNearestTiesToEven c_~C4~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 (fp.add roundNearestTiesToEven c_~C5~0 (fp.mul roundNearestTiesToEven c_ULTIMATE.start_mcos_~z~0 c_~C6~0)))))))))))))))) (and (fp.geq .cse0 (_ +zero 11 53)) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0)))))) is different from true [2019-11-20 11:27:45,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:27:47,422 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_mcos_~x_13 (_ FloatingPoint 11 53))) (or (not (fp.lt v_ULTIMATE.start_mcos_~x_13 ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 10.0)))) (fp.lt v_ULTIMATE.start_mcos_~x_13 (_ +zero 11 53)) (fp.leq (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (let ((.cse0 (fp.mul roundNearestTiesToEven v_ULTIMATE.start_mcos_~x_13 v_ULTIMATE.start_mcos_~x_13))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) .cse0) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven c_~C1~0 (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven c_~C2~0 (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven c_~C3~0 (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven c_~C4~0 (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven c_~C5~0 (fp.mul roundNearestTiesToEven .cse0 c_~C6~0))))))))))))))) ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0))))) (forall ((v_ULTIMATE.start_mcos_~x_13 (_ FloatingPoint 11 53))) (or (not (fp.lt v_ULTIMATE.start_mcos_~x_13 ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 10.0)))) (fp.lt v_ULTIMATE.start_mcos_~x_13 (_ +zero 11 53)) (fp.geq (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (let ((.cse1 (fp.mul roundNearestTiesToEven v_ULTIMATE.start_mcos_~x_13 v_ULTIMATE.start_mcos_~x_13))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) .cse1) (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven c_~C1~0 (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven c_~C2~0 (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven c_~C3~0 (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven c_~C4~0 (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven c_~C5~0 (fp.mul roundNearestTiesToEven .cse1 c_~C6~0))))))))))))))) (_ +zero 11 53))))) is different from false [2019-11-20 11:27:50,325 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_mcos_~x_13 (_ FloatingPoint 11 53))) (or (not (fp.lt v_ULTIMATE.start_mcos_~x_13 ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 10.0)))) (fp.lt v_ULTIMATE.start_mcos_~x_13 (_ +zero 11 53)) (fp.leq (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (let ((.cse0 (fp.mul roundNearestTiesToEven v_ULTIMATE.start_mcos_~x_13 v_ULTIMATE.start_mcos_~x_13))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) .cse0) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven c_~C1~0 (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven c_~C2~0 (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven c_~C3~0 (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven c_~C4~0 (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven c_~C5~0 (fp.mul roundNearestTiesToEven .cse0 c_~C6~0))))))))))))))) ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0))))) (forall ((v_ULTIMATE.start_mcos_~x_13 (_ FloatingPoint 11 53))) (or (not (fp.lt v_ULTIMATE.start_mcos_~x_13 ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 10.0)))) (fp.lt v_ULTIMATE.start_mcos_~x_13 (_ +zero 11 53)) (fp.geq (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (let ((.cse1 (fp.mul roundNearestTiesToEven v_ULTIMATE.start_mcos_~x_13 v_ULTIMATE.start_mcos_~x_13))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) .cse1) (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven c_~C1~0 (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven c_~C2~0 (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven c_~C3~0 (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven c_~C4~0 (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven c_~C5~0 (fp.mul roundNearestTiesToEven .cse1 c_~C6~0))))))))))))))) (_ +zero 11 53))))) is different from true [2019-11-20 11:27:50,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:27:50,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1895630950] [2019-11-20 11:27:50,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:27:50,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 14 [2019-11-20 11:27:50,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721574719] [2019-11-20 11:27:50,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-20 11:27:50,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:27:50,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-20 11:27:50,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=41, Unknown=13, NotChecked=126, Total=210 [2019-11-20 11:27:50,330 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand 15 states. [2019-11-20 11:27:53,161 WARN L838 $PredicateComparison]: unable to prove that (and (= c_~C5~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 20875723212981748279.0 10000000000000000000000000000.0))) (= c_~C4~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 55114628702781326607.0 200000000000000000000000000.0)))) (= c_~C2~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 138888888888741095749.0 100000000000000000000000.0)))) (forall ((v_ULTIMATE.start_mcos_~x_13 (_ FloatingPoint 11 53))) (or (not (fp.lt v_ULTIMATE.start_mcos_~x_13 ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 10.0)))) (fp.lt v_ULTIMATE.start_mcos_~x_13 (_ +zero 11 53)) (fp.leq (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (let ((.cse0 (fp.mul roundNearestTiesToEven v_ULTIMATE.start_mcos_~x_13 v_ULTIMATE.start_mcos_~x_13))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) .cse0) (fp.mul roundNearestTiesToEven .cse0 (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven c_~C1~0 (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven c_~C2~0 (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven c_~C3~0 (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven c_~C4~0 (fp.mul roundNearestTiesToEven .cse0 (fp.add roundNearestTiesToEven c_~C5~0 (fp.mul roundNearestTiesToEven .cse0 c_~C6~0))))))))))))))) ((_ to_fp 11 53) roundNearestTiesToEven (/ 11.0 10.0))))) (= c_~C1~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 416666666666666019037.0 10000000000000000000000.0))) (= c_~C6~0 (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 22719295115576389653.0 2000000000000000000000000000000.0)))) (forall ((v_ULTIMATE.start_mcos_~x_13 (_ FloatingPoint 11 53))) (or (not (fp.lt v_ULTIMATE.start_mcos_~x_13 ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 10.0)))) (fp.lt v_ULTIMATE.start_mcos_~x_13 (_ +zero 11 53)) (fp.geq (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (let ((.cse1 (fp.mul roundNearestTiesToEven v_ULTIMATE.start_mcos_~x_13 v_ULTIMATE.start_mcos_~x_13))) (fp.sub roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) .cse1) (fp.mul roundNearestTiesToEven .cse1 (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven c_~C1~0 (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven c_~C2~0 (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven c_~C3~0 (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven c_~C4~0 (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven c_~C5~0 (fp.mul roundNearestTiesToEven .cse1 c_~C6~0))))))))))))))) (_ +zero 11 53)))) (= c_~C3~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 124007936447383647089.0 5000000000000000000000000.0)))) is different from false [2019-11-20 11:27:55,084 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2019-11-20 11:27:55,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-20 11:27:55,285 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-20 11:27:55,286 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:153) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:140) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java: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:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:698) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:627) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:454) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1461) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:654) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 44 more [2019-11-20 11:27:55,290 INFO L168 Benchmark]: Toolchain (without parser) took 487425.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.1 MB). Free memory was 956.4 MB in the beginning and 1.0 GB in the end (delta: -66.7 MB). Peak memory consumption was 96.4 MB. Max. memory is 11.5 GB. [2019-11-20 11:27:55,290 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 11:27:55,291 INFO L168 Benchmark]: CACSL2BoogieTranslator took 256.33 ms. Allocated memory is still 1.0 GB. Free memory was 956.4 MB in the beginning and 945.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-20 11:27:55,291 INFO L168 Benchmark]: Boogie Procedure Inliner took 90.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.1 MB). Free memory was 945.7 MB in the beginning and 1.2 GB in the end (delta: -214.0 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. [2019-11-20 11:27:55,292 INFO L168 Benchmark]: Boogie Preprocessor took 24.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-20 11:27:55,292 INFO L168 Benchmark]: RCFGBuilder took 5844.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2019-11-20 11:27:55,293 INFO L168 Benchmark]: TraceAbstraction took 481205.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 110.4 MB). Peak memory consumption was 110.4 MB. Max. memory is 11.5 GB. [2019-11-20 11:27:55,296 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 256.33 ms. Allocated memory is still 1.0 GB. Free memory was 956.4 MB in the beginning and 945.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 90.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.1 MB). Free memory was 945.7 MB in the beginning and 1.2 GB in the end (delta: -214.0 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 5844.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 481205.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 110.4 MB). Peak memory consumption was 110.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...