./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_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/float_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 2d431936a29cc36080ed8e682b8710bc84852895ee04dfb24fab46f24aa96450 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:42:23,048 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:42:23,051 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:42:23,072 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:42:23,073 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:42:23,074 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:42:23,076 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:42:23,081 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:42:23,083 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:42:23,086 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:42:23,087 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:42:23,088 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:42:23,089 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:42:23,091 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:42:23,093 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:42:23,095 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:42:23,096 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:42:23,096 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:42:23,099 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:42:23,104 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:42:23,105 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:42:23,106 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:42:23,107 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:42:23,108 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:42:23,113 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:42:23,114 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:42:23,114 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:42:23,116 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:42:23,116 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:42:23,117 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:42:23,117 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:42:23,118 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:42:23,119 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:42:23,120 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:42:23,121 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:42:23,121 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:42:23,122 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:42:23,122 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:42:23,122 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:42:23,123 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:42:23,124 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:42:23,125 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:42:23,155 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:42:23,155 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:42:23,156 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:42:23,156 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:42:23,157 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:42:23,157 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:42:23,157 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:42:23,158 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:42:23,158 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:42:23,158 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:42:23,159 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:42:23,159 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:42:23,159 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:42:23,159 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:42:23,159 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:42:23,160 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:42:23,160 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:42:23,160 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:42:23,160 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:42:23,160 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:42:23,161 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:42:23,161 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:42:23,161 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:42:23,161 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:42:23,161 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:42:23,162 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:42:23,162 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:42:23,163 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:42:23,163 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:42:23,163 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:42:23,163 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:42:23,163 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:42:23,164 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:42:23,164 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 -> 2d431936a29cc36080ed8e682b8710bc84852895ee04dfb24fab46f24aa96450 [2022-02-20 16:42:23,377 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:42:23,399 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:42:23,401 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:42:23,401 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:42:23,402 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:42:23,403 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0720.c [2022-02-20 16:42:23,447 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b07cf26d/d9da597baaca4a88a301a54cadaf7871/FLAGb5922c497 [2022-02-20 16:42:23,810 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:42:23,813 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0720.c [2022-02-20 16:42:23,820 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b07cf26d/d9da597baaca4a88a301a54cadaf7871/FLAGb5922c497 [2022-02-20 16:42:23,838 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b07cf26d/d9da597baaca4a88a301a54cadaf7871 [2022-02-20 16:42:23,840 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:42:23,841 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:42:23,844 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:42:23,844 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:42:23,847 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:42:23,851 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:42:23" (1/1) ... [2022-02-20 16:42:23,852 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@617d27bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:23, skipping insertion in model container [2022-02-20 16:42:23,852 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:42:23" (1/1) ... [2022-02-20 16:42:23,856 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:42:23,871 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:42:24,066 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/float_req_bl_0720.c[1929,1942] [2022-02-20 16:42:24,068 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:42:24,078 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:42:24,098 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/float_req_bl_0720.c[1929,1942] [2022-02-20 16:42:24,103 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:42:24,116 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:42:24,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:24 WrapperNode [2022-02-20 16:42:24,116 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:42:24,117 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:42:24,117 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:42:24,117 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:42:24,121 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:42:24" (1/1) ... [2022-02-20 16:42:24,134 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:42:24" (1/1) ... [2022-02-20 16:42:24,158 INFO L137 Inliner]: procedures = 17, calls = 17, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 137 [2022-02-20 16:42:24,158 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:42:24,159 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:42:24,159 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:42:24,159 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:42:24,164 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:24" (1/1) ... [2022-02-20 16:42:24,168 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:24" (1/1) ... [2022-02-20 16:42:24,170 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:24" (1/1) ... [2022-02-20 16:42:24,170 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:24" (1/1) ... [2022-02-20 16:42:24,181 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:24" (1/1) ... [2022-02-20 16:42:24,193 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:24" (1/1) ... [2022-02-20 16:42:24,196 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:24" (1/1) ... [2022-02-20 16:42:24,203 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:42:24,204 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:42:24,204 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:42:24,204 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:42:24,205 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:24" (1/1) ... [2022-02-20 16:42:24,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:42:24,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:42:24,230 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:42:24,244 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:42:24,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:42:24,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:42:24,271 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:42:24,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-02-20 16:42:24,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:42:24,271 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-02-20 16:42:24,271 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:42:24,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:42:24,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:42:24,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:42:24,352 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:42:24,353 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:42:24,663 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:42:24,667 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:42:24,668 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-02-20 16:42:24,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:42:24 BoogieIcfgContainer [2022-02-20 16:42:24,669 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:42:24,670 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:42:24,670 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:42:24,672 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:42:24,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:42:23" (1/3) ... [2022-02-20 16:42:24,673 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a5dbb64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:42:24, skipping insertion in model container [2022-02-20 16:42:24,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:24" (2/3) ... [2022-02-20 16:42:24,674 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a5dbb64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:42:24, skipping insertion in model container [2022-02-20 16:42:24,674 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:42:24" (3/3) ... [2022-02-20 16:42:24,675 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_0720.c [2022-02-20 16:42:24,678 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:42:24,678 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:42:24,721 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:42:24,727 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:42:24,727 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:42:24,751 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 38 states have (on average 1.7105263157894737) internal successors, (65), 39 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:42:24,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 16:42:24,754 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:42:24,754 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:42:24,755 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:42:24,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:42:24,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1826743550, now seen corresponding path program 1 times [2022-02-20 16:42:24,765 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:42:24,766 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103810139] [2022-02-20 16:42:24,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:42:24,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:42:24,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:42:24,881 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#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(20, 2);call #Ultimate.allocInit(12, 3);~one_sqrt~0 := 1.0;~tiny_sqrt~0 := 1.0E-30; {43#true} is VALID [2022-02-20 16:42:24,882 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#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 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0);assume { :begin_inline___ieee754_sqrtf } true;__ieee754_sqrtf_#in~x#1 := main_~x~0#1;havoc __ieee754_sqrtf_#res#1;havoc __ieee754_sqrtf_#t~mem4#1, __ieee754_sqrtf_~#gf_u~0#1.base, __ieee754_sqrtf_~#gf_u~0#1.offset, __ieee754_sqrtf_#t~post6#1, __ieee754_sqrtf_#t~mem8#1, __ieee754_sqrtf_~#sf_u~0#1.base, __ieee754_sqrtf_~#sf_u~0#1.offset, __ieee754_sqrtf_~x#1, __ieee754_sqrtf_~z~0#1, __ieee754_sqrtf_~r~0#1, __ieee754_sqrtf_~hx~0#1, __ieee754_sqrtf_~ix~0#1, __ieee754_sqrtf_~s~0#1, __ieee754_sqrtf_~q~0#1, __ieee754_sqrtf_~m~0#1, __ieee754_sqrtf_~t~0#1, __ieee754_sqrtf_~i~0#1, __ieee754_sqrtf_#t~nondet5#1, __ieee754_sqrtf_#t~nondet7#1;__ieee754_sqrtf_~x#1 := __ieee754_sqrtf_#in~x#1;havoc __ieee754_sqrtf_~z~0#1;havoc __ieee754_sqrtf_~r~0#1;havoc __ieee754_sqrtf_~hx~0#1;havoc __ieee754_sqrtf_~ix~0#1;havoc __ieee754_sqrtf_~s~0#1;havoc __ieee754_sqrtf_~q~0#1;havoc __ieee754_sqrtf_~m~0#1;havoc __ieee754_sqrtf_~t~0#1;havoc __ieee754_sqrtf_~i~0#1; {43#true} is VALID [2022-02-20 16:42:24,883 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#true} assume !true; {44#false} is VALID [2022-02-20 16:42:24,883 INFO L290 TraceCheckUtils]: 3: Hoare triple {44#false} assume 0 == __ieee754_sqrtf_~ix~0#1;__ieee754_sqrtf_~hx~0#1 := 0; {44#false} is VALID [2022-02-20 16:42:24,883 INFO L290 TraceCheckUtils]: 4: Hoare triple {44#false} assume !(__ieee754_sqrtf_~hx~0#1 % 4294967296 < 2139095040);__ieee754_sqrtf_#res#1 := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(__ieee754_sqrtf_~x#1, __ieee754_sqrtf_~x#1), __ieee754_sqrtf_~x#1); {44#false} is VALID [2022-02-20 16:42:24,884 INFO L290 TraceCheckUtils]: 5: Hoare triple {44#false} main_#t~ret9#1 := __ieee754_sqrtf_#res#1;assume { :end_inline___ieee754_sqrtf } true;main_~res~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;assume { :begin_inline_isnan_float } true;isnan_float_#in~x#1 := main_~res~0#1;havoc isnan_float_#res#1;havoc isnan_float_~x#1;isnan_float_~x#1 := isnan_float_#in~x#1;isnan_float_#res#1 := (if ~someBinaryFLOATComparisonOperation(isnan_float_~x#1, isnan_float_~x#1) then 1 else 0); {44#false} is VALID [2022-02-20 16:42:24,884 INFO L290 TraceCheckUtils]: 6: Hoare triple {44#false} main_#t~ret10#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true;assume -2147483648 <= main_#t~ret10#1 && main_#t~ret10#1 <= 2147483647; {44#false} is VALID [2022-02-20 16:42:24,885 INFO L290 TraceCheckUtils]: 7: Hoare triple {44#false} assume 0 == main_#t~ret10#1;havoc main_#t~ret10#1; {44#false} is VALID [2022-02-20 16:42:24,885 INFO L290 TraceCheckUtils]: 8: Hoare triple {44#false} assume !false; {44#false} is VALID [2022-02-20 16:42:24,886 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:42:24,886 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:42:24,886 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103810139] [2022-02-20 16:42:24,887 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103810139] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:42:24,888 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:42:24,888 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:42:24,891 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594725370] [2022-02-20 16:42:24,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:42:24,895 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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:42:24,895 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:42:24,898 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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:42:24,918 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:42:24,919 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:42:24,919 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:42:24,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:42:24,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:42:24,944 INFO L87 Difference]: Start difference. First operand has 40 states, 38 states have (on average 1.7105263157894737) internal successors, (65), 39 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 has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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:42:25,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:25,016 INFO L93 Difference]: Finished difference Result 78 states and 128 transitions. [2022-02-20 16:42:25,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:42:25,016 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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:42:25,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:42:25,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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:42:25,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 128 transitions. [2022-02-20 16:42:25,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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:42:25,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 128 transitions. [2022-02-20 16:42:25,027 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 128 transitions. [2022-02-20 16:42:25,134 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:42:25,140 INFO L225 Difference]: With dead ends: 78 [2022-02-20 16:42:25,141 INFO L226 Difference]: Without dead ends: 37 [2022-02-20 16:42:25,144 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:42:25,147 INFO L933 BasicCegarLoop]: 53 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, 53 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:42:25,148 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:42:25,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-02-20 16:42:25,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-02-20 16:42:25,166 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:42:25,167 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 36 states have internal predecessors, (50), 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:42:25,168 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 36 states have internal predecessors, (50), 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:42:25,168 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 36 states have internal predecessors, (50), 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:42:25,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:25,171 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2022-02-20 16:42:25,171 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2022-02-20 16:42:25,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:25,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:25,172 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 36 states have internal predecessors, (50), 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 37 states. [2022-02-20 16:42:25,172 INFO L87 Difference]: Start difference. First operand has 37 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 36 states have internal predecessors, (50), 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 37 states. [2022-02-20 16:42:25,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:25,174 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2022-02-20 16:42:25,174 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2022-02-20 16:42:25,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:25,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:25,175 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:42:25,175 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:42:25,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 36 states have internal predecessors, (50), 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:42:25,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2022-02-20 16:42:25,178 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 50 transitions. Word has length 9 [2022-02-20 16:42:25,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:42:25,179 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 50 transitions. [2022-02-20 16:42:25,179 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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:42:25,179 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2022-02-20 16:42:25,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 16:42:25,179 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:42:25,180 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:42:25,180 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:42:25,180 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:42:25,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:42:25,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1561607263, now seen corresponding path program 1 times [2022-02-20 16:42:25,181 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:42:25,181 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252979466] [2022-02-20 16:42:25,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:42:25,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:42:25,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:42:25,254 INFO L290 TraceCheckUtils]: 0: Hoare triple {256#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(20, 2);call #Ultimate.allocInit(12, 3);~one_sqrt~0 := 1.0;~tiny_sqrt~0 := 1.0E-30; {256#true} is VALID [2022-02-20 16:42:25,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {256#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 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0);assume { :begin_inline___ieee754_sqrtf } true;__ieee754_sqrtf_#in~x#1 := main_~x~0#1;havoc __ieee754_sqrtf_#res#1;havoc __ieee754_sqrtf_#t~mem4#1, __ieee754_sqrtf_~#gf_u~0#1.base, __ieee754_sqrtf_~#gf_u~0#1.offset, __ieee754_sqrtf_#t~post6#1, __ieee754_sqrtf_#t~mem8#1, __ieee754_sqrtf_~#sf_u~0#1.base, __ieee754_sqrtf_~#sf_u~0#1.offset, __ieee754_sqrtf_~x#1, __ieee754_sqrtf_~z~0#1, __ieee754_sqrtf_~r~0#1, __ieee754_sqrtf_~hx~0#1, __ieee754_sqrtf_~ix~0#1, __ieee754_sqrtf_~s~0#1, __ieee754_sqrtf_~q~0#1, __ieee754_sqrtf_~m~0#1, __ieee754_sqrtf_~t~0#1, __ieee754_sqrtf_~i~0#1, __ieee754_sqrtf_#t~nondet5#1, __ieee754_sqrtf_#t~nondet7#1;__ieee754_sqrtf_~x#1 := __ieee754_sqrtf_#in~x#1;havoc __ieee754_sqrtf_~z~0#1;havoc __ieee754_sqrtf_~r~0#1;havoc __ieee754_sqrtf_~hx~0#1;havoc __ieee754_sqrtf_~ix~0#1;havoc __ieee754_sqrtf_~s~0#1;havoc __ieee754_sqrtf_~q~0#1;havoc __ieee754_sqrtf_~m~0#1;havoc __ieee754_sqrtf_~t~0#1;havoc __ieee754_sqrtf_~i~0#1; {256#true} is VALID [2022-02-20 16:42:25,254 INFO L290 TraceCheckUtils]: 2: Hoare triple {256#true} call __ieee754_sqrtf_~#gf_u~0#1.base, __ieee754_sqrtf_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4);call write~real(__ieee754_sqrtf_~x#1, __ieee754_sqrtf_~#gf_u~0#1.base, __ieee754_sqrtf_~#gf_u~0#1.offset, 4);call __ieee754_sqrtf_#t~mem4#1 := read~int(__ieee754_sqrtf_~#gf_u~0#1.base, __ieee754_sqrtf_~#gf_u~0#1.offset, 4);__ieee754_sqrtf_~ix~0#1 := (if __ieee754_sqrtf_#t~mem4#1 % 4294967296 % 4294967296 <= 2147483647 then __ieee754_sqrtf_#t~mem4#1 % 4294967296 % 4294967296 else __ieee754_sqrtf_#t~mem4#1 % 4294967296 % 4294967296 - 4294967296);havoc __ieee754_sqrtf_#t~mem4#1;call ULTIMATE.dealloc(__ieee754_sqrtf_~#gf_u~0#1.base, __ieee754_sqrtf_~#gf_u~0#1.offset);havoc __ieee754_sqrtf_~#gf_u~0#1.base, __ieee754_sqrtf_~#gf_u~0#1.offset; {256#true} is VALID [2022-02-20 16:42:25,254 INFO L290 TraceCheckUtils]: 3: Hoare triple {256#true} goto; {256#true} is VALID [2022-02-20 16:42:25,256 INFO L290 TraceCheckUtils]: 4: Hoare triple {256#true} assume 0 == __ieee754_sqrtf_~ix~0#1;__ieee754_sqrtf_~hx~0#1 := 0; {258#(= |ULTIMATE.start___ieee754_sqrtf_~hx~0#1| 0)} is VALID [2022-02-20 16:42:25,256 INFO L290 TraceCheckUtils]: 5: Hoare triple {258#(= |ULTIMATE.start___ieee754_sqrtf_~hx~0#1| 0)} assume !(__ieee754_sqrtf_~hx~0#1 % 4294967296 < 2139095040);__ieee754_sqrtf_#res#1 := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(__ieee754_sqrtf_~x#1, __ieee754_sqrtf_~x#1), __ieee754_sqrtf_~x#1); {257#false} is VALID [2022-02-20 16:42:25,257 INFO L290 TraceCheckUtils]: 6: Hoare triple {257#false} main_#t~ret9#1 := __ieee754_sqrtf_#res#1;assume { :end_inline___ieee754_sqrtf } true;main_~res~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;assume { :begin_inline_isnan_float } true;isnan_float_#in~x#1 := main_~res~0#1;havoc isnan_float_#res#1;havoc isnan_float_~x#1;isnan_float_~x#1 := isnan_float_#in~x#1;isnan_float_#res#1 := (if ~someBinaryFLOATComparisonOperation(isnan_float_~x#1, isnan_float_~x#1) then 1 else 0); {257#false} is VALID [2022-02-20 16:42:25,257 INFO L290 TraceCheckUtils]: 7: Hoare triple {257#false} main_#t~ret10#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true;assume -2147483648 <= main_#t~ret10#1 && main_#t~ret10#1 <= 2147483647; {257#false} is VALID [2022-02-20 16:42:25,257 INFO L290 TraceCheckUtils]: 8: Hoare triple {257#false} assume 0 == main_#t~ret10#1;havoc main_#t~ret10#1; {257#false} is VALID [2022-02-20 16:42:25,257 INFO L290 TraceCheckUtils]: 9: Hoare triple {257#false} assume !false; {257#false} is VALID [2022-02-20 16:42:25,257 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:42:25,258 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:42:25,258 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252979466] [2022-02-20 16:42:25,259 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252979466] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:42:25,259 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:42:25,259 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:42:25,259 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809489019] [2022-02-20 16:42:25,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:42:25,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2022-02-20 16:42:25,262 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:42:25,262 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:42:25,271 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:42:25,271 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:42:25,271 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:42:25,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:42:25,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:42:25,272 INFO L87 Difference]: Start difference. First operand 37 states and 50 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:42:25,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:25,341 INFO L93 Difference]: Finished difference Result 71 states and 94 transitions. [2022-02-20 16:42:25,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:42:25,341 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2022-02-20 16:42:25,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:42:25,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:42:25,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2022-02-20 16:42:25,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:42:25,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2022-02-20 16:42:25,348 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 94 transitions. [2022-02-20 16:42:25,414 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:42:25,415 INFO L225 Difference]: With dead ends: 71 [2022-02-20 16:42:25,415 INFO L226 Difference]: Without dead ends: 44 [2022-02-20 16:42:25,415 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:42:25,416 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 6 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:42:25,417 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 88 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:42:25,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-02-20 16:42:25,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 39. [2022-02-20 16:42:25,419 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:42:25,420 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 39 states, 38 states have (on average 1.368421052631579) internal successors, (52), 38 states have internal predecessors, (52), 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:42:25,420 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 39 states, 38 states have (on average 1.368421052631579) internal successors, (52), 38 states have internal predecessors, (52), 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:42:25,421 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 39 states, 38 states have (on average 1.368421052631579) internal successors, (52), 38 states have internal predecessors, (52), 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:42:25,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:25,422 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2022-02-20 16:42:25,422 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2022-02-20 16:42:25,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:25,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:25,423 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 38 states have (on average 1.368421052631579) internal successors, (52), 38 states have internal predecessors, (52), 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 44 states. [2022-02-20 16:42:25,423 INFO L87 Difference]: Start difference. First operand has 39 states, 38 states have (on average 1.368421052631579) internal successors, (52), 38 states have internal predecessors, (52), 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 44 states. [2022-02-20 16:42:25,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:25,425 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2022-02-20 16:42:25,425 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2022-02-20 16:42:25,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:25,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:25,426 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:42:25,426 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:42:25,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.368421052631579) internal successors, (52), 38 states have internal predecessors, (52), 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:42:25,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 52 transitions. [2022-02-20 16:42:25,429 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 52 transitions. Word has length 10 [2022-02-20 16:42:25,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:42:25,430 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 52 transitions. [2022-02-20 16:42:25,431 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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:42:25,431 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 52 transitions. [2022-02-20 16:42:25,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:42:25,432 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:42:25,432 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:42:25,432 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:42:25,433 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:42:25,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:42:25,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1121717072, now seen corresponding path program 1 times [2022-02-20 16:42:25,434 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:42:25,434 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670595688] [2022-02-20 16:42:25,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:42:25,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:42:25,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:42:25,458 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:42:25,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:42:25,496 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:42:25,503 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:42:25,504 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:42:25,506 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 16:42:25,508 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 16:42:25,510 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:42:25,549 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:42:25,549 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:42:25,549 WARN L170 areAnnotationChecker]: L24-2 has no Hoare annotation [2022-02-20 16:42:25,549 WARN L170 areAnnotationChecker]: L24-2 has no Hoare annotation [2022-02-20 16:42:25,549 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-02-20 16:42:25,549 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-02-20 16:42:25,549 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2022-02-20 16:42:25,549 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2022-02-20 16:42:25,549 WARN L170 areAnnotationChecker]: L29-7 has no Hoare annotation [2022-02-20 16:42:25,550 WARN L170 areAnnotationChecker]: L29-7 has no Hoare annotation [2022-02-20 16:42:25,550 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-02-20 16:42:25,550 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-02-20 16:42:25,550 WARN L170 areAnnotationChecker]: L83 has no Hoare annotation [2022-02-20 16:42:25,550 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-02-20 16:42:25,550 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-02-20 16:42:25,550 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2022-02-20 16:42:25,550 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2022-02-20 16:42:25,550 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-02-20 16:42:25,551 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 16:42:25,551 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 16:42:25,551 WARN L170 areAnnotationChecker]: L29-5 has no Hoare annotation [2022-02-20 16:42:25,551 WARN L170 areAnnotationChecker]: L29-5 has no Hoare annotation [2022-02-20 16:42:25,551 WARN L170 areAnnotationChecker]: L97 has no Hoare annotation [2022-02-20 16:42:25,551 WARN L170 areAnnotationChecker]: L97 has no Hoare annotation [2022-02-20 16:42:25,551 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 16:42:25,551 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 16:42:25,551 WARN L170 areAnnotationChecker]: L98 has no Hoare annotation [2022-02-20 16:42:25,552 WARN L170 areAnnotationChecker]: L98 has no Hoare annotation [2022-02-20 16:42:25,552 WARN L170 areAnnotationChecker]: L102 has no Hoare annotation [2022-02-20 16:42:25,552 WARN L170 areAnnotationChecker]: L41-3 has no Hoare annotation [2022-02-20 16:42:25,552 WARN L170 areAnnotationChecker]: L41-3 has no Hoare annotation [2022-02-20 16:42:25,552 WARN L170 areAnnotationChecker]: L41-3 has no Hoare annotation [2022-02-20 16:42:25,552 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2022-02-20 16:42:25,552 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:42:25,554 WARN L170 areAnnotationChecker]: L41-4 has no Hoare annotation [2022-02-20 16:42:25,554 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2022-02-20 16:42:25,554 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-02-20 16:42:25,554 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-02-20 16:42:25,554 WARN L170 areAnnotationChecker]: L46-8 has no Hoare annotation [2022-02-20 16:42:25,554 WARN L170 areAnnotationChecker]: L46-8 has no Hoare annotation [2022-02-20 16:42:25,555 WARN L170 areAnnotationChecker]: L46-2 has no Hoare annotation [2022-02-20 16:42:25,555 WARN L170 areAnnotationChecker]: L46-2 has no Hoare annotation [2022-02-20 16:42:25,555 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2022-02-20 16:42:25,555 WARN L170 areAnnotationChecker]: L46-4 has no Hoare annotation [2022-02-20 16:42:25,555 WARN L170 areAnnotationChecker]: L46-4 has no Hoare annotation [2022-02-20 16:42:25,555 WARN L170 areAnnotationChecker]: L55-2 has no Hoare annotation [2022-02-20 16:42:25,555 WARN L170 areAnnotationChecker]: L55-2 has no Hoare annotation [2022-02-20 16:42:25,555 WARN L170 areAnnotationChecker]: L55-2 has no Hoare annotation [2022-02-20 16:42:25,555 WARN L170 areAnnotationChecker]: L46-6 has no Hoare annotation [2022-02-20 16:42:25,556 WARN L170 areAnnotationChecker]: L46-6 has no Hoare annotation [2022-02-20 16:42:25,556 WARN L170 areAnnotationChecker]: L55-3 has no Hoare annotation [2022-02-20 16:42:25,556 WARN L170 areAnnotationChecker]: L55-3 has no Hoare annotation [2022-02-20 16:42:25,556 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-02-20 16:42:25,557 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-02-20 16:42:25,557 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2022-02-20 16:42:25,557 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2022-02-20 16:42:25,557 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2022-02-20 16:42:25,557 WARN L170 areAnnotationChecker]: L57-2 has no Hoare annotation [2022-02-20 16:42:25,557 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2022-02-20 16:42:25,557 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2022-02-20 16:42:25,557 WARN L170 areAnnotationChecker]: L78-2 has no Hoare annotation [2022-02-20 16:42:25,558 WARN L170 areAnnotationChecker]: L78-2 has no Hoare annotation [2022-02-20 16:42:25,558 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2022-02-20 16:42:25,559 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2022-02-20 16:42:25,559 WARN L170 areAnnotationChecker]: L78-3 has no Hoare annotation [2022-02-20 16:42:25,560 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:42:25,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:42:25 BoogieIcfgContainer [2022-02-20 16:42:25,560 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:42:25,561 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:42:25,561 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:42:25,561 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:42:25,562 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:42:24" (3/4) ... [2022-02-20 16:42:25,563 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 16:42:25,564 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:42:25,564 INFO L158 Benchmark]: Toolchain (without parser) took 1723.08ms. Allocated memory was 109.1MB in the beginning and 134.2MB in the end (delta: 25.2MB). Free memory was 79.5MB in the beginning and 96.3MB in the end (delta: -16.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 16:42:25,565 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 109.1MB. Free memory is still 64.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:42:25,565 INFO L158 Benchmark]: CACSL2BoogieTranslator took 272.49ms. Allocated memory is still 109.1MB. Free memory was 79.5MB in the beginning and 81.7MB in the end (delta: -2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 16:42:25,565 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.16ms. Allocated memory is still 109.1MB. Free memory was 81.7MB in the beginning and 79.2MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 16:42:25,565 INFO L158 Benchmark]: Boogie Preprocessor took 44.70ms. Allocated memory is still 109.1MB. Free memory was 79.2MB in the beginning and 77.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:42:25,566 INFO L158 Benchmark]: RCFGBuilder took 465.06ms. Allocated memory is still 109.1MB. Free memory was 77.6MB in the beginning and 61.3MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-02-20 16:42:25,566 INFO L158 Benchmark]: TraceAbstraction took 890.27ms. Allocated memory was 109.1MB in the beginning and 134.2MB in the end (delta: 25.2MB). Free memory was 60.7MB in the beginning and 96.3MB in the end (delta: -35.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:42:25,566 INFO L158 Benchmark]: Witness Printer took 2.74ms. Allocated memory is still 134.2MB. Free memory is still 96.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:42:25,568 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.16ms. Allocated memory is still 109.1MB. Free memory is still 64.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 272.49ms. Allocated memory is still 109.1MB. Free memory was 79.5MB in the beginning and 81.7MB in the end (delta: -2.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.16ms. Allocated memory is still 109.1MB. Free memory was 81.7MB in the beginning and 79.2MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.70ms. Allocated memory is still 109.1MB. Free memory was 79.2MB in the beginning and 77.6MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 465.06ms. Allocated memory is still 109.1MB. Free memory was 77.6MB in the beginning and 61.3MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 890.27ms. Allocated memory was 109.1MB in the beginning and 134.2MB in the end (delta: 25.2MB). Free memory was 60.7MB in the beginning and 96.3MB in the end (delta: -35.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.74ms. Allocated memory is still 134.2MB. Free memory is still 96.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 98]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 15, overapproximation of someBinaryArithmeticFLOAToperation at line 93. Possible FailurePath: [L17] static const float one_sqrt = 1.0, tiny_sqrt = 1.0e-30; VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L93] float x = 0.0f / 0.0f; [L94] CALL, EXPR __ieee754_sqrtf(x) [L20] float z; [L21] __uint32_t r, hx; [L22] __int32_t ix, s, q, m, t, i; VAL [\old(x)=4294967297, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=4294967297] [L25] ieee_float_shape_type gf_u; [L26] gf_u.value = (x) [L27] EXPR gf_u.word [L27] (ix) = gf_u.word [L29] hx = ix & 0x7fffffff VAL [\old(x)=4294967297, hx=0, ix=0, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=4294967297] [L31] COND FALSE !(!((hx) < 0x7f800000L)) VAL [\old(x)=4294967297, hx=0, ix=0, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=4294967297] [L34] COND TRUE ((hx) == 0) [L35] return x; VAL [\old(x)=4294967297, \result=4294967297, hx=0, ix=0, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=4294967297] [L94] RET, EXPR __ieee754_sqrtf(x) [L94] float res = __ieee754_sqrtf(x); [L97] CALL, EXPR isnan_float(res) [L15] return x != x; VAL [\old(x)=4294967297, \result=0, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=4294967297] [L97] RET, EXPR isnan_float(res) [L97] COND TRUE !isnan_float(res) [L98] reach_error() VAL [one_sqrt=1, res=4294967297, tiny_sqrt=1/1000000000000000000000000000000, x=4294967297] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.8s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6 mSDsluCounter, 141 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 40 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11 IncrementalHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 101 mSDtfsCounter, 11 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=0, InterpolantAutomatonStates: 5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 30 NumberOfCodeBlocks, 30 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 17 ConstructedInterpolants, 0 QuantifiedInterpolants, 19 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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:42:25,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/float_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 2d431936a29cc36080ed8e682b8710bc84852895ee04dfb24fab46f24aa96450 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:42:27,342 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:42:27,343 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:42:27,375 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:42:27,375 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:42:27,378 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:42:27,379 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:42:27,383 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:42:27,384 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:42:27,388 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:42:27,389 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:42:27,390 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:42:27,390 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:42:27,392 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:42:27,393 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:42:27,397 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:42:27,398 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:42:27,398 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:42:27,400 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:42:27,404 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:42:27,405 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:42:27,406 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:42:27,407 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:42:27,408 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:42:27,413 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:42:27,413 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:42:27,414 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:42:27,415 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:42:27,415 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:42:27,416 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:42:27,416 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:42:27,416 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:42:27,418 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:42:27,418 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:42:27,419 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:42:27,419 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:42:27,420 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:42:27,420 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:42:27,420 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:42:27,421 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:42:27,422 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:42:27,422 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:42:27,455 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:42:27,455 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:42:27,456 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:42:27,456 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:42:27,457 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:42:27,457 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:42:27,458 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:42:27,458 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:42:27,459 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:42:27,459 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:42:27,459 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:42:27,460 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:42:27,460 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:42:27,460 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:42:27,460 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:42:27,460 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:42:27,460 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:42:27,461 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:42:27,461 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:42:27,461 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:42:27,461 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:42:27,461 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:42:27,461 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:42:27,462 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:42:27,462 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:42:27,462 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:42:27,462 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:42:27,462 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:42:27,462 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:42:27,463 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:42:27,463 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:42:27,463 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:42:27,463 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:42:27,464 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:42:27,464 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:42:27,464 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:42:27,464 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 -> 2d431936a29cc36080ed8e682b8710bc84852895ee04dfb24fab46f24aa96450 [2022-02-20 16:42:27,733 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:42:27,753 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:42:27,755 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:42:27,755 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:42:27,756 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:42:27,757 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0720.c [2022-02-20 16:42:27,800 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c079b64c5/45638d9fac0b4662bd6038cd9c800c6c/FLAGcc86dad86 [2022-02-20 16:42:28,182 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:42:28,183 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0720.c [2022-02-20 16:42:28,188 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c079b64c5/45638d9fac0b4662bd6038cd9c800c6c/FLAGcc86dad86 [2022-02-20 16:42:28,591 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c079b64c5/45638d9fac0b4662bd6038cd9c800c6c [2022-02-20 16:42:28,594 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:42:28,595 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:42:28,598 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:42:28,598 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:42:28,601 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:42:28,602 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:42:28" (1/1) ... [2022-02-20 16:42:28,606 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f34918 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:28, skipping insertion in model container [2022-02-20 16:42:28,606 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:42:28" (1/1) ... [2022-02-20 16:42:28,611 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:42:28,624 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:42:28,785 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/float_req_bl_0720.c[1929,1942] [2022-02-20 16:42:28,790 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:42:28,831 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:42:28,848 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/float_req_bl_0720.c[1929,1942] [2022-02-20 16:42:28,850 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:42:28,864 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:42:28,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:28 WrapperNode [2022-02-20 16:42:28,865 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:42:28,866 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:42:28,867 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:42:28,867 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:42:28,872 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:42:28" (1/1) ... [2022-02-20 16:42:28,888 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:42:28" (1/1) ... [2022-02-20 16:42:28,918 INFO L137 Inliner]: procedures = 20, calls = 17, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 114 [2022-02-20 16:42:28,919 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:42:28,920 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:42:28,920 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:42:28,920 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:42:28,926 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:28" (1/1) ... [2022-02-20 16:42:28,927 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:28" (1/1) ... [2022-02-20 16:42:28,938 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:28" (1/1) ... [2022-02-20 16:42:28,938 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:28" (1/1) ... [2022-02-20 16:42:28,955 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:28" (1/1) ... [2022-02-20 16:42:28,964 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:28" (1/1) ... [2022-02-20 16:42:28,967 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:28" (1/1) ... [2022-02-20 16:42:28,973 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:42:28,976 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:42:28,976 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:42:28,977 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:42:28,977 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:28" (1/1) ... [2022-02-20 16:42:28,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:42:28,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:42:29,013 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:42:29,035 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:42:29,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:42:29,044 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:42:29,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:42:29,044 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2022-02-20 16:42:29,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 16:42:29,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:42:29,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:42:29,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2022-02-20 16:42:29,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 16:42:29,046 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:42:29,116 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:42:29,117 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:42:29,798 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:42:29,803 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:42:29,804 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-02-20 16:42:29,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:42:29 BoogieIcfgContainer [2022-02-20 16:42:29,805 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:42:29,806 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:42:29,806 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:42:29,808 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:42:29,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:42:28" (1/3) ... [2022-02-20 16:42:29,809 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d6f702a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:42:29, skipping insertion in model container [2022-02-20 16:42:29,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:28" (2/3) ... [2022-02-20 16:42:29,810 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d6f702a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:42:29, skipping insertion in model container [2022-02-20 16:42:29,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:42:29" (3/3) ... [2022-02-20 16:42:29,811 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_0720.c [2022-02-20 16:42:29,815 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:42:29,816 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:42:29,854 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:42:29,859 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:42:29,859 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:42:29,871 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 31 states have (on average 1.6129032258064515) internal successors, (50), 32 states have internal predecessors, (50), 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:42:29,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 16:42:29,874 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:42:29,875 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:42:29,875 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:42:29,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:42:29,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1903734416, now seen corresponding path program 1 times [2022-02-20 16:42:29,888 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:42:29,888 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [304123492] [2022-02-20 16:42:29,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:42:29,889 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:42:29,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:42:29,891 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:42:29,892 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:42:30,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:42:30,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:42:30,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:42:30,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:42:30,119 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#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(20bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~one_sqrt~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~tiny_sqrt~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E-30)); {36#true} is VALID [2022-02-20 16:42:30,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret7#1, main_#t~ret8#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());assume { :begin_inline___ieee754_sqrtf } true;__ieee754_sqrtf_#in~x#1 := main_~x~0#1;havoc __ieee754_sqrtf_#res#1;havoc __ieee754_sqrtf_#t~mem4#1, __ieee754_sqrtf_~#gf_u~0#1.base, __ieee754_sqrtf_~#gf_u~0#1.offset, __ieee754_sqrtf_#t~post5#1, __ieee754_sqrtf_#t~mem6#1, __ieee754_sqrtf_~#sf_u~0#1.base, __ieee754_sqrtf_~#sf_u~0#1.offset, __ieee754_sqrtf_~x#1, __ieee754_sqrtf_~z~0#1, __ieee754_sqrtf_~r~0#1, __ieee754_sqrtf_~hx~0#1, __ieee754_sqrtf_~ix~0#1, __ieee754_sqrtf_~s~0#1, __ieee754_sqrtf_~q~0#1, __ieee754_sqrtf_~m~0#1, __ieee754_sqrtf_~t~0#1, __ieee754_sqrtf_~i~0#1;__ieee754_sqrtf_~x#1 := __ieee754_sqrtf_#in~x#1;havoc __ieee754_sqrtf_~z~0#1;havoc __ieee754_sqrtf_~r~0#1;havoc __ieee754_sqrtf_~hx~0#1;havoc __ieee754_sqrtf_~ix~0#1;havoc __ieee754_sqrtf_~s~0#1;havoc __ieee754_sqrtf_~q~0#1;havoc __ieee754_sqrtf_~m~0#1;havoc __ieee754_sqrtf_~t~0#1;havoc __ieee754_sqrtf_~i~0#1; {36#true} is VALID [2022-02-20 16:42:30,121 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#true} assume !true; {37#false} is VALID [2022-02-20 16:42:30,121 INFO L290 TraceCheckUtils]: 3: Hoare triple {37#false} __ieee754_sqrtf_~hx~0#1 := ~bvand32(2147483647bv32, __ieee754_sqrtf_~ix~0#1); {37#false} is VALID [2022-02-20 16:42:30,121 INFO L290 TraceCheckUtils]: 4: Hoare triple {37#false} assume !~bvult32(__ieee754_sqrtf_~hx~0#1, 2139095040bv32);__ieee754_sqrtf_#res#1 := ~fp.add~FLOAT(currentRoundingMode, ~fp.mul~FLOAT(currentRoundingMode, __ieee754_sqrtf_~x#1, __ieee754_sqrtf_~x#1), __ieee754_sqrtf_~x#1); {37#false} is VALID [2022-02-20 16:42:30,122 INFO L290 TraceCheckUtils]: 5: Hoare triple {37#false} main_#t~ret7#1 := __ieee754_sqrtf_#res#1;assume { :end_inline___ieee754_sqrtf } true;main_~res~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1;assume { :begin_inline_isnan_float } true;isnan_float_#in~x#1 := main_~res~0#1;havoc isnan_float_#res#1;havoc isnan_float_~x#1;isnan_float_~x#1 := isnan_float_#in~x#1;isnan_float_#res#1 := (if !~fp.eq~FLOAT(isnan_float_~x#1, isnan_float_~x#1) then 1bv32 else 0bv32); {37#false} is VALID [2022-02-20 16:42:30,122 INFO L290 TraceCheckUtils]: 6: Hoare triple {37#false} main_#t~ret8#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true; {37#false} is VALID [2022-02-20 16:42:30,122 INFO L290 TraceCheckUtils]: 7: Hoare triple {37#false} assume 0bv32 == main_#t~ret8#1;havoc main_#t~ret8#1; {37#false} is VALID [2022-02-20 16:42:30,122 INFO L290 TraceCheckUtils]: 8: Hoare triple {37#false} assume !false; {37#false} is VALID [2022-02-20 16:42:30,123 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:42:30,124 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:42:30,124 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:42:30,124 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [304123492] [2022-02-20 16:42:30,125 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [304123492] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:42:30,125 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:42:30,125 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:42:30,127 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903770898] [2022-02-20 16:42:30,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:42:30,132 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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:42:30,133 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:42:30,135 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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:42:30,196 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:42:30,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:42:30,197 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:42:30,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:42:30,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:42:30,235 INFO L87 Difference]: Start difference. First operand has 33 states, 31 states have (on average 1.6129032258064515) internal successors, (50), 32 states have internal predecessors, (50), 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.5) internal successors, (9), 2 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:42:30,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:30,631 INFO L93 Difference]: Finished difference Result 64 states and 98 transitions. [2022-02-20 16:42:30,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:42:30,632 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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:42:30,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:42:30,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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:42:30,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 98 transitions. [2022-02-20 16:42:30,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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:42:30,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 98 transitions. [2022-02-20 16:42:30,640 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 98 transitions. [2022-02-20 16:42:31,145 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:42:31,151 INFO L225 Difference]: With dead ends: 64 [2022-02-20 16:42:31,153 INFO L226 Difference]: Without dead ends: 30 [2022-02-20 16:42:31,156 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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:42:31,162 INFO L933 BasicCegarLoop]: 43 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, 43 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:42:31,163 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:42:31,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-02-20 16:42:31,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-02-20 16:42:31,181 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:42:31,181 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 states have internal predecessors, (40), 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:42:31,182 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 states have internal predecessors, (40), 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:42:31,182 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 states have internal predecessors, (40), 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:42:31,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:31,184 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2022-02-20 16:42:31,184 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2022-02-20 16:42:31,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:31,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:31,185 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 states have internal predecessors, (40), 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 30 states. [2022-02-20 16:42:31,186 INFO L87 Difference]: Start difference. First operand has 30 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 states have internal predecessors, (40), 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 30 states. [2022-02-20 16:42:31,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:31,187 INFO L93 Difference]: Finished difference Result 30 states and 40 transitions. [2022-02-20 16:42:31,187 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2022-02-20 16:42:31,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:31,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:31,188 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:42:31,188 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:42:31,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.3793103448275863) internal successors, (40), 29 states have internal predecessors, (40), 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:42:31,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 40 transitions. [2022-02-20 16:42:31,190 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 40 transitions. Word has length 9 [2022-02-20 16:42:31,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:42:31,191 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 40 transitions. [2022-02-20 16:42:31,191 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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:42:31,191 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2022-02-20 16:42:31,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 16:42:31,191 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:42:31,192 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:42:31,203 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:42:31,396 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:42:31,397 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:42:31,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:42:31,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1484616397, now seen corresponding path program 1 times [2022-02-20 16:42:31,398 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:42:31,398 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1090037580] [2022-02-20 16:42:31,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:42:31,398 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:42:31,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:42:31,402 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:42:31,403 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:42:31,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:42:31,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 16:42:31,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:42:31,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:42:31,760 INFO L290 TraceCheckUtils]: 0: Hoare triple {238#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(20bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~one_sqrt~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~tiny_sqrt~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E-30)); {243#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:42:31,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {243#(= currentRoundingMode roundNearestTiesToEven)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret7#1, main_#t~ret8#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());assume { :begin_inline___ieee754_sqrtf } true;__ieee754_sqrtf_#in~x#1 := main_~x~0#1;havoc __ieee754_sqrtf_#res#1;havoc __ieee754_sqrtf_#t~mem4#1, __ieee754_sqrtf_~#gf_u~0#1.base, __ieee754_sqrtf_~#gf_u~0#1.offset, __ieee754_sqrtf_#t~post5#1, __ieee754_sqrtf_#t~mem6#1, __ieee754_sqrtf_~#sf_u~0#1.base, __ieee754_sqrtf_~#sf_u~0#1.offset, __ieee754_sqrtf_~x#1, __ieee754_sqrtf_~z~0#1, __ieee754_sqrtf_~r~0#1, __ieee754_sqrtf_~hx~0#1, __ieee754_sqrtf_~ix~0#1, __ieee754_sqrtf_~s~0#1, __ieee754_sqrtf_~q~0#1, __ieee754_sqrtf_~m~0#1, __ieee754_sqrtf_~t~0#1, __ieee754_sqrtf_~i~0#1;__ieee754_sqrtf_~x#1 := __ieee754_sqrtf_#in~x#1;havoc __ieee754_sqrtf_~z~0#1;havoc __ieee754_sqrtf_~r~0#1;havoc __ieee754_sqrtf_~hx~0#1;havoc __ieee754_sqrtf_~ix~0#1;havoc __ieee754_sqrtf_~s~0#1;havoc __ieee754_sqrtf_~q~0#1;havoc __ieee754_sqrtf_~m~0#1;havoc __ieee754_sqrtf_~t~0#1;havoc __ieee754_sqrtf_~i~0#1; {247#(and (= |ULTIMATE.start___ieee754_sqrtf_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:42:31,762 INFO L290 TraceCheckUtils]: 2: Hoare triple {247#(and (= |ULTIMATE.start___ieee754_sqrtf_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} call __ieee754_sqrtf_~#gf_u~0#1.base, __ieee754_sqrtf_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__ieee754_sqrtf_~x#1, __ieee754_sqrtf_~#gf_u~0#1.base, __ieee754_sqrtf_~#gf_u~0#1.offset, 4bv32);call __ieee754_sqrtf_#t~mem4#1 := read~intINTTYPE4(__ieee754_sqrtf_~#gf_u~0#1.base, __ieee754_sqrtf_~#gf_u~0#1.offset, 4bv32);__ieee754_sqrtf_~ix~0#1 := __ieee754_sqrtf_#t~mem4#1;havoc __ieee754_sqrtf_#t~mem4#1;call ULTIMATE.dealloc(__ieee754_sqrtf_~#gf_u~0#1.base, __ieee754_sqrtf_~#gf_u~0#1.offset);havoc __ieee754_sqrtf_~#gf_u~0#1.base, __ieee754_sqrtf_~#gf_u~0#1.offset; {247#(and (= |ULTIMATE.start___ieee754_sqrtf_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:42:31,763 INFO L290 TraceCheckUtils]: 3: Hoare triple {247#(and (= |ULTIMATE.start___ieee754_sqrtf_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} goto; {247#(and (= |ULTIMATE.start___ieee754_sqrtf_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:42:31,763 INFO L290 TraceCheckUtils]: 4: Hoare triple {247#(and (= |ULTIMATE.start___ieee754_sqrtf_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} __ieee754_sqrtf_~hx~0#1 := ~bvand32(2147483647bv32, __ieee754_sqrtf_~ix~0#1); {247#(and (= |ULTIMATE.start___ieee754_sqrtf_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:42:31,764 INFO L290 TraceCheckUtils]: 5: Hoare triple {247#(and (= |ULTIMATE.start___ieee754_sqrtf_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} assume !~bvult32(__ieee754_sqrtf_~hx~0#1, 2139095040bv32);__ieee754_sqrtf_#res#1 := ~fp.add~FLOAT(currentRoundingMode, ~fp.mul~FLOAT(currentRoundingMode, __ieee754_sqrtf_~x#1, __ieee754_sqrtf_~x#1), __ieee754_sqrtf_~x#1); {260#(= (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven (_ +zero 8 24) (_ +zero 8 24)) (fp.div roundNearestTiesToEven (_ +zero 8 24) (_ +zero 8 24))) (fp.div roundNearestTiesToEven (_ +zero 8 24) (_ +zero 8 24))) |ULTIMATE.start___ieee754_sqrtf_#res#1|)} is VALID [2022-02-20 16:42:31,764 INFO L290 TraceCheckUtils]: 6: Hoare triple {260#(= (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.div roundNearestTiesToEven (_ +zero 8 24) (_ +zero 8 24)) (fp.div roundNearestTiesToEven (_ +zero 8 24) (_ +zero 8 24))) (fp.div roundNearestTiesToEven (_ +zero 8 24) (_ +zero 8 24))) |ULTIMATE.start___ieee754_sqrtf_#res#1|)} main_#t~ret7#1 := __ieee754_sqrtf_#res#1;assume { :end_inline___ieee754_sqrtf } true;main_~res~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1;assume { :begin_inline_isnan_float } true;isnan_float_#in~x#1 := main_~res~0#1;havoc isnan_float_#res#1;havoc isnan_float_~x#1;isnan_float_~x#1 := isnan_float_#in~x#1;isnan_float_#res#1 := (if !~fp.eq~FLOAT(isnan_float_~x#1, isnan_float_~x#1) then 1bv32 else 0bv32); {264#(= (_ bv1 32) |ULTIMATE.start_isnan_float_#res#1|)} is VALID [2022-02-20 16:42:31,765 INFO L290 TraceCheckUtils]: 7: Hoare triple {264#(= (_ bv1 32) |ULTIMATE.start_isnan_float_#res#1|)} main_#t~ret8#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true; {268#(= (_ bv1 32) |ULTIMATE.start_main_#t~ret8#1|)} is VALID [2022-02-20 16:42:31,765 INFO L290 TraceCheckUtils]: 8: Hoare triple {268#(= (_ bv1 32) |ULTIMATE.start_main_#t~ret8#1|)} assume 0bv32 == main_#t~ret8#1;havoc main_#t~ret8#1; {239#false} is VALID [2022-02-20 16:42:31,766 INFO L290 TraceCheckUtils]: 9: Hoare triple {239#false} assume !false; {239#false} is VALID [2022-02-20 16:42:31,766 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:42:31,766 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:42:31,766 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:42:31,766 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1090037580] [2022-02-20 16:42:31,766 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1090037580] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:42:31,766 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:42:31,766 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 16:42:31,766 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593793343] [2022-02-20 16:42:31,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:42:31,768 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 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 10 [2022-02-20 16:42:31,768 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:42:31,768 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 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:42:31,817 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:42:31,817 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 16:42:31,817 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:42:31,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 16:42:31,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:42:31,818 INFO L87 Difference]: Start difference. First operand 30 states and 40 transitions. Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 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:42:34,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:34,019 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-02-20 16:42:34,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 16:42:34,019 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 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 10 [2022-02-20 16:42:34,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:42:34,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 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:42:34,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-02-20 16:42:34,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 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:42:34,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2022-02-20 16:42:34,022 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 44 transitions. [2022-02-20 16:42:34,299 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:42:34,300 INFO L225 Difference]: With dead ends: 35 [2022-02-20 16:42:34,301 INFO L226 Difference]: Without dead ends: 30 [2022-02-20 16:42:34,301 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-02-20 16:42:34,302 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 44 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-02-20 16:42:34,303 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 123 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-02-20 16:42:34,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-02-20 16:42:34,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-02-20 16:42:34,306 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:42:34,306 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 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:42:34,306 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 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:42:34,307 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 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:42:34,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:34,308 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2022-02-20 16:42:34,308 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2022-02-20 16:42:34,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:34,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:34,309 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 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 30 states. [2022-02-20 16:42:34,309 INFO L87 Difference]: Start difference. First operand has 30 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 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 30 states. [2022-02-20 16:42:34,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:34,310 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2022-02-20 16:42:34,310 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2022-02-20 16:42:34,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:34,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:34,312 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:42:34,312 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:42:34,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 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:42:34,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2022-02-20 16:42:34,314 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 10 [2022-02-20 16:42:34,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:42:34,314 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2022-02-20 16:42:34,314 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 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:42:34,315 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2022-02-20 16:42:34,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 16:42:34,315 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:42:34,315 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] [2022-02-20 16:42:34,325 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:42:34,520 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:42:34,520 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:42:34,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:42:34,521 INFO L85 PathProgramCache]: Analyzing trace with hash 591854048, now seen corresponding path program 1 times [2022-02-20 16:42:34,522 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:42:34,522 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1589081840] [2022-02-20 16:42:34,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:42:34,522 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:42:34,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:42:34,525 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:42:34,528 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:42:34,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:42:34,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 16:42:34,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:42:34,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:42:34,889 INFO L290 TraceCheckUtils]: 0: Hoare triple {419#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(20bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~one_sqrt~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~tiny_sqrt~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E-30)); {419#true} is VALID [2022-02-20 16:42:34,891 INFO L290 TraceCheckUtils]: 1: Hoare triple {419#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret7#1, main_#t~ret8#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());assume { :begin_inline___ieee754_sqrtf } true;__ieee754_sqrtf_#in~x#1 := main_~x~0#1;havoc __ieee754_sqrtf_#res#1;havoc __ieee754_sqrtf_#t~mem4#1, __ieee754_sqrtf_~#gf_u~0#1.base, __ieee754_sqrtf_~#gf_u~0#1.offset, __ieee754_sqrtf_#t~post5#1, __ieee754_sqrtf_#t~mem6#1, __ieee754_sqrtf_~#sf_u~0#1.base, __ieee754_sqrtf_~#sf_u~0#1.offset, __ieee754_sqrtf_~x#1, __ieee754_sqrtf_~z~0#1, __ieee754_sqrtf_~r~0#1, __ieee754_sqrtf_~hx~0#1, __ieee754_sqrtf_~ix~0#1, __ieee754_sqrtf_~s~0#1, __ieee754_sqrtf_~q~0#1, __ieee754_sqrtf_~m~0#1, __ieee754_sqrtf_~t~0#1, __ieee754_sqrtf_~i~0#1;__ieee754_sqrtf_~x#1 := __ieee754_sqrtf_#in~x#1;havoc __ieee754_sqrtf_~z~0#1;havoc __ieee754_sqrtf_~r~0#1;havoc __ieee754_sqrtf_~hx~0#1;havoc __ieee754_sqrtf_~ix~0#1;havoc __ieee754_sqrtf_~s~0#1;havoc __ieee754_sqrtf_~q~0#1;havoc __ieee754_sqrtf_~m~0#1;havoc __ieee754_sqrtf_~t~0#1;havoc __ieee754_sqrtf_~i~0#1; {427#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start___ieee754_sqrtf_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:42:34,899 INFO L290 TraceCheckUtils]: 2: Hoare triple {427#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start___ieee754_sqrtf_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} call __ieee754_sqrtf_~#gf_u~0#1.base, __ieee754_sqrtf_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__ieee754_sqrtf_~x#1, __ieee754_sqrtf_~#gf_u~0#1.base, __ieee754_sqrtf_~#gf_u~0#1.offset, 4bv32);call __ieee754_sqrtf_#t~mem4#1 := read~intINTTYPE4(__ieee754_sqrtf_~#gf_u~0#1.base, __ieee754_sqrtf_~#gf_u~0#1.offset, 4bv32);__ieee754_sqrtf_~ix~0#1 := __ieee754_sqrtf_#t~mem4#1;havoc __ieee754_sqrtf_#t~mem4#1;call ULTIMATE.dealloc(__ieee754_sqrtf_~#gf_u~0#1.base, __ieee754_sqrtf_~#gf_u~0#1.offset);havoc __ieee754_sqrtf_~#gf_u~0#1.base, __ieee754_sqrtf_~#gf_u~0#1.offset; {431#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|)) (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:42:34,901 INFO L290 TraceCheckUtils]: 3: Hoare triple {431#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|)) (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} goto; {431#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|)) (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:42:34,903 INFO L290 TraceCheckUtils]: 4: Hoare triple {431#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|)) (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} __ieee754_sqrtf_~hx~0#1 := ~bvand32(2147483647bv32, __ieee754_sqrtf_~ix~0#1); {438#(exists ((|ULTIMATE.start___ieee754_sqrtf_~ix~0#1| (_ BitVec 32))) (and (= (bvand (_ bv2147483647 32) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|) |ULTIMATE.start___ieee754_sqrtf_~hx~0#1|) (exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|)) (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))))} is VALID [2022-02-20 16:42:34,904 INFO L290 TraceCheckUtils]: 5: Hoare triple {438#(exists ((|ULTIMATE.start___ieee754_sqrtf_~ix~0#1| (_ BitVec 32))) (and (= (bvand (_ bv2147483647 32) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|) |ULTIMATE.start___ieee754_sqrtf_~hx~0#1|) (exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|)) (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))))} assume !!~bvult32(__ieee754_sqrtf_~hx~0#1, 2139095040bv32); {420#false} is VALID [2022-02-20 16:42:34,904 INFO L290 TraceCheckUtils]: 6: Hoare triple {420#false} assume !(0bv32 == __ieee754_sqrtf_~hx~0#1); {420#false} is VALID [2022-02-20 16:42:34,905 INFO L290 TraceCheckUtils]: 7: Hoare triple {420#false} assume !~bvslt32(__ieee754_sqrtf_~ix~0#1, 0bv32);__ieee754_sqrtf_~m~0#1 := ~bvashr32(__ieee754_sqrtf_~ix~0#1, 23bv32); {420#false} is VALID [2022-02-20 16:42:34,905 INFO L290 TraceCheckUtils]: 8: Hoare triple {420#false} assume !~bvult32(__ieee754_sqrtf_~hx~0#1, 8388608bv32); {420#false} is VALID [2022-02-20 16:42:34,905 INFO L290 TraceCheckUtils]: 9: Hoare triple {420#false} __ieee754_sqrtf_~m~0#1 := ~bvsub32(__ieee754_sqrtf_~m~0#1, 127bv32);__ieee754_sqrtf_~ix~0#1 := ~bvor32(8388608bv32, ~bvand32(8388607bv32, __ieee754_sqrtf_~ix~0#1)); {420#false} is VALID [2022-02-20 16:42:34,905 INFO L290 TraceCheckUtils]: 10: Hoare triple {420#false} assume 0bv32 != ~bvand32(1bv32, __ieee754_sqrtf_~m~0#1);__ieee754_sqrtf_~ix~0#1 := ~bvadd32(__ieee754_sqrtf_~ix~0#1, __ieee754_sqrtf_~ix~0#1); {420#false} is VALID [2022-02-20 16:42:34,905 INFO L290 TraceCheckUtils]: 11: Hoare triple {420#false} __ieee754_sqrtf_~m~0#1 := ~bvashr32(__ieee754_sqrtf_~m~0#1, 1bv32);__ieee754_sqrtf_~ix~0#1 := ~bvadd32(__ieee754_sqrtf_~ix~0#1, __ieee754_sqrtf_~ix~0#1);__ieee754_sqrtf_~s~0#1 := 0bv32;__ieee754_sqrtf_~q~0#1 := __ieee754_sqrtf_~s~0#1;__ieee754_sqrtf_~r~0#1 := 16777216bv32; {420#false} is VALID [2022-02-20 16:42:34,906 INFO L290 TraceCheckUtils]: 12: Hoare triple {420#false} assume !(0bv32 != __ieee754_sqrtf_~r~0#1); {420#false} is VALID [2022-02-20 16:42:34,906 INFO L290 TraceCheckUtils]: 13: Hoare triple {420#false} assume !(0bv32 != __ieee754_sqrtf_~ix~0#1); {420#false} is VALID [2022-02-20 16:42:34,906 INFO L290 TraceCheckUtils]: 14: Hoare triple {420#false} __ieee754_sqrtf_~ix~0#1 := ~bvadd32(1056964608bv32, ~bvashr32(__ieee754_sqrtf_~q~0#1, 1bv32));__ieee754_sqrtf_~ix~0#1 := ~bvadd32(__ieee754_sqrtf_~ix~0#1, ~bvshl32(__ieee754_sqrtf_~m~0#1, 23bv32)); {420#false} is VALID [2022-02-20 16:42:34,906 INFO L290 TraceCheckUtils]: 15: Hoare triple {420#false} call __ieee754_sqrtf_~#sf_u~0#1.base, __ieee754_sqrtf_~#sf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intINTTYPE4(__ieee754_sqrtf_~ix~0#1, __ieee754_sqrtf_~#sf_u~0#1.base, __ieee754_sqrtf_~#sf_u~0#1.offset, 4bv32);call __ieee754_sqrtf_#t~mem6#1 := read~intFLOATTYPE4(__ieee754_sqrtf_~#sf_u~0#1.base, __ieee754_sqrtf_~#sf_u~0#1.offset, 4bv32);__ieee754_sqrtf_~z~0#1 := __ieee754_sqrtf_#t~mem6#1;havoc __ieee754_sqrtf_#t~mem6#1;call ULTIMATE.dealloc(__ieee754_sqrtf_~#sf_u~0#1.base, __ieee754_sqrtf_~#sf_u~0#1.offset);havoc __ieee754_sqrtf_~#sf_u~0#1.base, __ieee754_sqrtf_~#sf_u~0#1.offset; {420#false} is VALID [2022-02-20 16:42:34,906 INFO L290 TraceCheckUtils]: 16: Hoare triple {420#false} goto; {420#false} is VALID [2022-02-20 16:42:34,907 INFO L290 TraceCheckUtils]: 17: Hoare triple {420#false} __ieee754_sqrtf_#res#1 := __ieee754_sqrtf_~z~0#1; {420#false} is VALID [2022-02-20 16:42:34,907 INFO L290 TraceCheckUtils]: 18: Hoare triple {420#false} main_#t~ret7#1 := __ieee754_sqrtf_#res#1;assume { :end_inline___ieee754_sqrtf } true;main_~res~0#1 := main_#t~ret7#1;havoc main_#t~ret7#1;assume { :begin_inline_isnan_float } true;isnan_float_#in~x#1 := main_~res~0#1;havoc isnan_float_#res#1;havoc isnan_float_~x#1;isnan_float_~x#1 := isnan_float_#in~x#1;isnan_float_#res#1 := (if !~fp.eq~FLOAT(isnan_float_~x#1, isnan_float_~x#1) then 1bv32 else 0bv32); {420#false} is VALID [2022-02-20 16:42:34,907 INFO L290 TraceCheckUtils]: 19: Hoare triple {420#false} main_#t~ret8#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true; {420#false} is VALID [2022-02-20 16:42:34,907 INFO L290 TraceCheckUtils]: 20: Hoare triple {420#false} assume 0bv32 == main_#t~ret8#1;havoc main_#t~ret8#1; {420#false} is VALID [2022-02-20 16:42:34,907 INFO L290 TraceCheckUtils]: 21: Hoare triple {420#false} assume !false; {420#false} is VALID [2022-02-20 16:42:34,908 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:42:34,908 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:42:34,908 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:42:34,908 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1589081840] [2022-02-20 16:42:34,908 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1589081840] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:42:34,908 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:42:34,908 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:42:34,909 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774187293] [2022-02-20 16:42:34,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:42:34,909 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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 22 [2022-02-20 16:42:34,910 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:42:34,910 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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:42:34,944 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:42:34,944 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:42:34,944 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:42:34,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:42:34,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:42:34,945 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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:42:34,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:34,986 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2022-02-20 16:42:34,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:42:34,986 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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 22 [2022-02-20 16:42:34,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:42:34,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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:42:34,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-02-20 16:42:34,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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:42:34,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-02-20 16:42:34,988 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 37 transitions. [2022-02-20 16:42:35,078 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:42:35,078 INFO L225 Difference]: With dead ends: 30 [2022-02-20 16:42:35,078 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 16:42:35,079 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:42:35,079 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:42:35,080 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 8 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 4 Unchecked, 0.0s Time] [2022-02-20 16:42:35,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 16:42:35,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 16:42:35,081 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:42:35,081 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:42:35,081 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:42:35,081 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:42:35,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:35,081 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:42:35,081 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:42:35,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:35,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:35,081 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:42:35,081 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:42:35,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:35,082 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:42:35,082 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:42:35,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:35,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:35,082 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:42:35,082 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:42:35,082 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:42:35,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 16:42:35,082 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2022-02-20 16:42:35,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:42:35,083 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 16:42:35,083 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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:42:35,083 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:42:35,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:35,085 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:42:35,095 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:42:35,285 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:42:35,287 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 16:42:35,366 INFO L861 garLoopResultBuilder]: At program point L102(lines 86 103) the Hoare annotation is: true [2022-02-20 16:42:35,366 INFO L858 garLoopResultBuilder]: For program point L36(lines 36 37) no Hoare annotation was computed. [2022-02-20 16:42:35,366 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 16:42:35,366 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 16:42:35,366 INFO L858 garLoopResultBuilder]: For program point L78-1(lines 78 82) no Hoare annotation was computed. [2022-02-20 16:42:35,366 INFO L854 garLoopResultBuilder]: At program point L78-2(lines 78 82) the Hoare annotation is: false [2022-02-20 16:42:35,367 INFO L858 garLoopResultBuilder]: For program point L78-3(lines 78 82) no Hoare annotation was computed. [2022-02-20 16:42:35,367 INFO L858 garLoopResultBuilder]: For program point L70(lines 70 73) no Hoare annotation was computed. [2022-02-20 16:42:35,367 INFO L854 garLoopResultBuilder]: At program point L55-2(lines 55 64) the Hoare annotation is: false [2022-02-20 16:42:35,367 INFO L858 garLoopResultBuilder]: For program point L55-3(lines 19 84) no Hoare annotation was computed. [2022-02-20 16:42:35,367 INFO L858 garLoopResultBuilder]: For program point L47(lines 47 48) no Hoare annotation was computed. [2022-02-20 16:42:35,367 INFO L858 garLoopResultBuilder]: For program point L47-2(lines 47 48) no Hoare annotation was computed. [2022-02-20 16:42:35,367 INFO L858 garLoopResultBuilder]: For program point L97(lines 97 100) no Hoare annotation was computed. [2022-02-20 16:42:35,367 INFO L858 garLoopResultBuilder]: For program point L31(lines 31 32) no Hoare annotation was computed. [2022-02-20 16:42:35,367 INFO L854 garLoopResultBuilder]: At program point L15(line 15) the Hoare annotation is: (and (= (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 8 24) (_ +zero 8 24)))) (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse0) .cse0)) |ULTIMATE.start___ieee754_sqrtf_#res#1|) (= |ULTIMATE.start___ieee754_sqrtf_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res#1|)) [2022-02-20 16:42:35,367 INFO L858 garLoopResultBuilder]: For program point L40(lines 40 44) no Hoare annotation was computed. [2022-02-20 16:42:35,367 INFO L858 garLoopResultBuilder]: For program point L40-2(lines 40 44) no Hoare annotation was computed. [2022-02-20 16:42:35,368 INFO L858 garLoopResultBuilder]: For program point L98(line 98) no Hoare annotation was computed. [2022-02-20 16:42:35,368 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 16:42:35,368 INFO L858 garLoopResultBuilder]: For program point L57(lines 57 61) no Hoare annotation was computed. [2022-02-20 16:42:35,368 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 98) no Hoare annotation was computed. [2022-02-20 16:42:35,368 INFO L858 garLoopResultBuilder]: For program point L24-1(lines 24 28) no Hoare annotation was computed. [2022-02-20 16:42:35,368 INFO L858 garLoopResultBuilder]: For program point L57-2(lines 57 61) no Hoare annotation was computed. [2022-02-20 16:42:35,368 INFO L854 garLoopResultBuilder]: At program point L24-2(lines 24 28) the Hoare annotation is: (and (= |ULTIMATE.start___ieee754_sqrtf_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven)) [2022-02-20 16:42:35,368 INFO L858 garLoopResultBuilder]: For program point L24-3(lines 24 28) no Hoare annotation was computed. [2022-02-20 16:42:35,369 INFO L858 garLoopResultBuilder]: For program point L41-2(lines 41 42) no Hoare annotation was computed. [2022-02-20 16:42:35,369 INFO L854 garLoopResultBuilder]: At program point L41-3(lines 41 42) the Hoare annotation is: false [2022-02-20 16:42:35,369 INFO L858 garLoopResultBuilder]: For program point L41-4(lines 41 42) no Hoare annotation was computed. [2022-02-20 16:42:35,369 INFO L858 garLoopResultBuilder]: For program point L66(lines 66 75) no Hoare annotation was computed. [2022-02-20 16:42:35,369 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 16:42:35,369 INFO L854 garLoopResultBuilder]: At program point L83(lines 19 84) the Hoare annotation is: (and (= (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 8 24) (_ +zero 8 24)))) (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven .cse0 .cse0) .cse0)) |ULTIMATE.start___ieee754_sqrtf_#res#1|) (= |ULTIMATE.start___ieee754_sqrtf_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven)) [2022-02-20 16:42:35,369 INFO L858 garLoopResultBuilder]: For program point L34(lines 34 35) no Hoare annotation was computed. [2022-02-20 16:42:35,369 INFO L858 garLoopResultBuilder]: For program point L68(lines 68 74) no Hoare annotation was computed. [2022-02-20 16:42:35,372 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 16:42:35,373 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:42:35,375 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:42:35,375 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:42:35,375 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-02-20 16:42:35,375 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2022-02-20 16:42:35,375 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-02-20 16:42:35,375 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-02-20 16:42:35,375 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2022-02-20 16:42:35,376 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-02-20 16:42:35,376 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-02-20 16:42:35,377 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-02-20 16:42:35,377 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-02-20 16:42:35,377 WARN L170 areAnnotationChecker]: L97 has no Hoare annotation [2022-02-20 16:42:35,377 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 16:42:35,377 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 16:42:35,377 WARN L170 areAnnotationChecker]: L97 has no Hoare annotation [2022-02-20 16:42:35,377 WARN L170 areAnnotationChecker]: L97 has no Hoare annotation [2022-02-20 16:42:35,377 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 16:42:35,377 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 16:42:35,377 WARN L170 areAnnotationChecker]: L98 has no Hoare annotation [2022-02-20 16:42:35,377 WARN L170 areAnnotationChecker]: L98 has no Hoare annotation [2022-02-20 16:42:35,377 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:42:35,377 WARN L170 areAnnotationChecker]: L41-4 has no Hoare annotation [2022-02-20 16:42:35,378 WARN L170 areAnnotationChecker]: L41-4 has no Hoare annotation [2022-02-20 16:42:35,378 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2022-02-20 16:42:35,378 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2022-02-20 16:42:35,378 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:42:35,378 WARN L170 areAnnotationChecker]: L41-4 has no Hoare annotation [2022-02-20 16:42:35,378 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2022-02-20 16:42:35,378 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-02-20 16:42:35,378 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-02-20 16:42:35,379 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2022-02-20 16:42:35,379 WARN L170 areAnnotationChecker]: L55-3 has no Hoare annotation [2022-02-20 16:42:35,379 WARN L170 areAnnotationChecker]: L55-3 has no Hoare annotation [2022-02-20 16:42:35,379 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-02-20 16:42:35,379 WARN L170 areAnnotationChecker]: L55-3 has no Hoare annotation [2022-02-20 16:42:35,379 WARN L170 areAnnotationChecker]: L55-3 has no Hoare annotation [2022-02-20 16:42:35,379 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-02-20 16:42:35,379 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-02-20 16:42:35,380 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2022-02-20 16:42:35,380 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2022-02-20 16:42:35,380 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2022-02-20 16:42:35,380 WARN L170 areAnnotationChecker]: L57-2 has no Hoare annotation [2022-02-20 16:42:35,380 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2022-02-20 16:42:35,380 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2022-02-20 16:42:35,380 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2022-02-20 16:42:35,380 WARN L170 areAnnotationChecker]: L78-3 has no Hoare annotation [2022-02-20 16:42:35,381 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2022-02-20 16:42:35,381 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2022-02-20 16:42:35,381 WARN L170 areAnnotationChecker]: L78-3 has no Hoare annotation [2022-02-20 16:42:35,381 INFO L163 areAnnotationChecker]: CFG has 1 edges. 1 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 16:42:35,384 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:35,388 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:35,389 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:35,389 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:35,389 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:35,389 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:35,389 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:35,390 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:35,390 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:35,390 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:35,391 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:35,391 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:35,391 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:35,391 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:35,392 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:35,392 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:35,392 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:35,392 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:35,392 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:35,392 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:35,393 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:35,393 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:35,393 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:35,393 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:35,393 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:35,393 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:35,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:42:35 BoogieIcfgContainer [2022-02-20 16:42:35,394 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:42:35,394 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:42:35,394 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:42:35,395 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:42:35,395 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:42:29" (3/4) ... [2022-02-20 16:42:35,397 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 16:42:35,404 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2022-02-20 16:42:35,404 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2022-02-20 16:42:35,405 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 16:42:35,405 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 16:42:35,421 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()), ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())), ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) == \result && x == ~fp.div~FLOAT(unknown-currentRoundingMode-unknown, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven [2022-02-20 16:42:35,422 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()), ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())), ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) == \result && x == ~fp.div~FLOAT(unknown-currentRoundingMode-unknown, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && 1bv32 == \result [2022-02-20 16:42:35,438 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 16:42:35,440 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:42:35,441 INFO L158 Benchmark]: Toolchain (without parser) took 6845.30ms. Allocated memory was 54.5MB in the beginning and 69.2MB in the end (delta: 14.7MB). Free memory was 31.7MB in the beginning and 36.6MB in the end (delta: -4.9MB). Peak memory consumption was 9.0MB. Max. memory is 16.1GB. [2022-02-20 16:42:35,441 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 54.5MB. Free memory was 36.5MB in the beginning and 36.4MB in the end (delta: 33.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:42:35,441 INFO L158 Benchmark]: CACSL2BoogieTranslator took 267.50ms. Allocated memory was 54.5MB in the beginning and 69.2MB in the end (delta: 14.7MB). Free memory was 31.4MB in the beginning and 50.0MB in the end (delta: -18.6MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. [2022-02-20 16:42:35,441 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.69ms. Allocated memory is still 69.2MB. Free memory was 49.8MB in the beginning and 47.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:42:35,442 INFO L158 Benchmark]: Boogie Preprocessor took 55.60ms. Allocated memory is still 69.2MB. Free memory was 47.9MB in the beginning and 46.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:42:35,443 INFO L158 Benchmark]: RCFGBuilder took 828.73ms. Allocated memory is still 69.2MB. Free memory was 46.0MB in the beginning and 46.7MB in the end (delta: -683.3kB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. [2022-02-20 16:42:35,443 INFO L158 Benchmark]: TraceAbstraction took 5587.95ms. Allocated memory is still 69.2MB. Free memory was 46.1MB in the beginning and 40.1MB in the end (delta: 6.1MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. [2022-02-20 16:42:35,444 INFO L158 Benchmark]: Witness Printer took 45.43ms. Allocated memory is still 69.2MB. Free memory was 40.1MB in the beginning and 36.6MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:42:35,445 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 54.5MB. Free memory was 36.5MB in the beginning and 36.4MB in the end (delta: 33.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 267.50ms. Allocated memory was 54.5MB in the beginning and 69.2MB in the end (delta: 14.7MB). Free memory was 31.4MB in the beginning and 50.0MB in the end (delta: -18.6MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.69ms. Allocated memory is still 69.2MB. Free memory was 49.8MB in the beginning and 47.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 55.60ms. Allocated memory is still 69.2MB. Free memory was 47.9MB in the beginning and 46.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 828.73ms. Allocated memory is still 69.2MB. Free memory was 46.0MB in the beginning and 46.7MB in the end (delta: -683.3kB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5587.95ms. Allocated memory is still 69.2MB. Free memory was 46.1MB in the beginning and 40.1MB in the end (delta: 6.1MB). Peak memory consumption was 7.3MB. Max. memory is 16.1GB. * Witness Printer took 45.43ms. Allocated memory is still 69.2MB. Free memory was 40.1MB in the beginning and 36.6MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. 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: 98]: 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, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.5s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 44 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 44 mSDsluCounter, 174 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 4 IncrementalHoareTripleChecker+Unchecked, 97 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 35 IncrementalHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 77 mSDtfsCounter, 35 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=0, InterpolantAutomatonStates: 14, 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, 7 LocationsWithAnnotation, 7 PreInvPairs, 11 NumberOfFragments, 73 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 7 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 41 NumberOfCodeBlocks, 41 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 38 ConstructedInterpolants, 4 QuantifiedInterpolants, 146 SizeOfPredicates, 16 NumberOfNonLiveVariables, 145 ConjunctsInSsa, 22 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: 24]: Loop Invariant [2022-02-20 16:42:35,460 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:35,462 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: x == ~fp.div~FLOAT(unknown-currentRoundingMode-unknown, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven - InvariantResult [Line: 78]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 86]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 15]: Loop Invariant [2022-02-20 16:42:35,463 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:35,463 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:35,463 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:35,463 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:35,463 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:35,463 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:35,464 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:35,464 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:35,464 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:35,464 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:35,464 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:35,464 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()), ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())), ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) == \result && x == ~fp.div~FLOAT(unknown-currentRoundingMode-unknown, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && 1bv32 == \result - InvariantResult [Line: 19]: Loop Invariant [2022-02-20 16:42:35,465 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:35,465 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:35,465 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:35,465 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:35,465 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:35,465 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:35,466 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:35,466 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:35,466 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:35,466 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:35,466 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:42:35,466 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()), ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())), ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) == \result && x == ~fp.div~FLOAT(unknown-currentRoundingMode-unknown, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: 0 RESULT: Ultimate proved your program to be correct! [2022-02-20 16:42:35,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE