./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/sqrt_Newton_pseudoconstant.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_bff30e8a-069a-475a-80dd-b4e73e5c6a41/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_bff30e8a-069a-475a-80dd-b4e73e5c6a41/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_bff30e8a-069a-475a-80dd-b4e73e5c6a41/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_bff30e8a-069a-475a-80dd-b4e73e5c6a41/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_Newton_pseudoconstant.c -s /tmp/vcloud-vcloud-master/worker/run_dir_bff30e8a-069a-475a-80dd-b4e73e5c6a41/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_bff30e8a-069a-475a-80dd-b4e73e5c6a41/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a9874b894e580352626d8ebc271850c0b42d4635 .................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_bff30e8a-069a-475a-80dd-b4e73e5c6a41/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_bff30e8a-069a-475a-80dd-b4e73e5c6a41/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_bff30e8a-069a-475a-80dd-b4e73e5c6a41/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_bff30e8a-069a-475a-80dd-b4e73e5c6a41/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/sqrt_Newton_pseudoconstant.c -s /tmp/vcloud-vcloud-master/worker/run_dir_bff30e8a-069a-475a-80dd-b4e73e5c6a41/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_bff30e8a-069a-475a-80dd-b4e73e5c6a41/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a9874b894e580352626d8ebc271850c0b42d4635 .................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-29 19:17:42,056 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-29 19:17:42,059 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-29 19:17:42,133 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-29 19:17:42,134 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-29 19:17:42,140 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-29 19:17:42,144 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-29 19:17:42,153 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-29 19:17:42,156 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-29 19:17:42,177 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-29 19:17:42,179 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-29 19:17:42,181 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-29 19:17:42,191 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-29 19:17:42,194 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-29 19:17:42,196 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-29 19:17:42,198 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-29 19:17:42,199 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-29 19:17:42,201 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-29 19:17:42,203 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-29 19:17:42,206 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-29 19:17:42,209 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-29 19:17:42,210 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-29 19:17:42,212 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-29 19:17:42,214 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-29 19:17:42,218 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-29 19:17:42,218 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-29 19:17:42,219 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-29 19:17:42,221 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-29 19:17:42,221 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-29 19:17:42,223 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-29 19:17:42,224 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-29 19:17:42,225 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-29 19:17:42,226 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-29 19:17:42,227 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-29 19:17:42,229 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-29 19:17:42,229 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-29 19:17:42,231 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-29 19:17:42,231 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-29 19:17:42,232 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-29 19:17:42,233 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-29 19:17:42,234 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-29 19:17:42,236 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_bff30e8a-069a-475a-80dd-b4e73e5c6a41/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-29 19:17:42,267 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-29 19:17:42,267 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-29 19:17:42,269 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-29 19:17:42,269 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-29 19:17:42,269 INFO L138 SettingsManager]: * Use SBE=true [2020-11-29 19:17:42,270 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-29 19:17:42,270 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-29 19:17:42,270 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-29 19:17:42,271 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-29 19:17:42,271 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-29 19:17:42,271 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-29 19:17:42,272 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-29 19:17:42,272 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-29 19:17:42,272 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-29 19:17:42,273 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-29 19:17:42,273 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-29 19:17:42,273 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-29 19:17:42,273 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-29 19:17:42,274 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-29 19:17:42,274 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-29 19:17:42,274 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-29 19:17:42,275 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-29 19:17:42,275 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-29 19:17:42,275 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-29 19:17:42,276 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-29 19:17:42,276 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-29 19:17:42,276 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-29 19:17:42,277 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-29 19:17:42,277 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-29 19:17:42,277 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_bff30e8a-069a-475a-80dd-b4e73e5c6a41/bin/uautomizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_bff30e8a-069a-475a-80dd-b4e73e5c6a41/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a9874b894e580352626d8ebc271850c0b42d4635 [2020-11-29 19:17:42,570 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-29 19:17:42,611 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-29 19:17:42,614 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-29 19:17:42,616 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-29 19:17:42,619 INFO L275 PluginConnector]: CDTParser initialized [2020-11-29 19:17:42,620 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_bff30e8a-069a-475a-80dd-b4e73e5c6a41/bin/uautomizer/../../sv-benchmarks/c/float-benchs/sqrt_Newton_pseudoconstant.c [2020-11-29 19:17:42,712 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bff30e8a-069a-475a-80dd-b4e73e5c6a41/bin/uautomizer/data/2d052f123/4f5a469eef584add9c94aa247ae16d76/FLAGaae53addb [2020-11-29 19:17:43,314 INFO L306 CDTParser]: Found 1 translation units. [2020-11-29 19:17:43,319 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_bff30e8a-069a-475a-80dd-b4e73e5c6a41/sv-benchmarks/c/float-benchs/sqrt_Newton_pseudoconstant.c [2020-11-29 19:17:43,330 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bff30e8a-069a-475a-80dd-b4e73e5c6a41/bin/uautomizer/data/2d052f123/4f5a469eef584add9c94aa247ae16d76/FLAGaae53addb [2020-11-29 19:17:43,669 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_bff30e8a-069a-475a-80dd-b4e73e5c6a41/bin/uautomizer/data/2d052f123/4f5a469eef584add9c94aa247ae16d76 [2020-11-29 19:17:43,672 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-29 19:17:43,674 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-29 19:17:43,681 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-29 19:17:43,681 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-29 19:17:43,685 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-29 19:17:43,688 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:17:43" (1/1) ... [2020-11-29 19:17:43,691 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c1b230a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:17:43, skipping insertion in model container [2020-11-29 19:17:43,691 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:17:43" (1/1) ... [2020-11-29 19:17:43,700 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-29 19:17:43,723 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-29 19:17:43,946 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 19:17:43,956 INFO L203 MainTranslator]: Completed pre-run [2020-11-29 19:17:43,980 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 19:17:44,001 INFO L208 MainTranslator]: Completed translation [2020-11-29 19:17:44,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:17:44 WrapperNode [2020-11-29 19:17:44,003 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-29 19:17:44,005 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-29 19:17:44,005 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-29 19:17:44,006 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-29 19:17:44,017 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:17:44" (1/1) ... [2020-11-29 19:17:44,032 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:17:44" (1/1) ... [2020-11-29 19:17:44,071 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-29 19:17:44,073 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-29 19:17:44,074 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-29 19:17:44,074 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-29 19:17:44,084 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:17:44" (1/1) ... [2020-11-29 19:17:44,085 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:17:44" (1/1) ... [2020-11-29 19:17:44,104 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:17:44" (1/1) ... [2020-11-29 19:17:44,105 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:17:44" (1/1) ... [2020-11-29 19:17:44,111 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:17:44" (1/1) ... [2020-11-29 19:17:44,119 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:17:44" (1/1) ... [2020-11-29 19:17:44,124 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:17:44" (1/1) ... [2020-11-29 19:17:44,137 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-29 19:17:44,139 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-29 19:17:44,139 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-29 19:17:44,139 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-29 19:17:44,144 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:17:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bff30e8a-069a-475a-80dd-b4e73e5c6a41/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-29 19:17:44,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-29 19:17:44,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-29 19:17:44,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-29 19:17:44,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-29 19:17:44,656 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-29 19:17:44,657 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-29 19:17:44,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:17:44 BoogieIcfgContainer [2020-11-29 19:17:44,658 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-29 19:17:44,676 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-29 19:17:44,676 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-29 19:17:44,691 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-29 19:17:44,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 07:17:43" (1/3) ... [2020-11-29 19:17:44,692 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@481c875 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 07:17:44, skipping insertion in model container [2020-11-29 19:17:44,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:17:44" (2/3) ... [2020-11-29 19:17:44,693 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@481c875 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 07:17:44, skipping insertion in model container [2020-11-29 19:17:44,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:17:44" (3/3) ... [2020-11-29 19:17:44,695 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt_Newton_pseudoconstant.c [2020-11-29 19:17:44,723 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-29 19:17:44,728 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-29 19:17:44,748 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-29 19:17:44,793 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-29 19:17:44,793 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-29 19:17:44,794 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-29 19:17:44,795 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-29 19:17:44,796 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-29 19:17:44,796 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-29 19:17:44,796 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-29 19:17:44,796 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-29 19:17:44,817 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2020-11-29 19:17:44,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-29 19:17:44,825 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:17:44,826 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:17:44,827 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:17:44,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:17:44,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1569195288, now seen corresponding path program 1 times [2020-11-29 19:17:44,847 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:17:44,848 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046979613] [2020-11-29 19:17:44,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:17:45,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:17:45,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:17:45,080 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046979613] [2020-11-29 19:17:45,081 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:17:45,081 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-29 19:17:45,083 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869512833] [2020-11-29 19:17:45,088 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-11-29 19:17:45,089 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:17:45,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-11-29 19:17:45,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-11-29 19:17:45,111 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2020-11-29 19:17:45,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:17:45,134 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2020-11-29 19:17:45,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-11-29 19:17:45,136 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2020-11-29 19:17:45,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:17:45,149 INFO L225 Difference]: With dead ends: 35 [2020-11-29 19:17:45,150 INFO L226 Difference]: Without dead ends: 14 [2020-11-29 19:17:45,154 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-11-29 19:17:45,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-11-29 19:17:45,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-11-29 19:17:45,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-11-29 19:17:45,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2020-11-29 19:17:45,196 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 12 [2020-11-29 19:17:45,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:17:45,196 INFO L481 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2020-11-29 19:17:45,197 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-11-29 19:17:45,198 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2020-11-29 19:17:45,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-29 19:17:45,199 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:17:45,199 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:17:45,199 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-29 19:17:45,200 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:17:45,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:17:45,204 INFO L82 PathProgramCache]: Analyzing trace with hash -2049407722, now seen corresponding path program 1 times [2020-11-29 19:17:45,205 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:17:45,206 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412285525] [2020-11-29 19:17:45,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:17:45,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:17:45,292 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:17:45,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:17:45,323 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:17:45,347 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:17:45,348 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-29 19:17:45,349 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-29 19:17:45,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 07:17:45 BoogieIcfgContainer [2020-11-29 19:17:45,378 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-29 19:17:45,379 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-29 19:17:45,379 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-29 19:17:45,379 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-29 19:17:45,380 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:17:44" (3/4) ... [2020-11-29 19:17:45,395 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-11-29 19:17:45,395 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-29 19:17:45,397 INFO L168 Benchmark]: Toolchain (without parser) took 1722.31 ms. Allocated memory was 98.6 MB in the beginning and 119.5 MB in the end (delta: 21.0 MB). Free memory was 69.2 MB in the beginning and 98.1 MB in the end (delta: -28.9 MB). Peak memory consumption was 34.8 MB. Max. memory is 16.1 GB. [2020-11-29 19:17:45,398 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 98.6 MB. Free memory was 55.5 MB in the beginning and 55.4 MB in the end (delta: 62.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 19:17:45,399 INFO L168 Benchmark]: CACSL2BoogieTranslator took 323.49 ms. Allocated memory is still 98.6 MB. Free memory was 68.9 MB in the beginning and 75.6 MB in the end (delta: -6.7 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-29 19:17:45,400 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.52 ms. Allocated memory is still 98.6 MB. Free memory was 75.6 MB in the beginning and 73.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 19:17:45,401 INFO L168 Benchmark]: Boogie Preprocessor took 65.16 ms. Allocated memory is still 98.6 MB. Free memory was 73.9 MB in the beginning and 72.9 MB in the end (delta: 984.4 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 19:17:45,401 INFO L168 Benchmark]: RCFGBuilder took 519.74 ms. Allocated memory is still 98.6 MB. Free memory was 72.9 MB in the beginning and 59.2 MB in the end (delta: 13.7 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-11-29 19:17:45,402 INFO L168 Benchmark]: TraceAbstraction took 702.17 ms. Allocated memory is still 98.6 MB. Free memory was 58.9 MB in the beginning and 37.6 MB in the end (delta: 21.2 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2020-11-29 19:17:45,403 INFO L168 Benchmark]: Witness Printer took 16.50 ms. Allocated memory was 98.6 MB in the beginning and 119.5 MB in the end (delta: 21.0 MB). Free memory was 37.6 MB in the beginning and 98.1 MB in the end (delta: -60.5 MB). Peak memory consumption was 6.0 MB. Max. memory is 16.1 GB. [2020-11-29 19:17:45,407 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35 ms. Allocated memory is still 98.6 MB. Free memory was 55.5 MB in the beginning and 55.4 MB in the end (delta: 62.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 323.49 ms. Allocated memory is still 98.6 MB. Free memory was 68.9 MB in the beginning and 75.6 MB in the end (delta: -6.7 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 66.52 ms. Allocated memory is still 98.6 MB. Free memory was 75.6 MB in the beginning and 73.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 65.16 ms. Allocated memory is still 98.6 MB. Free memory was 73.9 MB in the beginning and 72.9 MB in the end (delta: 984.4 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 519.74 ms. Allocated memory is still 98.6 MB. Free memory was 72.9 MB in the beginning and 59.2 MB in the end (delta: 13.7 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 702.17 ms. Allocated memory is still 98.6 MB. Free memory was 58.9 MB in the beginning and 37.6 MB in the end (delta: 21.2 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. * Witness Printer took 16.50 ms. Allocated memory was 98.6 MB in the beginning and 119.5 MB in the end (delta: 21.0 MB). Free memory was 37.6 MB in the beginning and 98.1 MB in the end (delta: -60.5 MB). Peak memory consumption was 6.0 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 3]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 52, overapproximation of someUnaryDOUBLEoperation at line 25, overapproximation of someBinaryArithmeticDOUBLEoperation at line 37. Possible FailurePath: [L15] double _EPS = 1e-6; VAL [_EPS=1/1000000] [L42] double d, dd, r; [L43] double epsilon = 1e-8; [L45] d = 1. VAL [_EPS=1/1000000] [L45] COND TRUE d <= 20. [L47] dd = __VERIFIER_nondet_double() [L11] COND FALSE !(!cond) VAL [_EPS=1/1000000] [L19] double xn, xnp1, residu, lsup, linf; [L20] int i, cond; VAL [_EPS=1/1000000] [L21] COND TRUE Input <= 1.0 [L21] xn = 1.0 VAL [_EPS=1/1000000] [L22] xnp1 = xn [L23] residu = 2.0*_EPS*(xn+xnp1) [L24] lsup = _EPS * (xn+xnp1) [L25] linf = -lsup [L26] cond = ((residu > lsup) || (residu < linf)) [L27] i = 0 VAL [_EPS=1/1000000] [L28] COND FALSE !(\read(cond)) VAL [_EPS=1/1000000] [L37] return 1.0 / xnp1; VAL [_EPS=1/1000000] [L50] r = SqrtR(dd) [L13] COND TRUE !(cond) VAL [_EPS=1/1000000] [L3] __assert_fail("0", "sqrt_Newton_pseudoconstant.c", 3, "reach_error") VAL [_EPS=1/1000000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 0.5s, OverallIterations: 2, TraceHistogramMax: 1, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 20 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 11 ConstructedInterpolants, 0 QuantifiedInterpolants, 121 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.0-a4ecdab [2020-11-29 19:17:48,230 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-29 19:17:48,234 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-29 19:17:48,286 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-29 19:17:48,287 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-29 19:17:48,296 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-29 19:17:48,299 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-29 19:17:48,305 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-29 19:17:48,309 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-29 19:17:48,316 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-29 19:17:48,319 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-29 19:17:48,330 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-29 19:17:48,331 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-29 19:17:48,334 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-29 19:17:48,336 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-29 19:17:48,338 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-29 19:17:48,340 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-29 19:17:48,346 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-29 19:17:48,349 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-29 19:17:48,353 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-29 19:17:48,358 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-29 19:17:48,360 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-29 19:17:48,361 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-29 19:17:48,362 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-29 19:17:48,365 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-29 19:17:48,366 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-29 19:17:48,366 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-29 19:17:48,368 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-29 19:17:48,368 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-29 19:17:48,370 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-29 19:17:48,370 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-29 19:17:48,371 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-29 19:17:48,372 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-29 19:17:48,373 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-29 19:17:48,375 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-29 19:17:48,375 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-29 19:17:48,376 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-29 19:17:48,377 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-29 19:17:48,377 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-29 19:17:48,378 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-29 19:17:48,379 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-29 19:17:48,380 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_bff30e8a-069a-475a-80dd-b4e73e5c6a41/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-11-29 19:17:48,413 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-29 19:17:48,414 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-29 19:17:48,415 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-29 19:17:48,415 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-29 19:17:48,416 INFO L138 SettingsManager]: * Use SBE=true [2020-11-29 19:17:48,416 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-29 19:17:48,416 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-29 19:17:48,417 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-29 19:17:48,417 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-29 19:17:48,417 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-29 19:17:48,417 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-29 19:17:48,417 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-29 19:17:48,418 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-11-29 19:17:48,418 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-11-29 19:17:48,418 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-29 19:17:48,418 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-29 19:17:48,419 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-29 19:17:48,419 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-29 19:17:48,419 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-29 19:17:48,420 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-29 19:17:48,420 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-29 19:17:48,420 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-29 19:17:48,420 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-29 19:17:48,421 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-29 19:17:48,421 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-29 19:17:48,421 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-29 19:17:48,421 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-11-29 19:17:48,422 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-11-29 19:17:48,422 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-29 19:17:48,422 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-29 19:17:48,422 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-29 19:17:48,423 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_bff30e8a-069a-475a-80dd-b4e73e5c6a41/bin/uautomizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_bff30e8a-069a-475a-80dd-b4e73e5c6a41/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a9874b894e580352626d8ebc271850c0b42d4635 [2020-11-29 19:17:48,874 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-29 19:17:48,925 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-29 19:17:48,930 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-29 19:17:48,932 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-29 19:17:48,933 INFO L275 PluginConnector]: CDTParser initialized [2020-11-29 19:17:48,935 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_bff30e8a-069a-475a-80dd-b4e73e5c6a41/bin/uautomizer/../../sv-benchmarks/c/float-benchs/sqrt_Newton_pseudoconstant.c [2020-11-29 19:17:49,035 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bff30e8a-069a-475a-80dd-b4e73e5c6a41/bin/uautomizer/data/faa32d300/82f25a5938604d529b3f0ee7ec1ca4c5/FLAGedec98a5a [2020-11-29 19:17:49,771 INFO L306 CDTParser]: Found 1 translation units. [2020-11-29 19:17:49,773 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_bff30e8a-069a-475a-80dd-b4e73e5c6a41/sv-benchmarks/c/float-benchs/sqrt_Newton_pseudoconstant.c [2020-11-29 19:17:49,782 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bff30e8a-069a-475a-80dd-b4e73e5c6a41/bin/uautomizer/data/faa32d300/82f25a5938604d529b3f0ee7ec1ca4c5/FLAGedec98a5a [2020-11-29 19:17:50,124 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_bff30e8a-069a-475a-80dd-b4e73e5c6a41/bin/uautomizer/data/faa32d300/82f25a5938604d529b3f0ee7ec1ca4c5 [2020-11-29 19:17:50,127 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-29 19:17:50,129 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-29 19:17:50,131 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-29 19:17:50,131 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-29 19:17:50,135 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-29 19:17:50,136 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:17:50" (1/1) ... [2020-11-29 19:17:50,139 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28539fe4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:17:50, skipping insertion in model container [2020-11-29 19:17:50,139 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:17:50" (1/1) ... [2020-11-29 19:17:50,148 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-29 19:17:50,167 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-29 19:17:50,383 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 19:17:50,398 INFO L203 MainTranslator]: Completed pre-run [2020-11-29 19:17:50,425 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 19:17:50,445 INFO L208 MainTranslator]: Completed translation [2020-11-29 19:17:50,445 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:17:50 WrapperNode [2020-11-29 19:17:50,446 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-29 19:17:50,447 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-29 19:17:50,448 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-29 19:17:50,448 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-29 19:17:50,458 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:17:50" (1/1) ... [2020-11-29 19:17:50,470 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:17:50" (1/1) ... [2020-11-29 19:17:50,505 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-29 19:17:50,506 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-29 19:17:50,506 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-29 19:17:50,506 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-29 19:17:50,518 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:17:50" (1/1) ... [2020-11-29 19:17:50,519 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:17:50" (1/1) ... [2020-11-29 19:17:50,556 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:17:50" (1/1) ... [2020-11-29 19:17:50,556 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:17:50" (1/1) ... [2020-11-29 19:17:50,567 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:17:50" (1/1) ... [2020-11-29 19:17:50,588 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:17:50" (1/1) ... [2020-11-29 19:17:50,590 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:17:50" (1/1) ... [2020-11-29 19:17:50,595 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-29 19:17:50,596 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-29 19:17:50,596 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-29 19:17:50,596 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-29 19:17:50,605 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:17:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bff30e8a-069a-475a-80dd-b4e73e5c6a41/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-29 19:17:50,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-11-29 19:17:50,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-29 19:17:50,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-29 19:17:50,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-29 19:18:00,811 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-29 19:18:00,811 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-29 19:18:00,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:18:00 BoogieIcfgContainer [2020-11-29 19:18:00,813 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-29 19:18:00,815 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-29 19:18:00,816 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-29 19:18:00,836 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-29 19:18:00,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 07:17:50" (1/3) ... [2020-11-29 19:18:00,838 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f2875f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 07:18:00, skipping insertion in model container [2020-11-29 19:18:00,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:17:50" (2/3) ... [2020-11-29 19:18:00,839 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f2875f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 07:18:00, skipping insertion in model container [2020-11-29 19:18:00,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:18:00" (3/3) ... [2020-11-29 19:18:00,841 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt_Newton_pseudoconstant.c [2020-11-29 19:18:00,855 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-29 19:18:00,861 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-29 19:18:00,875 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-29 19:18:00,903 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-29 19:18:00,903 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-29 19:18:00,904 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-29 19:18:00,904 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-29 19:18:00,904 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-29 19:18:00,904 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-29 19:18:00,904 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-29 19:18:00,905 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-29 19:18:00,918 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2020-11-29 19:18:00,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-29 19:18:00,925 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:18:00,926 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:18:00,926 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:18:00,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:18:00,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1569195288, now seen corresponding path program 1 times [2020-11-29 19:18:00,947 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-29 19:18:00,947 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1271497930] [2020-11-29 19:18:00,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bff30e8a-069a-475a-80dd-b4e73e5c6a41/bin/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-11-29 19:18:02,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:18:03,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 1 conjunts are in the unsatisfiable core [2020-11-29 19:18:03,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:18:03,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:18:03,050 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-29 19:18:03,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:18:03,058 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1271497930] [2020-11-29 19:18:03,059 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:18:03,060 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-11-29 19:18:03,061 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911530609] [2020-11-29 19:18:03,067 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-11-29 19:18:03,067 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-29 19:18:03,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-11-29 19:18:03,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-11-29 19:18:03,097 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2020-11-29 19:18:03,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:18:03,122 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2020-11-29 19:18:03,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-11-29 19:18:03,124 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2020-11-29 19:18:03,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:18:03,136 INFO L225 Difference]: With dead ends: 35 [2020-11-29 19:18:03,136 INFO L226 Difference]: Without dead ends: 14 [2020-11-29 19:18:03,139 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-11-29 19:18:03,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-11-29 19:18:03,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-11-29 19:18:03,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-11-29 19:18:03,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2020-11-29 19:18:03,178 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 12 [2020-11-29 19:18:03,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:18:03,179 INFO L481 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2020-11-29 19:18:03,179 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-11-29 19:18:03,179 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2020-11-29 19:18:03,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-29 19:18:03,180 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:18:03,181 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:18:03,383 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-11-29 19:18:03,385 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:18:03,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:18:03,386 INFO L82 PathProgramCache]: Analyzing trace with hash -2049407722, now seen corresponding path program 1 times [2020-11-29 19:18:03,387 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-29 19:18:03,388 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1499798428] [2020-11-29 19:18:03,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bff30e8a-069a-475a-80dd-b4e73e5c6a41/bin/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-11-29 19:18:05,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:18:05,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-29 19:18:05,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:18:05,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:18:05,715 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-29 19:18:07,928 WARN L838 $PredicateComparison]: unable to prove that (or (forall ((v_ULTIMATE.start_SqrtR_~linf~0_5 (_ FloatingPoint 11 53))) (fp.lt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) (fp.add c_currentRoundingMode c_ULTIMATE.start_SqrtR_~xn~0 c_ULTIMATE.start_SqrtR_~xn~0)) v_ULTIMATE.start_SqrtR_~linf~0_5)) (let ((.cse0 (fp.add c_currentRoundingMode c_ULTIMATE.start_SqrtR_~xn~0 c_ULTIMATE.start_SqrtR_~xn~0))) (fp.gt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) .cse0) (fp.mul c_currentRoundingMode c_~_EPS~0 .cse0)))) is different from false [2020-11-29 19:18:10,051 WARN L860 $PredicateComparison]: unable to prove that (or (forall ((v_ULTIMATE.start_SqrtR_~linf~0_5 (_ FloatingPoint 11 53))) (fp.lt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) (fp.add c_currentRoundingMode c_ULTIMATE.start_SqrtR_~xn~0 c_ULTIMATE.start_SqrtR_~xn~0)) v_ULTIMATE.start_SqrtR_~linf~0_5)) (let ((.cse0 (fp.add c_currentRoundingMode c_ULTIMATE.start_SqrtR_~xn~0 c_ULTIMATE.start_SqrtR_~xn~0))) (fp.gt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) .cse0) (fp.mul c_currentRoundingMode c_~_EPS~0 .cse0)))) is different from true [2020-11-29 19:18:17,705 WARN L193 SmtUtils]: Spent 4.43 s on a formula simplification. DAG size of input: 15 DAG size of output: 11 [2020-11-29 19:18:17,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:18:17,709 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1499798428] [2020-11-29 19:18:17,709 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:18:17,709 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2020-11-29 19:18:17,710 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363638398] [2020-11-29 19:18:17,711 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-29 19:18:17,712 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-11-29 19:18:17,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-29 19:18:17,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=27, Unknown=2, NotChecked=10, Total=56 [2020-11-29 19:18:17,713 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 8 states. [2020-11-29 19:18:20,113 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_SqrtR_~xn~0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (or (forall ((v_ULTIMATE.start_SqrtR_~linf~0_5 (_ FloatingPoint 11 53))) (fp.lt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) (fp.add c_currentRoundingMode c_ULTIMATE.start_SqrtR_~xn~0 c_ULTIMATE.start_SqrtR_~xn~0)) v_ULTIMATE.start_SqrtR_~linf~0_5)) (let ((.cse0 (fp.add c_currentRoundingMode c_ULTIMATE.start_SqrtR_~xn~0 c_ULTIMATE.start_SqrtR_~xn~0))) (fp.gt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) .cse0) (fp.mul c_currentRoundingMode c_~_EPS~0 .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven) (= c_~_EPS~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0)))) is different from true [2020-11-29 19:18:38,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:18:38,773 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2020-11-29 19:18:39,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 19:18:39,233 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2020-11-29 19:18:39,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:18:39,235 INFO L225 Difference]: With dead ends: 33 [2020-11-29 19:18:39,235 INFO L226 Difference]: Without dead ends: 21 [2020-11-29 19:18:39,236 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=19, Invalid=28, Unknown=3, NotChecked=22, Total=72 [2020-11-29 19:18:39,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-11-29 19:18:39,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2020-11-29 19:18:39,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-11-29 19:18:39,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2020-11-29 19:18:39,243 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 12 [2020-11-29 19:18:39,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:18:39,244 INFO L481 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2020-11-29 19:18:39,244 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-29 19:18:39,244 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2020-11-29 19:18:39,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-29 19:18:39,245 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:18:39,245 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 19:18:39,451 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-11-29 19:18:39,451 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:18:39,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:18:39,452 INFO L82 PathProgramCache]: Analyzing trace with hash -274400360, now seen corresponding path program 1 times [2020-11-29 19:18:39,453 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-11-29 19:18:39,453 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [937479492] [2020-11-29 19:18:39,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bff30e8a-069a-475a-80dd-b4e73e5c6a41/bin/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-11-29 19:18:43,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:18:43,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 21 conjunts are in the unsatisfiable core [2020-11-29 19:18:43,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:18:44,348 WARN L193 SmtUtils]: Spent 526.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2020-11-29 19:18:44,357 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:18:45,085 WARN L193 SmtUtils]: Spent 345.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2020-11-29 19:18:45,633 WARN L193 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2020-11-29 19:18:48,227 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_SqrtR_~Input (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 100000000.0))) (.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= c_ULTIMATE.start_SqrtR_~xn~0 (fp.div c_currentRoundingMode .cse0 ULTIMATE.start_SqrtR_~Input)) (fp.leq ULTIMATE.start_SqrtR_~Input (fp.add c_currentRoundingMode .cse0 .cse1)) (fp.geq ULTIMATE.start_SqrtR_~Input (fp.sub c_currentRoundingMode .cse0 .cse1)) (not (fp.leq ULTIMATE.start_SqrtR_~Input .cse0))))) (= c_currentRoundingMode roundNearestTiesToEven) (= c_~_EPS~0 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0)))) is different from false [2020-11-29 19:18:48,245 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 19:18:48,248 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 19:18:51,502 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_currentRoundingMode roundNearestTiesToEven)) (.cse6 (= (_ bv1 32) c_ULTIMATE.start_SqrtR_~cond~0))) (or (and .cse0 (exists ((ULTIMATE.start_SqrtR_~Input (_ FloatingPoint 11 53))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 100000000.0))) (.cse5 (fp.div c_currentRoundingMode .cse1 ULTIMATE.start_SqrtR_~Input))) (and (fp.leq ULTIMATE.start_SqrtR_~Input (fp.add c_currentRoundingMode .cse1 .cse2)) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0))) (.cse4 (fp.add c_currentRoundingMode .cse5 c_ULTIMATE.start_SqrtR_~xnp1~0))) (fp.gt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) .cse3) .cse4) (fp.mul c_currentRoundingMode .cse3 .cse4))) (fp.geq ULTIMATE.start_SqrtR_~Input (fp.sub c_currentRoundingMode .cse1 .cse2)) (not (fp.leq ULTIMATE.start_SqrtR_~Input .cse1)) (= c_ULTIMATE.start_SqrtR_~xnp1~0 .cse5))))) .cse6) (and .cse0 (exists ((ULTIMATE.start_SqrtR_~Input (_ FloatingPoint 11 53)) (ULTIMATE.start_SqrtR_~linf~0 (_ FloatingPoint 11 53))) (let ((.cse10 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse12 (fp.div c_currentRoundingMode .cse10 ULTIMATE.start_SqrtR_~Input))) (let ((.cse8 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0))) (.cse9 (fp.add c_currentRoundingMode .cse12 c_ULTIMATE.start_SqrtR_~xnp1~0))) (let ((.cse7 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) .cse8) .cse9)) (.cse11 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 100000000.0)))) (and (not (fp.gt .cse7 (fp.mul c_currentRoundingMode .cse8 .cse9))) (not (fp.lt .cse7 ULTIMATE.start_SqrtR_~linf~0)) (fp.leq ULTIMATE.start_SqrtR_~Input (fp.add c_currentRoundingMode .cse10 .cse11)) (fp.geq ULTIMATE.start_SqrtR_~Input (fp.sub c_currentRoundingMode .cse10 .cse11)) (not (fp.leq ULTIMATE.start_SqrtR_~Input .cse10)) (= c_ULTIMATE.start_SqrtR_~xnp1~0 .cse12))))))) (= (_ bv0 32) c_ULTIMATE.start_SqrtR_~cond~0)) (and .cse0 (exists ((ULTIMATE.start_SqrtR_~Input (_ FloatingPoint 11 53)) (ULTIMATE.start_SqrtR_~linf~0 (_ FloatingPoint 11 53))) (let ((.cse14 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse15 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 100000000.0))) (.cse13 (fp.div c_currentRoundingMode .cse14 ULTIMATE.start_SqrtR_~Input))) (and (fp.lt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0))) (fp.add c_currentRoundingMode .cse13 c_ULTIMATE.start_SqrtR_~xnp1~0)) ULTIMATE.start_SqrtR_~linf~0) (fp.leq ULTIMATE.start_SqrtR_~Input (fp.add c_currentRoundingMode .cse14 .cse15)) (fp.geq ULTIMATE.start_SqrtR_~Input (fp.sub c_currentRoundingMode .cse14 .cse15)) (not (fp.leq ULTIMATE.start_SqrtR_~Input .cse14)) (= c_ULTIMATE.start_SqrtR_~xnp1~0 .cse13))))) .cse6))) is different from false [2020-11-29 19:18:54,055 WARN L838 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (exists ((ULTIMATE.start_SqrtR_~Input (_ FloatingPoint 11 53)) (ULTIMATE.start_SqrtR_~linf~0 (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse5 (fp.div c_currentRoundingMode .cse3 ULTIMATE.start_SqrtR_~Input))) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0))) (.cse2 (fp.add c_currentRoundingMode .cse5 c_ULTIMATE.start_SqrtR_~xnp1~0))) (let ((.cse0 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) .cse1) .cse2)) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 100000000.0)))) (and (not (fp.gt .cse0 (fp.mul c_currentRoundingMode .cse1 .cse2))) (not (fp.lt .cse0 ULTIMATE.start_SqrtR_~linf~0)) (fp.leq ULTIMATE.start_SqrtR_~Input (fp.add c_currentRoundingMode .cse3 .cse4)) (fp.geq ULTIMATE.start_SqrtR_~Input (fp.sub c_currentRoundingMode .cse3 .cse4)) (not (fp.leq ULTIMATE.start_SqrtR_~Input .cse3)) (= c_ULTIMATE.start_SqrtR_~xnp1~0 .cse5)))))))) is different from false [2020-11-29 19:18:57,087 WARN L838 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (exists ((ULTIMATE.start_SqrtR_~Input (_ FloatingPoint 11 53)) (ULTIMATE.start_SqrtR_~linf~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse1 (fp.div c_currentRoundingMode .cse0 ULTIMATE.start_SqrtR_~Input))) (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0))) (.cse5 (fp.add c_currentRoundingMode .cse1 .cse1))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 100000000.0))) (.cse3 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) .cse4) .cse5))) (and (= |c_ULTIMATE.start_SqrtR_#res| (fp.div c_currentRoundingMode .cse0 .cse1)) (fp.leq ULTIMATE.start_SqrtR_~Input (fp.add c_currentRoundingMode .cse0 .cse2)) (fp.geq ULTIMATE.start_SqrtR_~Input (fp.sub c_currentRoundingMode .cse0 .cse2)) (not (fp.lt .cse3 ULTIMATE.start_SqrtR_~linf~0)) (not (fp.gt .cse3 (fp.mul c_currentRoundingMode .cse4 .cse5))) (not (fp.leq ULTIMATE.start_SqrtR_~Input .cse0))))))))) is different from false [2020-11-29 19:18:57,104 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 19:19:03,211 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 19:19:22,988 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse6 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) (or (and (exists ((ULTIMATE.start_SqrtR_~Input (_ FloatingPoint 11 53)) (ULTIMATE.start_SqrtR_~linf~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse5 (fp.div roundNearestTiesToEven .cse0 ULTIMATE.start_SqrtR_~Input))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (.cse4 (fp.add roundNearestTiesToEven .cse5 .cse5))) (let ((.cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse3) .cse4)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 100000000.0)))) (and (fp.geq ULTIMATE.start_SqrtR_~Input (fp.sub roundNearestTiesToEven .cse0 .cse1)) (not (fp.lt .cse2 ULTIMATE.start_SqrtR_~linf~0)) (not (fp.leq ULTIMATE.start_SqrtR_~Input .cse0)) (not (fp.gt .cse2 (fp.mul roundNearestTiesToEven .cse3 .cse4))) (not (fp.leq (fp.div roundNearestTiesToEven .cse0 .cse5) ((_ to_fp 11 53) roundNearestTiesToEven 5.0))) (fp.leq ULTIMATE.start_SqrtR_~Input (fp.add roundNearestTiesToEven .cse0 .cse1)))))))) .cse6) (and (exists ((ULTIMATE.start_SqrtR_~Input (_ FloatingPoint 11 53)) (ULTIMATE.start_SqrtR_~linf~0 (_ FloatingPoint 11 53))) (let ((.cse7 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse10 (fp.div roundNearestTiesToEven .cse7 ULTIMATE.start_SqrtR_~Input))) (let ((.cse11 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (.cse12 (fp.add roundNearestTiesToEven .cse10 .cse10))) (let ((.cse9 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse11) .cse12)) (.cse8 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 100000000.0)))) (and (fp.geq ULTIMATE.start_SqrtR_~Input (fp.sub roundNearestTiesToEven .cse7 .cse8)) (not (fp.lt .cse9 ULTIMATE.start_SqrtR_~linf~0)) (not (fp.geq (fp.div roundNearestTiesToEven .cse7 .cse10) ((_ to_fp 11 53) roundNearestTiesToEven (/ 9.0 10.0)))) (not (fp.leq ULTIMATE.start_SqrtR_~Input .cse7)) (not (fp.gt .cse9 (fp.mul roundNearestTiesToEven .cse11 .cse12))) (fp.leq ULTIMATE.start_SqrtR_~Input (fp.add roundNearestTiesToEven .cse7 .cse8)))))))) .cse6) (and (= (bvadd c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (exists ((ULTIMATE.start_SqrtR_~Input (_ FloatingPoint 11 53)) (ULTIMATE.start_SqrtR_~linf~0 (_ FloatingPoint 11 53))) (let ((.cse13 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse19 (fp.div roundNearestTiesToEven .cse13 ULTIMATE.start_SqrtR_~Input))) (let ((.cse17 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (.cse18 (fp.add roundNearestTiesToEven .cse19 .cse19))) (let ((.cse16 (fp.div roundNearestTiesToEven .cse13 .cse19)) (.cse15 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse17) .cse18)) (.cse14 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 100000000.0)))) (and (fp.geq ULTIMATE.start_SqrtR_~Input (fp.sub roundNearestTiesToEven .cse13 .cse14)) (not (fp.lt .cse15 ULTIMATE.start_SqrtR_~linf~0)) (fp.geq .cse16 ((_ to_fp 11 53) roundNearestTiesToEven (/ 9.0 10.0))) (fp.leq .cse16 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (not (fp.leq ULTIMATE.start_SqrtR_~Input .cse13)) (not (fp.gt .cse15 (fp.mul roundNearestTiesToEven .cse17 .cse18))) (fp.leq ULTIMATE.start_SqrtR_~Input (fp.add roundNearestTiesToEven .cse13 .cse14))))))))))) is different from false [2020-11-29 19:19:39,202 WARN L838 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_SqrtR_~Input (_ FloatingPoint 11 53)) (ULTIMATE.start_SqrtR_~linf~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse5 (fp.div roundNearestTiesToEven .cse0 ULTIMATE.start_SqrtR_~Input))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (.cse4 (fp.add roundNearestTiesToEven .cse5 .cse5))) (let ((.cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse3) .cse4)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 100000000.0)))) (and (fp.geq ULTIMATE.start_SqrtR_~Input (fp.sub roundNearestTiesToEven .cse0 .cse1)) (not (fp.lt .cse2 ULTIMATE.start_SqrtR_~linf~0)) (not (fp.leq ULTIMATE.start_SqrtR_~Input .cse0)) (not (fp.gt .cse2 (fp.mul roundNearestTiesToEven .cse3 .cse4))) (not (fp.leq (fp.div roundNearestTiesToEven .cse0 .cse5) ((_ to_fp 11 53) roundNearestTiesToEven 5.0))) (fp.leq ULTIMATE.start_SqrtR_~Input (fp.add roundNearestTiesToEven .cse0 .cse1)))))))) (exists ((v_prenex_1 (_ FloatingPoint 11 53)) (v_prenex_2 (_ FloatingPoint 11 53))) (let ((.cse9 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse10 (fp.div roundNearestTiesToEven .cse9 v_prenex_1))) (let ((.cse7 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (.cse8 (fp.add roundNearestTiesToEven .cse10 .cse10))) (let ((.cse11 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 100000000.0))) (.cse6 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse7) .cse8))) (and (not (fp.gt .cse6 (fp.mul roundNearestTiesToEven .cse7 .cse8))) (not (fp.leq v_prenex_1 .cse9)) (not (fp.geq (fp.div roundNearestTiesToEven .cse9 .cse10) ((_ to_fp 11 53) roundNearestTiesToEven (/ 9.0 10.0)))) (fp.geq v_prenex_1 (fp.sub roundNearestTiesToEven .cse9 .cse11)) (fp.leq v_prenex_1 (fp.add roundNearestTiesToEven .cse9 .cse11)) (not (fp.lt .cse6 v_prenex_2))))))))) is different from false [2020-11-29 19:19:42,065 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_SqrtR_~Input (_ FloatingPoint 11 53)) (ULTIMATE.start_SqrtR_~linf~0 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse5 (fp.div roundNearestTiesToEven .cse0 ULTIMATE.start_SqrtR_~Input))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (.cse4 (fp.add roundNearestTiesToEven .cse5 .cse5))) (let ((.cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse3) .cse4)) (.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 100000000.0)))) (and (fp.geq ULTIMATE.start_SqrtR_~Input (fp.sub roundNearestTiesToEven .cse0 .cse1)) (not (fp.lt .cse2 ULTIMATE.start_SqrtR_~linf~0)) (not (fp.leq ULTIMATE.start_SqrtR_~Input .cse0)) (not (fp.gt .cse2 (fp.mul roundNearestTiesToEven .cse3 .cse4))) (not (fp.leq (fp.div roundNearestTiesToEven .cse0 .cse5) ((_ to_fp 11 53) roundNearestTiesToEven 5.0))) (fp.leq ULTIMATE.start_SqrtR_~Input (fp.add roundNearestTiesToEven .cse0 .cse1)))))))) (exists ((v_prenex_1 (_ FloatingPoint 11 53)) (v_prenex_2 (_ FloatingPoint 11 53))) (let ((.cse9 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse10 (fp.div roundNearestTiesToEven .cse9 v_prenex_1))) (let ((.cse7 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (.cse8 (fp.add roundNearestTiesToEven .cse10 .cse10))) (let ((.cse11 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 100000000.0))) (.cse6 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse7) .cse8))) (and (not (fp.gt .cse6 (fp.mul roundNearestTiesToEven .cse7 .cse8))) (not (fp.leq v_prenex_1 .cse9)) (not (fp.geq (fp.div roundNearestTiesToEven .cse9 .cse10) ((_ to_fp 11 53) roundNearestTiesToEven (/ 9.0 10.0)))) (fp.geq v_prenex_1 (fp.sub roundNearestTiesToEven .cse9 .cse11)) (fp.leq v_prenex_1 (fp.add roundNearestTiesToEven .cse9 .cse11)) (not (fp.lt .cse6 v_prenex_2))))))))) is different from true [2020-11-29 19:19:42,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:19:42,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-11-29 19:19:44,835 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) c_ULTIMATE.start_SqrtR_~xnp1~0))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 9.0 10.0))))) is different from false [2020-11-29 19:19:47,322 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) c_ULTIMATE.start_SqrtR_~xnp1~0))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 9.0 10.0))))) is different from true [2020-11-29 19:19:49,830 WARN L838 $PredicateComparison]: unable to prove that (or (let ((.cse0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) c_ULTIMATE.start_SqrtR_~xnp1~0))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 9.0 10.0))))) (not (= (_ bv0 32) c_ULTIMATE.start_SqrtR_~cond~0))) is different from false [2020-11-29 19:19:52,322 WARN L860 $PredicateComparison]: unable to prove that (or (let ((.cse0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) c_ULTIMATE.start_SqrtR_~xnp1~0))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (fp.geq .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 9.0 10.0))))) (not (= (_ bv0 32) c_ULTIMATE.start_SqrtR_~cond~0))) is different from true [2020-11-29 19:19:54,960 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ULTIMATE.start_SqrtR_~linf~0_7 (_ FloatingPoint 11 53))) (fp.lt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) (fp.add c_currentRoundingMode c_ULTIMATE.start_SqrtR_~xn~0 c_ULTIMATE.start_SqrtR_~xn~0)) v_ULTIMATE.start_SqrtR_~linf~0_7))) (.cse1 (let ((.cse3 (fp.add c_currentRoundingMode c_ULTIMATE.start_SqrtR_~xn~0 c_ULTIMATE.start_SqrtR_~xn~0))) (fp.gt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) .cse3) (fp.mul c_currentRoundingMode c_~_EPS~0 .cse3)))) (.cse2 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) c_ULTIMATE.start_SqrtR_~xn~0))) (and (or .cse0 .cse1 (fp.leq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 5.0))) (or .cse0 .cse1 (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 9.0 10.0)))))) is different from false [2020-11-29 19:19:57,620 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ULTIMATE.start_SqrtR_~linf~0_7 (_ FloatingPoint 11 53))) (fp.lt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) (fp.add c_currentRoundingMode c_ULTIMATE.start_SqrtR_~xn~0 c_ULTIMATE.start_SqrtR_~xn~0)) v_ULTIMATE.start_SqrtR_~linf~0_7))) (.cse1 (let ((.cse3 (fp.add c_currentRoundingMode c_ULTIMATE.start_SqrtR_~xn~0 c_ULTIMATE.start_SqrtR_~xn~0))) (fp.gt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) .cse3) (fp.mul c_currentRoundingMode c_~_EPS~0 .cse3)))) (.cse2 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) c_ULTIMATE.start_SqrtR_~xn~0))) (and (or .cse0 .cse1 (fp.leq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 5.0))) (or .cse0 .cse1 (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 9.0 10.0)))))) is different from true [2020-11-29 19:20:00,777 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse7 (fp.div c_currentRoundingMode .cse5 c_ULTIMATE.start_SqrtR_~Input))) (let ((.cse3 (fp.div c_currentRoundingMode .cse5 .cse7)) (.cse0 (let ((.cse6 (fp.add c_currentRoundingMode .cse7 .cse7))) (fp.gt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) .cse6) (fp.mul c_currentRoundingMode c_~_EPS~0 .cse6)))) (.cse2 (fp.leq c_ULTIMATE.start_SqrtR_~Input .cse5))) (and (or .cse0 (forall ((v_prenex_3 (_ FloatingPoint 11 53))) (fp.lt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) (let ((.cse1 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) c_ULTIMATE.start_SqrtR_~Input))) (fp.add c_currentRoundingMode .cse1 .cse1))) v_prenex_3)) .cse2 (fp.leq .cse3 ((_ to_fp 11 53) c_currentRoundingMode 5.0))) (or (fp.geq .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 9.0 10.0))) (forall ((v_ULTIMATE.start_SqrtR_~linf~0_7 (_ FloatingPoint 11 53))) (fp.lt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) (let ((.cse4 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) c_ULTIMATE.start_SqrtR_~Input))) (fp.add c_currentRoundingMode .cse4 .cse4))) v_ULTIMATE.start_SqrtR_~linf~0_7)) .cse0 .cse2))))) is different from false [2020-11-29 19:20:03,916 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse5 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse7 (fp.div c_currentRoundingMode .cse5 c_ULTIMATE.start_SqrtR_~Input))) (let ((.cse3 (fp.div c_currentRoundingMode .cse5 .cse7)) (.cse0 (let ((.cse6 (fp.add c_currentRoundingMode .cse7 .cse7))) (fp.gt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) .cse6) (fp.mul c_currentRoundingMode c_~_EPS~0 .cse6)))) (.cse2 (fp.leq c_ULTIMATE.start_SqrtR_~Input .cse5))) (and (or .cse0 (forall ((v_prenex_3 (_ FloatingPoint 11 53))) (fp.lt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) (let ((.cse1 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) c_ULTIMATE.start_SqrtR_~Input))) (fp.add c_currentRoundingMode .cse1 .cse1))) v_prenex_3)) .cse2 (fp.leq .cse3 ((_ to_fp 11 53) c_currentRoundingMode 5.0))) (or (fp.geq .cse3 ((_ to_fp 11 53) c_currentRoundingMode (/ 9.0 10.0))) (forall ((v_ULTIMATE.start_SqrtR_~linf~0_7 (_ FloatingPoint 11 53))) (fp.lt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) (let ((.cse4 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) c_ULTIMATE.start_SqrtR_~Input))) (fp.add c_currentRoundingMode .cse4 .cse4))) v_ULTIMATE.start_SqrtR_~linf~0_7)) .cse0 .cse2))))) is different from true [2020-11-29 19:20:07,053 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse6 (fp.div c_currentRoundingMode .cse7 c_ULTIMATE.start_main_~dd~0))) (let ((.cse0 (fp.leq c_ULTIMATE.start_main_~dd~0 .cse7)) (.cse2 (fp.div c_currentRoundingMode .cse7 .cse6)) (.cse3 (let ((.cse5 (fp.add c_currentRoundingMode .cse6 .cse6))) (fp.gt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) .cse5) (fp.mul c_currentRoundingMode c_~_EPS~0 .cse5))))) (and (or .cse0 (forall ((v_ULTIMATE.start_SqrtR_~linf~0_7 (_ FloatingPoint 11 53))) (fp.lt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) (let ((.cse1 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) c_ULTIMATE.start_main_~dd~0))) (fp.add c_currentRoundingMode .cse1 .cse1))) v_ULTIMATE.start_SqrtR_~linf~0_7)) (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 9.0 10.0))) .cse3) (or .cse0 (fp.leq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (forall ((v_prenex_3 (_ FloatingPoint 11 53))) (fp.lt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) (let ((.cse4 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) c_ULTIMATE.start_main_~dd~0))) (fp.add c_currentRoundingMode .cse4 .cse4))) v_prenex_3)) .cse3))))) is different from false [2020-11-29 19:20:10,200 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse7 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse6 (fp.div c_currentRoundingMode .cse7 c_ULTIMATE.start_main_~dd~0))) (let ((.cse0 (fp.leq c_ULTIMATE.start_main_~dd~0 .cse7)) (.cse2 (fp.div c_currentRoundingMode .cse7 .cse6)) (.cse3 (let ((.cse5 (fp.add c_currentRoundingMode .cse6 .cse6))) (fp.gt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) .cse5) (fp.mul c_currentRoundingMode c_~_EPS~0 .cse5))))) (and (or .cse0 (forall ((v_ULTIMATE.start_SqrtR_~linf~0_7 (_ FloatingPoint 11 53))) (fp.lt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) (let ((.cse1 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) c_ULTIMATE.start_main_~dd~0))) (fp.add c_currentRoundingMode .cse1 .cse1))) v_ULTIMATE.start_SqrtR_~linf~0_7)) (fp.geq .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 9.0 10.0))) .cse3) (or .cse0 (fp.leq .cse2 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (forall ((v_prenex_3 (_ FloatingPoint 11 53))) (fp.lt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) (let ((.cse4 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) c_ULTIMATE.start_main_~dd~0))) (fp.add c_currentRoundingMode .cse4 .cse4))) v_prenex_3)) .cse3))))) is different from true [2020-11-29 19:20:13,352 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse8 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse7 (fp.div c_currentRoundingMode .cse8 c_ULTIMATE.start_main_~dd~0))) (let ((.cse0 (fp.leq c_ULTIMATE.start_main_~dd~0 .cse8)) (.cse1 (fp.div c_currentRoundingMode .cse8 .cse7)) (.cse3 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) (.cse4 (let ((.cse6 (fp.add c_currentRoundingMode .cse7 .cse7))) (fp.gt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) .cse6) (fp.mul c_currentRoundingMode c_~_EPS~0 .cse6))))) (and (or .cse0 (fp.leq .cse1 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (forall ((v_prenex_3 (_ FloatingPoint 11 53))) (fp.lt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) (let ((.cse2 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) c_ULTIMATE.start_main_~dd~0))) (fp.add c_currentRoundingMode .cse2 .cse2))) v_prenex_3)) .cse3 .cse4) (or .cse0 (forall ((v_ULTIMATE.start_SqrtR_~linf~0_7 (_ FloatingPoint 11 53))) (fp.lt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) (let ((.cse5 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) c_ULTIMATE.start_main_~dd~0))) (fp.add c_currentRoundingMode .cse5 .cse5))) v_ULTIMATE.start_SqrtR_~linf~0_7)) (fp.geq .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 9.0 10.0))) .cse3 .cse4))))) is different from false [2020-11-29 19:20:16,522 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse8 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse7 (fp.div c_currentRoundingMode .cse8 c_ULTIMATE.start_main_~dd~0))) (let ((.cse0 (fp.leq c_ULTIMATE.start_main_~dd~0 .cse8)) (.cse1 (fp.div c_currentRoundingMode .cse8 .cse7)) (.cse3 (= (_ bv0 32) c_ULTIMATE.start_assume_abort_if_not_~cond)) (.cse4 (let ((.cse6 (fp.add c_currentRoundingMode .cse7 .cse7))) (fp.gt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) .cse6) (fp.mul c_currentRoundingMode c_~_EPS~0 .cse6))))) (and (or .cse0 (fp.leq .cse1 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (forall ((v_prenex_3 (_ FloatingPoint 11 53))) (fp.lt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) (let ((.cse2 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) c_ULTIMATE.start_main_~dd~0))) (fp.add c_currentRoundingMode .cse2 .cse2))) v_prenex_3)) .cse3 .cse4) (or .cse0 (forall ((v_ULTIMATE.start_SqrtR_~linf~0_7 (_ FloatingPoint 11 53))) (fp.lt (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) (let ((.cse5 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0) c_ULTIMATE.start_main_~dd~0))) (fp.add c_currentRoundingMode .cse5 .cse5))) v_ULTIMATE.start_SqrtR_~linf~0_7)) (fp.geq .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 9.0 10.0))) .cse3 .cse4))))) is different from true [2020-11-29 19:20:16,529 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 5, 2, 1] term [2020-11-29 19:20:16,530 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-29 19:20:16,538 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-29 19:20:19,006 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~dd~0_8 (_ FloatingPoint 11 53)) (v_prenex_3 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.div c_currentRoundingMode .cse0 v_ULTIMATE.start_main_~dd~0_8))) (let ((.cse2 (fp.add c_currentRoundingMode .cse3 .cse3))) (let ((.cse1 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) .cse2))) (or (fp.leq v_ULTIMATE.start_main_~dd~0_8 .cse0) (not (fp.geq v_ULTIMATE.start_main_~dd~0_8 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~d~0 c_ULTIMATE.start_main_~epsilon~0))) (fp.lt .cse1 v_prenex_3) (not (fp.leq v_ULTIMATE.start_main_~dd~0_8 (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~d~0 c_ULTIMATE.start_main_~epsilon~0))) (fp.gt .cse1 (fp.mul c_currentRoundingMode c_~_EPS~0 .cse2)) (fp.leq (fp.div c_currentRoundingMode .cse0 .cse3) ((_ to_fp 11 53) c_currentRoundingMode 5.0)))))))) (forall ((v_ULTIMATE.start_main_~dd~0_8 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_SqrtR_~linf~0_7 (_ FloatingPoint 11 53))) (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse7 (fp.div c_currentRoundingMode .cse4 v_ULTIMATE.start_main_~dd~0_8))) (let ((.cse6 (fp.add c_currentRoundingMode .cse7 .cse7))) (let ((.cse5 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) .cse6))) (or (fp.leq v_ULTIMATE.start_main_~dd~0_8 .cse4) (not (fp.geq v_ULTIMATE.start_main_~dd~0_8 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~d~0 c_ULTIMATE.start_main_~epsilon~0))) (not (fp.leq v_ULTIMATE.start_main_~dd~0_8 (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~d~0 c_ULTIMATE.start_main_~epsilon~0))) (fp.gt .cse5 (fp.mul c_currentRoundingMode c_~_EPS~0 .cse6)) (fp.lt .cse5 v_ULTIMATE.start_SqrtR_~linf~0_7) (fp.geq (fp.div c_currentRoundingMode .cse4 .cse7) ((_ to_fp 11 53) c_currentRoundingMode (/ 9.0 10.0)))))))))) is different from false [2020-11-29 19:20:22,190 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_main_~dd~0_8 (_ FloatingPoint 11 53)) (v_prenex_3 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse3 (fp.div c_currentRoundingMode .cse0 v_ULTIMATE.start_main_~dd~0_8))) (let ((.cse2 (fp.add c_currentRoundingMode .cse3 .cse3))) (let ((.cse1 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) .cse2))) (or (fp.leq v_ULTIMATE.start_main_~dd~0_8 .cse0) (not (fp.geq v_ULTIMATE.start_main_~dd~0_8 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~d~0 c_ULTIMATE.start_main_~epsilon~0))) (fp.lt .cse1 v_prenex_3) (not (fp.leq v_ULTIMATE.start_main_~dd~0_8 (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~d~0 c_ULTIMATE.start_main_~epsilon~0))) (fp.gt .cse1 (fp.mul c_currentRoundingMode c_~_EPS~0 .cse2)) (fp.leq (fp.div c_currentRoundingMode .cse0 .cse3) ((_ to_fp 11 53) c_currentRoundingMode 5.0)))))))) (forall ((v_ULTIMATE.start_main_~dd~0_8 (_ FloatingPoint 11 53)) (v_ULTIMATE.start_SqrtR_~linf~0_7 (_ FloatingPoint 11 53))) (let ((.cse4 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse7 (fp.div c_currentRoundingMode .cse4 v_ULTIMATE.start_main_~dd~0_8))) (let ((.cse6 (fp.add c_currentRoundingMode .cse7 .cse7))) (let ((.cse5 (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) c_~_EPS~0) .cse6))) (or (fp.leq v_ULTIMATE.start_main_~dd~0_8 .cse4) (not (fp.geq v_ULTIMATE.start_main_~dd~0_8 (fp.sub c_currentRoundingMode c_ULTIMATE.start_main_~d~0 c_ULTIMATE.start_main_~epsilon~0))) (not (fp.leq v_ULTIMATE.start_main_~dd~0_8 (fp.add c_currentRoundingMode c_ULTIMATE.start_main_~d~0 c_ULTIMATE.start_main_~epsilon~0))) (fp.gt .cse5 (fp.mul c_currentRoundingMode c_~_EPS~0 .cse6)) (fp.lt .cse5 v_ULTIMATE.start_SqrtR_~linf~0_7) (fp.geq (fp.div c_currentRoundingMode .cse4 .cse7) ((_ to_fp 11 53) c_currentRoundingMode (/ 9.0 10.0)))))))))) is different from true [2020-11-29 19:20:23,646 WARN L195 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2020-11-29 19:20:23,648 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [937479492] [2020-11-29 19:20:23,649 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") [2020-11-29 19:20:23,650 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [763134093] [2020-11-29 19:20:23,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bff30e8a-069a-475a-80dd-b4e73e5c6a41/bin/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-11-29 19:20:30,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:20:30,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 17 conjunts are in the unsatisfiable core [2020-11-29 19:20:30,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:20:30,737 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 19:20:30,738 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken [2020-11-29 19:20:30,739 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989204624] [2020-11-29 19:20:30,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bff30e8a-069a-475a-80dd-b4e73e5c6a41/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 19:22:44,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:22:48,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 19 conjunts are in the unsatisfiable core [2020-11-29 19:22:48,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-29 19:22:48,367 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@5334e04f [2020-11-29 19:22:48,367 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:22:48,368 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2020-11-29 19:22:48,368 ERROR L205 FreeRefinementEngine]: Strategy WOLF failed to provide any proof altough trace is infeasible [2020-11-29 19:22:48,368 INFO L523 BasicCegarLoop]: Counterexample might be feasible [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forcibly destroying the process [2020-11-29 19:22:48,977 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3,5 cvc4 --incremental --print-success --lang smt --rewrite-divk,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-29 19:22:49,021 WARN L238 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2020-11-29 19:22:49,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 07:22:49 BoogieIcfgContainer [2020-11-29 19:22:49,022 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-29 19:22:49,023 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-29 19:22:49,024 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-29 19:22:49,024 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-29 19:22:49,025 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:18:00" (3/4) ... [2020-11-29 19:22:49,029 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-11-29 19:22:49,029 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-29 19:22:49,034 INFO L168 Benchmark]: Toolchain (without parser) took 298901.53 ms. Allocated memory was 56.6 MB in the beginning and 86.0 MB in the end (delta: 29.4 MB). Free memory was 36.4 MB in the beginning and 27.3 MB in the end (delta: 9.2 MB). Peak memory consumption was 38.9 MB. Max. memory is 16.1 GB. [2020-11-29 19:22:49,041 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 56.6 MB. Free memory was 39.3 MB in the beginning and 39.3 MB in the end (delta: 43.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 19:22:49,042 INFO L168 Benchmark]: CACSL2BoogieTranslator took 315.71 ms. Allocated memory is still 56.6 MB. Free memory was 36.2 MB in the beginning and 25.3 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-11-29 19:22:49,043 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.55 ms. Allocated memory is still 56.6 MB. Free memory was 25.3 MB in the beginning and 40.7 MB in the end (delta: -15.3 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-29 19:22:49,059 INFO L168 Benchmark]: Boogie Preprocessor took 89.04 ms. Allocated memory is still 56.6 MB. Free memory was 40.7 MB in the beginning and 39.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 19:22:49,060 INFO L168 Benchmark]: RCFGBuilder took 10217.70 ms. Allocated memory is still 56.6 MB. Free memory was 39.1 MB in the beginning and 25.3 MB in the end (delta: 13.9 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-11-29 19:22:49,066 INFO L168 Benchmark]: TraceAbstraction took 288207.22 ms. Allocated memory was 56.6 MB in the beginning and 86.0 MB in the end (delta: 29.4 MB). Free memory was 24.9 MB in the beginning and 27.3 MB in the end (delta: -2.4 MB). Peak memory consumption was 29.5 MB. Max. memory is 16.1 GB. [2020-11-29 19:22:49,067 INFO L168 Benchmark]: Witness Printer took 5.97 ms. Allocated memory is still 86.0 MB. Free memory is still 27.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 19:22:49,072 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30 ms. Allocated memory is still 56.6 MB. Free memory was 39.3 MB in the beginning and 39.3 MB in the end (delta: 43.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 315.71 ms. Allocated memory is still 56.6 MB. Free memory was 36.2 MB in the beginning and 25.3 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 57.55 ms. Allocated memory is still 56.6 MB. Free memory was 25.3 MB in the beginning and 40.7 MB in the end (delta: -15.3 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 89.04 ms. Allocated memory is still 56.6 MB. Free memory was 40.7 MB in the beginning and 39.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 10217.70 ms. Allocated memory is still 56.6 MB. Free memory was 39.1 MB in the beginning and 25.3 MB in the end (delta: 13.9 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 288207.22 ms. Allocated memory was 56.6 MB in the beginning and 86.0 MB in the end (delta: 29.4 MB). Free memory was 24.9 MB in the beginning and 27.3 MB in the end (delta: -2.4 MB). Peak memory consumption was 29.5 MB. Max. memory is 16.1 GB. * Witness Printer took 5.97 ms. Allocated memory is still 86.0 MB. Free memory is still 27.3 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 3]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L15] double _EPS = 1e-6; [L42] double d, dd, r; [L43] double epsilon = 1e-8; [L45] d = 1. [L45] COND TRUE d <= 20. [L47] dd = __VERIFIER_nondet_double() [L11] COND FALSE !(!cond) [L19] double xn, xnp1, residu, lsup, linf; [L20] int i, cond; [L21] COND FALSE !(Input <= 1.0) [L21] xn = 1.0/Input [L22] xnp1 = xn [L23] residu = 2.0*_EPS*(xn+xnp1) [L24] lsup = _EPS * (xn+xnp1) [L25] linf = -lsup [L26] cond = ((residu > lsup) || (residu < linf)) [L27] i = 0 [L28] COND FALSE !(\read(cond)) [L37] return 1.0 / xnp1; [L50] r = SqrtR(dd) [L13] COND TRUE !(cond) [L3] __assert_fail("0", "sqrt_Newton_pseudoconstant.c", 3, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNKNOWN, OverallTime: 288.0s, OverallIterations: 3, TraceHistogramMax: 1, AutomataDifference: 21.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 30 SDtfs, 4 SDslu, 23 SDs, 0 SdLazy, 25 SolverSat, 0 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 17.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 14.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=2, 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, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 3.8s SatisfiabilityAnalysisTime, 12.4s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 44 ConstructedInterpolants, 1 QuantifiedInterpolants, 2992 SizeOfPredicates, 8 NumberOfNonLiveVariables, 94 ConjunctsInSsa, 9 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, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...