./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/float-benchs/sqrt_Newton_pseudoconstant.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 54a68f41 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/float-benchs/sqrt_Newton_pseudoconstant.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a9874b894e580352626d8ebc271850c0b42d4635 ..................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/float-benchs/sqrt_Newton_pseudoconstant.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a9874b894e580352626d8ebc271850c0b42d4635 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.2.1-54a68f4 [2020-12-03 18:42:05,971 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-03 18:42:05,974 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-03 18:42:06,036 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-03 18:42:06,037 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-03 18:42:06,042 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-03 18:42:06,044 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-03 18:42:06,050 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-03 18:42:06,054 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-03 18:42:06,059 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-03 18:42:06,061 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-03 18:42:06,066 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-03 18:42:06,066 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-03 18:42:06,069 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-03 18:42:06,071 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-03 18:42:06,073 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-03 18:42:06,074 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-03 18:42:06,077 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-03 18:42:06,080 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-03 18:42:06,087 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-03 18:42:06,090 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-03 18:42:06,091 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-03 18:42:06,093 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-03 18:42:06,095 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-03 18:42:06,103 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-03 18:42:06,103 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-03 18:42:06,104 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-03 18:42:06,106 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-03 18:42:06,107 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-03 18:42:06,108 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-03 18:42:06,108 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-03 18:42:06,109 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-03 18:42:06,111 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-03 18:42:06,112 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-03 18:42:06,113 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-03 18:42:06,113 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-03 18:42:06,114 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-03 18:42:06,114 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-03 18:42:06,115 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-03 18:42:06,117 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-03 18:42:06,117 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-03 18:42:06,118 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-12-03 18:42:06,169 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-03 18:42:06,169 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-03 18:42:06,173 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-03 18:42:06,173 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-03 18:42:06,173 INFO L138 SettingsManager]: * Use SBE=true [2020-12-03 18:42:06,174 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-03 18:42:06,174 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-03 18:42:06,174 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-03 18:42:06,175 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-03 18:42:06,175 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-03 18:42:06,176 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-03 18:42:06,176 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-03 18:42:06,177 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-03 18:42:06,177 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-03 18:42:06,177 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-03 18:42:06,177 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-03 18:42:06,178 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-03 18:42:06,178 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-03 18:42:06,178 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-03 18:42:06,178 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-03 18:42:06,179 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-03 18:42:06,183 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-03 18:42:06,184 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-03 18:42:06,185 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-03 18:42:06,185 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-03 18:42:06,186 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-03 18:42:06,186 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-03 18:42:06,187 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-03 18:42:06,187 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a9874b894e580352626d8ebc271850c0b42d4635 [2020-12-03 18:42:06,567 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-03 18:42:06,605 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-03 18:42:06,608 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-03 18:42:06,610 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-03 18:42:06,611 INFO L275 PluginConnector]: CDTParser initialized [2020-12-03 18:42:06,612 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/sqrt_Newton_pseudoconstant.c [2020-12-03 18:42:06,691 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45cbc1697/3dd25476a47b4e249396b15c22a9dd23/FLAG7014a503b [2020-12-03 18:42:07,434 INFO L306 CDTParser]: Found 1 translation units. [2020-12-03 18:42:07,437 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/sqrt_Newton_pseudoconstant.c [2020-12-03 18:42:07,446 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45cbc1697/3dd25476a47b4e249396b15c22a9dd23/FLAG7014a503b [2020-12-03 18:42:07,779 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45cbc1697/3dd25476a47b4e249396b15c22a9dd23 [2020-12-03 18:42:07,782 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-03 18:42:07,785 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-03 18:42:07,787 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-03 18:42:07,787 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-03 18:42:07,796 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-03 18:42:07,797 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 06:42:07" (1/1) ... [2020-12-03 18:42:07,801 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d4ee8cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:42:07, skipping insertion in model container [2020-12-03 18:42:07,802 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 06:42:07" (1/1) ... [2020-12-03 18:42:07,810 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-03 18:42:07,834 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-03 18:42:08,030 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/sqrt_Newton_pseudoconstant.c[557,570] [2020-12-03 18:42:08,078 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-03 18:42:08,090 INFO L203 MainTranslator]: Completed pre-run [2020-12-03 18:42:08,108 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/sqrt_Newton_pseudoconstant.c[557,570] [2020-12-03 18:42:08,143 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-03 18:42:08,167 INFO L208 MainTranslator]: Completed translation [2020-12-03 18:42:08,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:42:08 WrapperNode [2020-12-03 18:42:08,169 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-03 18:42:08,171 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-03 18:42:08,171 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-03 18:42:08,174 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-03 18:42:08,185 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:42:08" (1/1) ... [2020-12-03 18:42:08,201 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:42:08" (1/1) ... [2020-12-03 18:42:08,242 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-03 18:42:08,244 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-03 18:42:08,245 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-03 18:42:08,245 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-03 18:42:08,257 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:42:08" (1/1) ... [2020-12-03 18:42:08,258 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:42:08" (1/1) ... [2020-12-03 18:42:08,271 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:42:08" (1/1) ... [2020-12-03 18:42:08,273 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:42:08" (1/1) ... [2020-12-03 18:42:08,288 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:42:08" (1/1) ... [2020-12-03 18:42:08,298 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:42:08" (1/1) ... [2020-12-03 18:42:08,301 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:42:08" (1/1) ... [2020-12-03 18:42:08,305 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-03 18:42:08,312 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-03 18:42:08,312 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-03 18:42:08,313 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-03 18:42:08,314 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:42:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-03 18:42:08,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-03 18:42:08,454 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-03 18:42:08,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-03 18:42:08,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-03 18:42:08,887 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-03 18:42:08,889 INFO L299 CfgBuilder]: Removed 12 assume(true) statements. [2020-12-03 18:42:08,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:42:08 BoogieIcfgContainer [2020-12-03 18:42:08,894 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-03 18:42:08,899 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-03 18:42:08,900 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-03 18:42:08,904 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-03 18:42:08,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 06:42:07" (1/3) ... [2020-12-03 18:42:08,908 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7267d745 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 06:42:08, skipping insertion in model container [2020-12-03 18:42:08,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:42:08" (2/3) ... [2020-12-03 18:42:08,909 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7267d745 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 06:42:08, skipping insertion in model container [2020-12-03 18:42:08,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:42:08" (3/3) ... [2020-12-03 18:42:08,916 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt_Newton_pseudoconstant.c [2020-12-03 18:42:08,937 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-03 18:42:08,942 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-03 18:42:08,957 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-03 18:42:08,988 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-03 18:42:08,988 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-03 18:42:08,989 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-03 18:42:08,989 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-03 18:42:08,989 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-03 18:42:08,989 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-03 18:42:08,990 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-03 18:42:08,990 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-03 18:42:09,006 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2020-12-03 18:42:09,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-03 18:42:09,013 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 18:42:09,014 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 18:42:09,015 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 18:42:09,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 18:42:09,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1569195288, now seen corresponding path program 1 times [2020-12-03 18:42:09,034 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 18:42:09,035 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494405061] [2020-12-03 18:42:09,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 18:42:09,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 18:42:09,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 18:42:09,265 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494405061] [2020-12-03 18:42:09,266 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 18:42:09,266 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-03 18:42:09,267 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019897823] [2020-12-03 18:42:09,279 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-03 18:42:09,279 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 18:42:09,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-03 18:42:09,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-03 18:42:09,304 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2020-12-03 18:42:09,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 18:42:09,329 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2020-12-03 18:42:09,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-03 18:42:09,331 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2020-12-03 18:42:09,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 18:42:09,356 INFO L225 Difference]: With dead ends: 34 [2020-12-03 18:42:09,357 INFO L226 Difference]: Without dead ends: 14 [2020-12-03 18:42:09,362 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-12-03 18:42:09,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-12-03 18:42:09,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-12-03 18:42:09,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-12-03 18:42:09,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2020-12-03 18:42:09,400 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 12 [2020-12-03 18:42:09,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 18:42:09,400 INFO L481 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2020-12-03 18:42:09,401 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-03 18:42:09,401 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2020-12-03 18:42:09,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-03 18:42:09,402 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 18:42:09,402 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 18:42:09,403 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-03 18:42:09,403 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 18:42:09,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 18:42:09,409 INFO L82 PathProgramCache]: Analyzing trace with hash -2049407722, now seen corresponding path program 1 times [2020-12-03 18:42:09,409 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 18:42:09,410 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712036629] [2020-12-03 18:42:09,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 18:42:09,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-03 18:42:09,495 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-03 18:42:09,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-03 18:42:09,531 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-03 18:42:09,555 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-03 18:42:09,555 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-03 18:42:09,557 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-03 18:42:09,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 06:42:09 BoogieIcfgContainer [2020-12-03 18:42:09,590 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-03 18:42:09,591 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-03 18:42:09,591 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-03 18:42:09,591 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-03 18:42:09,592 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:42:08" (3/4) ... [2020-12-03 18:42:09,596 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-12-03 18:42:09,596 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-03 18:42:09,599 INFO L168 Benchmark]: Toolchain (without parser) took 1812.94 ms. Allocated memory was 48.2 MB in the beginning and 58.7 MB in the end (delta: 10.5 MB). Free memory was 24.8 MB in the beginning and 36.6 MB in the end (delta: -11.8 MB). Peak memory consumption was 1.9 MB. Max. memory is 16.1 GB. [2020-12-03 18:42:09,600 INFO L168 Benchmark]: CDTParser took 0.52 ms. Allocated memory is still 48.2 MB. Free memory was 32.6 MB in the beginning and 32.5 MB in the end (delta: 33.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-03 18:42:09,601 INFO L168 Benchmark]: CACSL2BoogieTranslator took 383.27 ms. Allocated memory is still 48.2 MB. Free memory was 24.6 MB in the beginning and 25.2 MB in the end (delta: -652.2 kB). Peak memory consumption was 5.5 MB. Max. memory is 16.1 GB. [2020-12-03 18:42:09,602 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.84 ms. Allocated memory is still 48.2 MB. Free memory was 25.2 MB in the beginning and 23.7 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-03 18:42:09,603 INFO L168 Benchmark]: Boogie Preprocessor took 66.60 ms. Allocated memory is still 48.2 MB. Free memory was 23.7 MB in the beginning and 22.5 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-03 18:42:09,604 INFO L168 Benchmark]: RCFGBuilder took 582.71 ms. Allocated memory is still 48.2 MB. Free memory was 22.5 MB in the beginning and 20.2 MB in the end (delta: 2.3 MB). Peak memory consumption was 5.5 MB. Max. memory is 16.1 GB. [2020-12-03 18:42:09,605 INFO L168 Benchmark]: TraceAbstraction took 690.52 ms. Allocated memory was 48.2 MB in the beginning and 58.7 MB in the end (delta: 10.5 MB). Free memory was 19.8 MB in the beginning and 36.9 MB in the end (delta: -17.1 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-03 18:42:09,606 INFO L168 Benchmark]: Witness Printer took 5.54 ms. Allocated memory is still 58.7 MB. Free memory was 36.9 MB in the beginning and 36.6 MB in the end (delta: 358.9 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-03 18:42:09,611 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.52 ms. Allocated memory is still 48.2 MB. Free memory was 32.6 MB in the beginning and 32.5 MB in the end (delta: 33.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 383.27 ms. Allocated memory is still 48.2 MB. Free memory was 24.6 MB in the beginning and 25.2 MB in the end (delta: -652.2 kB). Peak memory consumption was 5.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 71.84 ms. Allocated memory is still 48.2 MB. Free memory was 25.2 MB in the beginning and 23.7 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 66.60 ms. Allocated memory is still 48.2 MB. Free memory was 23.7 MB in the beginning and 22.5 MB in the end (delta: 1.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 582.71 ms. Allocated memory is still 48.2 MB. Free memory was 22.5 MB in the beginning and 20.2 MB in the end (delta: 2.3 MB). Peak memory consumption was 5.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 690.52 ms. Allocated memory was 48.2 MB in the beginning and 58.7 MB in the end (delta: 10.5 MB). Free memory was 19.8 MB in the beginning and 36.9 MB in the end (delta: -17.1 MB). There was no memory consumed. Max. memory is 16.1 GB. * Witness Printer took 5.54 ms. Allocated memory is still 58.7 MB. Free memory was 36.9 MB in the beginning and 36.6 MB in the end (delta: 358.9 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 13]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is 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] [L13] reach_error() VAL [_EPS=1/1000000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 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=18occurred 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.1-54a68f4 [2020-12-03 18:42:12,134 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-03 18:42:12,137 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-03 18:42:12,173 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-03 18:42:12,173 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-03 18:42:12,175 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-03 18:42:12,176 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-03 18:42:12,178 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-03 18:42:12,180 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-03 18:42:12,181 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-03 18:42:12,183 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-03 18:42:12,184 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-03 18:42:12,184 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-03 18:42:12,186 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-03 18:42:12,187 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-03 18:42:12,188 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-03 18:42:12,189 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-03 18:42:12,190 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-03 18:42:12,192 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-03 18:42:12,194 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-03 18:42:12,196 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-03 18:42:12,198 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-03 18:42:12,199 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-03 18:42:12,200 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-03 18:42:12,203 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-03 18:42:12,203 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-03 18:42:12,204 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-03 18:42:12,205 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-03 18:42:12,206 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-03 18:42:12,207 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-03 18:42:12,207 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-03 18:42:12,208 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-03 18:42:12,209 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-03 18:42:12,210 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-03 18:42:12,213 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-03 18:42:12,213 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-03 18:42:12,214 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-03 18:42:12,214 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-03 18:42:12,215 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-03 18:42:12,216 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-03 18:42:12,226 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-03 18:42:12,232 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-12-03 18:42:12,258 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-03 18:42:12,259 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-03 18:42:12,260 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-03 18:42:12,260 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-03 18:42:12,261 INFO L138 SettingsManager]: * Use SBE=true [2020-12-03 18:42:12,261 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-03 18:42:12,261 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-03 18:42:12,262 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-03 18:42:12,262 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-03 18:42:12,262 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-03 18:42:12,262 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-03 18:42:12,262 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-03 18:42:12,263 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-12-03 18:42:12,263 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-12-03 18:42:12,263 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-03 18:42:12,263 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-03 18:42:12,264 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-03 18:42:12,264 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-03 18:42:12,264 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-03 18:42:12,264 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-03 18:42:12,265 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-03 18:42:12,265 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-03 18:42:12,265 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-03 18:42:12,266 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-03 18:42:12,266 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-03 18:42:12,266 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-12-03 18:42:12,266 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2020-12-03 18:42:12,267 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-03 18:42:12,267 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-03 18:42:12,267 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-03 18:42:12,267 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a9874b894e580352626d8ebc271850c0b42d4635 [2020-12-03 18:42:12,632 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-03 18:42:12,660 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-03 18:42:12,663 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-03 18:42:12,665 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-03 18:42:12,666 INFO L275 PluginConnector]: CDTParser initialized [2020-12-03 18:42:12,667 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-benchs/sqrt_Newton_pseudoconstant.c [2020-12-03 18:42:12,761 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e49290e64/68ed2f6449e34130b5eb312afe4fa18b/FLAGadbeff43e [2020-12-03 18:42:13,352 INFO L306 CDTParser]: Found 1 translation units. [2020-12-03 18:42:13,353 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/sqrt_Newton_pseudoconstant.c [2020-12-03 18:42:13,363 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e49290e64/68ed2f6449e34130b5eb312afe4fa18b/FLAGadbeff43e [2020-12-03 18:42:13,729 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e49290e64/68ed2f6449e34130b5eb312afe4fa18b [2020-12-03 18:42:13,733 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-03 18:42:13,736 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-03 18:42:13,740 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-03 18:42:13,740 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-03 18:42:13,745 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-03 18:42:13,746 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 06:42:13" (1/1) ... [2020-12-03 18:42:13,754 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26a30a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:42:13, skipping insertion in model container [2020-12-03 18:42:13,755 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 06:42:13" (1/1) ... [2020-12-03 18:42:13,763 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-03 18:42:13,781 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-03 18:42:13,975 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/sqrt_Newton_pseudoconstant.c[557,570] [2020-12-03 18:42:13,999 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-03 18:42:14,013 INFO L203 MainTranslator]: Completed pre-run [2020-12-03 18:42:14,027 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-benchs/sqrt_Newton_pseudoconstant.c[557,570] [2020-12-03 18:42:14,038 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-03 18:42:14,057 INFO L208 MainTranslator]: Completed translation [2020-12-03 18:42:14,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:42:14 WrapperNode [2020-12-03 18:42:14,058 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-03 18:42:14,059 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-03 18:42:14,059 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-03 18:42:14,060 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-03 18:42:14,068 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:42:14" (1/1) ... [2020-12-03 18:42:14,079 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:42:14" (1/1) ... [2020-12-03 18:42:14,102 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-03 18:42:14,103 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-03 18:42:14,104 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-03 18:42:14,104 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-03 18:42:14,113 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:42:14" (1/1) ... [2020-12-03 18:42:14,114 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:42:14" (1/1) ... [2020-12-03 18:42:14,118 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:42:14" (1/1) ... [2020-12-03 18:42:14,118 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:42:14" (1/1) ... [2020-12-03 18:42:14,126 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:42:14" (1/1) ... [2020-12-03 18:42:14,137 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:42:14" (1/1) ... [2020-12-03 18:42:14,140 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:42:14" (1/1) ... [2020-12-03 18:42:14,145 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-03 18:42:14,146 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-03 18:42:14,146 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-03 18:42:14,153 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-03 18:42:14,154 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:42:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-03 18:42:14,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-12-03 18:42:14,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-03 18:42:14,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-03 18:42:14,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-03 18:42:23,504 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-03 18:42:23,505 INFO L299 CfgBuilder]: Removed 12 assume(true) statements. [2020-12-03 18:42:23,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:42:23 BoogieIcfgContainer [2020-12-03 18:42:23,507 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-03 18:42:23,509 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-03 18:42:23,509 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-03 18:42:23,512 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-03 18:42:23,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 06:42:13" (1/3) ... [2020-12-03 18:42:23,513 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e5aaa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 06:42:23, skipping insertion in model container [2020-12-03 18:42:23,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:42:14" (2/3) ... [2020-12-03 18:42:23,514 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e5aaa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 06:42:23, skipping insertion in model container [2020-12-03 18:42:23,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:42:23" (3/3) ... [2020-12-03 18:42:23,515 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt_Newton_pseudoconstant.c [2020-12-03 18:42:23,528 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-03 18:42:23,531 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-03 18:42:23,543 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-03 18:42:23,569 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-03 18:42:23,570 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-03 18:42:23,570 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-03 18:42:23,570 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-03 18:42:23,570 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-03 18:42:23,571 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-03 18:42:23,571 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-03 18:42:23,571 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-03 18:42:23,585 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states. [2020-12-03 18:42:23,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-03 18:42:23,591 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 18:42:23,592 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 18:42:23,592 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 18:42:23,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 18:42:23,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1569195288, now seen corresponding path program 1 times [2020-12-03 18:42:23,612 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-03 18:42:23,612 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [967737566] [2020-12-03 18:42:23,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-12-03 18:42:24,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 18:42:25,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 1 conjunts are in the unsatisfiable core [2020-12-03 18:42:25,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-03 18:42:25,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 18:42:25,073 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-03 18:42:25,074 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [967737566] [2020-12-03 18:42:25,075 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 18:42:25,075 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-03 18:42:25,076 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324662371] [2020-12-03 18:42:25,081 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-03 18:42:25,082 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-03 18:42:25,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-03 18:42:25,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-03 18:42:25,099 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 2 states. [2020-12-03 18:42:25,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 18:42:25,117 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2020-12-03 18:42:25,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-03 18:42:25,119 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2020-12-03 18:42:25,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 18:42:25,128 INFO L225 Difference]: With dead ends: 34 [2020-12-03 18:42:25,128 INFO L226 Difference]: Without dead ends: 14 [2020-12-03 18:42:25,131 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 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-12-03 18:42:25,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-12-03 18:42:25,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-12-03 18:42:25,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-12-03 18:42:25,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2020-12-03 18:42:25,168 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 12 [2020-12-03 18:42:25,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 18:42:25,169 INFO L481 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2020-12-03 18:42:25,169 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-03 18:42:25,170 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2020-12-03 18:42:25,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-03 18:42:25,170 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 18:42:25,171 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 18:42:25,384 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-12-03 18:42:25,385 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 18:42:25,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 18:42:25,387 INFO L82 PathProgramCache]: Analyzing trace with hash -2049407722, now seen corresponding path program 1 times [2020-12-03 18:42:25,388 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-03 18:42:25,389 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1938972434] [2020-12-03 18:42:25,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-12-03 18:42:26,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 18:42:26,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-03 18:42:26,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-03 18:42:27,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 18:42:27,314 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-03 18:42:27,314 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1938972434] [2020-12-03 18:42:27,315 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 18:42:27,315 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-03 18:42:27,315 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662854377] [2020-12-03 18:42:27,317 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-03 18:42:27,317 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-03 18:42:27,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-03 18:42:27,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-03 18:42:27,318 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 5 states. [2020-12-03 18:42:40,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 18:42:40,669 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2020-12-03 18:42:40,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-03 18:42:40,670 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-12-03 18:42:40,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 18:42:40,671 INFO L225 Difference]: With dead ends: 32 [2020-12-03 18:42:40,671 INFO L226 Difference]: Without dead ends: 20 [2020-12-03 18:42:40,672 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-03 18:42:40,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-12-03 18:42:40,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-12-03 18:42:40,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-12-03 18:42:40,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2020-12-03 18:42:40,678 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 12 [2020-12-03 18:42:40,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 18:42:40,678 INFO L481 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2020-12-03 18:42:40,678 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-03 18:42:40,678 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2020-12-03 18:42:40,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-03 18:42:40,681 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 18:42:40,682 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 18:42:40,894 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-12-03 18:42:40,895 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 18:42:40,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 18:42:40,898 INFO L82 PathProgramCache]: Analyzing trace with hash -274400360, now seen corresponding path program 1 times [2020-12-03 18:42:40,899 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-03 18:42:40,899 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [359329350] [2020-12-03 18:42:40,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-12-03 18:42:44,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 18:42:44,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 21 conjunts are in the unsatisfiable core [2020-12-03 18:42:44,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-03 18:42:44,925 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2020-12-03 18:42:45,710 WARN L197 SmtUtils]: Spent 646.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2020-12-03 18:42:46,516 WARN L197 SmtUtils]: Spent 406.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2020-12-03 18:42:47,046 WARN L197 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2020-12-03 18:42:49,245 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-12-03 18:42:49,289 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-03 18:42:49,293 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-03 18:42:52,662 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 (exists ((ULTIMATE.start_SqrtR_~Input (_ FloatingPoint 11 53)) (v_prenex_1 (_ 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 v_prenex_1)) (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))))))) .cse0 (= (_ 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-12-03 18:42:54,897 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_SqrtR_~Input (_ FloatingPoint 11 53)) (v_prenex_1 (_ 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 v_prenex_1)) (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))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2020-12-03 18:42:57,314 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((ULTIMATE.start_SqrtR_~Input (_ FloatingPoint 11 53)) (v_prenex_1 (_ 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)) (not (fp.lt .cse3 v_prenex_1)) (fp.geq ULTIMATE.start_SqrtR_~Input (fp.sub c_currentRoundingMode .cse0 .cse2)) (not (fp.gt .cse3 (fp.mul c_currentRoundingMode .cse4 .cse5))) (not (fp.leq ULTIMATE.start_SqrtR_~Input .cse0)))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2020-12-03 18:42:57,352 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-03 18:42:59,734 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-03 18:43:16,768 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)) (v_prenex_1 (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse3 (fp.div roundNearestTiesToEven .cse0 ULTIMATE.start_SqrtR_~Input))) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (.cse5 (fp.add roundNearestTiesToEven .cse3 .cse3))) (let ((.cse2 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse4) .cse5)) (.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 v_prenex_1)) (not (fp.geq (fp.div roundNearestTiesToEven .cse0 .cse3) ((_ to_fp 11 53) roundNearestTiesToEven (/ 9.0 10.0)))) (not (fp.leq ULTIMATE.start_SqrtR_~Input .cse0)) (not (fp.gt .cse2 (fp.mul roundNearestTiesToEven .cse4 .cse5))) (fp.leq ULTIMATE.start_SqrtR_~Input (fp.add roundNearestTiesToEven .cse0 .cse1)))))))) .cse6) (and (exists ((ULTIMATE.start_SqrtR_~Input (_ FloatingPoint 11 53)) (v_prenex_1 (_ FloatingPoint 11 53))) (let ((.cse7 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse12 (fp.div roundNearestTiesToEven .cse7 ULTIMATE.start_SqrtR_~Input))) (let ((.cse10 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (.cse11 (fp.add roundNearestTiesToEven .cse12 .cse12))) (let ((.cse9 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse10) .cse11)) (.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 v_prenex_1)) (not (fp.leq ULTIMATE.start_SqrtR_~Input .cse7)) (not (fp.gt .cse9 (fp.mul roundNearestTiesToEven .cse10 .cse11))) (not (fp.leq (fp.div roundNearestTiesToEven .cse7 .cse12) ((_ to_fp 11 53) roundNearestTiesToEven 5.0))) (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)) (v_prenex_1 (_ 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 v_prenex_1)) (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-12-03 18:43:28,961 WARN L838 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_SqrtR_~Input (_ FloatingPoint 11 53)) (v_prenex_1 (_ 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 v_prenex_1)) (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_3 (_ FloatingPoint 11 53)) (v_prenex_2 (_ FloatingPoint 11 53))) (let ((.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse8 (fp.div roundNearestTiesToEven .cse6 v_prenex_2))) (let ((.cse10 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (.cse11 (fp.add roundNearestTiesToEven .cse8 .cse8))) (let ((.cse7 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 100000000.0))) (.cse9 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse10) .cse11))) (and (fp.leq v_prenex_2 (fp.add roundNearestTiesToEven .cse6 .cse7)) (not (fp.geq (fp.div roundNearestTiesToEven .cse6 .cse8) ((_ to_fp 11 53) roundNearestTiesToEven (/ 9.0 10.0)))) (not (fp.leq v_prenex_2 .cse6)) (not (fp.gt .cse9 (fp.mul roundNearestTiesToEven .cse10 .cse11))) (fp.geq v_prenex_2 (fp.sub roundNearestTiesToEven .cse6 .cse7)) (not (fp.lt .cse9 v_prenex_3))))))))) is different from false [2020-12-03 18:43:31,222 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((ULTIMATE.start_SqrtR_~Input (_ FloatingPoint 11 53)) (v_prenex_1 (_ 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 v_prenex_1)) (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_3 (_ FloatingPoint 11 53)) (v_prenex_2 (_ FloatingPoint 11 53))) (let ((.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse8 (fp.div roundNearestTiesToEven .cse6 v_prenex_2))) (let ((.cse10 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0))) (.cse11 (fp.add roundNearestTiesToEven .cse8 .cse8))) (let ((.cse7 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 100000000.0))) (.cse9 (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 2.0) .cse10) .cse11))) (and (fp.leq v_prenex_2 (fp.add roundNearestTiesToEven .cse6 .cse7)) (not (fp.geq (fp.div roundNearestTiesToEven .cse6 .cse8) ((_ to_fp 11 53) roundNearestTiesToEven (/ 9.0 10.0)))) (not (fp.leq v_prenex_2 .cse6)) (not (fp.gt .cse9 (fp.mul roundNearestTiesToEven .cse10 .cse11))) (fp.geq v_prenex_2 (fp.sub roundNearestTiesToEven .cse6 .cse7)) (not (fp.lt .cse9 v_prenex_3))))))))) is different from true [2020-12-03 18:43:31,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 18:43:31,226 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-03 18:43:31,227 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [359329350] [2020-12-03 18:43:31,227 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 18:43:31,227 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-03 18:43:31,227 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870355744] [2020-12-03 18:43:31,228 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-03 18:43:31,228 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-03 18:43:31,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-03 18:43:31,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=32, Unknown=7, NotChecked=90, Total=156 [2020-12-03 18:43:31,229 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 13 states. [2020-12-03 18:43:38,189 WARN L197 SmtUtils]: Spent 5.53 s on a formula simplification that was a NOOP. DAG size: 32 [2020-12-03 18:43:49,479 WARN L197 SmtUtils]: Spent 10.79 s on a formula simplification. DAG size of input: 32 DAG size of output: 24 [2020-12-03 18:44:08,750 WARN L197 SmtUtils]: Spent 19.06 s on a formula simplification. DAG size of input: 35 DAG size of output: 27 [2020-12-03 18:44:36,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 18:44:36,319 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2020-12-03 18:44:36,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-03 18:44:36,395 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 12 [2020-12-03 18:44:36,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 18:44:36,397 INFO L225 Difference]: With dead ends: 27 [2020-12-03 18:44:36,397 INFO L226 Difference]: Without dead ends: 25 [2020-12-03 18:44:36,401 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 56.2s TimeCoverageRelationStatistics Valid=48, Invalid=59, Unknown=7, NotChecked=126, Total=240 [2020-12-03 18:44:36,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-12-03 18:44:36,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-12-03 18:44:36,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-12-03 18:44:36,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2020-12-03 18:44:36,411 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 12 [2020-12-03 18:44:36,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 18:44:36,412 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2020-12-03 18:44:36,412 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-03 18:44:36,412 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2020-12-03 18:44:36,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-03 18:44:36,413 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 18:44:36,413 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 18:44:36,628 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-12-03 18:44:36,629 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 18:44:36,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 18:44:36,630 INFO L82 PathProgramCache]: Analyzing trace with hash 944524751, now seen corresponding path program 1 times [2020-12-03 18:44:36,631 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-03 18:44:36,632 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [773662167] [2020-12-03 18:44:36,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-12-03 18:44:43,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 18:44:44,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 23 conjunts are in the unsatisfiable core [2020-12-03 18:44:44,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-03 18:44:44,279 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2020-12-03 18:44:44,558 WARN L197 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2020-12-03 18:44:45,720 WARN L197 SmtUtils]: Spent 936.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2020-12-03 18:44:46,524 WARN L197 SmtUtils]: Spent 427.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2020-12-03 18:44:47,304 WARN L197 SmtUtils]: Spent 404.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2020-12-03 18:44:48,498 WARN L197 SmtUtils]: Spent 825.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 18 [2020-12-03 18:44:50,728 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) (fp.sub c_currentRoundingMode c_ULTIMATE.start_SqrtR_~xnp1~0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) (.cse6 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0)) (fp.add c_currentRoundingMode c_ULTIMATE.start_SqrtR_~xnp1~0 c_ULTIMATE.start_SqrtR_~xnp1~0)))) (let ((.cse3 (= (_ bv1 32) c_ULTIMATE.start_SqrtR_~cond~0)) (.cse0 (fp.gt .cse5 .cse6)) (.cse1 (= c_currentRoundingMode roundNearestTiesToEven)) (.cse2 (exists ((ULTIMATE.start_SqrtR_~Input (_ FloatingPoint 11 53))) (let ((.cse7 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= c_ULTIMATE.start_SqrtR_~xnp1~0 (fp.add c_currentRoundingMode .cse7 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse7 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ULTIMATE.start_SqrtR_~Input .cse7) .cse7))) ((_ to_fp 11 53) c_currentRoundingMode 2.0)))) (fp.leq ULTIMATE.start_SqrtR_~Input .cse7) (fp.geq ULTIMATE.start_SqrtR_~Input (fp.sub c_currentRoundingMode .cse7 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 100000000.0)))))))) (.cse4 (fp.lt .cse5 (fp.neg .cse6)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse1 .cse2 .cse3) (and (not .cse0) .cse1 .cse2 (not .cse4) (= (_ bv0 32) c_ULTIMATE.start_SqrtR_~cond~0))))) is different from false [2020-12-03 18:44:52,779 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse5 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) (fp.sub c_currentRoundingMode c_ULTIMATE.start_SqrtR_~xnp1~0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) (.cse6 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0)) (fp.add c_currentRoundingMode c_ULTIMATE.start_SqrtR_~xnp1~0 c_ULTIMATE.start_SqrtR_~xnp1~0)))) (let ((.cse3 (= (_ bv1 32) c_ULTIMATE.start_SqrtR_~cond~0)) (.cse0 (fp.gt .cse5 .cse6)) (.cse1 (= c_currentRoundingMode roundNearestTiesToEven)) (.cse2 (exists ((ULTIMATE.start_SqrtR_~Input (_ FloatingPoint 11 53))) (let ((.cse7 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= c_ULTIMATE.start_SqrtR_~xnp1~0 (fp.add c_currentRoundingMode .cse7 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse7 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ULTIMATE.start_SqrtR_~Input .cse7) .cse7))) ((_ to_fp 11 53) c_currentRoundingMode 2.0)))) (fp.leq ULTIMATE.start_SqrtR_~Input .cse7) (fp.geq ULTIMATE.start_SqrtR_~Input (fp.sub c_currentRoundingMode .cse7 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 100000000.0)))))))) (.cse4 (fp.lt .cse5 (fp.neg .cse6)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse1 .cse2 .cse3) (and (not .cse0) .cse1 .cse2 (not .cse4) (= (_ bv0 32) c_ULTIMATE.start_SqrtR_~cond~0))))) is different from true [2020-12-03 18:44:54,911 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) (fp.sub c_currentRoundingMode c_ULTIMATE.start_SqrtR_~xnp1~0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) (.cse1 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0)) (fp.add c_currentRoundingMode c_ULTIMATE.start_SqrtR_~xnp1~0 c_ULTIMATE.start_SqrtR_~xnp1~0)))) (and (not (fp.gt .cse0 .cse1)) (= c_currentRoundingMode roundNearestTiesToEven) (exists ((ULTIMATE.start_SqrtR_~Input (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= c_ULTIMATE.start_SqrtR_~xnp1~0 (fp.add c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ULTIMATE.start_SqrtR_~Input .cse2) .cse2))) ((_ to_fp 11 53) c_currentRoundingMode 2.0)))) (fp.leq ULTIMATE.start_SqrtR_~Input .cse2) (fp.geq ULTIMATE.start_SqrtR_~Input (fp.sub c_currentRoundingMode .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 100000000.0))))))) (not (fp.lt .cse0 (fp.neg .cse1))))) is different from false [2020-12-03 18:44:56,971 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 2.0) (fp.sub c_currentRoundingMode c_ULTIMATE.start_SqrtR_~xnp1~0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) (.cse1 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0)) (fp.add c_currentRoundingMode c_ULTIMATE.start_SqrtR_~xnp1~0 c_ULTIMATE.start_SqrtR_~xnp1~0)))) (and (not (fp.gt .cse0 .cse1)) (= c_currentRoundingMode roundNearestTiesToEven) (exists ((ULTIMATE.start_SqrtR_~Input (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= c_ULTIMATE.start_SqrtR_~xnp1~0 (fp.add c_currentRoundingMode .cse2 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ULTIMATE.start_SqrtR_~Input .cse2) .cse2))) ((_ to_fp 11 53) c_currentRoundingMode 2.0)))) (fp.leq ULTIMATE.start_SqrtR_~Input .cse2) (fp.geq ULTIMATE.start_SqrtR_~Input (fp.sub c_currentRoundingMode .cse2 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 100000000.0))))))) (not (fp.lt .cse0 (fp.neg .cse1))))) is different from true [2020-12-03 18:44:59,286 WARN L838 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (exists ((ULTIMATE.start_SqrtR_~Input (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0)) (.cse4 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (let ((.cse1 (fp.add c_currentRoundingMode .cse0 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv1 32)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ULTIMATE.start_SqrtR_~Input .cse0) .cse0))) .cse4)))) (let ((.cse2 (fp.mul c_currentRoundingMode .cse4 (fp.sub c_currentRoundingMode .cse1 .cse0))) (.cse3 (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 1000000.0)) (fp.add c_currentRoundingMode .cse1 .cse1)))) (and (= |c_ULTIMATE.start_SqrtR_#res| (fp.div c_currentRoundingMode .cse0 .cse1)) (fp.leq ULTIMATE.start_SqrtR_~Input .cse0) (fp.geq ULTIMATE.start_SqrtR_~Input (fp.sub c_currentRoundingMode .cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 100000000.0)))) (not (fp.gt .cse2 .cse3)) (not (fp.lt .cse2 (fp.neg .cse3))))))))) is different from false [2020-12-03 18:44:59,318 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-03 18:45:01,647 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-03 18:45:18,221 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse11 (= c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))) (or (and (= (bvadd c_ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32)) (exists ((ULTIMATE.start_SqrtR_~Input (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse5 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (let ((.cse4 (fp.add roundNearestTiesToEven .cse0 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ULTIMATE.start_SqrtR_~Input .cse0) .cse0))) .cse5)))) (let ((.cse3 (fp.div roundNearestTiesToEven .cse0 .cse4)) (.cse1 (fp.mul roundNearestTiesToEven .cse5 (fp.sub roundNearestTiesToEven .cse4 .cse0))) (.cse2 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0)) (fp.add roundNearestTiesToEven .cse4 .cse4)))) (and (fp.geq ULTIMATE.start_SqrtR_~Input (fp.sub roundNearestTiesToEven .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 100000000.0)))) (not (fp.lt .cse1 (fp.neg .cse2))) (fp.leq .cse3 ((_ to_fp 11 53) roundNearestTiesToEven 5.0)) (fp.leq ULTIMATE.start_SqrtR_~Input .cse0) (fp.geq .cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 9.0 10.0))) (not (fp.gt .cse1 .cse2)))))))) (and (exists ((ULTIMATE.start_SqrtR_~Input (_ FloatingPoint 11 53))) (let ((.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse10 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (let ((.cse7 (fp.add roundNearestTiesToEven .cse6 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse6 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ULTIMATE.start_SqrtR_~Input .cse6) .cse6))) .cse10)))) (let ((.cse8 (fp.mul roundNearestTiesToEven .cse10 (fp.sub roundNearestTiesToEven .cse7 .cse6))) (.cse9 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0)) (fp.add roundNearestTiesToEven .cse7 .cse7)))) (and (fp.geq ULTIMATE.start_SqrtR_~Input (fp.sub roundNearestTiesToEven .cse6 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 100000000.0)))) (not (fp.geq (fp.div roundNearestTiesToEven .cse6 .cse7) ((_ to_fp 11 53) roundNearestTiesToEven (/ 9.0 10.0)))) (not (fp.lt .cse8 (fp.neg .cse9))) (fp.leq ULTIMATE.start_SqrtR_~Input .cse6) (not (fp.gt .cse8 .cse9))))))) .cse11) (and (exists ((ULTIMATE.start_SqrtR_~Input (_ FloatingPoint 11 53))) (let ((.cse12 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse16 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (let ((.cse15 (fp.add roundNearestTiesToEven .cse12 (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse12 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv1 32)) (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ULTIMATE.start_SqrtR_~Input .cse12) .cse12))) .cse16)))) (let ((.cse13 (fp.mul roundNearestTiesToEven .cse16 (fp.sub roundNearestTiesToEven .cse15 .cse12))) (.cse14 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000.0)) (fp.add roundNearestTiesToEven .cse15 .cse15)))) (and (fp.geq ULTIMATE.start_SqrtR_~Input (fp.sub roundNearestTiesToEven .cse12 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 100000000.0)))) (not (fp.lt .cse13 (fp.neg .cse14))) (fp.leq ULTIMATE.start_SqrtR_~Input .cse12) (not (fp.leq (fp.div roundNearestTiesToEven .cse12 .cse15) ((_ to_fp 11 53) roundNearestTiesToEven 5.0))) (not (fp.gt .cse13 .cse14))))))) .cse11))) is different from false [2020-12-03 18:45:29,075 WARN L195 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2020-12-03 18:45:29,076 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [773662167] [2020-12-03 18:45:29,077 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-12-03 18:45:29,077 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1005537757] [2020-12-03 18:45:29,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt [2020-12-03 18:45:37,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 18:45:37,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 24 conjunts are in the unsatisfiable core [2020-12-03 18:45:37,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-03 18:45:37,279 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-12-03 18:45:37,280 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930324806] [2020-12-03 18:45:37,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-03 18:52:50,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 18:52:51,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 21 conjunts are in the unsatisfiable core [2020-12-03 18:52:51,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-03 18:52:51,022 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-12-03 18:52:51,022 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2020-12-03 18:52:51,022 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2020-12-03 18:52:51,023 ERROR L205 FreeRefinementEngine]: Strategy WOLF failed to provide any proof altough trace is infeasible [2020-12-03 18:52:51,023 INFO L523 BasicCegarLoop]: Counterexample might be feasible [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forcibly destroying the process [2020-12-03 18:52:51,628 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3,6 cvc4 --incremental --print-success --lang smt,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-03 18:52:51,653 WARN L254 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2020-12-03 18:52:51,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 06:52:51 BoogieIcfgContainer [2020-12-03 18:52:51,654 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-03 18:52:51,658 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-03 18:52:51,659 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-03 18:52:51,659 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-03 18:52:51,660 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:42:23" (3/4) ... [2020-12-03 18:52:51,663 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-12-03 18:52:51,663 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-03 18:52:51,664 INFO L168 Benchmark]: Toolchain (without parser) took 637928.33 ms. Allocated memory was 46.1 MB in the beginning and 56.6 MB in the end (delta: 10.5 MB). Free memory was 23.8 MB in the beginning and 39.5 MB in the end (delta: -15.7 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-03 18:52:51,665 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 35.7 MB. Free memory is still 18.4 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-03 18:52:51,666 INFO L168 Benchmark]: CACSL2BoogieTranslator took 318.08 ms. Allocated memory is still 46.1 MB. Free memory was 23.7 MB in the beginning and 24.1 MB in the end (delta: -347.5 kB). Peak memory consumption was 5.4 MB. Max. memory is 16.1 GB. [2020-12-03 18:52:51,667 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.57 ms. Allocated memory is still 46.1 MB. Free memory was 24.1 MB in the beginning and 22.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-03 18:52:51,668 INFO L168 Benchmark]: Boogie Preprocessor took 41.32 ms. Allocated memory is still 46.1 MB. Free memory was 22.3 MB in the beginning and 21.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-03 18:52:51,668 INFO L168 Benchmark]: RCFGBuilder took 9361.43 ms. Allocated memory was 46.1 MB in the beginning and 56.6 MB in the end (delta: 10.5 MB). Free memory was 20.9 MB in the beginning and 38.3 MB in the end (delta: -17.4 MB). Peak memory consumption was 6.2 MB. Max. memory is 16.1 GB. [2020-12-03 18:52:51,669 INFO L168 Benchmark]: TraceAbstraction took 628145.06 ms. Allocated memory is still 56.6 MB. Free memory was 37.8 MB in the beginning and 39.9 MB in the end (delta: -2.1 MB). Peak memory consumption was 18.0 MB. Max. memory is 16.1 GB. [2020-12-03 18:52:51,670 INFO L168 Benchmark]: Witness Printer took 4.98 ms. Allocated memory is still 56.6 MB. Free memory was 39.9 MB in the beginning and 39.5 MB in the end (delta: 399.8 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-03 18:52:51,675 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.28 ms. Allocated memory is still 35.7 MB. Free memory is still 18.4 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 318.08 ms. Allocated memory is still 46.1 MB. Free memory was 23.7 MB in the beginning and 24.1 MB in the end (delta: -347.5 kB). Peak memory consumption was 5.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 43.57 ms. Allocated memory is still 46.1 MB. Free memory was 24.1 MB in the beginning and 22.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 41.32 ms. Allocated memory is still 46.1 MB. Free memory was 22.3 MB in the beginning and 21.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 9361.43 ms. Allocated memory was 46.1 MB in the beginning and 56.6 MB in the end (delta: 10.5 MB). Free memory was 20.9 MB in the beginning and 38.3 MB in the end (delta: -17.4 MB). Peak memory consumption was 6.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 628145.06 ms. Allocated memory is still 56.6 MB. Free memory was 37.8 MB in the beginning and 39.9 MB in the end (delta: -2.1 MB). Peak memory consumption was 18.0 MB. Max. memory is 16.1 GB. * Witness Printer took 4.98 ms. Allocated memory is still 56.6 MB. Free memory was 39.9 MB in the beginning and 39.5 MB in the end (delta: 399.8 kB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 13]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is 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 TRUE Input <= 1.0 [L21] xn = 1.0 [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 TRUE \read(cond) [L29] xnp1 = xn + xn*(1-Input*xn*xn) / 2.0 [L30] residu = 2.0*(xnp1-xn) [L31] xn = xnp1 [L32] lsup = _EPS * (xn+xnp1) [L33] linf = -lsup [L34] cond = ((residu > lsup) || (residu < linf)) [L35] i++ [L28] COND FALSE !(\read(cond)) [L37] return 1.0 / xnp1; [L50] r = SqrtR(dd) [L13] COND TRUE !(cond) [L13] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNKNOWN, OverallTime: 628.0s, OverallIterations: 4, TraceHistogramMax: 1, AutomataDifference: 78.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 40 SDtfs, 14 SDslu, 56 SDs, 0 SdLazy, 39 SolverSat, 0 SolverUnsat, 15 SolverUnknown, 0 SolverNotchecked, 40.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 56.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=3, 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, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 6.2s SatisfiabilityAnalysisTime, 47.3s InterpolantComputationTime, 36 NumberOfCodeBlocks, 36 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 33 ConstructedInterpolants, 6 QuantifiedInterpolants, 14685 SizeOfPredicates, 26 NumberOfNonLiveVariables, 141 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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...