./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/sqrt_poly.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_08c98f4e-dbb0-46c0-ab82-3f6bd29eed1d/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_08c98f4e-dbb0-46c0-ab82-3f6bd29eed1d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_08c98f4e-dbb0-46c0-ab82-3f6bd29eed1d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_08c98f4e-dbb0-46c0-ab82-3f6bd29eed1d/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_poly.c -s /tmp/vcloud-vcloud-master/worker/run_dir_08c98f4e-dbb0-46c0-ab82-3f6bd29eed1d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_08c98f4e-dbb0-46c0-ab82-3f6bd29eed1d/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 8a4836c40967b3aafd0bbb2ea7228f657b02305b ............................................................................................................................................................................................................................... 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_08c98f4e-dbb0-46c0-ab82-3f6bd29eed1d/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_08c98f4e-dbb0-46c0-ab82-3f6bd29eed1d/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_08c98f4e-dbb0-46c0-ab82-3f6bd29eed1d/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_08c98f4e-dbb0-46c0-ab82-3f6bd29eed1d/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_poly.c -s /tmp/vcloud-vcloud-master/worker/run_dir_08c98f4e-dbb0-46c0-ab82-3f6bd29eed1d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_08c98f4e-dbb0-46c0-ab82-3f6bd29eed1d/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 8a4836c40967b3aafd0bbb2ea7228f657b02305b ....................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:58:23,035 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:58:23,037 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:58:23,046 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:58:23,047 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:58:23,048 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:58:23,049 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:58:23,051 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:58:23,052 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:58:23,053 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:58:23,054 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:58:23,055 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:58:23,056 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:58:23,056 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:58:23,057 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:58:23,058 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:58:23,059 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:58:23,060 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:58:23,062 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:58:23,064 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:58:23,065 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:58:23,069 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:58:23,071 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:58:23,073 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:58:23,075 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:58:23,077 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:58:23,077 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:58:23,078 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:58:23,079 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:58:23,080 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:58:23,081 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:58:23,082 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:58:23,083 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:58:23,083 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:58:23,085 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:58:23,086 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:58:23,087 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:58:23,088 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:58:23,088 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:58:23,089 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:58:23,090 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:58:23,091 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_08c98f4e-dbb0-46c0-ab82-3f6bd29eed1d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 23:58:23,108 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:58:23,108 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:58:23,110 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:58:23,110 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:58:23,110 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:58:23,110 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:58:23,111 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:58:23,111 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:58:23,111 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:58:23,111 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:58:23,112 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:58:23,113 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:58:23,113 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:58:23,113 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:58:23,113 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:58:23,114 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:58:23,114 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:58:23,114 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:58:23,114 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:58:23,114 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:58:23,115 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:58:23,115 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:58:23,115 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:58:23,115 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:58:23,116 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:58:23,116 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:58:23,116 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:58:23,116 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:58:23,117 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_08c98f4e-dbb0-46c0-ab82-3f6bd29eed1d/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 -> 8a4836c40967b3aafd0bbb2ea7228f657b02305b [2019-11-15 23:58:23,172 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:58:23,185 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:58:23,190 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:58:23,191 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:58:23,191 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:58:23,192 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_08c98f4e-dbb0-46c0-ab82-3f6bd29eed1d/bin/uautomizer/../../sv-benchmarks/c/float-benchs/sqrt_poly.c [2019-11-15 23:58:23,253 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_08c98f4e-dbb0-46c0-ab82-3f6bd29eed1d/bin/uautomizer/data/0b1259426/963359cdd0a64b4da0f613a4a4f49dfd/FLAG4b599d24d [2019-11-15 23:58:23,609 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:58:23,609 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_08c98f4e-dbb0-46c0-ab82-3f6bd29eed1d/sv-benchmarks/c/float-benchs/sqrt_poly.c [2019-11-15 23:58:23,615 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_08c98f4e-dbb0-46c0-ab82-3f6bd29eed1d/bin/uautomizer/data/0b1259426/963359cdd0a64b4da0f613a4a4f49dfd/FLAG4b599d24d [2019-11-15 23:58:24,010 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_08c98f4e-dbb0-46c0-ab82-3f6bd29eed1d/bin/uautomizer/data/0b1259426/963359cdd0a64b4da0f613a4a4f49dfd [2019-11-15 23:58:24,013 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:58:24,015 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:58:24,019 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:58:24,019 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:58:24,022 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:58:24,023 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:58:24" (1/1) ... [2019-11-15 23:58:24,025 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f72a3b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:58:24, skipping insertion in model container [2019-11-15 23:58:24,025 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:58:24" (1/1) ... [2019-11-15 23:58:24,031 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:58:24,045 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:58:24,241 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:58:24,246 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:58:24,270 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:58:24,283 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:58:24,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:58:24 WrapperNode [2019-11-15 23:58:24,284 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:58:24,285 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:58:24,285 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:58:24,285 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:58:24,294 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:58:24" (1/1) ... [2019-11-15 23:58:24,300 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:58:24" (1/1) ... [2019-11-15 23:58:24,315 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:58:24,316 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:58:24,316 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:58:24,316 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:58:24,323 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:58:24" (1/1) ... [2019-11-15 23:58:24,323 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:58:24" (1/1) ... [2019-11-15 23:58:24,323 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:58:24" (1/1) ... [2019-11-15 23:58:24,324 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:58:24" (1/1) ... [2019-11-15 23:58:24,326 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:58:24" (1/1) ... [2019-11-15 23:58:24,328 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:58:24" (1/1) ... [2019-11-15 23:58:24,329 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:58:24" (1/1) ... [2019-11-15 23:58:24,331 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:58:24,331 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:58:24,331 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:58:24,331 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:58:24,332 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:58:24" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_08c98f4e-dbb0-46c0-ab82-3f6bd29eed1d/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-15 23:58:24,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:58:24,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:58:24,565 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:58:24,566 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-15 23:58:24,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:58:24 BoogieIcfgContainer [2019-11-15 23:58:24,567 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:58:24,568 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:58:24,568 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:58:24,571 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:58:24,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:58:24" (1/3) ... [2019-11-15 23:58:24,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ff5d953 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:58:24, skipping insertion in model container [2019-11-15 23:58:24,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:58:24" (2/3) ... [2019-11-15 23:58:24,572 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ff5d953 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:58:24, skipping insertion in model container [2019-11-15 23:58:24,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:58:24" (3/3) ... [2019-11-15 23:58:24,577 INFO L109 eAbstractionObserver]: Analyzing ICFG sqrt_poly.c [2019-11-15 23:58:24,586 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:58:24,593 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 23:58:24,603 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 23:58:24,629 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:58:24,629 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:58:24,630 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:58:24,630 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:58:24,630 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:58:24,630 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:58:24,630 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:58:24,632 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:58:24,646 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2019-11-15 23:58:24,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-15 23:58:24,654 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:58:24,655 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-15 23:58:24,657 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:58:24,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:58:24,662 INFO L82 PathProgramCache]: Analyzing trace with hash 889508713, now seen corresponding path program 1 times [2019-11-15 23:58:24,669 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:58:24,670 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082765760] [2019-11-15 23:58:24,670 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:58:24,670 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:58:24,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:58:24,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:58:24,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:58:24,790 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:58:24,791 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 23:58:24,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:58:24 BoogieIcfgContainer [2019-11-15 23:58:24,813 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:58:24,813 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:58:24,813 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:58:24,814 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:58:24,814 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:58:24" (3/4) ... [2019-11-15 23:58:24,819 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 23:58:24,819 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:58:24,823 INFO L168 Benchmark]: Toolchain (without parser) took 806.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -158.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:58:24,824 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 962.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:58:24,826 INFO L168 Benchmark]: CACSL2BoogieTranslator took 265.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -185.9 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:58:24,827 INFO L168 Benchmark]: Boogie Procedure Inliner took 30.38 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:58:24,828 INFO L168 Benchmark]: Boogie Preprocessor took 15.26 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:58:24,829 INFO L168 Benchmark]: RCFGBuilder took 236.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. [2019-11-15 23:58:24,829 INFO L168 Benchmark]: TraceAbstraction took 244.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:58:24,830 INFO L168 Benchmark]: Witness Printer took 6.29 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:58:24,839 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 962.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 265.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -185.9 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 30.38 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.26 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 236.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 244.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Witness Printer took 6.29 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 11]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 25, overapproximation of someBinaryArithmeticDOUBLEoperation at line 22. Possible FailurePath: [L13] double sqrt2 = 1.414213538169860839843750; VAL [sqrt2=11863283/8388608] [L17] double S, I; [L19] I = __VERIFIER_nondet_double() [L22] COND TRUE I >= 2. [L22] S = sqrt2 * (1.+(I/2.- 1.)*(.5-0.125*(I/2.-1.))) VAL [sqrt2=11863283/8388608] [L11] COND TRUE !(cond) VAL [sqrt2=11863283/8388608] [L11] __VERIFIER_error() VAL [sqrt2=11863283/8388608] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 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=11occurred 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, 6 NumberOfCodeBlocks, 6 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-cad4683 [2019-11-15 23:58:27,003 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:58:27,005 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:58:27,016 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:58:27,016 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:58:27,017 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:58:27,018 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:58:27,020 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:58:27,022 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:58:27,023 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:58:27,024 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:58:27,025 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:58:27,033 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:58:27,035 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:58:27,036 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:58:27,037 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:58:27,038 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:58:27,041 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:58:27,043 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:58:27,044 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:58:27,045 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:58:27,046 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:58:27,047 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:58:27,048 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:58:27,051 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:58:27,051 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:58:27,051 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:58:27,052 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:58:27,053 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:58:27,053 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:58:27,054 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:58:27,054 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:58:27,055 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:58:27,056 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:58:27,057 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:58:27,057 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:58:27,057 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:58:27,058 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:58:27,058 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:58:27,059 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:58:27,059 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:58:27,060 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_08c98f4e-dbb0-46c0-ab82-3f6bd29eed1d/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-15 23:58:27,075 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:58:27,075 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:58:27,076 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:58:27,076 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:58:27,077 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:58:27,077 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:58:27,077 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:58:27,077 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:58:27,077 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:58:27,078 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:58:27,078 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:58:27,078 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:58:27,078 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-15 23:58:27,079 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-15 23:58:27,079 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:58:27,079 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:58:27,079 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:58:27,079 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:58:27,080 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:58:27,080 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:58:27,080 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:58:27,080 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:58:27,081 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:58:27,081 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:58:27,081 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:58:27,082 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:58:27,082 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-15 23:58:27,082 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-15 23:58:27,082 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:58:27,082 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-15 23:58:27,083 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_08c98f4e-dbb0-46c0-ab82-3f6bd29eed1d/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 -> 8a4836c40967b3aafd0bbb2ea7228f657b02305b [2019-11-15 23:58:27,123 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:58:27,141 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:58:27,144 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:58:27,151 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:58:27,152 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:58:27,153 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_08c98f4e-dbb0-46c0-ab82-3f6bd29eed1d/bin/uautomizer/../../sv-benchmarks/c/float-benchs/sqrt_poly.c [2019-11-15 23:58:27,215 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_08c98f4e-dbb0-46c0-ab82-3f6bd29eed1d/bin/uautomizer/data/23826f763/6fe99ea0704a4a6ba3b8ab119ee0fe91/FLAGa4322d1d6 [2019-11-15 23:58:27,633 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:58:27,633 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_08c98f4e-dbb0-46c0-ab82-3f6bd29eed1d/sv-benchmarks/c/float-benchs/sqrt_poly.c [2019-11-15 23:58:27,639 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_08c98f4e-dbb0-46c0-ab82-3f6bd29eed1d/bin/uautomizer/data/23826f763/6fe99ea0704a4a6ba3b8ab119ee0fe91/FLAGa4322d1d6 [2019-11-15 23:58:27,655 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_08c98f4e-dbb0-46c0-ab82-3f6bd29eed1d/bin/uautomizer/data/23826f763/6fe99ea0704a4a6ba3b8ab119ee0fe91 [2019-11-15 23:58:27,658 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:58:27,661 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:58:27,662 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:58:27,662 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:58:27,665 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:58:27,666 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:58:27" (1/1) ... [2019-11-15 23:58:27,668 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15c769a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:58:27, skipping insertion in model container [2019-11-15 23:58:27,669 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:58:27" (1/1) ... [2019-11-15 23:58:27,675 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:58:27,692 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:58:27,869 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:58:27,884 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:58:27,918 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:58:27,938 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:58:27,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:58:27 WrapperNode [2019-11-15 23:58:27,938 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:58:27,939 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:58:27,939 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:58:27,939 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:58:27,947 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:58:27" (1/1) ... [2019-11-15 23:58:28,011 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:58:27" (1/1) ... [2019-11-15 23:58:28,029 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:58:28,030 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:58:28,030 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:58:28,030 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:58:28,039 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:58:27" (1/1) ... [2019-11-15 23:58:28,039 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:58:27" (1/1) ... [2019-11-15 23:58:28,042 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:58:27" (1/1) ... [2019-11-15 23:58:28,042 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:58:27" (1/1) ... [2019-11-15 23:58:28,048 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:58:27" (1/1) ... [2019-11-15 23:58:28,050 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:58:27" (1/1) ... [2019-11-15 23:58:28,051 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:58:27" (1/1) ... [2019-11-15 23:58:28,054 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:58:28,054 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:58:28,055 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:58:28,055 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:58:28,056 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:58:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_08c98f4e-dbb0-46c0-ab82-3f6bd29eed1d/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-15 23:58:28,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:58:28,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:58:32,476 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:58:32,476 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-15 23:58:32,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:58:32 BoogieIcfgContainer [2019-11-15 23:58:32,477 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:58:32,478 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:58:32,479 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:58:32,481 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:58:32,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:58:27" (1/3) ... [2019-11-15 23:58:32,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27758d64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:58:32, skipping insertion in model container [2019-11-15 23:58:32,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:58:27" (2/3) ... [2019-11-15 23:58:32,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27758d64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:58:32, skipping insertion in model container [2019-11-15 23:58:32,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:58:32" (3/3) ... [2019-11-15 23:58:32,485 INFO L109 eAbstractionObserver]: Analyzing ICFG sqrt_poly.c [2019-11-15 23:58:32,494 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:58:32,501 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 23:58:32,511 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 23:58:32,540 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:58:32,540 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:58:32,541 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:58:32,541 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:58:32,541 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:58:32,543 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:58:32,543 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:58:32,543 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:58:32,555 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2019-11-15 23:58:32,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-15 23:58:32,559 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:58:32,560 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-15 23:58:32,561 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:58:32,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:58:32,565 INFO L82 PathProgramCache]: Analyzing trace with hash 889508713, now seen corresponding path program 1 times [2019-11-15 23:58:32,572 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:58:32,572 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [891552511] [2019-11-15 23:58:32,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_08c98f4e-dbb0-46c0-ab82-3f6bd29eed1d/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-15 23:58:35,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:58:35,473 WARN L254 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 23:58:35,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:58:37,691 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= c_ULTIMATE.start_main_~S~0 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse0 (let ((.cse1 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse2) .cse0))) (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse1))))))) (fp.geq ULTIMATE.start_main_~I~0 .cse2) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (fp.geq ULTIMATE.start_main_~I~0 .cse0)))) is different from false [2019-11-15 23:58:39,790 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= c_ULTIMATE.start_main_~S~0 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse0 (let ((.cse1 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse2) .cse0))) (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse1))))))) (fp.geq ULTIMATE.start_main_~I~0 .cse2) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (fp.geq ULTIMATE.start_main_~I~0 .cse0)))) is different from true [2019-11-15 23:58:39,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:58:41,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:58:56,890 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) (or (and (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq ULTIMATE.start_main_~I~0 .cse0) (not (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse1 (let ((.cse2 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse0) .cse1))) (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse2)))))) .cse1)) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (fp.geq ULTIMATE.start_main_~I~0 .cse1)))) .cse3) (and (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq ULTIMATE.start_main_~I~0 .cse4) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (not (fp.leq (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse5 (let ((.cse6 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse4) .cse5))) (fp.mul roundNearestTiesToEven .cse6 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse6)))))) .cse4)) (fp.geq ULTIMATE.start_main_~I~0 .cse5)))) .cse3) (and (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse7 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse9 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse8 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse9 (let ((.cse10 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse7) .cse9))) (fp.mul roundNearestTiesToEven .cse10 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse10)))))))) (and (fp.geq ULTIMATE.start_main_~I~0 .cse7) (fp.geq .cse8 .cse9) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (fp.geq ULTIMATE.start_main_~I~0 .cse9) (fp.leq .cse8 .cse7))))) (= (bvadd c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))))) is different from false [2019-11-15 23:59:07,633 WARN L838 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq ULTIMATE.start_main_~I~0 .cse0) (not (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse1 (let ((.cse2 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse0) .cse1))) (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse2)))))) .cse1)) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (fp.geq ULTIMATE.start_main_~I~0 .cse1)))) (exists ((v_prenex_1 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq v_prenex_1 .cse3) (not (fp.leq (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse3 (let ((.cse4 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven v_prenex_1 .cse5) .cse3))) (fp.mul roundNearestTiesToEven .cse4 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse4)))))) .cse5)) (fp.geq v_prenex_1 .cse5) (fp.leq v_prenex_1 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)))))) is different from false [2019-11-15 23:59:09,740 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq ULTIMATE.start_main_~I~0 .cse0) (not (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse1 (let ((.cse2 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse0) .cse1))) (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse2)))))) .cse1)) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (fp.geq ULTIMATE.start_main_~I~0 .cse1)))) (exists ((v_prenex_1 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq v_prenex_1 .cse3) (not (fp.leq (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse3 (let ((.cse4 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven v_prenex_1 .cse5) .cse3))) (fp.mul roundNearestTiesToEven .cse4 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse4)))))) .cse5)) (fp.geq v_prenex_1 .cse5) (fp.leq v_prenex_1 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)))))) is different from true [2019-11-15 23:59:09,745 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-15 23:59:09,746 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:59:11,970 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (or (not (fp.geq c_ULTIMATE.start_main_~I~0 .cse0)) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse1 (fp.mul roundNearestTiesToEven c_~sqrt2~0 (fp.add roundNearestTiesToEven .cse2 (let ((.cse3 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~I~0 .cse0) .cse2))) (fp.mul roundNearestTiesToEven .cse3 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse3)))))))) (and (fp.leq .cse1 .cse0) (fp.geq .cse1 .cse2)))))) is different from false [2019-11-15 23:59:14,152 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (or (not (fp.geq c_ULTIMATE.start_main_~I~0 .cse0)) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse1 (fp.mul roundNearestTiesToEven c_~sqrt2~0 (fp.add roundNearestTiesToEven .cse2 (let ((.cse3 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~I~0 .cse0) .cse2))) (fp.mul roundNearestTiesToEven .cse3 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse3)))))))) (and (fp.leq .cse1 .cse0) (fp.geq .cse1 .cse2)))))) is different from true [2019-11-15 23:59:14,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:59:16,252 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~I~0_8 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (not (fp.leq v_ULTIMATE.start_main_~I~0_8 ((_ to_fp 11 53) roundNearestTiesToEven 3.0))) (fp.leq (fp.mul roundNearestTiesToEven c_~sqrt2~0 (fp.add roundNearestTiesToEven .cse0 (let ((.cse1 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~I~0_8 .cse2) .cse0))) (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse1)))))) .cse2) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse2)) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse0))))) (forall ((v_ULTIMATE.start_main_~I~0_8 (_ FloatingPoint 11 53))) (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (fp.geq (fp.mul roundNearestTiesToEven c_~sqrt2~0 (fp.add roundNearestTiesToEven .cse3 (let ((.cse4 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~I~0_8 .cse5) .cse3))) (fp.mul roundNearestTiesToEven .cse4 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse4)))))) .cse3) (not (fp.leq v_ULTIMATE.start_main_~I~0_8 ((_ to_fp 11 53) roundNearestTiesToEven 3.0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse5)) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse3)))))) is different from false [2019-11-15 23:59:18,504 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~I~0_8 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (not (fp.leq v_ULTIMATE.start_main_~I~0_8 ((_ to_fp 11 53) roundNearestTiesToEven 3.0))) (fp.leq (fp.mul roundNearestTiesToEven c_~sqrt2~0 (fp.add roundNearestTiesToEven .cse0 (let ((.cse1 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~I~0_8 .cse2) .cse0))) (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse1)))))) .cse2) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse2)) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse0))))) (forall ((v_ULTIMATE.start_main_~I~0_8 (_ FloatingPoint 11 53))) (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (fp.geq (fp.mul roundNearestTiesToEven c_~sqrt2~0 (fp.add roundNearestTiesToEven .cse3 (let ((.cse4 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~I~0_8 .cse5) .cse3))) (fp.mul roundNearestTiesToEven .cse4 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse4)))))) .cse3) (not (fp.leq v_ULTIMATE.start_main_~I~0_8 ((_ to_fp 11 53) roundNearestTiesToEven 3.0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse5)) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse3)))))) is different from true [2019-11-15 23:59:18,506 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-15 23:59:18,507 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [891552511] [2019-11-15 23:59:18,507 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:59:18,508 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 10 [2019-11-15 23:59:18,508 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348752553] [2019-11-15 23:59:18,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-15 23:59:18,513 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:59:18,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 23:59:18,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=21, Unknown=9, NotChecked=60, Total=110 [2019-11-15 23:59:18,530 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states. [2019-11-15 23:59:20,652 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~I~0_8 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (not (fp.leq v_ULTIMATE.start_main_~I~0_8 ((_ to_fp 11 53) roundNearestTiesToEven 3.0))) (fp.leq (fp.mul roundNearestTiesToEven c_~sqrt2~0 (fp.add roundNearestTiesToEven .cse0 (let ((.cse1 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~I~0_8 .cse2) .cse0))) (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse1)))))) .cse2) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse2)) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse0))))) (forall ((v_ULTIMATE.start_main_~I~0_8 (_ FloatingPoint 11 53))) (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (fp.geq (fp.mul roundNearestTiesToEven c_~sqrt2~0 (fp.add roundNearestTiesToEven .cse3 (let ((.cse4 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~I~0_8 .cse5) .cse3))) (fp.mul roundNearestTiesToEven .cse4 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse4)))))) .cse3) (not (fp.leq v_ULTIMATE.start_main_~I~0_8 ((_ to_fp 11 53) roundNearestTiesToEven 3.0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse5)) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse3))))) (= ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) c_~sqrt2~0)) is different from false [2019-11-15 23:59:22,904 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~I~0_8 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (not (fp.leq v_ULTIMATE.start_main_~I~0_8 ((_ to_fp 11 53) roundNearestTiesToEven 3.0))) (fp.leq (fp.mul roundNearestTiesToEven c_~sqrt2~0 (fp.add roundNearestTiesToEven .cse0 (let ((.cse1 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~I~0_8 .cse2) .cse0))) (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse1)))))) .cse2) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse2)) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse0))))) (forall ((v_ULTIMATE.start_main_~I~0_8 (_ FloatingPoint 11 53))) (let ((.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (fp.geq (fp.mul roundNearestTiesToEven c_~sqrt2~0 (fp.add roundNearestTiesToEven .cse3 (let ((.cse4 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven v_ULTIMATE.start_main_~I~0_8 .cse5) .cse3))) (fp.mul roundNearestTiesToEven .cse4 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse4)))))) .cse3) (not (fp.leq v_ULTIMATE.start_main_~I~0_8 ((_ to_fp 11 53) roundNearestTiesToEven 3.0))) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse5)) (not (fp.geq v_ULTIMATE.start_main_~I~0_8 .cse3))))) (= ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) c_~sqrt2~0)) is different from true [2019-11-15 23:59:25,022 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (= ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) c_~sqrt2~0) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (or (not (fp.geq c_ULTIMATE.start_main_~I~0 .cse0)) (let ((.cse1 (fp.mul roundNearestTiesToEven c_~sqrt2~0 (fp.add roundNearestTiesToEven .cse2 (let ((.cse3 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~I~0 .cse0) .cse2))) (fp.mul roundNearestTiesToEven .cse3 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse3)))))))) (and (fp.leq .cse1 .cse0) (fp.geq .cse1 .cse2))))) (fp.geq c_ULTIMATE.start_main_~I~0 .cse2))) is different from false [2019-11-15 23:59:27,184 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (= ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) c_~sqrt2~0) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (or (not (fp.geq c_ULTIMATE.start_main_~I~0 .cse0)) (let ((.cse1 (fp.mul roundNearestTiesToEven c_~sqrt2~0 (fp.add roundNearestTiesToEven .cse2 (let ((.cse3 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven c_ULTIMATE.start_main_~I~0 .cse0) .cse2))) (fp.mul roundNearestTiesToEven .cse3 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse3)))))))) (and (fp.leq .cse1 .cse0) (fp.geq .cse1 .cse2))))) (fp.geq c_ULTIMATE.start_main_~I~0 .cse2))) is different from true [2019-11-15 23:59:29,315 WARN L838 $PredicateComparison]: unable to prove that (and (fp.leq c_ULTIMATE.start_main_~S~0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (fp.geq c_ULTIMATE.start_main_~S~0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= c_ULTIMATE.start_main_~S~0 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse0 (let ((.cse1 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse2) .cse0))) (fp.mul roundNearestTiesToEven .cse1 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse1))))))) (fp.geq ULTIMATE.start_main_~I~0 .cse2) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (fp.geq ULTIMATE.start_main_~I~0 .cse0))))) is different from false [2019-11-15 23:59:31,449 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) (and (or (and (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq ULTIMATE.start_main_~I~0 .cse0) (not (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse1 (let ((.cse2 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse0) .cse1))) (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse2)))))) .cse1)) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (fp.geq ULTIMATE.start_main_~I~0 .cse1)))) .cse3) (and (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq ULTIMATE.start_main_~I~0 .cse4) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (not (fp.leq (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse5 (let ((.cse6 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse4) .cse5))) (fp.mul roundNearestTiesToEven .cse6 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse6)))))) .cse4)) (fp.geq ULTIMATE.start_main_~I~0 .cse5)))) .cse3) (and (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse7 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse9 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse8 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse9 (let ((.cse10 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse7) .cse9))) (fp.mul roundNearestTiesToEven .cse10 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse10)))))))) (and (fp.geq ULTIMATE.start_main_~I~0 .cse7) (fp.geq .cse8 .cse9) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (fp.geq ULTIMATE.start_main_~I~0 .cse9) (fp.leq .cse8 .cse7))))) (= (bvadd c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)))) (not .cse3))) is different from false [2019-11-15 23:59:31,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:59:31,484 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-11-15 23:59:31,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:59:31,485 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 6 [2019-11-15 23:59:31,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:59:31,493 INFO L225 Difference]: With dead ends: 23 [2019-11-15 23:59:31,493 INFO L226 Difference]: Without dead ends: 7 [2019-11-15 23:59:31,501 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 32.5s TimeCoverageRelationStatistics Valid=28, Invalid=23, Unknown=15, NotChecked=144, Total=210 [2019-11-15 23:59:31,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-11-15 23:59:31,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-11-15 23:59:31,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-15 23:59:31,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 6 transitions. [2019-11-15 23:59:31,533 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 6 transitions. Word has length 6 [2019-11-15 23:59:31,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:59:31,533 INFO L462 AbstractCegarLoop]: Abstraction has 7 states and 6 transitions. [2019-11-15 23:59:31,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-15 23:59:31,533 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 6 transitions. [2019-11-15 23:59:31,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-11-15 23:59:31,534 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:59:31,534 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-11-15 23:59:31,753 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-15 23:59:31,753 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:59:31,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:59:31,753 INFO L82 PathProgramCache]: Analyzing trace with hash 889568295, now seen corresponding path program 1 times [2019-11-15 23:59:31,754 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:59:31,754 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [555303658] [2019-11-15 23:59:31,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_08c98f4e-dbb0-46c0-ab82-3f6bd29eed1d/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-15 23:59:40,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:59:40,473 WARN L254 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:59:40,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:59:42,650 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= (fp.add roundNearestTiesToEven .cse0 (let ((.cse1 (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse0))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))) c_ULTIMATE.start_main_~S~0) (not (fp.geq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (fp.geq ULTIMATE.start_main_~I~0 .cse0)))) is different from false [2019-11-15 23:59:44,777 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= (fp.add roundNearestTiesToEven .cse0 (let ((.cse1 (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse0))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))) c_ULTIMATE.start_main_~S~0) (not (fp.geq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (fp.geq ULTIMATE.start_main_~I~0 .cse0)))) is different from true [2019-11-15 23:59:44,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:59:46,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:02,260 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) (or (and (= (bvadd c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.add roundNearestTiesToEven .cse1 (let ((.cse3 (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse1))) (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0)))))))))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq .cse0 .cse1) (not (fp.geq ULTIMATE.start_main_~I~0 .cse2)) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (fp.geq ULTIMATE.start_main_~I~0 .cse1) (fp.leq .cse0 .cse2)))))) (and (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (not (fp.geq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (not (fp.geq (fp.add roundNearestTiesToEven .cse4 (let ((.cse5 (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse4))) (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))) .cse4)) (fp.geq ULTIMATE.start_main_~I~0 .cse4)))) .cse6) (and (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse7 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse8 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (not (fp.geq ULTIMATE.start_main_~I~0 .cse7)) (not (fp.leq (fp.add roundNearestTiesToEven .cse8 (let ((.cse9 (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse8))) (fp.mul roundNearestTiesToEven .cse9 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse9 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse9 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))) .cse7)) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (fp.geq ULTIMATE.start_main_~I~0 .cse8)))) .cse6))) is different from false [2019-11-16 00:00:13,128 WARN L838 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (not (fp.geq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (not (fp.geq (fp.add roundNearestTiesToEven .cse0 (let ((.cse1 (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse0))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))) .cse0)) (fp.geq ULTIMATE.start_main_~I~0 .cse0)))) (exists ((v_prenex_2 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq v_prenex_2 .cse2) (not (fp.geq v_prenex_2 .cse3)) (not (fp.leq (fp.add roundNearestTiesToEven .cse2 (let ((.cse4 (fp.sub roundNearestTiesToEven v_prenex_2 .cse2))) (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))) .cse3)) (fp.leq v_prenex_2 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)))))) is different from false [2019-11-16 00:00:15,231 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (not (fp.geq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (not (fp.geq (fp.add roundNearestTiesToEven .cse0 (let ((.cse1 (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse0))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))) .cse0)) (fp.geq ULTIMATE.start_main_~I~0 .cse0)))) (exists ((v_prenex_2 (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq v_prenex_2 .cse2) (not (fp.geq v_prenex_2 .cse3)) (not (fp.leq (fp.add roundNearestTiesToEven .cse2 (let ((.cse4 (fp.sub roundNearestTiesToEven v_prenex_2 .cse2))) (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))) .cse3)) (fp.leq v_prenex_2 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)))))) is different from true [2019-11-16 00:00:15,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:00:15,232 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-16 00:00:17,435 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (or (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse1 (fp.add roundNearestTiesToEven .cse2 (let ((.cse3 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~I~0 .cse2))) (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))))) (and (fp.geq .cse1 .cse2) (fp.leq .cse1 .cse0)))))) is different from false [2019-11-16 00:00:19,577 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (or (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse1 (fp.add roundNearestTiesToEven .cse2 (let ((.cse3 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~I~0 .cse2))) (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))))) (and (fp.geq .cse1 .cse2) (fp.leq .cse1 .cse0)))))) is different from true [2019-11-16 00:00:21,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:00:32,427 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~I~0_9 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse0) (fp.leq (fp.add roundNearestTiesToEven .cse1 (let ((.cse2 (fp.sub roundNearestTiesToEven v_ULTIMATE.start_main_~I~0_9 .cse1))) (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))) .cse0) (not (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse1)) (not (fp.leq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)))))) (forall ((v_ULTIMATE.start_main_~I~0_9 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (fp.geq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (not (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse3)) (not (fp.leq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) roundNearestTiesToEven 3.0))) (fp.geq (fp.add roundNearestTiesToEven .cse3 (let ((.cse4 (fp.sub roundNearestTiesToEven v_ULTIMATE.start_main_~I~0_9 .cse3))) (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))) .cse3))))) is different from false [2019-11-16 00:00:34,722 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~I~0_9 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse0) (fp.leq (fp.add roundNearestTiesToEven .cse1 (let ((.cse2 (fp.sub roundNearestTiesToEven v_ULTIMATE.start_main_~I~0_9 .cse1))) (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse2 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))) .cse0) (not (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse1)) (not (fp.leq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)))))) (forall ((v_ULTIMATE.start_main_~I~0_9 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (or (fp.geq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (not (fp.geq v_ULTIMATE.start_main_~I~0_9 .cse3)) (not (fp.leq v_ULTIMATE.start_main_~I~0_9 ((_ to_fp 11 53) roundNearestTiesToEven 3.0))) (fp.geq (fp.add roundNearestTiesToEven .cse3 (let ((.cse4 (fp.sub roundNearestTiesToEven v_ULTIMATE.start_main_~I~0_9 .cse3))) (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse4 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))) .cse3))))) is different from true [2019-11-16 00:00:34,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:00:34,724 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [555303658] [2019-11-16 00:00:34,724 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:00:34,724 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 10 [2019-11-16 00:00:34,724 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230471064] [2019-11-16 00:00:34,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-16 00:00:34,726 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-16 00:00:34,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-16 00:00:34,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=14, Unknown=9, NotChecked=50, Total=90 [2019-11-16 00:00:34,727 INFO L87 Difference]: Start difference. First operand 7 states and 6 transitions. Second operand 10 states. [2019-11-16 00:00:36,894 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (or (fp.geq c_ULTIMATE.start_main_~I~0 .cse1) (let ((.cse2 (fp.add roundNearestTiesToEven .cse0 (let ((.cse3 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~I~0 .cse0))) (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))))) (and (fp.geq .cse2 .cse0) (fp.leq .cse2 .cse1))))))) is different from false [2019-11-16 00:00:39,045 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.leq c_ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (fp.geq c_ULTIMATE.start_main_~I~0 .cse0) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (or (fp.geq c_ULTIMATE.start_main_~I~0 .cse1) (let ((.cse2 (fp.add roundNearestTiesToEven .cse0 (let ((.cse3 (fp.sub roundNearestTiesToEven c_ULTIMATE.start_main_~I~0 .cse0))) (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))))) (and (fp.geq .cse2 .cse0) (fp.leq .cse2 .cse1))))))) is different from true [2019-11-16 00:00:41,202 WARN L838 $PredicateComparison]: unable to prove that (and (fp.leq c_ULTIMATE.start_main_~S~0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= (fp.add roundNearestTiesToEven .cse0 (let ((.cse1 (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse0))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))) c_ULTIMATE.start_main_~S~0) (not (fp.geq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (fp.geq ULTIMATE.start_main_~I~0 .cse0)))) (fp.geq c_ULTIMATE.start_main_~S~0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) is different from false [2019-11-16 00:00:43,379 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) (and (or (and (= (bvadd c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse0 (fp.add roundNearestTiesToEven .cse1 (let ((.cse3 (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse1))) (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0)))))))))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq .cse0 .cse1) (not (fp.geq ULTIMATE.start_main_~I~0 .cse2)) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (fp.geq ULTIMATE.start_main_~I~0 .cse1) (fp.leq .cse0 .cse2)))))) (and (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (not (fp.geq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (not (fp.geq (fp.add roundNearestTiesToEven .cse4 (let ((.cse5 (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse4))) (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))) .cse4)) (fp.geq ULTIMATE.start_main_~I~0 .cse4)))) .cse6) (and (exists ((ULTIMATE.start_main_~I~0 (_ FloatingPoint 11 53))) (let ((.cse7 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse8 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (not (fp.geq ULTIMATE.start_main_~I~0 .cse7)) (not (fp.leq (fp.add roundNearestTiesToEven .cse8 (let ((.cse9 (fp.sub roundNearestTiesToEven ULTIMATE.start_main_~I~0 .cse8))) (fp.mul roundNearestTiesToEven .cse9 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse9 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse9 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))) .cse7)) (fp.leq ULTIMATE.start_main_~I~0 ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (fp.geq ULTIMATE.start_main_~I~0 .cse8)))) .cse6)) (not .cse6))) is different from false [2019-11-16 00:00:43,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:00:43,389 INFO L93 Difference]: Finished difference Result 7 states and 6 transitions. [2019-11-16 00:00:43,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:00:43,390 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-11-16 00:00:43,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:00:43,390 INFO L225 Difference]: With dead ends: 7 [2019-11-16 00:00:43,390 INFO L226 Difference]: Without dead ends: 0 [2019-11-16 00:00:43,391 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 28.4s TimeCoverageRelationStatistics Valid=23, Invalid=16, Unknown=13, NotChecked=104, Total=156 [2019-11-16 00:00:43,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-16 00:00:43,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-16 00:00:43,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-16 00:00:43,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-16 00:00:43,392 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2019-11-16 00:00:43,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:00:43,393 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:00:43,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-16 00:00:43,393 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:00:43,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-16 00:00:43,593 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-16 00:00:43,597 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-16 00:00:43,636 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 11) no Hoare annotation was computed. [2019-11-16 00:00:43,636 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-16 00:00:43,636 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-16 00:00:43,636 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-16 00:00:43,636 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-16 00:00:43,637 INFO L446 ceAbstractionStarter]: At program point L26(lines 15 27) the Hoare annotation is: true [2019-11-16 00:00:43,637 INFO L443 ceAbstractionStarter]: For program point L22(lines 22 23) no Hoare annotation was computed. [2019-11-16 00:00:43,637 INFO L443 ceAbstractionStarter]: For program point L22-2(lines 22 23) no Hoare annotation was computed. [2019-11-16 00:00:43,637 INFO L443 ceAbstractionStarter]: For program point L11(line 11) no Hoare annotation was computed. [2019-11-16 00:00:43,637 INFO L443 ceAbstractionStarter]: For program point L11-1(line 11) no Hoare annotation was computed. [2019-11-16 00:00:43,637 INFO L446 ceAbstractionStarter]: At program point L11-3(line 11) the Hoare annotation is: true [2019-11-16 00:00:43,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:00:43 BoogieIcfgContainer [2019-11-16 00:00:43,643 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:00:43,643 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:00:43,644 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:00:43,644 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:00:43,644 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:58:32" (3/4) ... [2019-11-16 00:00:43,648 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-16 00:00:43,658 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-16 00:00:43,659 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-16 00:00:43,712 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_08c98f4e-dbb0-46c0-ab82-3f6bd29eed1d/bin/uautomizer/witness.graphml [2019-11-16 00:00:43,714 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:00:43,716 INFO L168 Benchmark]: Toolchain (without parser) took 136055.42 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 952.3 MB in the beginning and 1.0 GB in the end (delta: -55.8 MB). Peak memory consumption was 54.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:00:43,717 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:00:43,717 INFO L168 Benchmark]: CACSL2BoogieTranslator took 276.66 ms. Allocated memory is still 1.0 GB. Free memory was 952.3 MB in the beginning and 941.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:00:43,718 INFO L168 Benchmark]: Boogie Procedure Inliner took 90.63 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -164.4 MB). Peak memory consumption was 12.3 MB. Max. memory is 11.5 GB. [2019-11-16 00:00:43,719 INFO L168 Benchmark]: Boogie Preprocessor took 24.46 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:00:43,719 INFO L168 Benchmark]: RCFGBuilder took 4423.22 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: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:00:43,719 INFO L168 Benchmark]: TraceAbstraction took 131164.56 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 68.5 MB). Peak memory consumption was 68.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:00:43,720 INFO L168 Benchmark]: Witness Printer took 70.77 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:00:43,729 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 276.66 ms. Allocated memory is still 1.0 GB. Free memory was 952.3 MB in the beginning and 941.6 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.63 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 941.6 MB in the beginning and 1.1 GB in the end (delta: -164.4 MB). Peak memory consumption was 12.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.46 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 4423.22 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: 15.7 MB). Peak memory consumption was 15.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 131164.56 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 68.5 MB). Peak memory consumption was 68.5 MB. Max. memory is 11.5 GB. * Witness Printer took 70.77 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 11]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 1 error locations. Result: SAFE, OverallTime: 131.1s, OverallIterations: 2, TraceHistogramMax: 1, AutomataDifference: 21.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 12 SDtfs, 3 SDslu, 34 SDs, 0 SdLazy, 4 SolverSat, 1 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 61.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 6 NumberOfFragments, 2 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 11.4s SatisfiabilityAnalysisTime, 97.4s InterpolantComputationTime, 12 NumberOfCodeBlocks, 12 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 20 ConstructedInterpolants, 8 QuantifiedInterpolants, 7215 SizeOfPredicates, 9 NumberOfNonLiveVariables, 22 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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 proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...