./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_0740.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-newlib/double_req_bl_0740.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 41132fbae907016ec5719feb94bacb8a0df8201935428a611dada6a5c8f6c43e --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:33:47,263 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:33:47,265 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:33:47,296 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:33:47,297 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:33:47,298 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:33:47,299 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:33:47,300 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:33:47,302 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:33:47,303 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:33:47,303 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:33:47,304 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:33:47,305 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:33:47,306 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:33:47,307 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:33:47,308 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:33:47,308 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:33:47,309 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:33:47,311 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:33:47,312 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:33:47,313 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:33:47,315 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:33:47,316 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:33:47,317 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:33:47,319 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:33:47,320 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:33:47,320 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:33:47,321 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:33:47,322 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:33:47,322 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:33:47,323 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:33:47,323 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:33:47,324 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:33:47,325 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:33:47,326 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:33:47,326 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:33:47,327 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:33:47,327 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:33:47,327 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:33:47,328 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:33:47,329 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:33:47,334 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:33:47,355 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:33:47,355 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:33:47,355 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:33:47,356 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:33:47,356 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:33:47,357 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:33:47,357 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:33:47,357 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:33:47,358 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:33:47,358 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:33:47,359 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:33:47,359 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:33:47,359 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:33:47,359 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:33:47,360 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:33:47,360 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:33:47,360 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:33:47,360 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:33:47,361 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:33:47,361 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:33:47,361 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:33:47,361 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:33:47,361 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:33:47,362 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:33:47,362 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:33:47,362 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:33:47,362 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:33:47,362 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:33:47,363 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:33:47,363 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:33:47,363 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:33:47,363 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:33:47,364 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:33:47,364 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 -> 41132fbae907016ec5719feb94bacb8a0df8201935428a611dada6a5c8f6c43e [2022-02-20 16:33:47,567 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:33:47,590 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:33:47,592 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:33:47,593 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:33:47,594 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:33:47,595 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_0740.c [2022-02-20 16:33:47,655 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a6ee6b92/66317db901b243b0aaba00751e70d1b1/FLAG3cc1c917c [2022-02-20 16:33:48,113 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:33:48,114 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0740.c [2022-02-20 16:33:48,122 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a6ee6b92/66317db901b243b0aaba00751e70d1b1/FLAG3cc1c917c [2022-02-20 16:33:48,523 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a6ee6b92/66317db901b243b0aaba00751e70d1b1 [2022-02-20 16:33:48,525 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:33:48,526 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:33:48,532 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:33:48,532 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:33:48,537 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:33:48,538 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:33:48" (1/1) ... [2022-02-20 16:33:48,539 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ff4053f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:33:48, skipping insertion in model container [2022-02-20 16:33:48,540 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:33:48" (1/1) ... [2022-02-20 16:33:48,546 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:33:48,562 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:33:48,783 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-newlib/double_req_bl_0740.c[3071,3084] [2022-02-20 16:33:48,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:33:48,792 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:33:48,828 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-newlib/double_req_bl_0740.c[3071,3084] [2022-02-20 16:33:48,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:33:48,842 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:33:48,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:33:48 WrapperNode [2022-02-20 16:33:48,843 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:33:48,843 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:33:48,844 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:33:48,844 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:33:48,854 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:33:48" (1/1) ... [2022-02-20 16:33:48,862 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:33:48" (1/1) ... [2022-02-20 16:33:48,943 INFO L137 Inliner]: procedures = 17, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 175 [2022-02-20 16:33:48,943 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:33:48,944 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:33:48,944 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:33:48,944 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:33:48,952 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:33:48" (1/1) ... [2022-02-20 16:33:48,952 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:33:48" (1/1) ... [2022-02-20 16:33:48,956 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:33:48" (1/1) ... [2022-02-20 16:33:48,957 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:33:48" (1/1) ... [2022-02-20 16:33:48,977 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:33:48" (1/1) ... [2022-02-20 16:33:48,995 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:33:48" (1/1) ... [2022-02-20 16:33:48,999 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:33:48" (1/1) ... [2022-02-20 16:33:49,005 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:33:49,006 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:33:49,006 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:33:49,007 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:33:49,008 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:33:48" (1/1) ... [2022-02-20 16:33:49,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:33:49,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:33:49,049 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:33:49,057 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:33:49,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:33:49,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:33:49,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:33:49,090 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-02-20 16:33:49,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:33:49,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-02-20 16:33:49,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:33:49,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:33:49,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:33:49,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:33:49,178 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:33:49,180 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:33:49,863 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:33:49,871 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:33:49,872 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-02-20 16:33:49,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:33:49 BoogieIcfgContainer [2022-02-20 16:33:49,876 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:33:49,878 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:33:49,878 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:33:49,881 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:33:49,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:33:48" (1/3) ... [2022-02-20 16:33:49,882 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57a81d84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:33:49, skipping insertion in model container [2022-02-20 16:33:49,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:33:48" (2/3) ... [2022-02-20 16:33:49,883 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57a81d84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:33:49, skipping insertion in model container [2022-02-20 16:33:49,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:33:49" (3/3) ... [2022-02-20 16:33:49,886 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_0740.c [2022-02-20 16:33:49,890 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:33:49,891 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:33:49,936 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:33:49,943 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:33:49,943 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:33:49,958 INFO L276 IsEmpty]: Start isEmpty. Operand has 53 states, 51 states have (on average 1.6666666666666667) internal successors, (85), 52 states have internal predecessors, (85), 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:33:49,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 16:33:49,963 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:33:49,964 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:33:49,966 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:33:49,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:33:49,973 INFO L85 PathProgramCache]: Analyzing trace with hash 361713738, now seen corresponding path program 1 times [2022-02-20 16:33:49,981 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:33:49,982 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492595428] [2022-02-20 16:33:49,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:33:49,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:33:50,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:33:50,115 INFO L290 TraceCheckUtils]: 0: Hoare triple {56#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(21, 2);call #Ultimate.allocInit(12, 3);~one_sqrt~0 := 1.0;~tiny_sqrt~0 := 1.0E-300; {56#true} is VALID [2022-02-20 16:33:50,115 INFO L290 TraceCheckUtils]: 1: Hoare triple {56#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret9#1, main_#t~ret10#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~someBinaryArithmeticDOUBLEoperation(~someUnaryDOUBLEoperation(1.0), 0.0);assume { :begin_inline___ieee754_sqrt } true;__ieee754_sqrt_#in~x#1 := main_~x~0#1;havoc __ieee754_sqrt_#res#1;havoc __ieee754_sqrt_#t~mem4#1, __ieee754_sqrt_#t~mem5#1, __ieee754_sqrt_~#ew_u~0#1.base, __ieee754_sqrt_~#ew_u~0#1.offset, __ieee754_sqrt_#t~post6#1, __ieee754_sqrt_#t~mem8#1, __ieee754_sqrt_~#iw_u~0#1.base, __ieee754_sqrt_~#iw_u~0#1.offset, __ieee754_sqrt_~x#1, __ieee754_sqrt_~z~0#1, __ieee754_sqrt_~sign~0#1, __ieee754_sqrt_~r~0#1, __ieee754_sqrt_~t1~0#1, __ieee754_sqrt_~s1~0#1, __ieee754_sqrt_~ix1~0#1, __ieee754_sqrt_~q1~0#1, __ieee754_sqrt_~ix0~0#1, __ieee754_sqrt_~s0~0#1, __ieee754_sqrt_~q~0#1, __ieee754_sqrt_~m~0#1, __ieee754_sqrt_~t~0#1, __ieee754_sqrt_~i~0#1, __ieee754_sqrt_#t~nondet7#1;__ieee754_sqrt_~x#1 := __ieee754_sqrt_#in~x#1;havoc __ieee754_sqrt_~z~0#1;__ieee754_sqrt_~sign~0#1 := -2147483648;havoc __ieee754_sqrt_~r~0#1;havoc __ieee754_sqrt_~t1~0#1;havoc __ieee754_sqrt_~s1~0#1;havoc __ieee754_sqrt_~ix1~0#1;havoc __ieee754_sqrt_~q1~0#1;havoc __ieee754_sqrt_~ix0~0#1;havoc __ieee754_sqrt_~s0~0#1;havoc __ieee754_sqrt_~q~0#1;havoc __ieee754_sqrt_~m~0#1;havoc __ieee754_sqrt_~t~0#1;havoc __ieee754_sqrt_~i~0#1; {56#true} is VALID [2022-02-20 16:33:50,116 INFO L290 TraceCheckUtils]: 2: Hoare triple {56#true} assume !true; {57#false} is VALID [2022-02-20 16:33:50,117 INFO L290 TraceCheckUtils]: 3: Hoare triple {57#false} assume 2146435072 == (if 0 == __ieee754_sqrt_~ix0~0#1 then 0 else (if 1 == __ieee754_sqrt_~ix0~0#1 then 0 else ~bitwiseAnd(__ieee754_sqrt_~ix0~0#1, 2146435072)));__ieee754_sqrt_#res#1 := ~someBinaryArithmeticDOUBLEoperation(~someBinaryArithmeticDOUBLEoperation(__ieee754_sqrt_~x#1, __ieee754_sqrt_~x#1), __ieee754_sqrt_~x#1); {57#false} is VALID [2022-02-20 16:33:50,117 INFO L290 TraceCheckUtils]: 4: Hoare triple {57#false} main_#t~ret9#1 := __ieee754_sqrt_#res#1;assume { :end_inline___ieee754_sqrt } true;main_~res~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;assume { :begin_inline_isnan_double } true;isnan_double_#in~x#1 := main_~res~0#1;havoc isnan_double_#res#1;havoc isnan_double_~x#1;isnan_double_~x#1 := isnan_double_#in~x#1;isnan_double_#res#1 := (if ~someBinaryDOUBLEComparisonOperation(isnan_double_~x#1, isnan_double_~x#1) then 1 else 0); {57#false} is VALID [2022-02-20 16:33:50,118 INFO L290 TraceCheckUtils]: 5: Hoare triple {57#false} main_#t~ret10#1 := isnan_double_#res#1;assume { :end_inline_isnan_double } true;assume -2147483648 <= main_#t~ret10#1 && main_#t~ret10#1 <= 2147483647; {57#false} is VALID [2022-02-20 16:33:50,118 INFO L290 TraceCheckUtils]: 6: Hoare triple {57#false} assume 0 == main_#t~ret10#1;havoc main_#t~ret10#1; {57#false} is VALID [2022-02-20 16:33:50,118 INFO L290 TraceCheckUtils]: 7: Hoare triple {57#false} assume !false; {57#false} is VALID [2022-02-20 16:33:50,119 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:33:50,120 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:33:50,120 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492595428] [2022-02-20 16:33:50,121 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492595428] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:33:50,122 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:33:50,122 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:33:50,124 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484409986] [2022-02-20 16:33:50,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:33:50,129 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 8 [2022-02-20 16:33:50,130 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:33:50,132 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:33:50,148 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:33:50,149 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:33:50,149 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:33:50,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:33:50,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:33:50,167 INFO L87 Difference]: Start difference. First operand has 53 states, 51 states have (on average 1.6666666666666667) internal successors, (85), 52 states have internal predecessors, (85), 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 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:33:50,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:33:50,273 INFO L93 Difference]: Finished difference Result 104 states and 168 transitions. [2022-02-20 16:33:50,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:33:50,273 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 8 [2022-02-20 16:33:50,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:33:50,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:33:50,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 168 transitions. [2022-02-20 16:33:50,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:33:50,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 168 transitions. [2022-02-20 16:33:50,287 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 168 transitions. [2022-02-20 16:33:50,464 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:33:50,482 INFO L225 Difference]: With dead ends: 104 [2022-02-20 16:33:50,482 INFO L226 Difference]: Without dead ends: 50 [2022-02-20 16:33:50,485 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:33:50,487 INFO L933 BasicCegarLoop]: 73 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, 73 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:33:50,501 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:33:50,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-02-20 16:33:50,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-02-20 16:33:50,523 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:33:50,523 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 49 states have internal predecessors, (70), 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:33:50,524 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 49 states have internal predecessors, (70), 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:33:50,525 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 49 states have internal predecessors, (70), 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:33:50,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:33:50,528 INFO L93 Difference]: Finished difference Result 50 states and 70 transitions. [2022-02-20 16:33:50,528 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 70 transitions. [2022-02-20 16:33:50,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:33:50,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:33:50,529 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 49 states have internal predecessors, (70), 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 50 states. [2022-02-20 16:33:50,530 INFO L87 Difference]: Start difference. First operand has 50 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 49 states have internal predecessors, (70), 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 50 states. [2022-02-20 16:33:50,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:33:50,534 INFO L93 Difference]: Finished difference Result 50 states and 70 transitions. [2022-02-20 16:33:50,534 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 70 transitions. [2022-02-20 16:33:50,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:33:50,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:33:50,535 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:33:50,535 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:33:50,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 49 states have internal predecessors, (70), 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:33:50,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 70 transitions. [2022-02-20 16:33:50,539 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 70 transitions. Word has length 8 [2022-02-20 16:33:50,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:33:50,539 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 70 transitions. [2022-02-20 16:33:50,539 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:33:50,540 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 70 transitions. [2022-02-20 16:33:50,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 16:33:50,540 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:33:50,540 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:33:50,541 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:33:50,541 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:33:50,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:33:50,542 INFO L85 PathProgramCache]: Analyzing trace with hash 332468045, now seen corresponding path program 1 times [2022-02-20 16:33:50,542 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:33:50,542 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478276496] [2022-02-20 16:33:50,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:33:50,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:33:50,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:33:50,610 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:33:50,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:33:50,672 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:33:50,673 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:33:50,674 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:33:50,676 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:33:50,678 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-02-20 16:33:50,680 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:33:50,703 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:33:50,703 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:33:50,703 WARN L170 areAnnotationChecker]: L27-2 has no Hoare annotation [2022-02-20 16:33:50,703 WARN L170 areAnnotationChecker]: L27-2 has no Hoare annotation [2022-02-20 16:33:50,703 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-02-20 16:33:50,703 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-02-20 16:33:50,703 WARN L170 areAnnotationChecker]: L27-3 has no Hoare annotation [2022-02-20 16:33:50,703 WARN L170 areAnnotationChecker]: L27-3 has no Hoare annotation [2022-02-20 16:33:50,703 WARN L170 areAnnotationChecker]: L128 has no Hoare annotation [2022-02-20 16:33:50,703 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-02-20 16:33:50,704 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-02-20 16:33:50,704 WARN L170 areAnnotationChecker]: L132 has no Hoare annotation [2022-02-20 16:33:50,704 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-02-20 16:33:50,704 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-02-20 16:33:50,704 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2022-02-20 16:33:50,704 WARN L170 areAnnotationChecker]: L145 has no Hoare annotation [2022-02-20 16:33:50,704 WARN L170 areAnnotationChecker]: L145 has no Hoare annotation [2022-02-20 16:33:50,704 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-02-20 16:33:50,704 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-02-20 16:33:50,704 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-02-20 16:33:50,704 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-02-20 16:33:50,704 WARN L170 areAnnotationChecker]: L146 has no Hoare annotation [2022-02-20 16:33:50,704 WARN L170 areAnnotationChecker]: L146 has no Hoare annotation [2022-02-20 16:33:50,704 WARN L170 areAnnotationChecker]: L150 has no Hoare annotation [2022-02-20 16:33:50,705 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2022-02-20 16:33:50,705 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2022-02-20 16:33:50,705 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2022-02-20 16:33:50,705 WARN L170 areAnnotationChecker]: L46-2 has no Hoare annotation [2022-02-20 16:33:50,705 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:33:50,705 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2022-02-20 16:33:50,705 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2022-02-20 16:33:50,706 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2022-02-20 16:33:50,707 WARN L170 areAnnotationChecker]: L52-3 has no Hoare annotation [2022-02-20 16:33:50,707 WARN L170 areAnnotationChecker]: L52-3 has no Hoare annotation [2022-02-20 16:33:50,707 WARN L170 areAnnotationChecker]: L52-3 has no Hoare annotation [2022-02-20 16:33:50,707 WARN L170 areAnnotationChecker]: L59-8 has no Hoare annotation [2022-02-20 16:33:50,707 WARN L170 areAnnotationChecker]: L59-8 has no Hoare annotation [2022-02-20 16:33:50,707 WARN L170 areAnnotationChecker]: L59-2 has no Hoare annotation [2022-02-20 16:33:50,707 WARN L170 areAnnotationChecker]: L59-2 has no Hoare annotation [2022-02-20 16:33:50,707 WARN L170 areAnnotationChecker]: L52-4 has no Hoare annotation [2022-02-20 16:33:50,708 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2022-02-20 16:33:50,708 WARN L170 areAnnotationChecker]: L60-1 has no Hoare annotation [2022-02-20 16:33:50,708 WARN L170 areAnnotationChecker]: L59-4 has no Hoare annotation [2022-02-20 16:33:50,708 WARN L170 areAnnotationChecker]: L59-4 has no Hoare annotation [2022-02-20 16:33:50,708 WARN L170 areAnnotationChecker]: L71-2 has no Hoare annotation [2022-02-20 16:33:50,708 WARN L170 areAnnotationChecker]: L71-2 has no Hoare annotation [2022-02-20 16:33:50,708 WARN L170 areAnnotationChecker]: L71-2 has no Hoare annotation [2022-02-20 16:33:50,708 WARN L170 areAnnotationChecker]: L59-6 has no Hoare annotation [2022-02-20 16:33:50,709 WARN L170 areAnnotationChecker]: L59-6 has no Hoare annotation [2022-02-20 16:33:50,709 WARN L170 areAnnotationChecker]: L71-3 has no Hoare annotation [2022-02-20 16:33:50,709 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2022-02-20 16:33:50,709 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2022-02-20 16:33:50,709 WARN L170 areAnnotationChecker]: L84-2 has no Hoare annotation [2022-02-20 16:33:50,709 WARN L170 areAnnotationChecker]: L84-2 has no Hoare annotation [2022-02-20 16:33:50,710 WARN L170 areAnnotationChecker]: L84-2 has no Hoare annotation [2022-02-20 16:33:50,710 WARN L170 areAnnotationChecker]: L73-2 has no Hoare annotation [2022-02-20 16:33:50,710 WARN L170 areAnnotationChecker]: L84-3 has no Hoare annotation [2022-02-20 16:33:50,710 WARN L170 areAnnotationChecker]: L84-3 has no Hoare annotation [2022-02-20 16:33:50,710 WARN L170 areAnnotationChecker]: L87 has no Hoare annotation [2022-02-20 16:33:50,710 WARN L170 areAnnotationChecker]: L87 has no Hoare annotation [2022-02-20 16:33:50,710 WARN L170 areAnnotationChecker]: L104 has no Hoare annotation [2022-02-20 16:33:50,711 WARN L170 areAnnotationChecker]: L104 has no Hoare annotation [2022-02-20 16:33:50,711 WARN L170 areAnnotationChecker]: L102 has no Hoare annotation [2022-02-20 16:33:50,711 WARN L170 areAnnotationChecker]: L89 has no Hoare annotation [2022-02-20 16:33:50,711 WARN L170 areAnnotationChecker]: L89 has no Hoare annotation [2022-02-20 16:33:50,711 WARN L170 areAnnotationChecker]: L87-2 has no Hoare annotation [2022-02-20 16:33:50,711 WARN L170 areAnnotationChecker]: L106 has no Hoare annotation [2022-02-20 16:33:50,711 WARN L170 areAnnotationChecker]: L106 has no Hoare annotation [2022-02-20 16:33:50,711 WARN L170 areAnnotationChecker]: L119 has no Hoare annotation [2022-02-20 16:33:50,711 WARN L170 areAnnotationChecker]: L119 has no Hoare annotation [2022-02-20 16:33:50,712 WARN L170 areAnnotationChecker]: L89-2 has no Hoare annotation [2022-02-20 16:33:50,712 WARN L170 areAnnotationChecker]: L109 has no Hoare annotation [2022-02-20 16:33:50,712 WARN L170 areAnnotationChecker]: L109 has no Hoare annotation [2022-02-20 16:33:50,712 WARN L170 areAnnotationChecker]: L119-2 has no Hoare annotation [2022-02-20 16:33:50,712 WARN L170 areAnnotationChecker]: L92 has no Hoare annotation [2022-02-20 16:33:50,712 WARN L170 areAnnotationChecker]: L92 has no Hoare annotation [2022-02-20 16:33:50,712 WARN L170 areAnnotationChecker]: L110 has no Hoare annotation [2022-02-20 16:33:50,712 WARN L170 areAnnotationChecker]: L110 has no Hoare annotation [2022-02-20 16:33:50,713 WARN L170 areAnnotationChecker]: L122-2 has no Hoare annotation [2022-02-20 16:33:50,713 WARN L170 areAnnotationChecker]: L122-2 has no Hoare annotation [2022-02-20 16:33:50,713 WARN L170 areAnnotationChecker]: L92-2 has no Hoare annotation [2022-02-20 16:33:50,713 WARN L170 areAnnotationChecker]: L110-2 has no Hoare annotation [2022-02-20 16:33:50,713 WARN L170 areAnnotationChecker]: L122-1 has no Hoare annotation [2022-02-20 16:33:50,713 WARN L170 areAnnotationChecker]: L122-1 has no Hoare annotation [2022-02-20 16:33:50,713 WARN L170 areAnnotationChecker]: L122-3 has no Hoare annotation [2022-02-20 16:33:50,713 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:33:50,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:33:50 BoogieIcfgContainer [2022-02-20 16:33:50,715 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:33:50,717 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:33:50,717 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:33:50,717 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:33:50,718 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:33:49" (3/4) ... [2022-02-20 16:33:50,728 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 16:33:50,728 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:33:50,730 INFO L158 Benchmark]: Toolchain (without parser) took 2203.43ms. Allocated memory was 111.1MB in the beginning and 134.2MB in the end (delta: 23.1MB). Free memory was 81.2MB in the beginning and 92.9MB in the end (delta: -11.7MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. [2022-02-20 16:33:50,730 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 111.1MB. Free memory was 65.0MB in the beginning and 65.0MB in the end (delta: 45.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:33:50,733 INFO L158 Benchmark]: CACSL2BoogieTranslator took 311.29ms. Allocated memory is still 111.1MB. Free memory was 80.9MB in the beginning and 83.1MB in the end (delta: -2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 16:33:50,734 INFO L158 Benchmark]: Boogie Procedure Inliner took 100.11ms. Allocated memory is still 111.1MB. Free memory was 83.1MB in the beginning and 76.5MB in the end (delta: 6.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-20 16:33:50,735 INFO L158 Benchmark]: Boogie Preprocessor took 61.34ms. Allocated memory is still 111.1MB. Free memory was 76.5MB in the beginning and 73.3MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 16:33:50,735 INFO L158 Benchmark]: RCFGBuilder took 869.70ms. Allocated memory was 111.1MB in the beginning and 134.2MB in the end (delta: 23.1MB). Free memory was 73.3MB in the beginning and 98.6MB in the end (delta: -25.2MB). Peak memory consumption was 33.4MB. Max. memory is 16.1GB. [2022-02-20 16:33:50,736 INFO L158 Benchmark]: TraceAbstraction took 837.03ms. Allocated memory is still 134.2MB. Free memory was 98.0MB in the beginning and 92.9MB in the end (delta: 5.1MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. [2022-02-20 16:33:50,736 INFO L158 Benchmark]: Witness Printer took 11.65ms. Allocated memory is still 134.2MB. Free memory is still 92.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:33:50,739 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.22ms. Allocated memory is still 111.1MB. Free memory was 65.0MB in the beginning and 65.0MB in the end (delta: 45.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 311.29ms. Allocated memory is still 111.1MB. Free memory was 80.9MB in the beginning and 83.1MB in the end (delta: -2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 100.11ms. Allocated memory is still 111.1MB. Free memory was 83.1MB in the beginning and 76.5MB in the end (delta: 6.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.34ms. Allocated memory is still 111.1MB. Free memory was 76.5MB in the beginning and 73.3MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 869.70ms. Allocated memory was 111.1MB in the beginning and 134.2MB in the end (delta: 23.1MB). Free memory was 73.3MB in the beginning and 98.6MB in the end (delta: -25.2MB). Peak memory consumption was 33.4MB. Max. memory is 16.1GB. * TraceAbstraction took 837.03ms. Allocated memory is still 134.2MB. Free memory was 98.0MB in the beginning and 92.9MB in the end (delta: 5.1MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. * Witness Printer took 11.65ms. Allocated memory is still 134.2MB. Free memory is still 92.9MB. There was no memory consumed. 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: 146]: 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 132, overapproximation of someBinaryArithmeticDOUBLEoperation at line 35, overapproximation of bitwiseAnd at line 34. Possible FailurePath: [L19] static const double one_sqrt = 1.0, tiny_sqrt = 1.0e-300; VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L141] double x = -1.0 / 0.0; [L142] CALL, EXPR __ieee754_sqrt(x) [L22] double z; [L23] __int32_t sign = 0x80000000; [L24] __uint32_t r, t1, s1, ix1, q1; [L25] __int32_t ix0, s0, q, m, t, i; VAL [\old(x)=4294967296, one_sqrt=1, sign=-2147483648, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=4294967296] [L28] ieee_double_shape_type ew_u; [L29] ew_u.value = (x) [L30] EXPR ew_u.parts.msw [L30] (ix0) = ew_u.parts.msw [L31] EXPR ew_u.parts.lsw [L31] (ix1) = ew_u.parts.lsw [L34] COND TRUE (ix0 & 0x7ff00000) == 0x7ff00000 [L35] return x * x + x; VAL [\old(x)=4294967296, ix0=-1, ix1=4294967297, one_sqrt=1, sign=-2147483648, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=4294967296] [L142] RET, EXPR __ieee754_sqrt(x) [L142] double res = __ieee754_sqrt(x); [L145] CALL, EXPR isnan_double(res) [L132] return x != x; VAL [\old(x)=4294967298, \result=0, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=4294967298] [L145] RET, EXPR isnan_double(res) [L145] COND TRUE !isnan_double(res) [L146] reach_error() VAL [one_sqrt=1, res=4294967298, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=4294967296] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 53 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, 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, 73 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, 73 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=53occurred 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.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 17 NumberOfCodeBlocks, 17 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 7 ConstructedInterpolants, 0 QuantifiedInterpolants, 7 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:33:50,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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-newlib/double_req_bl_0740.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 41132fbae907016ec5719feb94bacb8a0df8201935428a611dada6a5c8f6c43e --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:33:52,699 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:33:52,702 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:33:52,741 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:33:52,741 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:33:52,744 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:33:52,746 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:33:52,750 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:33:52,752 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:33:52,756 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:33:52,758 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:33:52,759 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:33:52,759 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:33:52,762 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:33:52,763 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:33:52,768 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:33:52,769 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:33:52,770 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:33:52,772 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:33:52,777 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:33:52,778 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:33:52,784 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:33:52,785 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:33:52,787 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:33:52,792 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:33:52,793 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:33:52,793 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:33:52,795 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:33:52,795 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:33:52,796 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:33:52,796 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:33:52,797 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:33:52,798 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:33:52,799 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:33:52,800 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:33:52,800 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:33:52,801 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:33:52,801 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:33:52,801 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:33:52,803 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:33:52,803 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:33:52,807 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:33:52,846 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:33:52,847 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:33:52,847 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:33:52,847 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:33:52,848 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:33:52,848 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:33:52,850 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:33:52,850 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:33:52,850 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:33:52,851 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:33:52,851 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:33:52,852 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:33:52,852 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:33:52,852 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:33:52,852 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:33:52,853 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:33:52,853 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:33:52,853 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:33:52,853 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:33:52,853 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:33:52,854 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:33:52,854 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:33:52,854 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:33:52,854 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:33:52,854 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:33:52,855 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:33:52,860 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:33:52,861 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:33:52,861 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:33:52,861 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:33:52,861 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:33:52,862 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:33:52,862 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:33:52,862 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:33:52,862 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:33:52,863 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:33:52,863 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 -> 41132fbae907016ec5719feb94bacb8a0df8201935428a611dada6a5c8f6c43e [2022-02-20 16:33:53,168 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:33:53,190 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:33:53,193 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:33:53,194 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:33:53,194 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:33:53,196 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_0740.c [2022-02-20 16:33:53,250 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7e2a298b/d6c7dd4096d248f1956e7a2d43f97d6e/FLAGd7aca4d22 [2022-02-20 16:33:53,675 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:33:53,676 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0740.c [2022-02-20 16:33:53,683 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7e2a298b/d6c7dd4096d248f1956e7a2d43f97d6e/FLAGd7aca4d22 [2022-02-20 16:33:53,693 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7e2a298b/d6c7dd4096d248f1956e7a2d43f97d6e [2022-02-20 16:33:53,695 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:33:53,696 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:33:53,697 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:33:53,697 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:33:53,701 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:33:53,702 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:33:53" (1/1) ... [2022-02-20 16:33:53,703 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6efb6487 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:33:53, skipping insertion in model container [2022-02-20 16:33:53,706 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:33:53" (1/1) ... [2022-02-20 16:33:53,712 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:33:53,727 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:33:53,913 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-newlib/double_req_bl_0740.c[3071,3084] [2022-02-20 16:33:53,921 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:33:53,934 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:33:53,990 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-newlib/double_req_bl_0740.c[3071,3084] [2022-02-20 16:33:54,001 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:33:54,018 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:33:54,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:33:54 WrapperNode [2022-02-20 16:33:54,019 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:33:54,020 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:33:54,020 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:33:54,020 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:33:54,025 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:33:54" (1/1) ... [2022-02-20 16:33:54,034 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:33:54" (1/1) ... [2022-02-20 16:33:54,073 INFO L137 Inliner]: procedures = 20, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 163 [2022-02-20 16:33:54,074 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:33:54,074 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:33:54,075 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:33:54,075 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:33:54,085 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:33:54" (1/1) ... [2022-02-20 16:33:54,086 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:33:54" (1/1) ... [2022-02-20 16:33:54,099 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:33:54" (1/1) ... [2022-02-20 16:33:54,101 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:33:54" (1/1) ... [2022-02-20 16:33:54,110 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:33:54" (1/1) ... [2022-02-20 16:33:54,115 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:33:54" (1/1) ... [2022-02-20 16:33:54,117 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:33:54" (1/1) ... [2022-02-20 16:33:54,120 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:33:54,121 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:33:54,121 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:33:54,121 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:33:54,122 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:33:54" (1/1) ... [2022-02-20 16:33:54,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:33:54,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:33:54,149 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:33:54,151 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:33:54,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:33:54,175 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2022-02-20 16:33:54,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2022-02-20 16:33:54,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:33:54,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:33:54,181 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 16:33:54,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:33:54,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:33:54,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 16:33:54,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:33:54,250 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:33:54,251 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:33:56,367 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:33:56,374 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:33:56,375 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-02-20 16:33:56,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:33:56 BoogieIcfgContainer [2022-02-20 16:33:56,377 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:33:56,378 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:33:56,379 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:33:56,381 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:33:56,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:33:53" (1/3) ... [2022-02-20 16:33:56,382 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e636507 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:33:56, skipping insertion in model container [2022-02-20 16:33:56,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:33:54" (2/3) ... [2022-02-20 16:33:56,383 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e636507 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:33:56, skipping insertion in model container [2022-02-20 16:33:56,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:33:56" (3/3) ... [2022-02-20 16:33:56,384 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_0740.c [2022-02-20 16:33:56,389 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:33:56,390 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:33:56,427 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:33:56,431 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:33:56,432 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:33:56,443 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 47 states have (on average 1.6382978723404256) internal successors, (77), 48 states have internal predecessors, (77), 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:33:56,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 16:33:56,447 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:33:56,447 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:33:56,448 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:33:56,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:33:56,451 INFO L85 PathProgramCache]: Analyzing trace with hash 361067274, now seen corresponding path program 1 times [2022-02-20 16:33:56,459 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:33:56,459 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1745047780] [2022-02-20 16:33:56,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:33:56,460 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:33:56,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:33:56,462 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:33:56,463 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:33:56,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:33:56,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:33:56,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:33:56,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:33:56,915 INFO L290 TraceCheckUtils]: 0: Hoare triple {52#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(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~one_sqrt~0 := ~to_fp~DOUBLE(currentRoundingMode, 1.0);~tiny_sqrt~0 := ~to_fp~DOUBLE(currentRoundingMode, 1.0E-300); {52#true} is VALID [2022-02-20 16:33:56,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {52#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_#t~ret9#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0)), ~Pluszero~DOUBLE());assume { :begin_inline___ieee754_sqrt } true;__ieee754_sqrt_#in~x#1 := main_~x~0#1;havoc __ieee754_sqrt_#res#1;havoc __ieee754_sqrt_#t~mem4#1, __ieee754_sqrt_#t~mem5#1, __ieee754_sqrt_~#ew_u~0#1.base, __ieee754_sqrt_~#ew_u~0#1.offset, __ieee754_sqrt_#t~post6#1, __ieee754_sqrt_#t~mem7#1, __ieee754_sqrt_~#iw_u~0#1.base, __ieee754_sqrt_~#iw_u~0#1.offset, __ieee754_sqrt_~x#1, __ieee754_sqrt_~z~0#1, __ieee754_sqrt_~sign~0#1, __ieee754_sqrt_~r~0#1, __ieee754_sqrt_~t1~0#1, __ieee754_sqrt_~s1~0#1, __ieee754_sqrt_~ix1~0#1, __ieee754_sqrt_~q1~0#1, __ieee754_sqrt_~ix0~0#1, __ieee754_sqrt_~s0~0#1, __ieee754_sqrt_~q~0#1, __ieee754_sqrt_~m~0#1, __ieee754_sqrt_~t~0#1, __ieee754_sqrt_~i~0#1;__ieee754_sqrt_~x#1 := __ieee754_sqrt_#in~x#1;havoc __ieee754_sqrt_~z~0#1;__ieee754_sqrt_~sign~0#1 := 2147483648bv32;havoc __ieee754_sqrt_~r~0#1;havoc __ieee754_sqrt_~t1~0#1;havoc __ieee754_sqrt_~s1~0#1;havoc __ieee754_sqrt_~ix1~0#1;havoc __ieee754_sqrt_~q1~0#1;havoc __ieee754_sqrt_~ix0~0#1;havoc __ieee754_sqrt_~s0~0#1;havoc __ieee754_sqrt_~q~0#1;havoc __ieee754_sqrt_~m~0#1;havoc __ieee754_sqrt_~t~0#1;havoc __ieee754_sqrt_~i~0#1; {52#true} is VALID [2022-02-20 16:33:56,917 INFO L290 TraceCheckUtils]: 2: Hoare triple {52#true} assume !true; {53#false} is VALID [2022-02-20 16:33:56,917 INFO L290 TraceCheckUtils]: 3: Hoare triple {53#false} assume 2146435072bv32 == ~bvand32(2146435072bv32, __ieee754_sqrt_~ix0~0#1);__ieee754_sqrt_#res#1 := ~fp.add~DOUBLE(currentRoundingMode, ~fp.mul~DOUBLE(currentRoundingMode, __ieee754_sqrt_~x#1, __ieee754_sqrt_~x#1), __ieee754_sqrt_~x#1); {53#false} is VALID [2022-02-20 16:33:56,917 INFO L290 TraceCheckUtils]: 4: Hoare triple {53#false} main_#t~ret8#1 := __ieee754_sqrt_#res#1;assume { :end_inline___ieee754_sqrt } true;main_~res~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_isnan_double } true;isnan_double_#in~x#1 := main_~res~0#1;havoc isnan_double_#res#1;havoc isnan_double_~x#1;isnan_double_~x#1 := isnan_double_#in~x#1;isnan_double_#res#1 := (if !~fp.eq~DOUBLE(isnan_double_~x#1, isnan_double_~x#1) then 1bv32 else 0bv32); {53#false} is VALID [2022-02-20 16:33:56,918 INFO L290 TraceCheckUtils]: 5: Hoare triple {53#false} main_#t~ret9#1 := isnan_double_#res#1;assume { :end_inline_isnan_double } true; {53#false} is VALID [2022-02-20 16:33:56,918 INFO L290 TraceCheckUtils]: 6: Hoare triple {53#false} assume 0bv32 == main_#t~ret9#1;havoc main_#t~ret9#1; {53#false} is VALID [2022-02-20 16:33:56,918 INFO L290 TraceCheckUtils]: 7: Hoare triple {53#false} assume !false; {53#false} is VALID [2022-02-20 16:33:56,919 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:33:56,919 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:33:56,920 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:33:56,920 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1745047780] [2022-02-20 16:33:56,921 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1745047780] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:33:56,921 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:33:56,921 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:33:56,923 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690974219] [2022-02-20 16:33:56,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:33:56,928 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 8 [2022-02-20 16:33:56,929 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:33:56,932 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:33:57,124 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:33:57,124 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:33:57,124 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:33:57,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:33:57,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:33:57,155 INFO L87 Difference]: Start difference. First operand has 49 states, 47 states have (on average 1.6382978723404256) internal successors, (77), 48 states have internal predecessors, (77), 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 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:33:59,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:33:59,351 INFO L93 Difference]: Finished difference Result 96 states and 152 transitions. [2022-02-20 16:33:59,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:33:59,351 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 8 [2022-02-20 16:33:59,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:33:59,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:33:59,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 152 transitions. [2022-02-20 16:33:59,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:33:59,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 152 transitions. [2022-02-20 16:33:59,374 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 152 transitions. [2022-02-20 16:34:01,342 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:34:01,350 INFO L225 Difference]: With dead ends: 96 [2022-02-20 16:34:01,351 INFO L226 Difference]: Without dead ends: 46 [2022-02-20 16:34:01,353 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 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:34:01,356 INFO L933 BasicCegarLoop]: 68 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, 68 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:34:01,357 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:34:01,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-02-20 16:34:01,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-02-20 16:34:01,377 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:34:01,378 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 46 states, 45 states have (on average 1.4444444444444444) internal successors, (65), 45 states have internal predecessors, (65), 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:34:01,379 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 46 states, 45 states have (on average 1.4444444444444444) internal successors, (65), 45 states have internal predecessors, (65), 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:34:01,380 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 46 states, 45 states have (on average 1.4444444444444444) internal successors, (65), 45 states have internal predecessors, (65), 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:34:01,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:34:01,383 INFO L93 Difference]: Finished difference Result 46 states and 65 transitions. [2022-02-20 16:34:01,383 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 65 transitions. [2022-02-20 16:34:01,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:34:01,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:34:01,385 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 45 states have (on average 1.4444444444444444) internal successors, (65), 45 states have internal predecessors, (65), 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 46 states. [2022-02-20 16:34:01,385 INFO L87 Difference]: Start difference. First operand has 46 states, 45 states have (on average 1.4444444444444444) internal successors, (65), 45 states have internal predecessors, (65), 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 46 states. [2022-02-20 16:34:01,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:34:01,388 INFO L93 Difference]: Finished difference Result 46 states and 65 transitions. [2022-02-20 16:34:01,388 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 65 transitions. [2022-02-20 16:34:01,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:34:01,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:34:01,389 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:34:01,389 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:34:01,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.4444444444444444) internal successors, (65), 45 states have internal predecessors, (65), 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:34:01,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 65 transitions. [2022-02-20 16:34:01,393 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 65 transitions. Word has length 8 [2022-02-20 16:34:01,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:34:01,393 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 65 transitions. [2022-02-20 16:34:01,394 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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:34:01,394 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 65 transitions. [2022-02-20 16:34:01,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 16:34:01,394 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:34:01,395 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:34:01,410 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:34:01,601 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:34:01,602 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:34:01,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:34:01,603 INFO L85 PathProgramCache]: Analyzing trace with hash 331821581, now seen corresponding path program 1 times [2022-02-20 16:34:01,603 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:34:01,604 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1584447509] [2022-02-20 16:34:01,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:34:01,604 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:34:01,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:34:01,606 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:34:01,610 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:34:01,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:34:01,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 16:34:01,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:34:01,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:34:02,484 INFO L290 TraceCheckUtils]: 0: Hoare triple {337#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(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~one_sqrt~0 := ~to_fp~DOUBLE(currentRoundingMode, 1.0);~tiny_sqrt~0 := ~to_fp~DOUBLE(currentRoundingMode, 1.0E-300); {342#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:34:02,492 INFO L290 TraceCheckUtils]: 1: Hoare triple {342#(= currentRoundingMode roundNearestTiesToEven)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_#t~ret9#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0)), ~Pluszero~DOUBLE());assume { :begin_inline___ieee754_sqrt } true;__ieee754_sqrt_#in~x#1 := main_~x~0#1;havoc __ieee754_sqrt_#res#1;havoc __ieee754_sqrt_#t~mem4#1, __ieee754_sqrt_#t~mem5#1, __ieee754_sqrt_~#ew_u~0#1.base, __ieee754_sqrt_~#ew_u~0#1.offset, __ieee754_sqrt_#t~post6#1, __ieee754_sqrt_#t~mem7#1, __ieee754_sqrt_~#iw_u~0#1.base, __ieee754_sqrt_~#iw_u~0#1.offset, __ieee754_sqrt_~x#1, __ieee754_sqrt_~z~0#1, __ieee754_sqrt_~sign~0#1, __ieee754_sqrt_~r~0#1, __ieee754_sqrt_~t1~0#1, __ieee754_sqrt_~s1~0#1, __ieee754_sqrt_~ix1~0#1, __ieee754_sqrt_~q1~0#1, __ieee754_sqrt_~ix0~0#1, __ieee754_sqrt_~s0~0#1, __ieee754_sqrt_~q~0#1, __ieee754_sqrt_~m~0#1, __ieee754_sqrt_~t~0#1, __ieee754_sqrt_~i~0#1;__ieee754_sqrt_~x#1 := __ieee754_sqrt_#in~x#1;havoc __ieee754_sqrt_~z~0#1;__ieee754_sqrt_~sign~0#1 := 2147483648bv32;havoc __ieee754_sqrt_~r~0#1;havoc __ieee754_sqrt_~t1~0#1;havoc __ieee754_sqrt_~s1~0#1;havoc __ieee754_sqrt_~ix1~0#1;havoc __ieee754_sqrt_~q1~0#1;havoc __ieee754_sqrt_~ix0~0#1;havoc __ieee754_sqrt_~s0~0#1;havoc __ieee754_sqrt_~q~0#1;havoc __ieee754_sqrt_~m~0#1;havoc __ieee754_sqrt_~t~0#1;havoc __ieee754_sqrt_~i~0#1; {346#(and (= |ULTIMATE.start___ieee754_sqrt_~x#1| (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:34:02,494 INFO L290 TraceCheckUtils]: 2: Hoare triple {346#(and (= |ULTIMATE.start___ieee754_sqrt_~x#1| (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))) (= currentRoundingMode roundNearestTiesToEven))} call __ieee754_sqrt_~#ew_u~0#1.base, __ieee754_sqrt_~#ew_u~0#1.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(__ieee754_sqrt_~x#1, __ieee754_sqrt_~#ew_u~0#1.base, __ieee754_sqrt_~#ew_u~0#1.offset, 8bv32);call __ieee754_sqrt_#t~mem4#1 := read~intINTTYPE4(__ieee754_sqrt_~#ew_u~0#1.base, ~bvadd32(4bv32, __ieee754_sqrt_~#ew_u~0#1.offset), 4bv32);__ieee754_sqrt_~ix0~0#1 := __ieee754_sqrt_#t~mem4#1;havoc __ieee754_sqrt_#t~mem4#1;call __ieee754_sqrt_#t~mem5#1 := read~intINTTYPE4(__ieee754_sqrt_~#ew_u~0#1.base, __ieee754_sqrt_~#ew_u~0#1.offset, 4bv32);__ieee754_sqrt_~ix1~0#1 := __ieee754_sqrt_#t~mem5#1;havoc __ieee754_sqrt_#t~mem5#1;call ULTIMATE.dealloc(__ieee754_sqrt_~#ew_u~0#1.base, __ieee754_sqrt_~#ew_u~0#1.offset);havoc __ieee754_sqrt_~#ew_u~0#1.base, __ieee754_sqrt_~#ew_u~0#1.offset; {346#(and (= |ULTIMATE.start___ieee754_sqrt_~x#1| (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:34:02,495 INFO L290 TraceCheckUtils]: 3: Hoare triple {346#(and (= |ULTIMATE.start___ieee754_sqrt_~x#1| (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))) (= currentRoundingMode roundNearestTiesToEven))} goto; {346#(and (= |ULTIMATE.start___ieee754_sqrt_~x#1| (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:34:02,496 INFO L290 TraceCheckUtils]: 4: Hoare triple {346#(and (= |ULTIMATE.start___ieee754_sqrt_~x#1| (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))) (= currentRoundingMode roundNearestTiesToEven))} assume 2146435072bv32 == ~bvand32(2146435072bv32, __ieee754_sqrt_~ix0~0#1);__ieee754_sqrt_#res#1 := ~fp.add~DOUBLE(currentRoundingMode, ~fp.mul~DOUBLE(currentRoundingMode, __ieee754_sqrt_~x#1, __ieee754_sqrt_~x#1), __ieee754_sqrt_~x#1); {356#(= (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53))) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53))) |ULTIMATE.start___ieee754_sqrt_#res#1|)} is VALID [2022-02-20 16:34:02,496 INFO L290 TraceCheckUtils]: 5: Hoare triple {356#(= (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53))) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53))) |ULTIMATE.start___ieee754_sqrt_#res#1|)} main_#t~ret8#1 := __ieee754_sqrt_#res#1;assume { :end_inline___ieee754_sqrt } true;main_~res~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_isnan_double } true;isnan_double_#in~x#1 := main_~res~0#1;havoc isnan_double_#res#1;havoc isnan_double_~x#1;isnan_double_~x#1 := isnan_double_#in~x#1;isnan_double_#res#1 := (if !~fp.eq~DOUBLE(isnan_double_~x#1, isnan_double_~x#1) then 1bv32 else 0bv32); {360#(= (_ bv1 32) |ULTIMATE.start_isnan_double_#res#1|)} is VALID [2022-02-20 16:34:02,497 INFO L290 TraceCheckUtils]: 6: Hoare triple {360#(= (_ bv1 32) |ULTIMATE.start_isnan_double_#res#1|)} main_#t~ret9#1 := isnan_double_#res#1;assume { :end_inline_isnan_double } true; {364#(= (_ bv1 32) |ULTIMATE.start_main_#t~ret9#1|)} is VALID [2022-02-20 16:34:02,497 INFO L290 TraceCheckUtils]: 7: Hoare triple {364#(= (_ bv1 32) |ULTIMATE.start_main_#t~ret9#1|)} assume 0bv32 == main_#t~ret9#1;havoc main_#t~ret9#1; {338#false} is VALID [2022-02-20 16:34:02,498 INFO L290 TraceCheckUtils]: 8: Hoare triple {338#false} assume !false; {338#false} is VALID [2022-02-20 16:34:02,498 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:34:02,498 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:34:02,498 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:34:02,498 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1584447509] [2022-02-20 16:34:02,498 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1584447509] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:34:02,498 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:34:02,499 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 16:34:02,499 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871606948] [2022-02-20 16:34:02,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:34:02,500 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 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 9 [2022-02-20 16:34:02,500 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:34:02,500 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 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:34:02,692 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:34:02,692 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 16:34:02,692 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:34:02,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 16:34:02,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:34:02,693 INFO L87 Difference]: Start difference. First operand 46 states and 65 transitions. Second operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 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:34:12,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:34:12,237 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-02-20 16:34:12,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 16:34:12,237 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 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 9 [2022-02-20 16:34:12,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:34:12,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 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:34:12,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 69 transitions. [2022-02-20 16:34:12,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 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:34:12,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 69 transitions. [2022-02-20 16:34:12,241 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 69 transitions. [2022-02-20 16:34:13,580 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:34:13,582 INFO L225 Difference]: With dead ends: 51 [2022-02-20 16:34:13,582 INFO L226 Difference]: Without dead ends: 46 [2022-02-20 16:34:13,582 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-02-20 16:34:13,583 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 69 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:34:13,584 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 223 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-02-20 16:34:13,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-02-20 16:34:13,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-02-20 16:34:13,590 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:34:13,591 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 46 states, 45 states have (on average 1.4) internal successors, (63), 45 states have internal predecessors, (63), 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:34:13,592 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 46 states, 45 states have (on average 1.4) internal successors, (63), 45 states have internal predecessors, (63), 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:34:13,594 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 46 states, 45 states have (on average 1.4) internal successors, (63), 45 states have internal predecessors, (63), 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:34:13,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:34:13,597 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2022-02-20 16:34:13,598 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2022-02-20 16:34:13,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:34:13,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:34:13,599 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 45 states have (on average 1.4) internal successors, (63), 45 states have internal predecessors, (63), 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 46 states. [2022-02-20 16:34:13,599 INFO L87 Difference]: Start difference. First operand has 46 states, 45 states have (on average 1.4) internal successors, (63), 45 states have internal predecessors, (63), 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 46 states. [2022-02-20 16:34:13,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:34:13,603 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2022-02-20 16:34:13,603 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2022-02-20 16:34:13,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:34:13,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:34:13,604 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:34:13,604 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:34:13,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.4) internal successors, (63), 45 states have internal predecessors, (63), 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:34:13,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 63 transitions. [2022-02-20 16:34:13,610 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 63 transitions. Word has length 9 [2022-02-20 16:34:13,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:34:13,610 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 63 transitions. [2022-02-20 16:34:13,611 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 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:34:13,611 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2022-02-20 16:34:13,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:34:13,612 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:34:13,612 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:34:13,631 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:34:13,823 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:34:13,824 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:34:13,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:34:13,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1929236654, now seen corresponding path program 1 times [2022-02-20 16:34:13,826 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:34:13,828 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [328059167] [2022-02-20 16:34:13,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:34:13,829 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:34:13,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:34:13,830 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:34:13,835 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:34:13,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:34:13,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 16:34:13,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:34:13,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:34:14,310 INFO L290 TraceCheckUtils]: 0: Hoare triple {583#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(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~one_sqrt~0 := ~to_fp~DOUBLE(currentRoundingMode, 1.0);~tiny_sqrt~0 := ~to_fp~DOUBLE(currentRoundingMode, 1.0E-300); {583#true} is VALID [2022-02-20 16:34:14,314 INFO L290 TraceCheckUtils]: 1: Hoare triple {583#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_#t~ret9#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0)), ~Pluszero~DOUBLE());assume { :begin_inline___ieee754_sqrt } true;__ieee754_sqrt_#in~x#1 := main_~x~0#1;havoc __ieee754_sqrt_#res#1;havoc __ieee754_sqrt_#t~mem4#1, __ieee754_sqrt_#t~mem5#1, __ieee754_sqrt_~#ew_u~0#1.base, __ieee754_sqrt_~#ew_u~0#1.offset, __ieee754_sqrt_#t~post6#1, __ieee754_sqrt_#t~mem7#1, __ieee754_sqrt_~#iw_u~0#1.base, __ieee754_sqrt_~#iw_u~0#1.offset, __ieee754_sqrt_~x#1, __ieee754_sqrt_~z~0#1, __ieee754_sqrt_~sign~0#1, __ieee754_sqrt_~r~0#1, __ieee754_sqrt_~t1~0#1, __ieee754_sqrt_~s1~0#1, __ieee754_sqrt_~ix1~0#1, __ieee754_sqrt_~q1~0#1, __ieee754_sqrt_~ix0~0#1, __ieee754_sqrt_~s0~0#1, __ieee754_sqrt_~q~0#1, __ieee754_sqrt_~m~0#1, __ieee754_sqrt_~t~0#1, __ieee754_sqrt_~i~0#1;__ieee754_sqrt_~x#1 := __ieee754_sqrt_#in~x#1;havoc __ieee754_sqrt_~z~0#1;__ieee754_sqrt_~sign~0#1 := 2147483648bv32;havoc __ieee754_sqrt_~r~0#1;havoc __ieee754_sqrt_~t1~0#1;havoc __ieee754_sqrt_~s1~0#1;havoc __ieee754_sqrt_~ix1~0#1;havoc __ieee754_sqrt_~q1~0#1;havoc __ieee754_sqrt_~ix0~0#1;havoc __ieee754_sqrt_~s0~0#1;havoc __ieee754_sqrt_~q~0#1;havoc __ieee754_sqrt_~m~0#1;havoc __ieee754_sqrt_~t~0#1;havoc __ieee754_sqrt_~i~0#1; {591#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start___ieee754_sqrt_~x#1| (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))))} is VALID [2022-02-20 16:34:14,321 INFO L290 TraceCheckUtils]: 2: Hoare triple {591#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start___ieee754_sqrt_~x#1| (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))))} call __ieee754_sqrt_~#ew_u~0#1.base, __ieee754_sqrt_~#ew_u~0#1.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(__ieee754_sqrt_~x#1, __ieee754_sqrt_~#ew_u~0#1.base, __ieee754_sqrt_~#ew_u~0#1.offset, 8bv32);call __ieee754_sqrt_#t~mem4#1 := read~intINTTYPE4(__ieee754_sqrt_~#ew_u~0#1.base, ~bvadd32(4bv32, __ieee754_sqrt_~#ew_u~0#1.offset), 4bv32);__ieee754_sqrt_~ix0~0#1 := __ieee754_sqrt_#t~mem4#1;havoc __ieee754_sqrt_#t~mem4#1;call __ieee754_sqrt_#t~mem5#1 := read~intINTTYPE4(__ieee754_sqrt_~#ew_u~0#1.base, __ieee754_sqrt_~#ew_u~0#1.offset, 4bv32);__ieee754_sqrt_~ix1~0#1 := __ieee754_sqrt_#t~mem5#1;havoc __ieee754_sqrt_#t~mem5#1;call ULTIMATE.dealloc(__ieee754_sqrt_~#ew_u~0#1.base, __ieee754_sqrt_~#ew_u~0#1.offset);havoc __ieee754_sqrt_~#ew_u~0#1.base, __ieee754_sqrt_~#ew_u~0#1.offset; {595#(exists ((|v_skolemized_q#valueAsBitvector_5| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_5|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_5|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_5|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))) (= |ULTIMATE.start___ieee754_sqrt_~ix0~0#1| ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_5|))))} is VALID [2022-02-20 16:34:14,322 INFO L290 TraceCheckUtils]: 3: Hoare triple {595#(exists ((|v_skolemized_q#valueAsBitvector_5| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_5|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_5|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_5|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))) (= |ULTIMATE.start___ieee754_sqrt_~ix0~0#1| ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_5|))))} goto; {595#(exists ((|v_skolemized_q#valueAsBitvector_5| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_5|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_5|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_5|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))) (= |ULTIMATE.start___ieee754_sqrt_~ix0~0#1| ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_5|))))} is VALID [2022-02-20 16:34:14,327 INFO L290 TraceCheckUtils]: 4: Hoare triple {595#(exists ((|v_skolemized_q#valueAsBitvector_5| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_5|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_5|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_5|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))) (= |ULTIMATE.start___ieee754_sqrt_~ix0~0#1| ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_5|))))} assume !(2146435072bv32 == ~bvand32(2146435072bv32, __ieee754_sqrt_~ix0~0#1)); {584#false} is VALID [2022-02-20 16:34:14,327 INFO L290 TraceCheckUtils]: 5: Hoare triple {584#false} assume ~bvsle32(__ieee754_sqrt_~ix0~0#1, 0bv32); {584#false} is VALID [2022-02-20 16:34:14,327 INFO L290 TraceCheckUtils]: 6: Hoare triple {584#false} assume 0bv32 == ~bvor32(~bvand32(__ieee754_sqrt_~ix0~0#1, ~bvnot32(__ieee754_sqrt_~sign~0#1)), __ieee754_sqrt_~ix1~0#1);__ieee754_sqrt_#res#1 := __ieee754_sqrt_~x#1; {584#false} is VALID [2022-02-20 16:34:14,327 INFO L290 TraceCheckUtils]: 7: Hoare triple {584#false} main_#t~ret8#1 := __ieee754_sqrt_#res#1;assume { :end_inline___ieee754_sqrt } true;main_~res~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_isnan_double } true;isnan_double_#in~x#1 := main_~res~0#1;havoc isnan_double_#res#1;havoc isnan_double_~x#1;isnan_double_~x#1 := isnan_double_#in~x#1;isnan_double_#res#1 := (if !~fp.eq~DOUBLE(isnan_double_~x#1, isnan_double_~x#1) then 1bv32 else 0bv32); {584#false} is VALID [2022-02-20 16:34:14,328 INFO L290 TraceCheckUtils]: 8: Hoare triple {584#false} main_#t~ret9#1 := isnan_double_#res#1;assume { :end_inline_isnan_double } true; {584#false} is VALID [2022-02-20 16:34:14,328 INFO L290 TraceCheckUtils]: 9: Hoare triple {584#false} assume 0bv32 == main_#t~ret9#1;havoc main_#t~ret9#1; {584#false} is VALID [2022-02-20 16:34:14,328 INFO L290 TraceCheckUtils]: 10: Hoare triple {584#false} assume !false; {584#false} is VALID [2022-02-20 16:34:14,328 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:34:14,328 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:34:14,328 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:34:14,329 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [328059167] [2022-02-20 16:34:14,329 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [328059167] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:34:14,329 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:34:14,329 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:34:14,329 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428175190] [2022-02-20 16:34:14,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:34:14,330 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) 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:34:14,330 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:34:14,330 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) 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:34:14,360 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:34:14,361 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:34:14,361 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:34:14,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:34:14,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:34:14,362 INFO L87 Difference]: Start difference. First operand 46 states and 63 transitions. Second operand has 4 states, 4 states have (on average 2.75) 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:34:14,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:34:14,433 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2022-02-20 16:34:14,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:34:14,434 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) 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:34:14,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:34:14,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) 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:34:14,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2022-02-20 16:34:14,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) 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:34:14,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2022-02-20 16:34:14,441 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 63 transitions. [2022-02-20 16:34:14,610 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:34:14,610 INFO L225 Difference]: With dead ends: 46 [2022-02-20 16:34:14,610 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 16:34:14,611 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:34:14,612 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:34:14,612 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 6 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 2 Unchecked, 0.0s Time] [2022-02-20 16:34:14,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 16:34:14,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 16:34:14,613 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:34:14,613 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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:34:14,613 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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:34:14,613 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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:34:14,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:34:14,614 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:34:14,614 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:34:14,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:34:14,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:34:14,614 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 0 states. [2022-02-20 16:34:14,614 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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 0 states. [2022-02-20 16:34:14,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:34:14,615 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:34:14,615 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:34:14,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:34:14,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:34:14,616 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:34:14,616 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:34:14,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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:34:14,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 16:34:14,616 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2022-02-20 16:34:14,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:34:14,616 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 16:34:14,616 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) 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:34:14,617 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:34:14,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:34:14,619 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:34:14,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-20 16:34:14,819 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:34:14,821 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 16:34:15,103 INFO L858 garLoopResultBuilder]: For program point L60(lines 60 63) no Hoare annotation was computed. [2022-02-20 16:34:15,103 INFO L858 garLoopResultBuilder]: For program point L27-1(lines 27 32) no Hoare annotation was computed. [2022-02-20 16:34:15,104 INFO L858 garLoopResultBuilder]: For program point L60-2(lines 60 63) no Hoare annotation was computed. [2022-02-20 16:34:15,104 INFO L854 garLoopResultBuilder]: At program point L27-2(lines 27 32) the Hoare annotation is: (and (= currentRoundingMode roundNearestTiesToEven) (exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start___ieee754_sqrt_~x#1| (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))))) [2022-02-20 16:34:15,104 INFO L858 garLoopResultBuilder]: For program point L27-3(lines 21 129) no Hoare annotation was computed. [2022-02-20 16:34:15,104 INFO L858 garLoopResultBuilder]: For program point L52-2(lines 52 53) no Hoare annotation was computed. [2022-02-20 16:34:15,104 INFO L854 garLoopResultBuilder]: At program point L52-3(lines 52 53) the Hoare annotation is: false [2022-02-20 16:34:15,104 INFO L858 garLoopResultBuilder]: For program point L52-4(lines 52 53) no Hoare annotation was computed. [2022-02-20 16:34:15,104 INFO L858 garLoopResultBuilder]: For program point L110(lines 110 111) no Hoare annotation was computed. [2022-02-20 16:34:15,104 INFO L858 garLoopResultBuilder]: For program point L110-2(lines 110 111) no Hoare annotation was computed. [2022-02-20 16:34:15,104 INFO L858 garLoopResultBuilder]: For program point L102(lines 102 116) no Hoare annotation was computed. [2022-02-20 16:34:15,105 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 16:34:15,105 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 16:34:15,105 INFO L858 garLoopResultBuilder]: For program point L119(lines 119 120) no Hoare annotation was computed. [2022-02-20 16:34:15,105 INFO L858 garLoopResultBuilder]: For program point L119-2(lines 119 120) no Hoare annotation was computed. [2022-02-20 16:34:15,105 INFO L854 garLoopResultBuilder]: At program point L128(lines 21 129) the Hoare annotation is: (and (= (let ((.cse0 (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53)))) (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse0) .cse0)) |ULTIMATE.start___ieee754_sqrt_#res#1|) (= |ULTIMATE.start___ieee754_sqrt_~x#1| (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))) (= currentRoundingMode roundNearestTiesToEven)) [2022-02-20 16:34:15,105 INFO L858 garLoopResultBuilder]: For program point L87(lines 87 96) no Hoare annotation was computed. [2022-02-20 16:34:15,105 INFO L858 garLoopResultBuilder]: For program point L87-2(lines 87 96) no Hoare annotation was computed. [2022-02-20 16:34:15,105 INFO L858 garLoopResultBuilder]: For program point L145(lines 145 148) no Hoare annotation was computed. [2022-02-20 16:34:15,105 INFO L858 garLoopResultBuilder]: For program point L46(lines 46 57) no Hoare annotation was computed. [2022-02-20 16:34:15,105 INFO L858 garLoopResultBuilder]: For program point L46-2(lines 46 57) no Hoare annotation was computed. [2022-02-20 16:34:15,105 INFO L858 garLoopResultBuilder]: For program point L104(lines 104 115) no Hoare annotation was computed. [2022-02-20 16:34:15,105 INFO L858 garLoopResultBuilder]: For program point L38(lines 38 43) no Hoare annotation was computed. [2022-02-20 16:34:15,106 INFO L854 garLoopResultBuilder]: At program point L71-2(lines 71 81) the Hoare annotation is: false [2022-02-20 16:34:15,106 INFO L858 garLoopResultBuilder]: For program point L38-2(lines 38 43) no Hoare annotation was computed. [2022-02-20 16:34:15,106 INFO L858 garLoopResultBuilder]: For program point L71-3(lines 71 81) no Hoare annotation was computed. [2022-02-20 16:34:15,106 INFO L858 garLoopResultBuilder]: For program point L146(line 146) no Hoare annotation was computed. [2022-02-20 16:34:15,106 INFO L854 garLoopResultBuilder]: At program point L47-2(lines 47 51) the Hoare annotation is: false [2022-02-20 16:34:15,106 INFO L858 garLoopResultBuilder]: For program point L47-3(lines 47 51) no Hoare annotation was computed. [2022-02-20 16:34:15,106 INFO L858 garLoopResultBuilder]: For program point L39(lines 39 42) no Hoare annotation was computed. [2022-02-20 16:34:15,107 INFO L858 garLoopResultBuilder]: For program point L89(lines 89 90) no Hoare annotation was computed. [2022-02-20 16:34:15,107 INFO L858 garLoopResultBuilder]: For program point L122-1(lines 122 127) no Hoare annotation was computed. [2022-02-20 16:34:15,108 INFO L854 garLoopResultBuilder]: At program point L122-2(lines 122 127) the Hoare annotation is: false [2022-02-20 16:34:15,108 INFO L858 garLoopResultBuilder]: For program point L89-2(lines 89 90) no Hoare annotation was computed. [2022-02-20 16:34:15,108 INFO L858 garLoopResultBuilder]: For program point L122-3(lines 122 127) no Hoare annotation was computed. [2022-02-20 16:34:15,108 INFO L858 garLoopResultBuilder]: For program point L106(lines 106 114) no Hoare annotation was computed. [2022-02-20 16:34:15,108 INFO L858 garLoopResultBuilder]: For program point L73(lines 73 77) no Hoare annotation was computed. [2022-02-20 16:34:15,108 INFO L858 garLoopResultBuilder]: For program point L73-2(lines 73 77) no Hoare annotation was computed. [2022-02-20 16:34:15,108 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 16:34:15,109 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 146) no Hoare annotation was computed. [2022-02-20 16:34:15,109 INFO L858 garLoopResultBuilder]: For program point L41(lines 41 42) no Hoare annotation was computed. [2022-02-20 16:34:15,109 INFO L854 garLoopResultBuilder]: At program point L132(line 132) the Hoare annotation is: (and (= (_ bv1 32) |ULTIMATE.start_isnan_double_#res#1|) (= (let ((.cse0 (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53)))) (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse0) .cse0)) |ULTIMATE.start___ieee754_sqrt_#res#1|) (= |ULTIMATE.start___ieee754_sqrt_~x#1| (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))) (= currentRoundingMode roundNearestTiesToEven)) [2022-02-20 16:34:15,109 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 16:34:15,109 INFO L858 garLoopResultBuilder]: For program point L92(lines 92 93) no Hoare annotation was computed. [2022-02-20 16:34:15,110 INFO L858 garLoopResultBuilder]: For program point L92-2(lines 92 93) no Hoare annotation was computed. [2022-02-20 16:34:15,110 INFO L861 garLoopResultBuilder]: At program point L150(lines 134 151) the Hoare annotation is: true [2022-02-20 16:34:15,110 INFO L854 garLoopResultBuilder]: At program point L84-2(lines 84 100) the Hoare annotation is: false [2022-02-20 16:34:15,110 INFO L858 garLoopResultBuilder]: For program point L84-3(lines 21 129) no Hoare annotation was computed. [2022-02-20 16:34:15,110 INFO L858 garLoopResultBuilder]: For program point L109(lines 109 114) no Hoare annotation was computed. [2022-02-20 16:34:15,112 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 16:34:15,113 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:34:15,116 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:34:15,116 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:34:15,116 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-02-20 16:34:15,116 WARN L170 areAnnotationChecker]: L27-3 has no Hoare annotation [2022-02-20 16:34:15,116 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-02-20 16:34:15,116 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-02-20 16:34:15,116 WARN L170 areAnnotationChecker]: L27-3 has no Hoare annotation [2022-02-20 16:34:15,117 WARN L170 areAnnotationChecker]: L27-3 has no Hoare annotation [2022-02-20 16:34:15,117 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-02-20 16:34:15,117 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-02-20 16:34:15,118 WARN L170 areAnnotationChecker]: L145 has no Hoare annotation [2022-02-20 16:34:15,118 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-02-20 16:34:15,118 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-02-20 16:34:15,118 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2022-02-20 16:34:15,118 WARN L170 areAnnotationChecker]: L145 has no Hoare annotation [2022-02-20 16:34:15,118 WARN L170 areAnnotationChecker]: L145 has no Hoare annotation [2022-02-20 16:34:15,118 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-02-20 16:34:15,118 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-02-20 16:34:15,118 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-02-20 16:34:15,118 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-02-20 16:34:15,118 WARN L170 areAnnotationChecker]: L146 has no Hoare annotation [2022-02-20 16:34:15,118 WARN L170 areAnnotationChecker]: L146 has no Hoare annotation [2022-02-20 16:34:15,118 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:34:15,118 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2022-02-20 16:34:15,118 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2022-02-20 16:34:15,119 WARN L170 areAnnotationChecker]: L46-2 has no Hoare annotation [2022-02-20 16:34:15,119 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:34:15,119 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2022-02-20 16:34:15,119 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2022-02-20 16:34:15,119 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2022-02-20 16:34:15,119 WARN L170 areAnnotationChecker]: L52-4 has no Hoare annotation [2022-02-20 16:34:15,119 WARN L170 areAnnotationChecker]: L52-4 has no Hoare annotation [2022-02-20 16:34:15,119 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2022-02-20 16:34:15,119 WARN L170 areAnnotationChecker]: L60-2 has no Hoare annotation [2022-02-20 16:34:15,119 WARN L170 areAnnotationChecker]: L52-4 has no Hoare annotation [2022-02-20 16:34:15,119 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2022-02-20 16:34:15,119 WARN L170 areAnnotationChecker]: L71-3 has no Hoare annotation [2022-02-20 16:34:15,119 WARN L170 areAnnotationChecker]: L71-3 has no Hoare annotation [2022-02-20 16:34:15,119 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2022-02-20 16:34:15,120 WARN L170 areAnnotationChecker]: L71-3 has no Hoare annotation [2022-02-20 16:34:15,120 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2022-02-20 16:34:15,120 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2022-02-20 16:34:15,120 WARN L170 areAnnotationChecker]: L84-3 has no Hoare annotation [2022-02-20 16:34:15,120 WARN L170 areAnnotationChecker]: L84-3 has no Hoare annotation [2022-02-20 16:34:15,120 WARN L170 areAnnotationChecker]: L87 has no Hoare annotation [2022-02-20 16:34:15,120 WARN L170 areAnnotationChecker]: L73-2 has no Hoare annotation [2022-02-20 16:34:15,120 WARN L170 areAnnotationChecker]: L84-3 has no Hoare annotation [2022-02-20 16:34:15,120 WARN L170 areAnnotationChecker]: L84-3 has no Hoare annotation [2022-02-20 16:34:15,120 WARN L170 areAnnotationChecker]: L87 has no Hoare annotation [2022-02-20 16:34:15,120 WARN L170 areAnnotationChecker]: L87 has no Hoare annotation [2022-02-20 16:34:15,120 WARN L170 areAnnotationChecker]: L104 has no Hoare annotation [2022-02-20 16:34:15,120 WARN L170 areAnnotationChecker]: L104 has no Hoare annotation [2022-02-20 16:34:15,120 WARN L170 areAnnotationChecker]: L102 has no Hoare annotation [2022-02-20 16:34:15,120 WARN L170 areAnnotationChecker]: L89 has no Hoare annotation [2022-02-20 16:34:15,121 WARN L170 areAnnotationChecker]: L89 has no Hoare annotation [2022-02-20 16:34:15,121 WARN L170 areAnnotationChecker]: L87-2 has no Hoare annotation [2022-02-20 16:34:15,121 WARN L170 areAnnotationChecker]: L106 has no Hoare annotation [2022-02-20 16:34:15,121 WARN L170 areAnnotationChecker]: L106 has no Hoare annotation [2022-02-20 16:34:15,121 WARN L170 areAnnotationChecker]: L119 has no Hoare annotation [2022-02-20 16:34:15,121 WARN L170 areAnnotationChecker]: L119 has no Hoare annotation [2022-02-20 16:34:15,121 WARN L170 areAnnotationChecker]: L89-2 has no Hoare annotation [2022-02-20 16:34:15,121 WARN L170 areAnnotationChecker]: L109 has no Hoare annotation [2022-02-20 16:34:15,121 WARN L170 areAnnotationChecker]: L109 has no Hoare annotation [2022-02-20 16:34:15,121 WARN L170 areAnnotationChecker]: L119-2 has no Hoare annotation [2022-02-20 16:34:15,121 WARN L170 areAnnotationChecker]: L92 has no Hoare annotation [2022-02-20 16:34:15,121 WARN L170 areAnnotationChecker]: L92 has no Hoare annotation [2022-02-20 16:34:15,121 WARN L170 areAnnotationChecker]: L110 has no Hoare annotation [2022-02-20 16:34:15,121 WARN L170 areAnnotationChecker]: L110 has no Hoare annotation [2022-02-20 16:34:15,122 WARN L170 areAnnotationChecker]: L122-1 has no Hoare annotation [2022-02-20 16:34:15,122 WARN L170 areAnnotationChecker]: L122-3 has no Hoare annotation [2022-02-20 16:34:15,122 WARN L170 areAnnotationChecker]: L92-2 has no Hoare annotation [2022-02-20 16:34:15,122 WARN L170 areAnnotationChecker]: L110-2 has no Hoare annotation [2022-02-20 16:34:15,122 WARN L170 areAnnotationChecker]: L122-1 has no Hoare annotation [2022-02-20 16:34:15,122 WARN L170 areAnnotationChecker]: L122-1 has no Hoare annotation [2022-02-20 16:34:15,122 WARN L170 areAnnotationChecker]: L122-3 has no Hoare annotation [2022-02-20 16:34:15,122 INFO L163 areAnnotationChecker]: CFG has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 16:34:15,127 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:34:15,127 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:34:15,127 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:34:15,127 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:34:15,127 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:34:15,127 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:34:15,128 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:34:15,128 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:34:15,128 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:34:15,130 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:34:15,130 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:34:15,130 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:34:15,130 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:34:15,131 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:34:15,131 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:34:15,131 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:34:15,131 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:34:15,131 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:34:15,132 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:34:15,132 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:34:15,132 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:34:15,133 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:34:15,133 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:34:15,133 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:34:15,133 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:34:15,133 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:34:15,133 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:34:15,134 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:34:15,134 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:34:15,134 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:34:15,134 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:34:15,134 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:34:15,134 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:34:15,135 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:34:15,135 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:34:15,135 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:34:15,135 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:34:15,135 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:34:15,135 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:34:15,135 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:34:15,135 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:34:15,135 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:34:15,136 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:34:15 BoogieIcfgContainer [2022-02-20 16:34:15,136 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:34:15,137 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:34:15,137 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:34:15,137 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:34:15,138 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:33:56" (3/4) ... [2022-02-20 16:34:15,140 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 16:34:15,148 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2022-02-20 16:34:15,148 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2022-02-20 16:34:15,149 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 16:34:15,149 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 16:34:15,167 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven && (\exists currentRoundingMode : FloatRoundingMode :: x == ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE())) [2022-02-20 16:34:15,168 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (~fp.add~DOUBLE(~roundNearestTiesToEven, ~fp.mul~DOUBLE(~roundNearestTiesToEven, ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()), ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE())), ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE())) == \result && x == ~fp.div~DOUBLE(unknown-currentRoundingMode-unknown, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0)), ~Pluszero~LONGDOUBLE())) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven [2022-02-20 16:34:15,168 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((1bv32 == \result && ~fp.add~DOUBLE(~roundNearestTiesToEven, ~fp.mul~DOUBLE(~roundNearestTiesToEven, ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()), ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE())), ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE())) == \result) && x == ~fp.div~DOUBLE(unknown-currentRoundingMode-unknown, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0)), ~Pluszero~LONGDOUBLE())) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven [2022-02-20 16:34:15,190 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 16:34:15,194 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:34:15,195 INFO L158 Benchmark]: Toolchain (without parser) took 21499.10ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 41.0MB in the beginning and 41.8MB in the end (delta: -806.7kB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. [2022-02-20 16:34:15,195 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 60.8MB. Free memory was 42.6MB in the beginning and 42.5MB in the end (delta: 44.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:34:15,196 INFO L158 Benchmark]: CACSL2BoogieTranslator took 322.92ms. Allocated memory is still 60.8MB. Free memory was 40.8MB in the beginning and 39.4MB in the end (delta: 1.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 16:34:15,196 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.71ms. Allocated memory is still 60.8MB. Free memory was 39.2MB in the beginning and 36.8MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:34:15,196 INFO L158 Benchmark]: Boogie Preprocessor took 45.58ms. Allocated memory is still 60.8MB. Free memory was 36.6MB in the beginning and 34.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:34:15,197 INFO L158 Benchmark]: RCFGBuilder took 2256.17ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 34.5MB in the beginning and 49.2MB in the end (delta: -14.7MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. [2022-02-20 16:34:15,197 INFO L158 Benchmark]: TraceAbstraction took 18757.87ms. Allocated memory is still 73.4MB. Free memory was 48.5MB in the beginning and 45.5MB in the end (delta: 3.0MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. [2022-02-20 16:34:15,197 INFO L158 Benchmark]: Witness Printer took 57.17ms. Allocated memory is still 73.4MB. Free memory was 45.5MB in the beginning and 41.8MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 16:34:15,202 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.17ms. Allocated memory is still 60.8MB. Free memory was 42.6MB in the beginning and 42.5MB in the end (delta: 44.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 322.92ms. Allocated memory is still 60.8MB. Free memory was 40.8MB in the beginning and 39.4MB in the end (delta: 1.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.71ms. Allocated memory is still 60.8MB. Free memory was 39.2MB in the beginning and 36.8MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.58ms. Allocated memory is still 60.8MB. Free memory was 36.6MB in the beginning and 34.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 2256.17ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 34.5MB in the beginning and 49.2MB in the end (delta: -14.7MB). Peak memory consumption was 14.9MB. Max. memory is 16.1GB. * TraceAbstraction took 18757.87ms. Allocated memory is still 73.4MB. Free memory was 48.5MB in the beginning and 45.5MB in the end (delta: 3.0MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. * Witness Printer took 57.17ms. Allocated memory is still 73.4MB. Free memory was 45.5MB in the beginning and 41.8MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven * 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 - PositiveResult [Line: 146]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 49 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.7s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 15.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 69 SdHoareTripleChecker+Valid, 5.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 69 mSDsluCounter, 297 SdHoareTripleChecker+Invalid, 5.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2 IncrementalHoareTripleChecker+Unchecked, 170 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 36 IncrementalHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 127 mSDtfsCounter, 36 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=0, InterpolantAutomatonStates: 13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 13 NumberOfFragments, 103 HoareAnnotationTreeSize, 9 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 9 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 28 NumberOfCodeBlocks, 28 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 25 ConstructedInterpolants, 3 QuantifiedInterpolants, 142 SizeOfPredicates, 15 NumberOfNonLiveVariables, 123 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 71]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 84]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 21]: Loop Invariant [2022-02-20 16:34:15,217 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:34:15,217 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:34:15,218 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:34:15,218 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:34:15,218 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:34:15,218 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:34:15,218 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:34:15,218 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:34:15,219 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:34:15,222 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:34:15,222 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:34:15,222 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:34:15,222 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:34:15,222 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:34:15,222 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:34:15,223 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:34:15,223 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:34:15,223 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (~fp.add~DOUBLE(~roundNearestTiesToEven, ~fp.mul~DOUBLE(~roundNearestTiesToEven, ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()), ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE())), ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE())) == \result && x == ~fp.div~DOUBLE(unknown-currentRoundingMode-unknown, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0)), ~Pluszero~LONGDOUBLE())) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 52]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 122]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 27]: Loop Invariant [2022-02-20 16:34:15,225 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:34:15,225 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:34:15,225 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:34:15,225 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:34:15,225 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:34:15,225 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven && (\exists currentRoundingMode : FloatRoundingMode :: x == ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE())) - InvariantResult [Line: 132]: Loop Invariant [2022-02-20 16:34:15,226 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:34:15,226 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:34:15,226 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:34:15,226 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:34:15,226 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:34:15,227 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:34:15,227 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:34:15,227 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:34:15,227 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:34:15,228 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:34:15,228 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:34:15,228 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:34:15,228 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:34:15,228 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:34:15,228 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:34:15,228 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:34:15,229 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:34:15,229 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((1bv32 == \result && ~fp.add~DOUBLE(~roundNearestTiesToEven, ~fp.mul~DOUBLE(~roundNearestTiesToEven, ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()), ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE())), ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE())) == \result) && x == ~fp.div~DOUBLE(unknown-currentRoundingMode-unknown, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0)), ~Pluszero~LONGDOUBLE())) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven RESULT: Ultimate proved your program to be correct! [2022-02-20 16:34:15,365 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 Writing output log to file Ultimate.log Result: TRUE