./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/sqrt_Householder_interval.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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 ../sv-benchmarks/c/float-benchs/sqrt_Householder_interval.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 3bb1d9e312234d5c4f7ead2dcb51cc43e4ff3aebeffef1b0758f6a0d5be2ea9b --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:25:21,988 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:25:21,989 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:25:22,027 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:25:22,027 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:25:22,030 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:25:22,031 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:25:22,033 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:25:22,035 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:25:22,038 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:25:22,039 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:25:22,040 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:25:22,040 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:25:22,042 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:25:22,043 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:25:22,046 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:25:22,047 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:25:22,048 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:25:22,049 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:25:22,055 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:25:22,055 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:25:22,056 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:25:22,057 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:25:22,058 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:25:22,063 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:25:22,063 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:25:22,064 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:25:22,065 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:25:22,065 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:25:22,066 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:25:22,066 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:25:22,067 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:25:22,068 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:25:22,069 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:25:22,069 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:25:22,070 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:25:22,070 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:25:22,070 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:25:22,070 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:25:22,071 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:25:22,072 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:25:22,073 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 16:25:22,097 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:25:22,097 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:25:22,097 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:25:22,098 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:25:22,098 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:25:22,099 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:25:22,099 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:25:22,099 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:25:22,099 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:25:22,100 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:25:22,100 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:25:22,100 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:25:22,100 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:25:22,101 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:25:22,101 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:25:22,101 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:25:22,101 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:25:22,101 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:25:22,101 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:25:22,102 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:25:22,102 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:25:22,102 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:25:22,102 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:25:22,102 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:25:22,102 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:25:22,103 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:25:22,103 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:25:22,104 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:25:22,104 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:25:22,104 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:25:22,104 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:25:22,104 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:25:22,105 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:25:22,105 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 -> 3bb1d9e312234d5c4f7ead2dcb51cc43e4ff3aebeffef1b0758f6a0d5be2ea9b [2022-02-20 16:25:22,295 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:25:22,322 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:25:22,337 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:25:22,338 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:25:22,338 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:25:22,339 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/sqrt_Householder_interval.c [2022-02-20 16:25:22,387 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a399eb146/97925165e020408fa872b649bbecb72b/FLAGd34637863 [2022-02-20 16:25:22,735 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:25:22,735 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/sqrt_Householder_interval.c [2022-02-20 16:25:22,739 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a399eb146/97925165e020408fa872b649bbecb72b/FLAGd34637863 [2022-02-20 16:25:22,749 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a399eb146/97925165e020408fa872b649bbecb72b [2022-02-20 16:25:22,751 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:25:22,753 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:25:22,754 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:25:22,754 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:25:22,756 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:25:22,758 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:25:22" (1/1) ... [2022-02-20 16:25:22,758 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@155a376f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:25:22, skipping insertion in model container [2022-02-20 16:25:22,758 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:25:22" (1/1) ... [2022-02-20 16:25:22,763 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:25:22,774 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:25:22,890 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/sqrt_Householder_interval.c[831,844] [2022-02-20 16:25:22,903 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:25:22,911 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:25:22,919 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/sqrt_Householder_interval.c[831,844] [2022-02-20 16:25:22,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:25:22,934 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:25:22,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:25:22 WrapperNode [2022-02-20 16:25:22,934 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:25:22,935 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:25:22,935 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:25:22,935 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:25:22,940 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:25:22" (1/1) ... [2022-02-20 16:25:22,944 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:25:22" (1/1) ... [2022-02-20 16:25:22,960 INFO L137 Inliner]: procedures = 15, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 63 [2022-02-20 16:25:22,960 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:25:22,961 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:25:22,961 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:25:22,961 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:25:22,966 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:25:22" (1/1) ... [2022-02-20 16:25:22,967 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:25:22" (1/1) ... [2022-02-20 16:25:22,968 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:25:22" (1/1) ... [2022-02-20 16:25:22,968 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:25:22" (1/1) ... [2022-02-20 16:25:22,972 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:25:22" (1/1) ... [2022-02-20 16:25:22,974 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:25:22" (1/1) ... [2022-02-20 16:25:22,975 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:25:22" (1/1) ... [2022-02-20 16:25:22,976 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:25:22,976 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:25:22,977 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:25:22,977 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:25:22,977 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:25:22" (1/1) ... [2022-02-20 16:25:22,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:25:22,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:25:23,011 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 16:25:23,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 16:25:23,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:25:23,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:25:23,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:25:23,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:25:23,099 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:25:23,100 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:25:23,222 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:25:23,226 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:25:23,226 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 16:25:23,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:25:23 BoogieIcfgContainer [2022-02-20 16:25:23,227 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:25:23,228 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:25:23,228 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:25:23,233 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:25:23,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:25:22" (1/3) ... [2022-02-20 16:25:23,234 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5803cd41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:25:23, skipping insertion in model container [2022-02-20 16:25:23,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:25:22" (2/3) ... [2022-02-20 16:25:23,234 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5803cd41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:25:23, skipping insertion in model container [2022-02-20 16:25:23,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:25:23" (3/3) ... [2022-02-20 16:25:23,235 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_interval.c [2022-02-20 16:25:23,238 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:25:23,238 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:25:23,273 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:25:23,286 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 16:25:23,286 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:25:23,299 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:25:23,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:25:23,319 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:25:23,319 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:25:23,320 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:25:23,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:25:23,323 INFO L85 PathProgramCache]: Analyzing trace with hash 334453616, now seen corresponding path program 1 times [2022-02-20 16:25:23,329 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:25:23,329 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59956633] [2022-02-20 16:25:23,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:25:23,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:25:23,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:25:23,435 INFO L290 TraceCheckUtils]: 0: Hoare triple {19#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(28, 2);call #Ultimate.allocInit(12, 3);~_EPS~0 := 1.0E-6; {19#true} is VALID [2022-02-20 16:25:23,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {19#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~d~0#1, main_~r~0#1;havoc main_~d~0#1;havoc main_~r~0#1;main_~d~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~someBinaryDOUBLEComparisonOperation(main_~d~0#1, 0.1) && ~someBinaryDOUBLEComparisonOperation(main_~d~0#1, 20.0) then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {19#true} is VALID [2022-02-20 16:25:23,437 INFO L290 TraceCheckUtils]: 2: Hoare triple {19#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {20#false} is VALID [2022-02-20 16:25:23,437 INFO L290 TraceCheckUtils]: 3: Hoare triple {20#false} assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_SqrtR } true;SqrtR_#in~Input#1 := main_~d~0#1;havoc SqrtR_#res#1;havoc SqrtR_#t~post4#1, SqrtR_~Input#1, SqrtR_~xn~0#1, SqrtR_~xnp1~0#1, SqrtR_~residu~0#1, SqrtR_~lsup~0#1, SqrtR_~linf~0#1, SqrtR_~i~0#1, SqrtR_~cond~0#1;SqrtR_~Input#1 := SqrtR_#in~Input#1;havoc SqrtR_~xn~0#1;havoc SqrtR_~xnp1~0#1;havoc SqrtR_~residu~0#1;havoc SqrtR_~lsup~0#1;havoc SqrtR_~linf~0#1;havoc SqrtR_~i~0#1;havoc SqrtR_~cond~0#1; {20#false} is VALID [2022-02-20 16:25:23,437 INFO L290 TraceCheckUtils]: 4: Hoare triple {20#false} assume ~someBinaryDOUBLEComparisonOperation(SqrtR_~Input#1, 1.0);SqrtR_~xn~0#1 := 1.0; {20#false} is VALID [2022-02-20 16:25:23,437 INFO L290 TraceCheckUtils]: 5: Hoare triple {20#false} SqrtR_~xnp1~0#1 := SqrtR_~xn~0#1;SqrtR_~residu~0#1 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(2.0, ~_EPS~0), ~someBinaryArithmeticDOUBLEoperation(SqrtR_~xn~0#1, SqrtR_~xnp1~0#1));SqrtR_~lsup~0#1 := ~someBinaryArithmeticDOUBLEoperation(~_EPS~0, ~someBinaryArithmeticDOUBLEoperation(SqrtR_~xn~0#1, SqrtR_~xnp1~0#1));SqrtR_~linf~0#1 := ~someUnaryDOUBLEoperation(SqrtR_~lsup~0#1);SqrtR_~cond~0#1 := (if ~someBinaryDOUBLEComparisonOperation(SqrtR_~residu~0#1, SqrtR_~lsup~0#1) || ~someBinaryDOUBLEComparisonOperation(SqrtR_~residu~0#1, SqrtR_~linf~0#1) then 1 else 0);SqrtR_~i~0#1 := 0; {20#false} is VALID [2022-02-20 16:25:23,437 INFO L290 TraceCheckUtils]: 6: Hoare triple {20#false} assume !(0 != SqrtR_~cond~0#1); {20#false} is VALID [2022-02-20 16:25:23,438 INFO L290 TraceCheckUtils]: 7: Hoare triple {20#false} SqrtR_#res#1 := ~someBinaryArithmeticDOUBLEoperation(1.0, SqrtR_~xnp1~0#1); {20#false} is VALID [2022-02-20 16:25:23,438 INFO L290 TraceCheckUtils]: 8: Hoare triple {20#false} main_#t~ret6#1 := SqrtR_#res#1;assume { :end_inline_SqrtR } true;main_~r~0#1 := main_#t~ret6#1;havoc main_#t~ret6#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if ~someBinaryDOUBLEComparisonOperation(main_~r~0#1, 0.3) && ~someBinaryDOUBLEComparisonOperation(main_~r~0#1, 5.0) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {20#false} is VALID [2022-02-20 16:25:23,438 INFO L290 TraceCheckUtils]: 9: Hoare triple {20#false} assume 0 == __VERIFIER_assert_~cond#1; {20#false} is VALID [2022-02-20 16:25:23,438 INFO L290 TraceCheckUtils]: 10: Hoare triple {20#false} assume !false; {20#false} is VALID [2022-02-20 16:25:23,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:25:23,439 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:25:23,440 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59956633] [2022-02-20 16:25:23,441 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59956633] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:25:23,441 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:25:23,441 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:25:23,442 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761782809] [2022-02-20 16:25:23,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:25:23,446 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 16:25:23,446 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:25:23,448 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:25:23,459 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:25:23,460 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:25:23,460 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:25:23,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:25:23,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:25:23,476 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:25:23,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:25:23,509 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2022-02-20 16:25:23,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:25:23,509 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 16:25:23,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:25:23,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:25:23,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 36 transitions. [2022-02-20 16:25:23,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:25:23,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 36 transitions. [2022-02-20 16:25:23,517 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 36 transitions. [2022-02-20 16:25:23,544 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:25:23,549 INFO L225 Difference]: With dead ends: 29 [2022-02-20 16:25:23,549 INFO L226 Difference]: Without dead ends: 12 [2022-02-20 16:25:23,551 INFO L932 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 [2022-02-20 16:25:23,553 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:25:23,554 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:25:23,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-02-20 16:25:23,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-02-20 16:25:23,570 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:25:23,570 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:25:23,570 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:25:23,571 INFO L87 Difference]: Start difference. First operand 12 states. Second operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:25:23,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:25:23,572 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2022-02-20 16:25:23,572 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2022-02-20 16:25:23,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:25:23,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:25:23,573 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 12 states. [2022-02-20 16:25:23,573 INFO L87 Difference]: Start difference. First operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 12 states. [2022-02-20 16:25:23,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:25:23,574 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2022-02-20 16:25:23,574 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2022-02-20 16:25:23,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:25:23,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:25:23,575 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:25:23,575 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:25:23,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:25:23,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2022-02-20 16:25:23,577 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 11 [2022-02-20 16:25:23,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:25:23,577 INFO L470 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2022-02-20 16:25:23,577 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:25:23,577 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2022-02-20 16:25:23,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:25:23,578 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:25:23,578 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:25:23,578 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:25:23,579 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:25:23,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:25:23,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1014511986, now seen corresponding path program 1 times [2022-02-20 16:25:23,579 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:25:23,580 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157849078] [2022-02-20 16:25:23,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:25:23,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:25:23,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:25:23,598 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:25:23,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:25:23,620 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:25:23,620 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:25:23,621 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:25:23,622 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:25:23,625 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-02-20 16:25:23,626 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:25:23,641 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:25:23,641 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:25:23,642 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-02-20 16:25:23,642 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-02-20 16:25:23,642 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-02-20 16:25:23,642 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-02-20 16:25:23,642 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-02-20 16:25:23,642 WARN L170 areAnnotationChecker]: L28-2 has no Hoare annotation [2022-02-20 16:25:23,642 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2022-02-20 16:25:23,642 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2022-02-20 16:25:23,643 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2022-02-20 16:25:23,643 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2022-02-20 16:25:23,643 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-02-20 16:25:23,643 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-02-20 16:25:23,643 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-02-20 16:25:23,643 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2022-02-20 16:25:23,643 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2022-02-20 16:25:23,643 WARN L170 areAnnotationChecker]: L20-3 has no Hoare annotation [2022-02-20 16:25:23,643 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-02-20 16:25:23,644 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:25:23,644 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 16:25:23,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:25:23 BoogieIcfgContainer [2022-02-20 16:25:23,644 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:25:23,645 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:25:23,645 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:25:23,645 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:25:23,646 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:25:23" (3/4) ... [2022-02-20 16:25:23,648 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 16:25:23,648 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:25:23,649 INFO L158 Benchmark]: Toolchain (without parser) took 895.89ms. Allocated memory was 102.8MB in the beginning and 132.1MB in the end (delta: 29.4MB). Free memory was 71.0MB in the beginning and 94.7MB in the end (delta: -23.7MB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. [2022-02-20 16:25:23,649 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 102.8MB. Free memory was 57.8MB in the beginning and 57.8MB in the end (delta: 41.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:25:23,650 INFO L158 Benchmark]: CACSL2BoogieTranslator took 180.19ms. Allocated memory is still 102.8MB. Free memory was 70.8MB in the beginning and 77.4MB in the end (delta: -6.6MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. [2022-02-20 16:25:23,650 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.45ms. Allocated memory is still 102.8MB. Free memory was 77.4MB in the beginning and 75.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:25:23,650 INFO L158 Benchmark]: Boogie Preprocessor took 14.81ms. Allocated memory is still 102.8MB. Free memory was 75.6MB in the beginning and 74.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:25:23,651 INFO L158 Benchmark]: RCFGBuilder took 250.87ms. Allocated memory is still 102.8MB. Free memory was 74.5MB in the beginning and 64.3MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 16:25:23,651 INFO L158 Benchmark]: TraceAbstraction took 416.23ms. Allocated memory was 102.8MB in the beginning and 132.1MB in the end (delta: 29.4MB). Free memory was 63.9MB in the beginning and 95.3MB in the end (delta: -31.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:25:23,652 INFO L158 Benchmark]: Witness Printer took 2.91ms. Allocated memory is still 132.1MB. Free memory was 95.3MB in the beginning and 94.7MB in the end (delta: 629.2kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:25:23,654 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 102.8MB. Free memory was 57.8MB in the beginning and 57.8MB in the end (delta: 41.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 180.19ms. Allocated memory is still 102.8MB. Free memory was 70.8MB in the beginning and 77.4MB in the end (delta: -6.6MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.45ms. Allocated memory is still 102.8MB. Free memory was 77.4MB in the beginning and 75.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 14.81ms. Allocated memory is still 102.8MB. Free memory was 75.6MB in the beginning and 74.5MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 250.87ms. Allocated memory is still 102.8MB. Free memory was 74.5MB in the beginning and 64.3MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 416.23ms. Allocated memory was 102.8MB in the beginning and 132.1MB in the end (delta: 29.4MB). Free memory was 63.9MB in the beginning and 95.3MB in the end (delta: -31.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.91ms. Allocated memory is still 132.1MB. Free memory was 95.3MB in the beginning and 94.7MB in the end (delta: 629.2kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 20]: 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 56, overapproximation of someUnaryDOUBLEoperation at line 32, overapproximation of someBinaryArithmeticDOUBLEoperation at line 44. Possible FailurePath: [L22] double _EPS = 1e-6; VAL [_EPS=1/1000000] [L49] double d, r; [L51] d = __VERIFIER_nondet_double() [L52] CALL assume_abort_if_not(d >= 0.1 && d <= 20.0) [L18] COND FALSE !(!cond) VAL [\old(cond)=1, _EPS=1/1000000, cond=1] [L52] RET assume_abort_if_not(d >= 0.1 && d <= 20.0) [L54] CALL, EXPR SqrtR(d) [L26] double xn, xnp1, residu, lsup, linf; [L27] int i, cond; VAL [\old(Input)=49, _EPS=1/1000000, Input=49] [L28] COND TRUE Input <= 1.0 [L28] xn = 1.0 VAL [\old(Input)=49, _EPS=1/1000000, Input=49, xn=1] [L29] xnp1 = xn [L30] residu = 2.0*_EPS*(xn+xnp1) [L31] lsup = _EPS * (xn+xnp1) [L32] linf = -lsup [L33] cond = ((residu > lsup) || (residu < linf)) [L34] i = 0 VAL [\old(Input)=49, _EPS=1/1000000, cond=0, i=0, Input=49, xn=1, xn=1] [L35] COND FALSE !(\read(cond)) VAL [\old(Input)=49, _EPS=1/1000000, cond=0, i=0, Input=49, xn=1, xn=1] [L44] return 1.0 / xnp1; VAL [\old(Input)=49, _EPS=1/1000000, cond=0, i=0, Input=49, xn=1, xn=1] [L54] RET, EXPR SqrtR(d) [L54] r = SqrtR(d) [L56] CALL __VERIFIER_assert(r >= 0.3 && r <= 5.) [L20] COND TRUE !(cond) VAL [\old(cond)=0, _EPS=1/1000000, cond=0] [L20] reach_error() VAL [\old(cond)=0, _EPS=1/1000000, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.4s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 17 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 17 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, 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=16occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 22 NumberOfCodeBlocks, 22 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 10 ConstructedInterpolants, 0 QuantifiedInterpolants, 10 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 [2022-02-20 16:25:23,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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 ../sv-benchmarks/c/float-benchs/sqrt_Householder_interval.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 3bb1d9e312234d5c4f7ead2dcb51cc43e4ff3aebeffef1b0758f6a0d5be2ea9b --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:25:25,454 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:25:25,457 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:25:25,494 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:25:25,494 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:25:25,497 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:25:25,498 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:25:25,501 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:25:25,503 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:25:25,506 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:25:25,507 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:25:25,510 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:25:25,510 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:25:25,512 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:25:25,513 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:25:25,515 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:25:25,516 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:25:25,516 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:25:25,518 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:25:25,522 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:25:25,523 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:25:25,524 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:25:25,525 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:25:25,526 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:25:25,531 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:25:25,531 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:25:25,531 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:25:25,532 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:25:25,533 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:25:25,533 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:25:25,533 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:25:25,534 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:25:25,535 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:25:25,536 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:25:25,536 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:25:25,537 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:25:25,537 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:25:25,538 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:25:25,538 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:25:25,539 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:25:25,539 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:25:25,540 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-02-20 16:25:25,568 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:25:25,569 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:25:25,569 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:25:25,570 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:25:25,570 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:25:25,571 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:25:25,571 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:25:25,572 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:25:25,572 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:25:25,572 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:25:25,573 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:25:25,573 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:25:25,573 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:25:25,574 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:25:25,574 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:25:25,574 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:25:25,574 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:25:25,574 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:25:25,574 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:25:25,574 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:25:25,574 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:25:25,575 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:25:25,575 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:25:25,575 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:25:25,575 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:25:25,575 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:25:25,575 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:25:25,576 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:25:25,576 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:25:25,576 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:25:25,576 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:25:25,576 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:25:25,576 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:25:25,576 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:25:25,577 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:25:25,577 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:25:25,577 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 -> 3bb1d9e312234d5c4f7ead2dcb51cc43e4ff3aebeffef1b0758f6a0d5be2ea9b [2022-02-20 16:25:25,850 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:25:25,871 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:25:25,872 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:25:25,873 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:25:25,873 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:25:25,874 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/sqrt_Householder_interval.c [2022-02-20 16:25:25,920 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b70e30da9/ff63fd8be1d146219505d241cce84b8f/FLAG0297fe7fe [2022-02-20 16:25:26,247 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:25:26,248 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/sqrt_Householder_interval.c [2022-02-20 16:25:26,253 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b70e30da9/ff63fd8be1d146219505d241cce84b8f/FLAG0297fe7fe [2022-02-20 16:25:26,670 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b70e30da9/ff63fd8be1d146219505d241cce84b8f [2022-02-20 16:25:26,672 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:25:26,673 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:25:26,676 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:25:26,676 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:25:26,681 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:25:26,682 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:25:26" (1/1) ... [2022-02-20 16:25:26,682 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37310a6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:25:26, skipping insertion in model container [2022-02-20 16:25:26,683 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:25:26" (1/1) ... [2022-02-20 16:25:26,690 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:25:26,701 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:25:26,811 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/sqrt_Householder_interval.c[831,844] [2022-02-20 16:25:26,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:25:26,833 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:25:26,845 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/sqrt_Householder_interval.c[831,844] [2022-02-20 16:25:26,850 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:25:26,865 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:25:26,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:25:26 WrapperNode [2022-02-20 16:25:26,865 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:25:26,866 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:25:26,866 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:25:26,866 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:25:26,871 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:25:26" (1/1) ... [2022-02-20 16:25:26,883 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:25:26" (1/1) ... [2022-02-20 16:25:26,913 INFO L137 Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 64 [2022-02-20 16:25:26,917 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:25:26,918 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:25:26,918 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:25:26,918 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:25:26,923 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:25:26" (1/1) ... [2022-02-20 16:25:26,923 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:25:26" (1/1) ... [2022-02-20 16:25:26,935 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:25:26" (1/1) ... [2022-02-20 16:25:26,938 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:25:26" (1/1) ... [2022-02-20 16:25:26,944 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:25:26" (1/1) ... [2022-02-20 16:25:26,947 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:25:26" (1/1) ... [2022-02-20 16:25:26,948 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:25:26" (1/1) ... [2022-02-20 16:25:26,954 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:25:26,955 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:25:26,956 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:25:26,956 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:25:26,957 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:25:26" (1/1) ... [2022-02-20 16:25:26,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:25:26,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:25:26,976 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 16:25:26,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 16:25:27,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:25:27,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:25:27,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:25:27,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:25:27,099 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:25:27,100 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:25:35,338 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:25:35,345 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:25:35,346 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 16:25:35,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:25:35 BoogieIcfgContainer [2022-02-20 16:25:35,347 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:25:35,351 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:25:35,355 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:25:35,357 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:25:35,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:25:26" (1/3) ... [2022-02-20 16:25:35,369 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2edba5bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:25:35, skipping insertion in model container [2022-02-20 16:25:35,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:25:26" (2/3) ... [2022-02-20 16:25:35,369 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2edba5bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:25:35, skipping insertion in model container [2022-02-20 16:25:35,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:25:35" (3/3) ... [2022-02-20 16:25:35,378 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_interval.c [2022-02-20 16:25:35,382 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:25:35,382 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:25:35,441 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:25:35,445 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 16:25:35,450 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:25:35,463 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:25:35,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:25:35,467 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:25:35,468 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:25:35,469 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:25:35,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:25:35,473 INFO L85 PathProgramCache]: Analyzing trace with hash 334453616, now seen corresponding path program 1 times [2022-02-20 16:25:35,481 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:25:35,482 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [482751402] [2022-02-20 16:25:35,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:25:35,483 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:25:35,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:25:35,485 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:25:35,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 16:25:36,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:25:36,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:25:36,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:25:36,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:25:36,870 INFO L290 TraceCheckUtils]: 0: Hoare triple {19#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(28bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~_EPS~0 := ~to_fp~DOUBLE(currentRoundingMode, 1.0E-6); {19#true} is VALID [2022-02-20 16:25:36,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {19#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~d~0#1, main_~r~0#1;havoc main_~d~0#1;havoc main_~r~0#1;main_~d~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~fp.geq~DOUBLE(main_~d~0#1, ~to_fp~DOUBLE(currentRoundingMode, 0.1)) && ~fp.leq~DOUBLE(main_~d~0#1, ~to_fp~DOUBLE(currentRoundingMode, 20.0)) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {19#true} is VALID [2022-02-20 16:25:36,871 INFO L290 TraceCheckUtils]: 2: Hoare triple {19#true} assume 0bv32 == assume_abort_if_not_~cond#1;assume false; {20#false} is VALID [2022-02-20 16:25:36,871 INFO L290 TraceCheckUtils]: 3: Hoare triple {20#false} assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_SqrtR } true;SqrtR_#in~Input#1 := main_~d~0#1;havoc SqrtR_#res#1;havoc SqrtR_#t~post4#1, SqrtR_~Input#1, SqrtR_~xn~0#1, SqrtR_~xnp1~0#1, SqrtR_~residu~0#1, SqrtR_~lsup~0#1, SqrtR_~linf~0#1, SqrtR_~i~0#1, SqrtR_~cond~0#1;SqrtR_~Input#1 := SqrtR_#in~Input#1;havoc SqrtR_~xn~0#1;havoc SqrtR_~xnp1~0#1;havoc SqrtR_~residu~0#1;havoc SqrtR_~lsup~0#1;havoc SqrtR_~linf~0#1;havoc SqrtR_~i~0#1;havoc SqrtR_~cond~0#1; {20#false} is VALID [2022-02-20 16:25:36,871 INFO L290 TraceCheckUtils]: 4: Hoare triple {20#false} assume ~fp.leq~DOUBLE(SqrtR_~Input#1, ~to_fp~DOUBLE(currentRoundingMode, 1.0));SqrtR_~xn~0#1 := ~to_fp~DOUBLE(currentRoundingMode, 1.0); {20#false} is VALID [2022-02-20 16:25:36,872 INFO L290 TraceCheckUtils]: 5: Hoare triple {20#false} SqrtR_~xnp1~0#1 := SqrtR_~xn~0#1;SqrtR_~residu~0#1 := ~fp.mul~DOUBLE(currentRoundingMode, ~fp.mul~DOUBLE(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 2.0), ~_EPS~0), ~fp.add~DOUBLE(currentRoundingMode, SqrtR_~xn~0#1, SqrtR_~xnp1~0#1));SqrtR_~lsup~0#1 := ~fp.mul~DOUBLE(currentRoundingMode, ~_EPS~0, ~fp.add~DOUBLE(currentRoundingMode, SqrtR_~xn~0#1, SqrtR_~xnp1~0#1));SqrtR_~linf~0#1 := ~fp.neg~DOUBLE(SqrtR_~lsup~0#1);SqrtR_~cond~0#1 := (if ~fp.gt~DOUBLE(SqrtR_~residu~0#1, SqrtR_~lsup~0#1) || ~fp.lt~DOUBLE(SqrtR_~residu~0#1, SqrtR_~linf~0#1) then 1bv32 else 0bv32);SqrtR_~i~0#1 := 0bv32; {20#false} is VALID [2022-02-20 16:25:36,872 INFO L290 TraceCheckUtils]: 6: Hoare triple {20#false} assume !(0bv32 != SqrtR_~cond~0#1); {20#false} is VALID [2022-02-20 16:25:36,872 INFO L290 TraceCheckUtils]: 7: Hoare triple {20#false} SqrtR_#res#1 := ~fp.div~DOUBLE(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0), SqrtR_~xnp1~0#1); {20#false} is VALID [2022-02-20 16:25:36,872 INFO L290 TraceCheckUtils]: 8: Hoare triple {20#false} main_#t~ret6#1 := SqrtR_#res#1;assume { :end_inline_SqrtR } true;main_~r~0#1 := main_#t~ret6#1;havoc main_#t~ret6#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if ~fp.geq~DOUBLE(main_~r~0#1, ~to_fp~DOUBLE(currentRoundingMode, 0.3)) && ~fp.leq~DOUBLE(main_~r~0#1, ~to_fp~DOUBLE(currentRoundingMode, 5.0)) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {20#false} is VALID [2022-02-20 16:25:36,872 INFO L290 TraceCheckUtils]: 9: Hoare triple {20#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {20#false} is VALID [2022-02-20 16:25:36,873 INFO L290 TraceCheckUtils]: 10: Hoare triple {20#false} assume !false; {20#false} is VALID [2022-02-20 16:25:36,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:25:36,873 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:25:36,874 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:25:36,874 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [482751402] [2022-02-20 16:25:36,874 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [482751402] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:25:36,875 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:25:36,875 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:25:36,876 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706434144] [2022-02-20 16:25:36,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:25:36,880 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 16:25:36,880 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:25:36,883 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:25:37,845 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:25:37,845 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:25:37,845 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:25:37,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:25:37,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:25:37,868 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:25:47,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:25:47,021 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2022-02-20 16:25:47,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:25:47,021 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 16:25:47,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:25:47,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:25:47,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 36 transitions. [2022-02-20 16:25:47,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:25:47,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 36 transitions. [2022-02-20 16:25:47,029 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 36 transitions. [2022-02-20 16:25:53,012 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:25:53,017 INFO L225 Difference]: With dead ends: 29 [2022-02-20 16:25:53,018 INFO L226 Difference]: Without dead ends: 12 [2022-02-20 16:25:53,020 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:25:53,023 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:25:53,025 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:25:53,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-02-20 16:25:53,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-02-20 16:25:53,048 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:25:53,049 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:25:53,050 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:25:53,050 INFO L87 Difference]: Start difference. First operand 12 states. Second operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:25:53,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:25:53,056 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2022-02-20 16:25:53,056 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2022-02-20 16:25:53,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:25:53,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:25:53,057 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 12 states. [2022-02-20 16:25:53,058 INFO L87 Difference]: Start difference. First operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 12 states. [2022-02-20 16:25:53,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:25:53,066 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2022-02-20 16:25:53,067 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2022-02-20 16:25:53,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:25:53,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:25:53,067 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:25:53,067 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:25:53,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:25:53,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2022-02-20 16:25:53,071 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 11 [2022-02-20 16:25:53,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:25:53,072 INFO L470 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2022-02-20 16:25:53,073 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:25:53,075 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2022-02-20 16:25:53,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:25:53,076 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:25:53,076 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:25:53,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-02-20 16:25:53,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:25:53,292 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:25:53,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:25:53,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1014511986, now seen corresponding path program 1 times [2022-02-20 16:25:53,293 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:25:53,293 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1620078065] [2022-02-20 16:25:53,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:25:53,293 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:25:53,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:25:53,295 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:25:53,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 16:25:54,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:25:54,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 16:25:54,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:25:54,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:25:55,753 INFO L290 TraceCheckUtils]: 0: Hoare triple {128#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(28bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~_EPS~0 := ~to_fp~DOUBLE(currentRoundingMode, 1.0E-6); {133#(and (= ~_EPS~0 ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000.0))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:25:55,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {133#(and (= ~_EPS~0 ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000.0))) (= currentRoundingMode roundNearestTiesToEven))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet5#1, main_#t~ret6#1, main_~d~0#1, main_~r~0#1;havoc main_~d~0#1;havoc main_~r~0#1;main_~d~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~fp.geq~DOUBLE(main_~d~0#1, ~to_fp~DOUBLE(currentRoundingMode, 0.1)) && ~fp.leq~DOUBLE(main_~d~0#1, ~to_fp~DOUBLE(currentRoundingMode, 20.0)) then 1bv32 else 0bv32);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {133#(and (= ~_EPS~0 ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000.0))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:25:55,755 INFO L290 TraceCheckUtils]: 2: Hoare triple {133#(and (= ~_EPS~0 ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000.0))) (= currentRoundingMode roundNearestTiesToEven))} assume !(0bv32 == assume_abort_if_not_~cond#1); {133#(and (= ~_EPS~0 ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000.0))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:25:55,755 INFO L290 TraceCheckUtils]: 3: Hoare triple {133#(and (= ~_EPS~0 ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000.0))) (= currentRoundingMode roundNearestTiesToEven))} assume { :end_inline_assume_abort_if_not } true;assume { :begin_inline_SqrtR } true;SqrtR_#in~Input#1 := main_~d~0#1;havoc SqrtR_#res#1;havoc SqrtR_#t~post4#1, SqrtR_~Input#1, SqrtR_~xn~0#1, SqrtR_~xnp1~0#1, SqrtR_~residu~0#1, SqrtR_~lsup~0#1, SqrtR_~linf~0#1, SqrtR_~i~0#1, SqrtR_~cond~0#1;SqrtR_~Input#1 := SqrtR_#in~Input#1;havoc SqrtR_~xn~0#1;havoc SqrtR_~xnp1~0#1;havoc SqrtR_~residu~0#1;havoc SqrtR_~lsup~0#1;havoc SqrtR_~linf~0#1;havoc SqrtR_~i~0#1;havoc SqrtR_~cond~0#1; {133#(and (= ~_EPS~0 ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000.0))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:25:55,756 INFO L290 TraceCheckUtils]: 4: Hoare triple {133#(and (= ~_EPS~0 ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000.0))) (= currentRoundingMode roundNearestTiesToEven))} assume ~fp.leq~DOUBLE(SqrtR_~Input#1, ~to_fp~DOUBLE(currentRoundingMode, 1.0));SqrtR_~xn~0#1 := ~to_fp~DOUBLE(currentRoundingMode, 1.0); {146#(and (= |ULTIMATE.start_SqrtR_~xn~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= ~_EPS~0 ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000.0))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:25:55,757 INFO L290 TraceCheckUtils]: 5: Hoare triple {146#(and (= |ULTIMATE.start_SqrtR_~xn~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= ~_EPS~0 ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000.0))) (= currentRoundingMode roundNearestTiesToEven))} SqrtR_~xnp1~0#1 := SqrtR_~xn~0#1;SqrtR_~residu~0#1 := ~fp.mul~DOUBLE(currentRoundingMode, ~fp.mul~DOUBLE(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 2.0), ~_EPS~0), ~fp.add~DOUBLE(currentRoundingMode, SqrtR_~xn~0#1, SqrtR_~xnp1~0#1));SqrtR_~lsup~0#1 := ~fp.mul~DOUBLE(currentRoundingMode, ~_EPS~0, ~fp.add~DOUBLE(currentRoundingMode, SqrtR_~xn~0#1, SqrtR_~xnp1~0#1));SqrtR_~linf~0#1 := ~fp.neg~DOUBLE(SqrtR_~lsup~0#1);SqrtR_~cond~0#1 := (if ~fp.gt~DOUBLE(SqrtR_~residu~0#1, SqrtR_~lsup~0#1) || ~fp.lt~DOUBLE(SqrtR_~residu~0#1, SqrtR_~linf~0#1) then 1bv32 else 0bv32);SqrtR_~i~0#1 := 0bv32; {150#(= (_ bv1 32) |ULTIMATE.start_SqrtR_~cond~0#1|)} is VALID [2022-02-20 16:25:55,757 INFO L290 TraceCheckUtils]: 6: Hoare triple {150#(= (_ bv1 32) |ULTIMATE.start_SqrtR_~cond~0#1|)} assume !(0bv32 != SqrtR_~cond~0#1); {129#false} is VALID [2022-02-20 16:25:55,758 INFO L290 TraceCheckUtils]: 7: Hoare triple {129#false} SqrtR_#res#1 := ~fp.div~DOUBLE(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0), SqrtR_~xnp1~0#1); {129#false} is VALID [2022-02-20 16:25:55,758 INFO L290 TraceCheckUtils]: 8: Hoare triple {129#false} main_#t~ret6#1 := SqrtR_#res#1;assume { :end_inline_SqrtR } true;main_~r~0#1 := main_#t~ret6#1;havoc main_#t~ret6#1;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if ~fp.geq~DOUBLE(main_~r~0#1, ~to_fp~DOUBLE(currentRoundingMode, 0.3)) && ~fp.leq~DOUBLE(main_~r~0#1, ~to_fp~DOUBLE(currentRoundingMode, 5.0)) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {129#false} is VALID [2022-02-20 16:25:55,758 INFO L290 TraceCheckUtils]: 9: Hoare triple {129#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {129#false} is VALID [2022-02-20 16:25:55,758 INFO L290 TraceCheckUtils]: 10: Hoare triple {129#false} assume !false; {129#false} is VALID [2022-02-20 16:25:55,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:25:55,758 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:25:55,758 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:25:55,759 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1620078065] [2022-02-20 16:25:55,759 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1620078065] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:25:55,759 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:25:55,759 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:25:55,759 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520351589] [2022-02-20 16:25:55,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:25:55,760 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 16:25:55,760 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:25:55,760 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:25:57,588 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:25:57,589 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:25:57,589 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:25:57,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:25:57,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:25:57,590 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:26:00,626 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.56s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 16:26:03,007 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 16:26:05,983 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.97s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 16:26:10,411 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.60s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 16:26:12,421 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 16:26:16,859 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 16:26:18,869 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 16:26:19,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:26:19,053 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2022-02-20 16:26:19,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:26:19,053 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 16:26:19,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:26:19,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:26:19,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2022-02-20 16:26:19,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:26:19,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2022-02-20 16:26:19,055 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 20 transitions. [2022-02-20 16:26:25,849 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:26:25,850 INFO L225 Difference]: With dead ends: 19 [2022-02-20 16:26:25,850 INFO L226 Difference]: Without dead ends: 14 [2022-02-20 16:26:25,850 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:26:25,851 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 1 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.7s IncrementalHoareTripleChecker+Time [2022-02-20 16:26:25,851 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 21 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 7 Unknown, 0 Unchecked, 16.7s Time] [2022-02-20 16:26:25,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-02-20 16:26:25,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-02-20 16:26:25,853 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:26:25,853 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:26:25,853 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:26:25,854 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:26:25,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:26:25,854 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-02-20 16:26:25,855 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-02-20 16:26:25,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:26:25,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:26:25,855 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 14 states. [2022-02-20 16:26:25,855 INFO L87 Difference]: Start difference. First operand has 14 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 14 states. [2022-02-20 16:26:25,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:26:25,856 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-02-20 16:26:25,856 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-02-20 16:26:25,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:26:25,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:26:25,857 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:26:25,857 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:26:25,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:26:25,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-02-20 16:26:25,859 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2022-02-20 16:26:25,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:26:25,859 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-02-20 16:26:25,859 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:26:25,860 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-02-20 16:26:25,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:26:25,860 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:26:25,860 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:26:25,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 16:26:26,075 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:26:26,076 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:26:26,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:26:26,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1505447948, now seen corresponding path program 1 times [2022-02-20 16:26:26,077 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:26:26,077 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1656936813] [2022-02-20 16:26:26,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:26:26,077 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:26:26,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:26:26,084 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:26:26,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 16:26:32,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:26:32,733 WARN L261 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 20 conjunts are in the unsatisfiable core [2022-02-20 16:26:34,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-02-20 16:26:35,186 INFO L286 TraceCheckSpWp]: Computing forward predicates...