./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_0720.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_0720.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 4e4c2067f061fded3c73bef3417c7b43200911ac0a27c4167dda41245285899f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:33:04,101 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:33:04,102 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:33:04,125 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:33:04,126 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:33:04,128 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:33:04,130 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:33:04,134 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:33:04,135 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:33:04,138 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:33:04,139 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:33:04,140 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:33:04,140 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:33:04,142 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:33:04,143 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:33:04,144 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:33:04,145 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:33:04,146 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:33:04,148 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:33:04,152 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:33:04,153 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:33:04,154 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:33:04,155 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:33:04,156 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:33:04,160 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:33:04,160 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:33:04,161 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:33:04,162 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:33:04,162 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:33:04,163 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:33:04,163 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:33:04,164 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:33:04,165 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:33:04,166 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:33:04,166 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:33:04,166 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:33:04,167 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:33:04,167 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:33:04,167 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:33:04,169 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:33:04,169 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:33:04,170 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:04,197 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:33:04,197 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:33:04,198 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:33:04,198 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:33:04,199 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:33:04,199 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:33:04,199 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:33:04,199 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:33:04,199 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:33:04,200 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:33:04,200 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:33:04,200 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:33:04,200 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:33:04,201 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:33:04,201 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:33:04,201 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:33:04,201 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:33:04,201 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:33:04,201 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:33:04,201 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:33:04,202 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:33:04,202 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:33:04,202 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:33:04,202 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:33:04,202 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:33:04,202 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:33:04,203 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:33:04,203 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:33:04,203 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:33:04,203 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:33:04,203 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:33:04,203 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:33:04,203 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:33:04,204 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 -> 4e4c2067f061fded3c73bef3417c7b43200911ac0a27c4167dda41245285899f [2022-02-20 16:33:04,354 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:33:04,381 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:33:04,383 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:33:04,384 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:33:04,384 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:33:04,385 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_0720.c [2022-02-20 16:33:04,433 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4163255ab/fb65f9b548174766a7a2d7c895ab7540/FLAG6777e90e9 [2022-02-20 16:33:04,760 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:33:04,761 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0720.c [2022-02-20 16:33:04,771 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4163255ab/fb65f9b548174766a7a2d7c895ab7540/FLAG6777e90e9 [2022-02-20 16:33:05,177 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4163255ab/fb65f9b548174766a7a2d7c895ab7540 [2022-02-20 16:33:05,180 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:33:05,182 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:33:05,184 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:33:05,184 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:33:05,186 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:33:05,187 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:33:05" (1/1) ... [2022-02-20 16:33:05,188 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ef70c98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:33:05, skipping insertion in model container [2022-02-20 16:33:05,189 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:33:05" (1/1) ... [2022-02-20 16:33:05,193 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:33:05,212 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:33:05,373 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_0720.c[3072,3085] [2022-02-20 16:33:05,375 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:33:05,380 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:33:05,419 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_0720.c[3072,3085] [2022-02-20 16:33:05,427 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:33:05,437 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:33:05,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:33:05 WrapperNode [2022-02-20 16:33:05,437 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:33:05,438 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:33:05,438 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:33:05,438 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:33:05,444 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:05" (1/1) ... [2022-02-20 16:33:05,459 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:05" (1/1) ... [2022-02-20 16:33:05,514 INFO L137 Inliner]: procedures = 17, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 175 [2022-02-20 16:33:05,516 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:33:05,517 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:33:05,517 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:33:05,517 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:33:05,523 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:05" (1/1) ... [2022-02-20 16:33:05,523 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:05" (1/1) ... [2022-02-20 16:33:05,534 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:05" (1/1) ... [2022-02-20 16:33:05,534 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:05" (1/1) ... [2022-02-20 16:33:05,549 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:05" (1/1) ... [2022-02-20 16:33:05,553 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:05" (1/1) ... [2022-02-20 16:33:05,556 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:05" (1/1) ... [2022-02-20 16:33:05,561 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:33:05,561 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:33:05,562 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:33:05,562 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:33:05,563 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:33:05" (1/1) ... [2022-02-20 16:33:05,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:33:05,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:33:05,604 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:05,612 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:05,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:33:05,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:33:05,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:33:05,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-02-20 16:33:05,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:33:05,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-02-20 16:33:05,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:33:05,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:33:05,642 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:33:05,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:33:05,692 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:33:05,693 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:33:06,166 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:33:06,171 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:33:06,171 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-02-20 16:33:06,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:33:06 BoogieIcfgContainer [2022-02-20 16:33:06,172 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:33:06,173 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:33:06,173 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:33:06,176 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:33:06,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:33:05" (1/3) ... [2022-02-20 16:33:06,176 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28616fd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:33:06, skipping insertion in model container [2022-02-20 16:33:06,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:33:05" (2/3) ... [2022-02-20 16:33:06,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28616fd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:33:06, skipping insertion in model container [2022-02-20 16:33:06,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:33:06" (3/3) ... [2022-02-20 16:33:06,178 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_0720.c [2022-02-20 16:33:06,181 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:33:06,181 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:33:06,208 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:33:06,212 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:06,213 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:33:06,222 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:06,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 16:33:06,225 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:33:06,226 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:33:06,226 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:33:06,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:33:06,230 INFO L85 PathProgramCache]: Analyzing trace with hash 361713738, now seen corresponding path program 1 times [2022-02-20 16:33:06,235 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:33:06,236 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940522083] [2022-02-20 16:33:06,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:33:06,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:33:06,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:33:06,362 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:06,363 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(0.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:06,364 INFO L290 TraceCheckUtils]: 2: Hoare triple {56#true} assume !true; {57#false} is VALID [2022-02-20 16:33:06,364 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:06,364 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:06,365 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:06,365 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:06,365 INFO L290 TraceCheckUtils]: 7: Hoare triple {57#false} assume !false; {57#false} is VALID [2022-02-20 16:33:06,366 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:06,366 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:33:06,367 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940522083] [2022-02-20 16:33:06,367 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940522083] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:33:06,368 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:33:06,368 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:33:06,370 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981148524] [2022-02-20 16:33:06,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:33:06,375 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:06,376 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:33:06,378 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:06,395 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:06,395 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:33:06,396 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:33:06,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:33:06,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:33:06,417 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:06,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:33:06,497 INFO L93 Difference]: Finished difference Result 104 states and 168 transitions. [2022-02-20 16:33:06,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:33:06,498 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:06,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:33:06,499 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:06,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 168 transitions. [2022-02-20 16:33:06,505 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:06,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 168 transitions. [2022-02-20 16:33:06,509 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 168 transitions. [2022-02-20 16:33:06,679 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:06,690 INFO L225 Difference]: With dead ends: 104 [2022-02-20 16:33:06,690 INFO L226 Difference]: Without dead ends: 50 [2022-02-20 16:33:06,692 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:06,697 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:06,698 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:06,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-02-20 16:33:06,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-02-20 16:33:06,719 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:33:06,720 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:06,721 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:06,723 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:06,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:33:06,727 INFO L93 Difference]: Finished difference Result 50 states and 70 transitions. [2022-02-20 16:33:06,728 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 70 transitions. [2022-02-20 16:33:06,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:33:06,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:33:06,729 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:06,730 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:06,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:33:06,735 INFO L93 Difference]: Finished difference Result 50 states and 70 transitions. [2022-02-20 16:33:06,735 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 70 transitions. [2022-02-20 16:33:06,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:33:06,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:33:06,736 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:33:06,736 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:33:06,738 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:06,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 70 transitions. [2022-02-20 16:33:06,746 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 70 transitions. Word has length 8 [2022-02-20 16:33:06,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:33:06,747 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 70 transitions. [2022-02-20 16:33:06,747 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:06,747 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 70 transitions. [2022-02-20 16:33:06,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 16:33:06,748 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:33:06,748 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:33:06,748 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:33:06,749 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:33:06,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:33:06,754 INFO L85 PathProgramCache]: Analyzing trace with hash 332468045, now seen corresponding path program 1 times [2022-02-20 16:33:06,754 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:33:06,755 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154341442] [2022-02-20 16:33:06,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:33:06,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:33:06,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:33:06,830 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:33:06,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:33:06,874 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:33:06,877 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:33:06,878 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:33:06,879 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:33:06,882 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-02-20 16:33:06,884 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:33:06,908 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:33:06,909 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:33:06,909 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2022-02-20 16:33:06,909 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2022-02-20 16:33:06,909 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2022-02-20 16:33:06,909 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2022-02-20 16:33:06,909 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2022-02-20 16:33:06,909 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2022-02-20 16:33:06,909 WARN L170 areAnnotationChecker]: L131 has no Hoare annotation [2022-02-20 16:33:06,910 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-02-20 16:33:06,910 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-02-20 16:33:06,910 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-02-20 16:33:06,910 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-02-20 16:33:06,910 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-02-20 16:33:06,910 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2022-02-20 16:33:06,910 WARN L170 areAnnotationChecker]: L146 has no Hoare annotation [2022-02-20 16:33:06,910 WARN L170 areAnnotationChecker]: L146 has no Hoare annotation [2022-02-20 16:33:06,910 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-02-20 16:33:06,911 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-02-20 16:33:06,911 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-02-20 16:33:06,911 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-02-20 16:33:06,911 WARN L170 areAnnotationChecker]: L147 has no Hoare annotation [2022-02-20 16:33:06,911 WARN L170 areAnnotationChecker]: L147 has no Hoare annotation [2022-02-20 16:33:06,911 WARN L170 areAnnotationChecker]: L151 has no Hoare annotation [2022-02-20 16:33:06,911 WARN L170 areAnnotationChecker]: L50-2 has no Hoare annotation [2022-02-20 16:33:06,911 WARN L170 areAnnotationChecker]: L50-2 has no Hoare annotation [2022-02-20 16:33:06,912 WARN L170 areAnnotationChecker]: L50-2 has no Hoare annotation [2022-02-20 16:33:06,912 WARN L170 areAnnotationChecker]: L49-2 has no Hoare annotation [2022-02-20 16:33:06,912 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:33:06,912 WARN L170 areAnnotationChecker]: L50-3 has no Hoare annotation [2022-02-20 16:33:06,912 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2022-02-20 16:33:06,912 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2022-02-20 16:33:06,912 WARN L170 areAnnotationChecker]: L55-3 has no Hoare annotation [2022-02-20 16:33:06,912 WARN L170 areAnnotationChecker]: L55-3 has no Hoare annotation [2022-02-20 16:33:06,912 WARN L170 areAnnotationChecker]: L55-3 has no Hoare annotation [2022-02-20 16:33:06,913 WARN L170 areAnnotationChecker]: L62-8 has no Hoare annotation [2022-02-20 16:33:06,913 WARN L170 areAnnotationChecker]: L62-8 has no Hoare annotation [2022-02-20 16:33:06,913 WARN L170 areAnnotationChecker]: L62-2 has no Hoare annotation [2022-02-20 16:33:06,913 WARN L170 areAnnotationChecker]: L62-2 has no Hoare annotation [2022-02-20 16:33:06,913 WARN L170 areAnnotationChecker]: L55-4 has no Hoare annotation [2022-02-20 16:33:06,913 WARN L170 areAnnotationChecker]: L55-2 has no Hoare annotation [2022-02-20 16:33:06,913 WARN L170 areAnnotationChecker]: L63-1 has no Hoare annotation [2022-02-20 16:33:06,913 WARN L170 areAnnotationChecker]: L62-4 has no Hoare annotation [2022-02-20 16:33:06,913 WARN L170 areAnnotationChecker]: L62-4 has no Hoare annotation [2022-02-20 16:33:06,913 WARN L170 areAnnotationChecker]: L74-2 has no Hoare annotation [2022-02-20 16:33:06,914 WARN L170 areAnnotationChecker]: L74-2 has no Hoare annotation [2022-02-20 16:33:06,914 WARN L170 areAnnotationChecker]: L74-2 has no Hoare annotation [2022-02-20 16:33:06,914 WARN L170 areAnnotationChecker]: L62-6 has no Hoare annotation [2022-02-20 16:33:06,914 WARN L170 areAnnotationChecker]: L62-6 has no Hoare annotation [2022-02-20 16:33:06,914 WARN L170 areAnnotationChecker]: L74-3 has no Hoare annotation [2022-02-20 16:33:06,914 WARN L170 areAnnotationChecker]: L76 has no Hoare annotation [2022-02-20 16:33:06,914 WARN L170 areAnnotationChecker]: L76 has no Hoare annotation [2022-02-20 16:33:06,914 WARN L170 areAnnotationChecker]: L87-2 has no Hoare annotation [2022-02-20 16:33:06,914 WARN L170 areAnnotationChecker]: L87-2 has no Hoare annotation [2022-02-20 16:33:06,915 WARN L170 areAnnotationChecker]: L87-2 has no Hoare annotation [2022-02-20 16:33:06,915 WARN L170 areAnnotationChecker]: L76-2 has no Hoare annotation [2022-02-20 16:33:06,915 WARN L170 areAnnotationChecker]: L87-3 has no Hoare annotation [2022-02-20 16:33:06,915 WARN L170 areAnnotationChecker]: L87-3 has no Hoare annotation [2022-02-20 16:33:06,915 WARN L170 areAnnotationChecker]: L90 has no Hoare annotation [2022-02-20 16:33:06,916 WARN L170 areAnnotationChecker]: L90 has no Hoare annotation [2022-02-20 16:33:06,916 WARN L170 areAnnotationChecker]: L107 has no Hoare annotation [2022-02-20 16:33:06,916 WARN L170 areAnnotationChecker]: L107 has no Hoare annotation [2022-02-20 16:33:06,917 WARN L170 areAnnotationChecker]: L105 has no Hoare annotation [2022-02-20 16:33:06,917 WARN L170 areAnnotationChecker]: L92 has no Hoare annotation [2022-02-20 16:33:06,917 WARN L170 areAnnotationChecker]: L92 has no Hoare annotation [2022-02-20 16:33:06,917 WARN L170 areAnnotationChecker]: L90-2 has no Hoare annotation [2022-02-20 16:33:06,917 WARN L170 areAnnotationChecker]: L109 has no Hoare annotation [2022-02-20 16:33:06,917 WARN L170 areAnnotationChecker]: L109 has no Hoare annotation [2022-02-20 16:33:06,917 WARN L170 areAnnotationChecker]: L122 has no Hoare annotation [2022-02-20 16:33:06,917 WARN L170 areAnnotationChecker]: L122 has no Hoare annotation [2022-02-20 16:33:06,917 WARN L170 areAnnotationChecker]: L92-2 has no Hoare annotation [2022-02-20 16:33:06,917 WARN L170 areAnnotationChecker]: L112 has no Hoare annotation [2022-02-20 16:33:06,918 WARN L170 areAnnotationChecker]: L112 has no Hoare annotation [2022-02-20 16:33:06,918 WARN L170 areAnnotationChecker]: L122-2 has no Hoare annotation [2022-02-20 16:33:06,918 WARN L170 areAnnotationChecker]: L95 has no Hoare annotation [2022-02-20 16:33:06,918 WARN L170 areAnnotationChecker]: L95 has no Hoare annotation [2022-02-20 16:33:06,918 WARN L170 areAnnotationChecker]: L113 has no Hoare annotation [2022-02-20 16:33:06,918 WARN L170 areAnnotationChecker]: L113 has no Hoare annotation [2022-02-20 16:33:06,918 WARN L170 areAnnotationChecker]: L125-2 has no Hoare annotation [2022-02-20 16:33:06,918 WARN L170 areAnnotationChecker]: L125-2 has no Hoare annotation [2022-02-20 16:33:06,918 WARN L170 areAnnotationChecker]: L95-2 has no Hoare annotation [2022-02-20 16:33:06,918 WARN L170 areAnnotationChecker]: L113-2 has no Hoare annotation [2022-02-20 16:33:06,919 WARN L170 areAnnotationChecker]: L125-1 has no Hoare annotation [2022-02-20 16:33:06,919 WARN L170 areAnnotationChecker]: L125-1 has no Hoare annotation [2022-02-20 16:33:06,919 WARN L170 areAnnotationChecker]: L125-3 has no Hoare annotation [2022-02-20 16:33:06,919 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:06,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:33:06 BoogieIcfgContainer [2022-02-20 16:33:06,920 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:33:06,921 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:33:06,921 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:33:06,922 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:33:06,922 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:06" (3/4) ... [2022-02-20 16:33:06,924 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 16:33:06,924 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:33:06,926 INFO L158 Benchmark]: Toolchain (without parser) took 1743.72ms. Allocated memory was 86.0MB in the beginning and 109.1MB in the end (delta: 23.1MB). Free memory was 52.2MB in the beginning and 74.9MB in the end (delta: -22.7MB). Peak memory consumption was 764.4kB. Max. memory is 16.1GB. [2022-02-20 16:33:06,926 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 86.0MB. Free memory was 56.6MB in the beginning and 56.6MB in the end (delta: 25.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:33:06,928 INFO L158 Benchmark]: CACSL2BoogieTranslator took 253.39ms. Allocated memory was 86.0MB in the beginning and 109.1MB in the end (delta: 23.1MB). Free memory was 52.0MB in the beginning and 81.9MB in the end (delta: -29.8MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. [2022-02-20 16:33:06,929 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.16ms. Allocated memory is still 109.1MB. Free memory was 81.9MB in the beginning and 75.2MB in the end (delta: 6.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-20 16:33:06,931 INFO L158 Benchmark]: Boogie Preprocessor took 44.04ms. Allocated memory is still 109.1MB. Free memory was 75.2MB in the beginning and 71.8MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 16:33:06,931 INFO L158 Benchmark]: RCFGBuilder took 610.99ms. Allocated memory is still 109.1MB. Free memory was 71.8MB in the beginning and 62.3MB in the end (delta: 9.5MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. [2022-02-20 16:33:06,931 INFO L158 Benchmark]: TraceAbstraction took 746.93ms. Allocated memory is still 109.1MB. Free memory was 61.8MB in the beginning and 75.5MB in the end (delta: -13.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:33:06,932 INFO L158 Benchmark]: Witness Printer took 3.16ms. Allocated memory is still 109.1MB. Free memory was 75.5MB in the beginning and 74.9MB in the end (delta: 632.4kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:33:06,936 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.13ms. Allocated memory is still 86.0MB. Free memory was 56.6MB in the beginning and 56.6MB in the end (delta: 25.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 253.39ms. Allocated memory was 86.0MB in the beginning and 109.1MB in the end (delta: 23.1MB). Free memory was 52.0MB in the beginning and 81.9MB in the end (delta: -29.8MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.16ms. Allocated memory is still 109.1MB. Free memory was 81.9MB in the beginning and 75.2MB in the end (delta: 6.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.04ms. Allocated memory is still 109.1MB. Free memory was 75.2MB in the beginning and 71.8MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 610.99ms. Allocated memory is still 109.1MB. Free memory was 71.8MB in the beginning and 62.3MB in the end (delta: 9.5MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. * TraceAbstraction took 746.93ms. Allocated memory is still 109.1MB. Free memory was 61.8MB in the beginning and 75.5MB in the end (delta: -13.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.16ms. Allocated memory is still 109.1MB. Free memory was 75.5MB in the beginning and 74.9MB in the end (delta: 632.4kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 147]: 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 20, overapproximation of someBinaryArithmeticDOUBLEoperation at line 38, overapproximation of bitwiseAnd at line 37. Possible FailurePath: [L22] static const double one_sqrt = 1.0, tiny_sqrt = 1.0e-300; VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000] [L141] double x = 0.0 / 0.0; [L143] CALL, EXPR __ieee754_sqrt(x) [L25] double z; [L26] __int32_t sign = 0x80000000; [L27] __uint32_t r, t1, s1, ix1, q1; [L28] __int32_t ix0, s0, q, m, t, i; VAL [\old(x)=4294967296, one_sqrt=1, sign=-2147483648, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=4294967296] [L31] ieee_double_shape_type ew_u; [L32] ew_u.value = (x) [L33] EXPR ew_u.parts.msw [L33] (ix0) = ew_u.parts.msw [L34] EXPR ew_u.parts.lsw [L34] (ix1) = ew_u.parts.lsw [L37] COND TRUE (ix0 & 0x7ff00000) == 0x7ff00000 [L38] return x * x + x; VAL [\old(x)=4294967296, ix0=-1, ix1=4294967297, one_sqrt=1, sign=-2147483648, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=4294967296] [L143] RET, EXPR __ieee754_sqrt(x) [L143] double res = __ieee754_sqrt(x); [L146] CALL, EXPR isnan_double(res) [L20] return x != x; VAL [\old(x)=4294967298, \result=0, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, x=4294967298] [L146] RET, EXPR isnan_double(res) [L146] COND TRUE !isnan_double(res) [L147] 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.3s, 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:06,973 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_0720.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 4e4c2067f061fded3c73bef3417c7b43200911ac0a27c4167dda41245285899f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:33:08,690 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:33:08,692 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:33:08,720 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:33:08,721 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:33:08,727 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:33:08,728 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:33:08,732 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:33:08,733 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:33:08,736 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:33:08,737 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:33:08,740 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:33:08,740 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:33:08,742 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:33:08,743 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:33:08,745 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:33:08,745 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:33:08,746 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:33:08,748 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:33:08,752 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:33:08,753 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:33:08,753 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:33:08,754 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:33:08,755 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:33:08,760 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:33:08,760 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:33:08,760 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:33:08,769 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:33:08,769 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:33:08,770 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:33:08,770 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:33:08,770 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:33:08,772 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:33:08,772 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:33:08,773 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:33:08,773 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:33:08,774 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:33:08,774 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:33:08,774 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:33:08,775 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:33:08,776 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:33:08,779 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:08,807 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:33:08,807 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:33:08,808 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:33:08,808 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:33:08,809 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:33:08,809 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:33:08,810 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:33:08,810 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:33:08,810 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:33:08,810 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:33:08,811 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:33:08,811 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:33:08,811 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:33:08,812 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:33:08,812 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:33:08,812 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:33:08,812 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:33:08,812 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:33:08,812 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:33:08,813 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:33:08,813 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:33:08,813 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:33:08,813 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:33:08,813 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:33:08,813 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:33:08,814 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:33:08,814 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:33:08,814 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:33:08,814 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:33:08,814 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:33:08,815 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:33:08,815 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:33:08,815 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:33:08,815 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:33:08,815 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:33:08,815 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:33:08,816 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 -> 4e4c2067f061fded3c73bef3417c7b43200911ac0a27c4167dda41245285899f [2022-02-20 16:33:09,056 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:33:09,068 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:33:09,070 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:33:09,071 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:33:09,071 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:33:09,072 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_0720.c [2022-02-20 16:33:09,121 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86a08f2c2/aa604efbcc4f42c68d054e5779d18374/FLAGb25750874 [2022-02-20 16:33:09,486 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:33:09,487 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0720.c [2022-02-20 16:33:09,493 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86a08f2c2/aa604efbcc4f42c68d054e5779d18374/FLAGb25750874 [2022-02-20 16:33:09,505 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86a08f2c2/aa604efbcc4f42c68d054e5779d18374 [2022-02-20 16:33:09,507 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:33:09,509 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:33:09,511 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:33:09,511 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:33:09,514 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:33:09,515 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:33:09" (1/1) ... [2022-02-20 16:33:09,516 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e229461 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:33:09, skipping insertion in model container [2022-02-20 16:33:09,516 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:33:09" (1/1) ... [2022-02-20 16:33:09,521 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:33:09,541 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:33:09,739 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_0720.c[3072,3085] [2022-02-20 16:33:09,746 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:33:09,760 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:33:09,805 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_0720.c[3072,3085] [2022-02-20 16:33:09,814 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:33:09,830 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:33:09,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:33:09 WrapperNode [2022-02-20 16:33:09,835 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:33:09,837 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:33:09,837 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:33:09,837 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:33:09,841 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:09" (1/1) ... [2022-02-20 16:33:09,859 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:09" (1/1) ... [2022-02-20 16:33:09,891 INFO L137 Inliner]: procedures = 20, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 163 [2022-02-20 16:33:09,891 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:33:09,892 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:33:09,892 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:33:09,892 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:33:09,898 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:09" (1/1) ... [2022-02-20 16:33:09,899 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:09" (1/1) ... [2022-02-20 16:33:09,908 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:09" (1/1) ... [2022-02-20 16:33:09,908 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:09" (1/1) ... [2022-02-20 16:33:09,926 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:09" (1/1) ... [2022-02-20 16:33:09,931 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:09" (1/1) ... [2022-02-20 16:33:09,934 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:09" (1/1) ... [2022-02-20 16:33:09,944 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:33:09,952 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:33:09,953 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:33:09,953 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:33:09,954 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:33:09" (1/1) ... [2022-02-20 16:33:09,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:33:09,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:33:09,983 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:09,987 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:10,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:33:10,012 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2022-02-20 16:33:10,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2022-02-20 16:33:10,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:33:10,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:33:10,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 16:33:10,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:33:10,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:33:10,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 16:33:10,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:33:10,081 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:33:10,082 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:33:13,123 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:33:13,128 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:33:13,128 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-02-20 16:33:13,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:33:13 BoogieIcfgContainer [2022-02-20 16:33:13,129 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:33:13,130 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:33:13,130 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:33:13,134 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:33:13,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:33:09" (1/3) ... [2022-02-20 16:33:13,134 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cd43cc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:33:13, skipping insertion in model container [2022-02-20 16:33:13,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:33:09" (2/3) ... [2022-02-20 16:33:13,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cd43cc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:33:13, skipping insertion in model container [2022-02-20 16:33:13,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:33:13" (3/3) ... [2022-02-20 16:33:13,136 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_0720.c [2022-02-20 16:33:13,139 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:33:13,139 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:33:13,177 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:33:13,182 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:13,182 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:33:13,194 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:13,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 16:33:13,197 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:33:13,198 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:33:13,198 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:33:13,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:33:13,220 INFO L85 PathProgramCache]: Analyzing trace with hash 361067274, now seen corresponding path program 1 times [2022-02-20 16:33:13,228 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:33:13,229 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1752534442] [2022-02-20 16:33:13,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:33:13,229 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:33:13,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:33:13,231 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:13,237 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:13,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:33:13,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:33:13,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:33:13,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:33:13,597 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:13,599 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, ~Pluszero~DOUBLE(), ~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:13,600 INFO L290 TraceCheckUtils]: 2: Hoare triple {52#true} assume !true; {53#false} is VALID [2022-02-20 16:33:13,601 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:13,601 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:13,601 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:13,602 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:13,602 INFO L290 TraceCheckUtils]: 7: Hoare triple {53#false} assume !false; {53#false} is VALID [2022-02-20 16:33:13,603 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:13,603 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:33:13,604 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:33:13,604 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1752534442] [2022-02-20 16:33:13,604 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1752534442] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:33:13,605 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:33:13,605 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:33:13,606 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752020480] [2022-02-20 16:33:13,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:33:13,609 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:13,610 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:33:13,612 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:13,739 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:13,739 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:33:13,739 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:33:13,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:33:13,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:33:13,754 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:15,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:33:15,433 INFO L93 Difference]: Finished difference Result 96 states and 152 transitions. [2022-02-20 16:33:15,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:33:15,433 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:15,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:33:15,434 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:15,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 152 transitions. [2022-02-20 16:33:15,440 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:15,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 152 transitions. [2022-02-20 16:33:15,445 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 152 transitions. [2022-02-20 16:33:17,528 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:33:17,535 INFO L225 Difference]: With dead ends: 96 [2022-02-20 16:33:17,536 INFO L226 Difference]: Without dead ends: 46 [2022-02-20 16:33:17,538 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:33:17,541 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:33:17,542 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:33:17,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-02-20 16:33:17,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-02-20 16:33:17,563 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:33:17,564 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:33:17,565 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:33:17,565 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:33:17,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:33:17,568 INFO L93 Difference]: Finished difference Result 46 states and 65 transitions. [2022-02-20 16:33:17,569 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 65 transitions. [2022-02-20 16:33:17,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:33:17,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:33:17,570 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:33:17,570 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:33:17,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:33:17,573 INFO L93 Difference]: Finished difference Result 46 states and 65 transitions. [2022-02-20 16:33:17,573 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 65 transitions. [2022-02-20 16:33:17,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:33:17,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:33:17,573 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:33:17,574 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:33:17,574 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:33:17,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 65 transitions. [2022-02-20 16:33:17,577 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 65 transitions. Word has length 8 [2022-02-20 16:33:17,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:33:17,578 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 65 transitions. [2022-02-20 16:33:17,578 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:17,578 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 65 transitions. [2022-02-20 16:33:17,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 16:33:17,578 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:33:17,579 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:33:17,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 16:33:17,794 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:33:17,795 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:33:17,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:33:17,796 INFO L85 PathProgramCache]: Analyzing trace with hash 331821581, now seen corresponding path program 1 times [2022-02-20 16:33:17,796 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:33:17,797 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [455769773] [2022-02-20 16:33:17,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:33:17,797 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:33:17,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:33:17,799 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:33:17,800 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:33:18,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:33:18,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 16:33:18,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:33:18,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:33:18,694 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:33:18,695 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, ~Pluszero~DOUBLE(), ~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 (= currentRoundingMode roundNearestTiesToEven) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start___ieee754_sqrt_~x#1|))} is VALID [2022-02-20 16:33:18,696 INFO L290 TraceCheckUtils]: 2: Hoare triple {346#(and (= currentRoundingMode roundNearestTiesToEven) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start___ieee754_sqrt_~x#1|))} 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 (= currentRoundingMode roundNearestTiesToEven) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start___ieee754_sqrt_~x#1|))} is VALID [2022-02-20 16:33:18,697 INFO L290 TraceCheckUtils]: 3: Hoare triple {346#(and (= currentRoundingMode roundNearestTiesToEven) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start___ieee754_sqrt_~x#1|))} goto; {346#(and (= currentRoundingMode roundNearestTiesToEven) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start___ieee754_sqrt_~x#1|))} is VALID [2022-02-20 16:33:18,697 INFO L290 TraceCheckUtils]: 4: Hoare triple {346#(and (= currentRoundingMode roundNearestTiesToEven) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start___ieee754_sqrt_~x#1|))} 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#(= |ULTIMATE.start___ieee754_sqrt_#res#1| (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)) (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53))) (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53))))} is VALID [2022-02-20 16:33:18,698 INFO L290 TraceCheckUtils]: 5: Hoare triple {356#(= |ULTIMATE.start___ieee754_sqrt_#res#1| (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)) (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53))) (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53))))} 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:33:18,698 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:33:18,699 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:33:18,699 INFO L290 TraceCheckUtils]: 8: Hoare triple {338#false} assume !false; {338#false} is VALID [2022-02-20 16:33:18,699 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:18,699 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:33:18,699 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:33:18,699 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [455769773] [2022-02-20 16:33:18,699 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [455769773] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:33:18,699 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:33:18,699 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 16:33:18,700 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723364952] [2022-02-20 16:33:18,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:33:18,701 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:33:18,701 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:33:18,701 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:33:18,919 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:33:18,919 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 16:33:18,920 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:33:18,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 16:33:18,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:33:18,924 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:33:24,546 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 16:33:28,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:33:28,959 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-02-20 16:33:28,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 16:33:28,960 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:33:28,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:33:28,960 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:33:28,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 69 transitions. [2022-02-20 16:33:28,961 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:33:28,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 69 transitions. [2022-02-20 16:33:28,963 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 69 transitions. [2022-02-20 16:33:30,136 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:33:30,137 INFO L225 Difference]: With dead ends: 51 [2022-02-20 16:33:30,138 INFO L226 Difference]: Without dead ends: 46 [2022-02-20 16:33:30,138 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:33:30,139 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 69 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-02-20 16:33:30,139 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 223 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-02-20 16:33:30,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-02-20 16:33:30,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-02-20 16:33:30,142 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:33:30,142 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 46 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 45 states have internal predecessors, (62), 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:30,142 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 46 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 45 states have internal predecessors, (62), 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:30,143 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 46 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 45 states have internal predecessors, (62), 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:30,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:33:30,144 INFO L93 Difference]: Finished difference Result 46 states and 62 transitions. [2022-02-20 16:33:30,144 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 62 transitions. [2022-02-20 16:33:30,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:33:30,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:33:30,145 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 45 states have internal predecessors, (62), 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:33:30,145 INFO L87 Difference]: Start difference. First operand has 46 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 45 states have internal predecessors, (62), 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:33:30,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:33:30,146 INFO L93 Difference]: Finished difference Result 46 states and 62 transitions. [2022-02-20 16:33:30,146 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 62 transitions. [2022-02-20 16:33:30,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:33:30,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:33:30,147 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:33:30,147 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:33:30,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 45 states have internal predecessors, (62), 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:30,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 62 transitions. [2022-02-20 16:33:30,153 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 62 transitions. Word has length 9 [2022-02-20 16:33:30,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:33:30,153 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 62 transitions. [2022-02-20 16:33:30,154 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:33:30,154 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 62 transitions. [2022-02-20 16:33:30,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 16:33:30,159 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:33:30,159 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:33:30,185 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:33:30,371 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:33:30,372 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:33:30,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:33:30,372 INFO L85 PathProgramCache]: Analyzing trace with hash -677928537, now seen corresponding path program 1 times [2022-02-20 16:33:30,373 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:33:30,373 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [53216564] [2022-02-20 16:33:30,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:33:30,373 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:33:30,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:33:30,374 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:33:30,375 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:33:30,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:33:30,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 16:33:30,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:33:30,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:33:30,884 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:33:30,886 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, ~Pluszero~DOUBLE(), ~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)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start___ieee754_sqrt_~x#1|))} is VALID [2022-02-20 16:33:30,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {591#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start___ieee754_sqrt_~x#1|))} 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 (= |ULTIMATE.start___ieee754_sqrt_~ix0~0#1| ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_5|)) (= (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 (_ +zero 11 53) (_ +zero 11 53)))))} is VALID [2022-02-20 16:33:30,889 INFO L290 TraceCheckUtils]: 3: Hoare triple {595#(exists ((|v_skolemized_q#valueAsBitvector_5| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= |ULTIMATE.start___ieee754_sqrt_~ix0~0#1| ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_5|)) (= (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 (_ +zero 11 53) (_ +zero 11 53)))))} goto; {595#(exists ((|v_skolemized_q#valueAsBitvector_5| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= |ULTIMATE.start___ieee754_sqrt_~ix0~0#1| ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_5|)) (= (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 (_ +zero 11 53) (_ +zero 11 53)))))} is VALID [2022-02-20 16:33:30,891 INFO L290 TraceCheckUtils]: 4: Hoare triple {595#(exists ((|v_skolemized_q#valueAsBitvector_5| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= |ULTIMATE.start___ieee754_sqrt_~ix0~0#1| ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_5|)) (= (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 (_ +zero 11 53) (_ +zero 11 53)))))} assume !(2146435072bv32 == ~bvand32(2146435072bv32, __ieee754_sqrt_~ix0~0#1)); {584#false} is VALID [2022-02-20 16:33:30,891 INFO L290 TraceCheckUtils]: 5: Hoare triple {584#false} assume !~bvsle32(__ieee754_sqrt_~ix0~0#1, 0bv32); {584#false} is VALID [2022-02-20 16:33:30,891 INFO L290 TraceCheckUtils]: 6: Hoare triple {584#false} __ieee754_sqrt_~m~0#1 := ~bvashr32(__ieee754_sqrt_~ix0~0#1, 20bv32); {584#false} is VALID [2022-02-20 16:33:30,891 INFO L290 TraceCheckUtils]: 7: Hoare triple {584#false} assume !(0bv32 == __ieee754_sqrt_~m~0#1); {584#false} is VALID [2022-02-20 16:33:30,892 INFO L290 TraceCheckUtils]: 8: Hoare triple {584#false} __ieee754_sqrt_~m~0#1 := ~bvsub32(__ieee754_sqrt_~m~0#1, 1023bv32);__ieee754_sqrt_~ix0~0#1 := ~bvor32(1048576bv32, ~bvand32(1048575bv32, __ieee754_sqrt_~ix0~0#1)); {584#false} is VALID [2022-02-20 16:33:30,892 INFO L290 TraceCheckUtils]: 9: Hoare triple {584#false} assume 0bv32 != ~bvand32(1bv32, __ieee754_sqrt_~m~0#1);__ieee754_sqrt_~ix0~0#1 := ~bvadd32(__ieee754_sqrt_~ix0~0#1, ~bvadd32(__ieee754_sqrt_~ix0~0#1, ~bvlshr32(~bvand32(__ieee754_sqrt_~ix1~0#1, __ieee754_sqrt_~sign~0#1), 31bv32)));__ieee754_sqrt_~ix1~0#1 := ~bvadd32(__ieee754_sqrt_~ix1~0#1, __ieee754_sqrt_~ix1~0#1); {584#false} is VALID [2022-02-20 16:33:30,892 INFO L290 TraceCheckUtils]: 10: Hoare triple {584#false} __ieee754_sqrt_~m~0#1 := ~bvashr32(__ieee754_sqrt_~m~0#1, 1bv32);__ieee754_sqrt_~ix0~0#1 := ~bvadd32(__ieee754_sqrt_~ix0~0#1, ~bvadd32(__ieee754_sqrt_~ix0~0#1, ~bvlshr32(~bvand32(__ieee754_sqrt_~ix1~0#1, __ieee754_sqrt_~sign~0#1), 31bv32)));__ieee754_sqrt_~ix1~0#1 := ~bvadd32(__ieee754_sqrt_~ix1~0#1, __ieee754_sqrt_~ix1~0#1);__ieee754_sqrt_~s1~0#1 := 0bv32;__ieee754_sqrt_~s0~0#1 := __ieee754_sqrt_~s1~0#1;__ieee754_sqrt_~q1~0#1 := __ieee754_sqrt_~s0~0#1;__ieee754_sqrt_~q~0#1 := __ieee754_sqrt_~q1~0#1;__ieee754_sqrt_~r~0#1 := 2097152bv32; {584#false} is VALID [2022-02-20 16:33:30,892 INFO L290 TraceCheckUtils]: 11: Hoare triple {584#false} assume !(0bv32 != __ieee754_sqrt_~r~0#1); {584#false} is VALID [2022-02-20 16:33:30,892 INFO L290 TraceCheckUtils]: 12: Hoare triple {584#false} __ieee754_sqrt_~r~0#1 := __ieee754_sqrt_~sign~0#1; {584#false} is VALID [2022-02-20 16:33:30,893 INFO L290 TraceCheckUtils]: 13: Hoare triple {584#false} assume !(0bv32 != __ieee754_sqrt_~r~0#1); {584#false} is VALID [2022-02-20 16:33:30,893 INFO L290 TraceCheckUtils]: 14: Hoare triple {584#false} assume !(0bv32 != ~bvor32(__ieee754_sqrt_~ix0~0#1, __ieee754_sqrt_~ix1~0#1)); {584#false} is VALID [2022-02-20 16:33:30,893 INFO L290 TraceCheckUtils]: 15: Hoare triple {584#false} __ieee754_sqrt_~ix0~0#1 := ~bvadd32(1071644672bv32, ~bvashr32(__ieee754_sqrt_~q~0#1, 1bv32));__ieee754_sqrt_~ix1~0#1 := ~bvlshr32(__ieee754_sqrt_~q1~0#1, 1bv32); {584#false} is VALID [2022-02-20 16:33:30,893 INFO L290 TraceCheckUtils]: 16: Hoare triple {584#false} assume 1bv32 == ~bvand32(1bv32, __ieee754_sqrt_~q~0#1);__ieee754_sqrt_~ix1~0#1 := ~bvor32(__ieee754_sqrt_~ix1~0#1, __ieee754_sqrt_~sign~0#1); {584#false} is VALID [2022-02-20 16:33:30,893 INFO L290 TraceCheckUtils]: 17: Hoare triple {584#false} __ieee754_sqrt_~ix0~0#1 := ~bvadd32(__ieee754_sqrt_~ix0~0#1, ~bvshl32(__ieee754_sqrt_~m~0#1, 20bv32)); {584#false} is VALID [2022-02-20 16:33:30,893 INFO L290 TraceCheckUtils]: 18: Hoare triple {584#false} call __ieee754_sqrt_~#iw_u~0#1.base, __ieee754_sqrt_~#iw_u~0#1.offset := #Ultimate.allocOnStack(8bv32);call write~intINTTYPE4(__ieee754_sqrt_~ix0~0#1, __ieee754_sqrt_~#iw_u~0#1.base, ~bvadd32(4bv32, __ieee754_sqrt_~#iw_u~0#1.offset), 4bv32);call write~intINTTYPE4(__ieee754_sqrt_~ix1~0#1, __ieee754_sqrt_~#iw_u~0#1.base, __ieee754_sqrt_~#iw_u~0#1.offset, 4bv32);call __ieee754_sqrt_#t~mem7#1 := read~intFLOATTYPE8(__ieee754_sqrt_~#iw_u~0#1.base, __ieee754_sqrt_~#iw_u~0#1.offset, 8bv32);__ieee754_sqrt_~z~0#1 := __ieee754_sqrt_#t~mem7#1;havoc __ieee754_sqrt_#t~mem7#1;call ULTIMATE.dealloc(__ieee754_sqrt_~#iw_u~0#1.base, __ieee754_sqrt_~#iw_u~0#1.offset);havoc __ieee754_sqrt_~#iw_u~0#1.base, __ieee754_sqrt_~#iw_u~0#1.offset; {584#false} is VALID [2022-02-20 16:33:30,894 INFO L290 TraceCheckUtils]: 19: Hoare triple {584#false} goto; {584#false} is VALID [2022-02-20 16:33:30,894 INFO L290 TraceCheckUtils]: 20: Hoare triple {584#false} __ieee754_sqrt_#res#1 := __ieee754_sqrt_~z~0#1; {584#false} is VALID [2022-02-20 16:33:30,894 INFO L290 TraceCheckUtils]: 21: 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:33:30,894 INFO L290 TraceCheckUtils]: 22: 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:33:30,894 INFO L290 TraceCheckUtils]: 23: Hoare triple {584#false} assume 0bv32 == main_#t~ret9#1;havoc main_#t~ret9#1; {584#false} is VALID [2022-02-20 16:33:30,894 INFO L290 TraceCheckUtils]: 24: Hoare triple {584#false} assume !false; {584#false} is VALID [2022-02-20 16:33:30,895 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:30,895 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:33:30,895 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:33:30,895 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [53216564] [2022-02-20 16:33:30,904 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [53216564] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:33:30,905 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:33:30,905 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:33:30,905 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953157057] [2022-02-20 16:33:30,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:33:30,905 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 25 [2022-02-20 16:33:30,906 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:33:30,906 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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:30,934 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:33:30,935 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:33:30,935 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:33:30,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:33:30,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:33:30,936 INFO L87 Difference]: Start difference. First operand 46 states and 62 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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:31,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:33:31,005 INFO L93 Difference]: Finished difference Result 46 states and 62 transitions. [2022-02-20 16:33:31,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:33:31,005 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 25 [2022-02-20 16:33:31,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:33:31,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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:31,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-02-20 16:33:31,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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:31,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-02-20 16:33:31,008 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 62 transitions. [2022-02-20 16:33:31,140 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:33:31,140 INFO L225 Difference]: With dead ends: 46 [2022-02-20 16:33:31,140 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 16:33:31,141 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 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:33:31,142 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:33:31,142 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:33:31,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 16:33:31,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 16:33:31,143 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:33:31,143 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:33:31,143 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:33:31,143 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:33:31,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:33:31,143 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:33:31,143 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:33:31,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:33:31,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:33:31,143 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:33:31,143 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:33:31,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:33:31,144 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:33:31,144 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:33:31,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:33:31,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:33:31,144 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:33:31,144 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:33:31,144 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:33:31,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 16:33:31,144 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2022-02-20 16:33:31,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:33:31,144 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 16:33:31,145 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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:31,145 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:33:31,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:33:31,147 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:33:31,172 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:33:31,356 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:33:31,358 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 16:33:31,608 INFO L861 garLoopResultBuilder]: At program point L151(lines 134 152) the Hoare annotation is: true [2022-02-20 16:33:31,608 INFO L858 garLoopResultBuilder]: For program point L44(lines 44 45) no Hoare annotation was computed. [2022-02-20 16:33:31,608 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 16:33:31,608 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 16:33:31,608 INFO L854 garLoopResultBuilder]: At program point L20(line 20) the Hoare annotation is: (and (= (_ bv1 32) |ULTIMATE.start_isnan_double_#res#1|) (= currentRoundingMode roundNearestTiesToEven) (= |ULTIMATE.start___ieee754_sqrt_#res#1| (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse0) .cse0))) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start___ieee754_sqrt_~x#1|)) [2022-02-20 16:33:31,608 INFO L858 garLoopResultBuilder]: For program point L95(lines 95 96) no Hoare annotation was computed. [2022-02-20 16:33:31,608 INFO L858 garLoopResultBuilder]: For program point L95-2(lines 95 96) no Hoare annotation was computed. [2022-02-20 16:33:31,608 INFO L854 garLoopResultBuilder]: At program point L87-2(lines 87 103) the Hoare annotation is: false [2022-02-20 16:33:31,608 INFO L858 garLoopResultBuilder]: For program point L87-3(lines 24 132) no Hoare annotation was computed. [2022-02-20 16:33:31,608 INFO L858 garLoopResultBuilder]: For program point L112(lines 112 117) no Hoare annotation was computed. [2022-02-20 16:33:31,608 INFO L858 garLoopResultBuilder]: For program point L63(lines 63 66) no Hoare annotation was computed. [2022-02-20 16:33:31,609 INFO L858 garLoopResultBuilder]: For program point L30-1(lines 30 35) no Hoare annotation was computed. [2022-02-20 16:33:31,609 INFO L858 garLoopResultBuilder]: For program point L63-2(lines 63 66) no Hoare annotation was computed. [2022-02-20 16:33:31,609 INFO L854 garLoopResultBuilder]: At program point L30-2(lines 30 35) the Hoare annotation is: (and (= currentRoundingMode roundNearestTiesToEven) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start___ieee754_sqrt_~x#1|)) [2022-02-20 16:33:31,609 INFO L858 garLoopResultBuilder]: For program point L30-3(lines 24 132) no Hoare annotation was computed. [2022-02-20 16:33:31,609 INFO L858 garLoopResultBuilder]: For program point L55-2(lines 55 56) no Hoare annotation was computed. [2022-02-20 16:33:31,609 INFO L854 garLoopResultBuilder]: At program point L55-3(lines 55 56) the Hoare annotation is: false [2022-02-20 16:33:31,609 INFO L858 garLoopResultBuilder]: For program point L55-4(lines 55 56) no Hoare annotation was computed. [2022-02-20 16:33:31,609 INFO L858 garLoopResultBuilder]: For program point L146(lines 146 149) no Hoare annotation was computed. [2022-02-20 16:33:31,609 INFO L858 garLoopResultBuilder]: For program point L113(lines 113 114) no Hoare annotation was computed. [2022-02-20 16:33:31,609 INFO L858 garLoopResultBuilder]: For program point L113-2(lines 113 114) no Hoare annotation was computed. [2022-02-20 16:33:31,609 INFO L858 garLoopResultBuilder]: For program point L105(lines 105 119) no Hoare annotation was computed. [2022-02-20 16:33:31,609 INFO L858 garLoopResultBuilder]: For program point L122(lines 122 123) no Hoare annotation was computed. [2022-02-20 16:33:31,609 INFO L858 garLoopResultBuilder]: For program point L122-2(lines 122 123) no Hoare annotation was computed. [2022-02-20 16:33:31,609 INFO L858 garLoopResultBuilder]: For program point L147(line 147) no Hoare annotation was computed. [2022-02-20 16:33:31,610 INFO L854 garLoopResultBuilder]: At program point L131(lines 24 132) the Hoare annotation is: (and (= currentRoundingMode roundNearestTiesToEven) (= |ULTIMATE.start___ieee754_sqrt_#res#1| (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse0) .cse0))) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start___ieee754_sqrt_~x#1|)) [2022-02-20 16:33:31,610 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 16:33:31,610 INFO L858 garLoopResultBuilder]: For program point L90(lines 90 99) no Hoare annotation was computed. [2022-02-20 16:33:31,610 INFO L858 garLoopResultBuilder]: For program point L90-2(lines 90 99) no Hoare annotation was computed. [2022-02-20 16:33:31,610 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 147) no Hoare annotation was computed. [2022-02-20 16:33:31,610 INFO L858 garLoopResultBuilder]: For program point L49(lines 49 60) no Hoare annotation was computed. [2022-02-20 16:33:31,610 INFO L858 garLoopResultBuilder]: For program point L49-2(lines 49 60) no Hoare annotation was computed. [2022-02-20 16:33:31,610 INFO L858 garLoopResultBuilder]: For program point L107(lines 107 118) no Hoare annotation was computed. [2022-02-20 16:33:31,610 INFO L858 garLoopResultBuilder]: For program point L41(lines 41 46) no Hoare annotation was computed. [2022-02-20 16:33:31,610 INFO L854 garLoopResultBuilder]: At program point L74-2(lines 74 84) the Hoare annotation is: false [2022-02-20 16:33:31,611 INFO L858 garLoopResultBuilder]: For program point L41-2(lines 41 46) no Hoare annotation was computed. [2022-02-20 16:33:31,611 INFO L858 garLoopResultBuilder]: For program point L74-3(lines 74 84) no Hoare annotation was computed. [2022-02-20 16:33:31,611 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 16:33:31,611 INFO L854 garLoopResultBuilder]: At program point L50-2(lines 50 54) the Hoare annotation is: false [2022-02-20 16:33:31,611 INFO L858 garLoopResultBuilder]: For program point L50-3(lines 50 54) no Hoare annotation was computed. [2022-02-20 16:33:31,611 INFO L858 garLoopResultBuilder]: For program point L42(lines 42 45) no Hoare annotation was computed. [2022-02-20 16:33:31,611 INFO L858 garLoopResultBuilder]: For program point L92(lines 92 93) no Hoare annotation was computed. [2022-02-20 16:33:31,611 INFO L858 garLoopResultBuilder]: For program point L125-1(lines 125 130) no Hoare annotation was computed. [2022-02-20 16:33:31,611 INFO L854 garLoopResultBuilder]: At program point L125-2(lines 125 130) the Hoare annotation is: false [2022-02-20 16:33:31,612 INFO L858 garLoopResultBuilder]: For program point L92-2(lines 92 93) no Hoare annotation was computed. [2022-02-20 16:33:31,612 INFO L858 garLoopResultBuilder]: For program point L125-3(lines 125 130) no Hoare annotation was computed. [2022-02-20 16:33:31,612 INFO L858 garLoopResultBuilder]: For program point L109(lines 109 117) no Hoare annotation was computed. [2022-02-20 16:33:31,612 INFO L858 garLoopResultBuilder]: For program point L76(lines 76 80) no Hoare annotation was computed. [2022-02-20 16:33:31,612 INFO L858 garLoopResultBuilder]: For program point L76-2(lines 76 80) no Hoare annotation was computed. [2022-02-20 16:33:31,614 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 16:33:31,615 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:33:31,617 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:33:31,618 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:33:31,618 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2022-02-20 16:33:31,618 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2022-02-20 16:33:31,618 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2022-02-20 16:33:31,618 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2022-02-20 16:33:31,618 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2022-02-20 16:33:31,618 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2022-02-20 16:33:31,632 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-02-20 16:33:31,632 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-02-20 16:33:31,632 WARN L170 areAnnotationChecker]: L146 has no Hoare annotation [2022-02-20 16:33:31,632 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-02-20 16:33:31,632 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-02-20 16:33:31,632 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2022-02-20 16:33:31,632 WARN L170 areAnnotationChecker]: L146 has no Hoare annotation [2022-02-20 16:33:31,632 WARN L170 areAnnotationChecker]: L146 has no Hoare annotation [2022-02-20 16:33:31,632 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-02-20 16:33:31,632 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-02-20 16:33:31,632 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-02-20 16:33:31,632 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-02-20 16:33:31,632 WARN L170 areAnnotationChecker]: L147 has no Hoare annotation [2022-02-20 16:33:31,632 WARN L170 areAnnotationChecker]: L147 has no Hoare annotation [2022-02-20 16:33:31,632 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:33:31,632 WARN L170 areAnnotationChecker]: L50-3 has no Hoare annotation [2022-02-20 16:33:31,632 WARN L170 areAnnotationChecker]: L50-3 has no Hoare annotation [2022-02-20 16:33:31,632 WARN L170 areAnnotationChecker]: L49-2 has no Hoare annotation [2022-02-20 16:33:31,632 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:33:31,632 WARN L170 areAnnotationChecker]: L50-3 has no Hoare annotation [2022-02-20 16:33:31,632 WARN L170 areAnnotationChecker]: L63 has no Hoare annotation [2022-02-20 16:33:31,633 WARN L170 areAnnotationChecker]: L63 has no Hoare annotation [2022-02-20 16:33:31,633 WARN L170 areAnnotationChecker]: L55-4 has no Hoare annotation [2022-02-20 16:33:31,633 WARN L170 areAnnotationChecker]: L55-4 has no Hoare annotation [2022-02-20 16:33:31,633 WARN L170 areAnnotationChecker]: L55-2 has no Hoare annotation [2022-02-20 16:33:31,633 WARN L170 areAnnotationChecker]: L63-2 has no Hoare annotation [2022-02-20 16:33:31,633 WARN L170 areAnnotationChecker]: L55-4 has no Hoare annotation [2022-02-20 16:33:31,633 WARN L170 areAnnotationChecker]: L55-2 has no Hoare annotation [2022-02-20 16:33:31,633 WARN L170 areAnnotationChecker]: L74-3 has no Hoare annotation [2022-02-20 16:33:31,633 WARN L170 areAnnotationChecker]: L74-3 has no Hoare annotation [2022-02-20 16:33:31,633 WARN L170 areAnnotationChecker]: L76 has no Hoare annotation [2022-02-20 16:33:31,633 WARN L170 areAnnotationChecker]: L74-3 has no Hoare annotation [2022-02-20 16:33:31,633 WARN L170 areAnnotationChecker]: L76 has no Hoare annotation [2022-02-20 16:33:31,633 WARN L170 areAnnotationChecker]: L76 has no Hoare annotation [2022-02-20 16:33:31,633 WARN L170 areAnnotationChecker]: L87-3 has no Hoare annotation [2022-02-20 16:33:31,633 WARN L170 areAnnotationChecker]: L87-3 has no Hoare annotation [2022-02-20 16:33:31,633 WARN L170 areAnnotationChecker]: L90 has no Hoare annotation [2022-02-20 16:33:31,633 WARN L170 areAnnotationChecker]: L76-2 has no Hoare annotation [2022-02-20 16:33:31,633 WARN L170 areAnnotationChecker]: L87-3 has no Hoare annotation [2022-02-20 16:33:31,633 WARN L170 areAnnotationChecker]: L87-3 has no Hoare annotation [2022-02-20 16:33:31,633 WARN L170 areAnnotationChecker]: L90 has no Hoare annotation [2022-02-20 16:33:31,633 WARN L170 areAnnotationChecker]: L90 has no Hoare annotation [2022-02-20 16:33:31,633 WARN L170 areAnnotationChecker]: L107 has no Hoare annotation [2022-02-20 16:33:31,633 WARN L170 areAnnotationChecker]: L107 has no Hoare annotation [2022-02-20 16:33:31,633 WARN L170 areAnnotationChecker]: L105 has no Hoare annotation [2022-02-20 16:33:31,633 WARN L170 areAnnotationChecker]: L92 has no Hoare annotation [2022-02-20 16:33:31,633 WARN L170 areAnnotationChecker]: L92 has no Hoare annotation [2022-02-20 16:33:31,633 WARN L170 areAnnotationChecker]: L90-2 has no Hoare annotation [2022-02-20 16:33:31,633 WARN L170 areAnnotationChecker]: L109 has no Hoare annotation [2022-02-20 16:33:31,636 WARN L170 areAnnotationChecker]: L109 has no Hoare annotation [2022-02-20 16:33:31,636 WARN L170 areAnnotationChecker]: L122 has no Hoare annotation [2022-02-20 16:33:31,636 WARN L170 areAnnotationChecker]: L122 has no Hoare annotation [2022-02-20 16:33:31,636 WARN L170 areAnnotationChecker]: L92-2 has no Hoare annotation [2022-02-20 16:33:31,636 WARN L170 areAnnotationChecker]: L112 has no Hoare annotation [2022-02-20 16:33:31,636 WARN L170 areAnnotationChecker]: L112 has no Hoare annotation [2022-02-20 16:33:31,636 WARN L170 areAnnotationChecker]: L122-2 has no Hoare annotation [2022-02-20 16:33:31,637 WARN L170 areAnnotationChecker]: L95 has no Hoare annotation [2022-02-20 16:33:31,637 WARN L170 areAnnotationChecker]: L95 has no Hoare annotation [2022-02-20 16:33:31,637 WARN L170 areAnnotationChecker]: L113 has no Hoare annotation [2022-02-20 16:33:31,637 WARN L170 areAnnotationChecker]: L113 has no Hoare annotation [2022-02-20 16:33:31,637 WARN L170 areAnnotationChecker]: L125-1 has no Hoare annotation [2022-02-20 16:33:31,637 WARN L170 areAnnotationChecker]: L125-3 has no Hoare annotation [2022-02-20 16:33:31,637 WARN L170 areAnnotationChecker]: L95-2 has no Hoare annotation [2022-02-20 16:33:31,637 WARN L170 areAnnotationChecker]: L113-2 has no Hoare annotation [2022-02-20 16:33:31,637 WARN L170 areAnnotationChecker]: L125-1 has no Hoare annotation [2022-02-20 16:33:31,637 WARN L170 areAnnotationChecker]: L125-1 has no Hoare annotation [2022-02-20 16:33:31,637 WARN L170 areAnnotationChecker]: L125-3 has no Hoare annotation [2022-02-20 16:33:31,637 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:33:31,639 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:33:31,643 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:33:31,644 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:33:31,644 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:33:31,644 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:33:31,644 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:33:31,644 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:33:31,644 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:33:31,645 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:33:31,645 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:33:31,645 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:33:31,645 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:33:31,648 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:33:31,648 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:33:31,649 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:33:31,649 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:33:31,650 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:33:31,650 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:33:31,650 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:33:31,650 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:33:31,651 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:33:31,651 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:33:31,651 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:33:31,651 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:33:31,651 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:33:31,651 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:33:31,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:33:31 BoogieIcfgContainer [2022-02-20 16:33:31,653 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:33:31,653 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:33:31,654 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:33:31,654 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:33:31,655 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:13" (3/4) ... [2022-02-20 16:33:31,657 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 16:33:31,667 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2022-02-20 16:33:31,668 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2022-02-20 16:33:31,668 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 16:33:31,668 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 16:33:31,686 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven && \result == ~fp.add~DOUBLE(~roundNearestTiesToEven, ~fp.mul~DOUBLE(~roundNearestTiesToEven, ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()), ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())), ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()))) && ~fp.div~DOUBLE(unknown-currentRoundingMode-unknown, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == x [2022-02-20 16:33:31,687 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((1bv32 == \result && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && \result == ~fp.add~DOUBLE(~roundNearestTiesToEven, ~fp.mul~DOUBLE(~roundNearestTiesToEven, ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()), ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())), ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()))) && ~fp.div~DOUBLE(unknown-currentRoundingMode-unknown, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == x [2022-02-20 16:33:31,710 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 16:33:31,711 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:33:31,711 INFO L158 Benchmark]: Toolchain (without parser) took 22202.40ms. Allocated memory was 56.6MB in the beginning and 71.3MB in the end (delta: 14.7MB). Free memory was 34.4MB in the beginning and 29.3MB in the end (delta: 5.0MB). Peak memory consumption was 21.3MB. Max. memory is 16.1GB. [2022-02-20 16:33:31,711 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 56.6MB. Free memory was 36.8MB in the beginning and 36.8MB in the end (delta: 44.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:33:31,712 INFO L158 Benchmark]: CACSL2BoogieTranslator took 324.63ms. Allocated memory is still 56.6MB. Free memory was 34.1MB in the beginning and 35.2MB in the end (delta: -1.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 16:33:31,712 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.85ms. Allocated memory is still 56.6MB. Free memory was 35.2MB in the beginning and 32.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:33:31,712 INFO L158 Benchmark]: Boogie Preprocessor took 54.81ms. Allocated memory is still 56.6MB. Free memory was 32.6MB in the beginning and 30.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:33:31,712 INFO L158 Benchmark]: RCFGBuilder took 3177.66ms. Allocated memory was 56.6MB in the beginning and 71.3MB in the end (delta: 14.7MB). Free memory was 30.5MB in the beginning and 41.2MB in the end (delta: -10.7MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. [2022-02-20 16:33:31,713 INFO L158 Benchmark]: TraceAbstraction took 18522.62ms. Allocated memory is still 71.3MB. Free memory was 40.7MB in the beginning and 33.1MB in the end (delta: 7.6MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. [2022-02-20 16:33:31,713 INFO L158 Benchmark]: Witness Printer took 57.20ms. Allocated memory is still 71.3MB. Free memory was 33.1MB in the beginning and 29.3MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 16:33:31,715 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.15ms. Allocated memory is still 56.6MB. Free memory was 36.8MB in the beginning and 36.8MB in the end (delta: 44.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 324.63ms. Allocated memory is still 56.6MB. Free memory was 34.1MB in the beginning and 35.2MB in the end (delta: -1.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.85ms. Allocated memory is still 56.6MB. Free memory was 35.2MB in the beginning and 32.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.81ms. Allocated memory is still 56.6MB. Free memory was 32.6MB in the beginning and 30.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 3177.66ms. Allocated memory was 56.6MB in the beginning and 71.3MB in the end (delta: 14.7MB). Free memory was 30.5MB in the beginning and 41.2MB in the end (delta: -10.7MB). Peak memory consumption was 8.3MB. Max. memory is 16.1GB. * TraceAbstraction took 18522.62ms. Allocated memory is still 71.3MB. Free memory was 40.7MB in the beginning and 33.1MB in the end (delta: 7.6MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. * Witness Printer took 57.20ms. Allocated memory is still 71.3MB. Free memory was 33.1MB in the beginning and 29.3MB 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 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: 147]: 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.4s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 15.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 69 SdHoareTripleChecker+Valid, 5.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 69 mSDsluCounter, 297 SdHoareTripleChecker+Invalid, 5.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2 IncrementalHoareTripleChecker+Unchecked, 170 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 35 IncrementalHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 127 mSDtfsCounter, 35 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 32 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.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 13 NumberOfFragments, 75 HoareAnnotationTreeSize, 9 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 7 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 42 NumberOfCodeBlocks, 42 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 39 ConstructedInterpolants, 3 QuantifiedInterpolants, 129 SizeOfPredicates, 15 NumberOfNonLiveVariables, 159 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: 30]: Loop Invariant [2022-02-20 16:33:31,734 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:33:31,735 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven && ~fp.div~DOUBLE(unknown-currentRoundingMode-unknown, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == x - InvariantResult [Line: 24]: Loop Invariant [2022-02-20 16:33:31,735 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:33:31,735 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:33:31,735 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:33:31,735 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:33:31,735 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:33:31,735 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:33:31,736 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:33:31,736 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:33:31,736 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:33:31,736 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:33:31,736 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:33:31,736 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven && \result == ~fp.add~DOUBLE(~roundNearestTiesToEven, ~fp.mul~DOUBLE(~roundNearestTiesToEven, ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()), ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())), ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()))) && ~fp.div~DOUBLE(unknown-currentRoundingMode-unknown, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == x - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 87]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 20]: Loop Invariant [2022-02-20 16:33:31,737 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:33:31,737 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:33:31,737 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:33:31,737 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:33:31,737 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:33:31,753 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:33:31,753 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:33:31,753 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:33:31,754 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:33:31,754 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:33:31,754 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:33:31,754 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((1bv32 == \result && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && \result == ~fp.add~DOUBLE(~roundNearestTiesToEven, ~fp.mul~DOUBLE(~roundNearestTiesToEven, ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()), ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())), ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()))) && ~fp.div~DOUBLE(unknown-currentRoundingMode-unknown, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == x - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: 0 RESULT: Ultimate proved your program to be correct! [2022-02-20 16:33:31,889 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 Writing output log to file Ultimate.log Result: TRUE