./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_0710.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_0710.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 213c24ef3c7753bf19a615c5715fd8340a45826778b0f8f910dadd2d17208462 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:42:03,966 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:42:03,968 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:42:04,011 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:42:04,012 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:42:04,015 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:42:04,016 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:42:04,018 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:42:04,020 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:42:04,024 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:42:04,024 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:42:04,026 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:42:04,026 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:42:04,028 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:42:04,029 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:42:04,032 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:42:04,033 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:42:04,034 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:42:04,036 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:42:04,041 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:42:04,042 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:42:04,043 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:42:04,044 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:42:04,045 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:42:04,050 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:42:04,051 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:42:04,051 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:42:04,052 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:42:04,053 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:42:04,054 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:42:04,055 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:42:04,055 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:42:04,057 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:42:04,058 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:42:04,059 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:42:04,059 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:42:04,060 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:42:04,060 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:42:04,060 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:42:04,061 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:42:04,061 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:42:04,062 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:04,092 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:42:04,092 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:42:04,093 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:42:04,093 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:42:04,094 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:42:04,094 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:42:04,095 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:42:04,095 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:42:04,095 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:42:04,095 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:42:04,096 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:42:04,096 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:42:04,096 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:42:04,096 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:42:04,097 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:42:04,097 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:42:04,097 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:42:04,097 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:42:04,097 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:42:04,098 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:42:04,098 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:42:04,098 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:42:04,098 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:42:04,098 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:42:04,099 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:42:04,099 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:42:04,099 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:42:04,099 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:42:04,099 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:42:04,100 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:42:04,100 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:42:04,100 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:42:04,100 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:42:04,100 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 -> 213c24ef3c7753bf19a615c5715fd8340a45826778b0f8f910dadd2d17208462 [2022-02-20 16:42:04,315 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:42:04,330 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:42:04,332 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:42:04,333 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:42:04,334 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:42:04,335 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0710.c [2022-02-20 16:42:04,408 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/042c93e13/db4e1388b8bb4544ab92ca8a5f7ed217/FLAG0d56d501d [2022-02-20 16:42:04,744 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:42:04,745 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0710.c [2022-02-20 16:42:04,750 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/042c93e13/db4e1388b8bb4544ab92ca8a5f7ed217/FLAG0d56d501d [2022-02-20 16:42:05,177 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/042c93e13/db4e1388b8bb4544ab92ca8a5f7ed217 [2022-02-20 16:42:05,179 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:42:05,181 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:42:05,184 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:42:05,184 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:42:05,187 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:42:05,188 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:42:05" (1/1) ... [2022-02-20 16:42:05,188 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4789b5bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:05, skipping insertion in model container [2022-02-20 16:42:05,189 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:42:05" (1/1) ... [2022-02-20 16:42:05,195 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:42:05,213 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:42:05,390 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_0710.c[1961,1974] [2022-02-20 16:42:05,397 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:42:05,408 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:42:05,447 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_0710.c[1961,1974] [2022-02-20 16:42:05,447 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:42:05,458 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:42:05,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:05 WrapperNode [2022-02-20 16:42:05,459 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:42:05,459 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:42:05,459 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:42:05,460 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:42:05,464 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:05" (1/1) ... [2022-02-20 16:42:05,469 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:05" (1/1) ... [2022-02-20 16:42:05,497 INFO L137 Inliner]: procedures = 17, calls = 17, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 139 [2022-02-20 16:42:05,497 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:42:05,498 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:42:05,498 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:42:05,498 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:42:05,505 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:05" (1/1) ... [2022-02-20 16:42:05,505 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:05" (1/1) ... [2022-02-20 16:42:05,507 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:05" (1/1) ... [2022-02-20 16:42:05,507 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:05" (1/1) ... [2022-02-20 16:42:05,516 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:05" (1/1) ... [2022-02-20 16:42:05,521 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:05" (1/1) ... [2022-02-20 16:42:05,523 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:05" (1/1) ... [2022-02-20 16:42:05,525 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:42:05,526 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:42:05,526 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:42:05,526 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:42:05,527 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:05" (1/1) ... [2022-02-20 16:42:05,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:42:05,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:42:05,560 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:05,594 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:05,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:42:05,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:42:05,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:42:05,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-02-20 16:42:05,615 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:42:05,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-02-20 16:42:05,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:42:05,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:42:05,618 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:42:05,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:42:05,691 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:42:05,692 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:42:05,961 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:42:05,969 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:42:05,969 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-02-20 16:42:05,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:42:05 BoogieIcfgContainer [2022-02-20 16:42:05,972 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:42:05,977 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:42:05,977 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:42:05,982 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:42:05,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:42:05" (1/3) ... [2022-02-20 16:42:05,983 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34412119 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:42:05, skipping insertion in model container [2022-02-20 16:42:05,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:05" (2/3) ... [2022-02-20 16:42:05,983 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34412119 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:42:05, skipping insertion in model container [2022-02-20 16:42:05,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:42:05" (3/3) ... [2022-02-20 16:42:05,992 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_0710.c [2022-02-20 16:42:05,997 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:42:05,997 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:42:06,035 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:42:06,040 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:06,040 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:42:06,054 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 40 states have (on average 1.7) internal successors, (68), 41 states have internal predecessors, (68), 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:06,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 16:42:06,057 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:42:06,057 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:42:06,058 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:42:06,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:42:06,062 INFO L85 PathProgramCache]: Analyzing trace with hash 937602086, now seen corresponding path program 1 times [2022-02-20 16:42:06,069 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:42:06,069 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195233200] [2022-02-20 16:42:06,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:42:06,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:42:06,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:42:06,225 INFO L290 TraceCheckUtils]: 0: Hoare triple {45#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; {45#true} is VALID [2022-02-20 16:42:06,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {45#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~ret10#1, main_#t~ret11#1, main_~res~0#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {45#true} is VALID [2022-02-20 16:42:06,226 INFO L290 TraceCheckUtils]: 2: Hoare triple {45#true} assume ~someBinaryFLOATComparisonOperation(main_~x~0#1, ~someUnaryFLOAToperation(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; {45#true} is VALID [2022-02-20 16:42:06,227 INFO L290 TraceCheckUtils]: 3: Hoare triple {45#true} assume !true; {46#false} is VALID [2022-02-20 16:42:06,227 INFO L290 TraceCheckUtils]: 4: Hoare triple {46#false} assume 0 == __ieee754_sqrtf_~ix~0#1;__ieee754_sqrtf_~hx~0#1 := 0; {46#false} is VALID [2022-02-20 16:42:06,228 INFO L290 TraceCheckUtils]: 5: Hoare triple {46#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); {46#false} is VALID [2022-02-20 16:42:06,228 INFO L290 TraceCheckUtils]: 6: Hoare triple {46#false} main_#t~ret10#1 := __ieee754_sqrtf_#res#1;assume { :end_inline___ieee754_sqrtf } true;main_~res~0#1 := main_#t~ret10#1;havoc main_#t~ret10#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); {46#false} is VALID [2022-02-20 16:42:06,229 INFO L290 TraceCheckUtils]: 7: Hoare triple {46#false} main_#t~ret11#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true;assume -2147483648 <= main_#t~ret11#1 && main_#t~ret11#1 <= 2147483647; {46#false} is VALID [2022-02-20 16:42:06,229 INFO L290 TraceCheckUtils]: 8: Hoare triple {46#false} assume 0 == main_#t~ret11#1;havoc main_#t~ret11#1; {46#false} is VALID [2022-02-20 16:42:06,230 INFO L290 TraceCheckUtils]: 9: Hoare triple {46#false} assume !false; {46#false} is VALID [2022-02-20 16:42:06,231 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:06,232 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:42:06,232 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195233200] [2022-02-20 16:42:06,232 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195233200] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:42:06,233 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:42:06,233 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:42:06,234 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124191495] [2022-02-20 16:42:06,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:42:06,239 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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:06,239 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:42:06,241 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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:06,255 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:06,255 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:42:06,256 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:42:06,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:42:06,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:42:06,277 INFO L87 Difference]: Start difference. First operand has 42 states, 40 states have (on average 1.7) internal successors, (68), 41 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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:06,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:06,352 INFO L93 Difference]: Finished difference Result 81 states and 132 transitions. [2022-02-20 16:42:06,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:42:06,353 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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:06,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:42:06,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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:06,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 132 transitions. [2022-02-20 16:42:06,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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:06,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 132 transitions. [2022-02-20 16:42:06,366 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 132 transitions. [2022-02-20 16:42:06,476 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:42:06,484 INFO L225 Difference]: With dead ends: 81 [2022-02-20 16:42:06,484 INFO L226 Difference]: Without dead ends: 38 [2022-02-20 16:42:06,486 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:06,489 INFO L933 BasicCegarLoop]: 56 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, 56 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:06,490 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 56 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:06,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-02-20 16:42:06,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-02-20 16:42:06,512 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:42:06,513 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 37 states have internal predecessors, (51), 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:06,514 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 37 states have internal predecessors, (51), 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:06,514 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 37 states have internal predecessors, (51), 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:06,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:06,517 INFO L93 Difference]: Finished difference Result 38 states and 51 transitions. [2022-02-20 16:42:06,517 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 51 transitions. [2022-02-20 16:42:06,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:06,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:06,518 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 37 states have internal predecessors, (51), 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 38 states. [2022-02-20 16:42:06,519 INFO L87 Difference]: Start difference. First operand has 38 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 37 states have internal predecessors, (51), 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 38 states. [2022-02-20 16:42:06,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:06,521 INFO L93 Difference]: Finished difference Result 38 states and 51 transitions. [2022-02-20 16:42:06,521 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 51 transitions. [2022-02-20 16:42:06,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:06,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:06,522 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:42:06,522 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:42:06,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 37 states have internal predecessors, (51), 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:06,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 51 transitions. [2022-02-20 16:42:06,526 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 51 transitions. Word has length 10 [2022-02-20 16:42:06,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:42:06,526 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 51 transitions. [2022-02-20 16:42:06,526 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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:06,526 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 51 transitions. [2022-02-20 16:42:06,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:42:06,527 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:42:06,527 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:42:06,528 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:42:06,528 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:42:06,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:42:06,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1356976062, now seen corresponding path program 1 times [2022-02-20 16:42:06,529 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:42:06,529 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029582023] [2022-02-20 16:42:06,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:42:06,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:42:06,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:42:06,610 INFO L290 TraceCheckUtils]: 0: Hoare triple {264#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; {264#true} is VALID [2022-02-20 16:42:06,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {264#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, main_#t~ret10#1, main_#t~ret11#1, main_~res~0#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1; {264#true} is VALID [2022-02-20 16:42:06,614 INFO L290 TraceCheckUtils]: 2: Hoare triple {264#true} assume ~someBinaryFLOATComparisonOperation(main_~x~0#1, ~someUnaryFLOAToperation(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; {264#true} is VALID [2022-02-20 16:42:06,615 INFO L290 TraceCheckUtils]: 3: Hoare triple {264#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; {264#true} is VALID [2022-02-20 16:42:06,615 INFO L290 TraceCheckUtils]: 4: Hoare triple {264#true} goto; {264#true} is VALID [2022-02-20 16:42:06,616 INFO L290 TraceCheckUtils]: 5: Hoare triple {264#true} assume 0 == __ieee754_sqrtf_~ix~0#1;__ieee754_sqrtf_~hx~0#1 := 0; {266#(= |ULTIMATE.start___ieee754_sqrtf_~hx~0#1| 0)} is VALID [2022-02-20 16:42:06,616 INFO L290 TraceCheckUtils]: 6: Hoare triple {266#(= |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); {265#false} is VALID [2022-02-20 16:42:06,616 INFO L290 TraceCheckUtils]: 7: Hoare triple {265#false} main_#t~ret10#1 := __ieee754_sqrtf_#res#1;assume { :end_inline___ieee754_sqrtf } true;main_~res~0#1 := main_#t~ret10#1;havoc main_#t~ret10#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); {265#false} is VALID [2022-02-20 16:42:06,617 INFO L290 TraceCheckUtils]: 8: Hoare triple {265#false} main_#t~ret11#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true;assume -2147483648 <= main_#t~ret11#1 && main_#t~ret11#1 <= 2147483647; {265#false} is VALID [2022-02-20 16:42:06,617 INFO L290 TraceCheckUtils]: 9: Hoare triple {265#false} assume 0 == main_#t~ret11#1;havoc main_#t~ret11#1; {265#false} is VALID [2022-02-20 16:42:06,618 INFO L290 TraceCheckUtils]: 10: Hoare triple {265#false} assume !false; {265#false} is VALID [2022-02-20 16:42:06,618 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:06,619 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:42:06,619 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029582023] [2022-02-20 16:42:06,619 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029582023] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:42:06,620 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:42:06,620 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:42:06,628 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194607207] [2022-02-20 16:42:06,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:42:06,630 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 16:42:06,630 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:42:06,630 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:06,643 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:42:06,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:42:06,643 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:42:06,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:42:06,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:42:06,645 INFO L87 Difference]: Start difference. First operand 38 states and 51 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:06,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:06,728 INFO L93 Difference]: Finished difference Result 72 states and 95 transitions. [2022-02-20 16:42:06,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:42:06,728 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 16:42:06,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:42:06,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:06,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-02-20 16:42:06,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:06,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-02-20 16:42:06,734 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 95 transitions. [2022-02-20 16:42:06,822 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:42:06,824 INFO L225 Difference]: With dead ends: 72 [2022-02-20 16:42:06,825 INFO L226 Difference]: Without dead ends: 45 [2022-02-20 16:42:06,826 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:06,829 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 6 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 90 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:06,830 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 90 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:06,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-02-20 16:42:06,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2022-02-20 16:42:06,836 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:42:06,837 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 40 states, 39 states have (on average 1.358974358974359) internal successors, (53), 39 states have internal predecessors, (53), 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:06,838 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 40 states, 39 states have (on average 1.358974358974359) internal successors, (53), 39 states have internal predecessors, (53), 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:06,840 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 40 states, 39 states have (on average 1.358974358974359) internal successors, (53), 39 states have internal predecessors, (53), 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:06,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:06,846 INFO L93 Difference]: Finished difference Result 45 states and 57 transitions. [2022-02-20 16:42:06,846 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2022-02-20 16:42:06,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:06,847 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:06,847 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 39 states have (on average 1.358974358974359) internal successors, (53), 39 states have internal predecessors, (53), 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 45 states. [2022-02-20 16:42:06,848 INFO L87 Difference]: Start difference. First operand has 40 states, 39 states have (on average 1.358974358974359) internal successors, (53), 39 states have internal predecessors, (53), 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 45 states. [2022-02-20 16:42:06,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:06,851 INFO L93 Difference]: Finished difference Result 45 states and 57 transitions. [2022-02-20 16:42:06,851 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2022-02-20 16:42:06,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:06,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:06,853 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:42:06,853 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:42:06,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.358974358974359) internal successors, (53), 39 states have internal predecessors, (53), 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:06,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 53 transitions. [2022-02-20 16:42:06,858 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 53 transitions. Word has length 11 [2022-02-20 16:42:06,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:42:06,858 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 53 transitions. [2022-02-20 16:42:06,859 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:06,859 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2022-02-20 16:42:06,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 16:42:06,860 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:42:06,860 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:42:06,861 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:42:06,861 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:42:06,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:42:06,862 INFO L85 PathProgramCache]: Analyzing trace with hash -926882860, now seen corresponding path program 1 times [2022-02-20 16:42:06,862 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:42:06,862 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787777434] [2022-02-20 16:42:06,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:42:06,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:42:06,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:42:06,916 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:42:06,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:42:06,955 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:42:06,955 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:42:06,956 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:42:06,957 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 16:42:06,960 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 16:42:06,962 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:42:06,981 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:42:06,983 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:42:06,983 WARN L170 areAnnotationChecker]: L94 has no Hoare annotation [2022-02-20 16:42:06,983 WARN L170 areAnnotationChecker]: L94 has no Hoare annotation [2022-02-20 16:42:06,984 WARN L170 areAnnotationChecker]: L24-2 has no Hoare annotation [2022-02-20 16:42:06,984 WARN L170 areAnnotationChecker]: L24-2 has no Hoare annotation [2022-02-20 16:42:06,984 WARN L170 areAnnotationChecker]: L94-2 has no Hoare annotation [2022-02-20 16:42:06,984 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-02-20 16:42:06,984 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-02-20 16:42:06,984 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2022-02-20 16:42:06,984 WARN L170 areAnnotationChecker]: L24-3 has no Hoare annotation [2022-02-20 16:42:06,985 WARN L170 areAnnotationChecker]: L105 has no Hoare annotation [2022-02-20 16:42:06,985 WARN L170 areAnnotationChecker]: L29-7 has no Hoare annotation [2022-02-20 16:42:06,985 WARN L170 areAnnotationChecker]: L29-7 has no Hoare annotation [2022-02-20 16:42:06,985 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-02-20 16:42:06,985 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-02-20 16:42:06,985 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:42:06,985 WARN L170 areAnnotationChecker]: L83 has no Hoare annotation [2022-02-20 16:42:06,985 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-02-20 16:42:06,986 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-02-20 16:42:06,986 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2022-02-20 16:42:06,986 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2022-02-20 16:42:06,986 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-02-20 16:42:06,986 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 16:42:06,986 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 16:42:06,986 WARN L170 areAnnotationChecker]: L29-5 has no Hoare annotation [2022-02-20 16:42:06,986 WARN L170 areAnnotationChecker]: L29-5 has no Hoare annotation [2022-02-20 16:42:06,987 WARN L170 areAnnotationChecker]: L99 has no Hoare annotation [2022-02-20 16:42:06,987 WARN L170 areAnnotationChecker]: L99 has no Hoare annotation [2022-02-20 16:42:06,989 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 16:42:06,989 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 16:42:06,989 WARN L170 areAnnotationChecker]: L100 has no Hoare annotation [2022-02-20 16:42:06,989 WARN L170 areAnnotationChecker]: L100 has no Hoare annotation [2022-02-20 16:42:06,989 WARN L170 areAnnotationChecker]: L41-3 has no Hoare annotation [2022-02-20 16:42:06,990 WARN L170 areAnnotationChecker]: L41-3 has no Hoare annotation [2022-02-20 16:42:06,990 WARN L170 areAnnotationChecker]: L41-3 has no Hoare annotation [2022-02-20 16:42:06,990 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2022-02-20 16:42:06,991 WARN L170 areAnnotationChecker]: L41-4 has no Hoare annotation [2022-02-20 16:42:06,992 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2022-02-20 16:42:06,992 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-02-20 16:42:06,992 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-02-20 16:42:06,992 WARN L170 areAnnotationChecker]: L46-8 has no Hoare annotation [2022-02-20 16:42:06,992 WARN L170 areAnnotationChecker]: L46-8 has no Hoare annotation [2022-02-20 16:42:06,993 WARN L170 areAnnotationChecker]: L46-2 has no Hoare annotation [2022-02-20 16:42:06,993 WARN L170 areAnnotationChecker]: L46-2 has no Hoare annotation [2022-02-20 16:42:06,993 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2022-02-20 16:42:06,993 WARN L170 areAnnotationChecker]: L46-4 has no Hoare annotation [2022-02-20 16:42:06,993 WARN L170 areAnnotationChecker]: L46-4 has no Hoare annotation [2022-02-20 16:42:06,993 WARN L170 areAnnotationChecker]: L55-2 has no Hoare annotation [2022-02-20 16:42:06,993 WARN L170 areAnnotationChecker]: L55-2 has no Hoare annotation [2022-02-20 16:42:06,993 WARN L170 areAnnotationChecker]: L55-2 has no Hoare annotation [2022-02-20 16:42:06,993 WARN L170 areAnnotationChecker]: L46-6 has no Hoare annotation [2022-02-20 16:42:06,994 WARN L170 areAnnotationChecker]: L46-6 has no Hoare annotation [2022-02-20 16:42:06,994 WARN L170 areAnnotationChecker]: L55-3 has no Hoare annotation [2022-02-20 16:42:06,994 WARN L170 areAnnotationChecker]: L55-3 has no Hoare annotation [2022-02-20 16:42:06,994 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-02-20 16:42:06,994 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-02-20 16:42:06,994 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2022-02-20 16:42:06,994 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2022-02-20 16:42:06,994 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2022-02-20 16:42:06,995 WARN L170 areAnnotationChecker]: L57-2 has no Hoare annotation [2022-02-20 16:42:06,995 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2022-02-20 16:42:06,995 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2022-02-20 16:42:06,995 WARN L170 areAnnotationChecker]: L78-2 has no Hoare annotation [2022-02-20 16:42:06,995 WARN L170 areAnnotationChecker]: L78-2 has no Hoare annotation [2022-02-20 16:42:06,995 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2022-02-20 16:42:06,995 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2022-02-20 16:42:06,995 WARN L170 areAnnotationChecker]: L78-3 has no Hoare annotation [2022-02-20 16:42:06,996 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:06,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:42:06 BoogieIcfgContainer [2022-02-20 16:42:06,999 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:42:07,001 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:42:07,001 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:42:07,001 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:42:07,001 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:05" (3/4) ... [2022-02-20 16:42:07,004 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 16:42:07,004 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:42:07,005 INFO L158 Benchmark]: Toolchain (without parser) took 1823.71ms. Allocated memory was 96.5MB in the beginning and 121.6MB in the end (delta: 25.2MB). Free memory was 63.9MB in the beginning and 73.4MB in the end (delta: -9.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-20 16:42:07,006 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 96.5MB. Free memory was 51.2MB in the beginning and 51.1MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:42:07,007 INFO L158 Benchmark]: CACSL2BoogieTranslator took 274.78ms. Allocated memory is still 96.5MB. Free memory was 63.5MB in the beginning and 70.3MB in the end (delta: -6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 16:42:07,014 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.91ms. Allocated memory is still 96.5MB. Free memory was 70.3MB in the beginning and 68.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:42:07,015 INFO L158 Benchmark]: Boogie Preprocessor took 27.27ms. Allocated memory is still 96.5MB. Free memory was 68.0MB in the beginning and 66.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:42:07,015 INFO L158 Benchmark]: RCFGBuilder took 449.61ms. Allocated memory is still 96.5MB. Free memory was 66.1MB in the beginning and 50.0MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-02-20 16:42:07,016 INFO L158 Benchmark]: TraceAbstraction took 1022.71ms. Allocated memory was 96.5MB in the beginning and 121.6MB in the end (delta: 25.2MB). Free memory was 49.4MB in the beginning and 73.4MB in the end (delta: -24.1MB). Peak memory consumption was 3.0MB. Max. memory is 16.1GB. [2022-02-20 16:42:07,016 INFO L158 Benchmark]: Witness Printer took 3.35ms. Allocated memory is still 121.6MB. Free memory is still 73.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:42:07,022 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.11ms. Allocated memory is still 96.5MB. Free memory was 51.2MB in the beginning and 51.1MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 274.78ms. Allocated memory is still 96.5MB. Free memory was 63.5MB in the beginning and 70.3MB in the end (delta: -6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.91ms. Allocated memory is still 96.5MB. Free memory was 70.3MB in the beginning and 68.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.27ms. Allocated memory is still 96.5MB. Free memory was 68.0MB in the beginning and 66.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 449.61ms. Allocated memory is still 96.5MB. Free memory was 66.1MB in the beginning and 50.0MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1022.71ms. Allocated memory was 96.5MB in the beginning and 121.6MB in the end (delta: 25.2MB). Free memory was 49.4MB in the beginning and 73.4MB in the end (delta: -24.1MB). Peak memory consumption was 3.0MB. Max. memory is 16.1GB. * Witness Printer took 3.35ms. Allocated memory is still 121.6MB. Free memory is still 73.4MB. 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: 100]: 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. 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 = __VERIFIER_nondet_float(); [L94] COND TRUE x < -0.0f [L96] 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)=49, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=49] [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)=49, hx=0, ix=0, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=49] [L31] COND FALSE !(!((hx) < 0x7f800000L)) VAL [\old(x)=49, hx=0, ix=0, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=49] [L34] COND TRUE ((hx) == 0) [L35] return x; VAL [\old(x)=49, \result=49, hx=0, ix=0, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=49] [L96] RET, EXPR __ieee754_sqrtf(x) [L96] float res = __ieee754_sqrtf(x); [L99] CALL, EXPR isnan_float(res) [L15] return x != x; VAL [\old(x)=49, \result=0, one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000, x=49] [L99] RET, EXPR isnan_float(res) [L99] COND TRUE !isnan_float(res) [L100] reach_error() VAL [one_sqrt=1, res=49, tiny_sqrt=1/1000000000000000000000000000000, x=49] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.9s, 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, 146 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 41 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11 IncrementalHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 105 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=42occurred 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.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 33 NumberOfCodeBlocks, 33 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 19 ConstructedInterpolants, 0 QuantifiedInterpolants, 21 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:07,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/float_req_bl_0710.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 213c24ef3c7753bf19a615c5715fd8340a45826778b0f8f910dadd2d17208462 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:42:08,953 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:42:08,955 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:42:09,001 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:42:09,001 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:42:09,005 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:42:09,006 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:42:09,011 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:42:09,013 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:42:09,017 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:42:09,018 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:42:09,021 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:42:09,021 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:42:09,024 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:42:09,025 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:42:09,028 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:42:09,029 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:42:09,030 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:42:09,032 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:42:09,037 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:42:09,039 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:42:09,040 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:42:09,041 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:42:09,042 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:42:09,045 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:42:09,045 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:42:09,045 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:42:09,047 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:42:09,047 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:42:09,048 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:42:09,048 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:42:09,049 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:42:09,050 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:42:09,051 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:42:09,052 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:42:09,052 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:42:09,053 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:42:09,053 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:42:09,053 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:42:09,055 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:42:09,055 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:42:09,056 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:09,087 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:42:09,087 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:42:09,088 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:42:09,089 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:42:09,089 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:42:09,090 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:42:09,091 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:42:09,091 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:42:09,091 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:42:09,091 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:42:09,092 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:42:09,092 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:42:09,093 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:42:09,093 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:42:09,093 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:42:09,093 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:42:09,093 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:42:09,094 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:42:09,094 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:42:09,094 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:42:09,094 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:42:09,094 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:42:09,094 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:42:09,095 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:42:09,095 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:42:09,095 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:42:09,095 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:42:09,096 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:42:09,096 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:42:09,096 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:42:09,096 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:42:09,096 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:42:09,097 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:42:09,097 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:42:09,097 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:42:09,097 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:42:09,097 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 -> 213c24ef3c7753bf19a615c5715fd8340a45826778b0f8f910dadd2d17208462 [2022-02-20 16:42:09,379 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:42:09,401 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:42:09,403 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:42:09,404 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:42:09,407 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:42:09,408 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0710.c [2022-02-20 16:42:09,465 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a125aa3c5/35e6d6d0803c4e8fa6a214a9a09c6d0b/FLAG07aba0806 [2022-02-20 16:42:09,911 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:42:09,912 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0710.c [2022-02-20 16:42:09,919 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a125aa3c5/35e6d6d0803c4e8fa6a214a9a09c6d0b/FLAG07aba0806 [2022-02-20 16:42:09,934 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a125aa3c5/35e6d6d0803c4e8fa6a214a9a09c6d0b [2022-02-20 16:42:09,937 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:42:09,938 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:42:09,940 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:42:09,941 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:42:09,944 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:42:09,944 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:42:09" (1/1) ... [2022-02-20 16:42:09,946 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@267f50b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:09, skipping insertion in model container [2022-02-20 16:42:09,946 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:42:09" (1/1) ... [2022-02-20 16:42:09,952 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:42:09,966 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:42:10,128 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_0710.c[1961,1974] [2022-02-20 16:42:10,132 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:42:10,143 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:42:10,169 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_0710.c[1961,1974] [2022-02-20 16:42:10,171 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:42:10,184 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:42:10,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:10 WrapperNode [2022-02-20 16:42:10,184 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:42:10,185 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:42:10,185 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:42:10,186 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:42:10,191 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:10" (1/1) ... [2022-02-20 16:42:10,199 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:10" (1/1) ... [2022-02-20 16:42:10,223 INFO L137 Inliner]: procedures = 20, calls = 17, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 116 [2022-02-20 16:42:10,223 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:42:10,224 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:42:10,224 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:42:10,224 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:42:10,231 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:10" (1/1) ... [2022-02-20 16:42:10,232 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:10" (1/1) ... [2022-02-20 16:42:10,235 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:10" (1/1) ... [2022-02-20 16:42:10,236 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:10" (1/1) ... [2022-02-20 16:42:10,246 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:10" (1/1) ... [2022-02-20 16:42:10,251 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:10" (1/1) ... [2022-02-20 16:42:10,253 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:10" (1/1) ... [2022-02-20 16:42:10,256 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:42:10,257 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:42:10,257 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:42:10,257 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:42:10,258 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:10" (1/1) ... [2022-02-20 16:42:10,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:42:10,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:42:10,283 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:10,291 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:10,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:42:10,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:42:10,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:42:10,317 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2022-02-20 16:42:10,322 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 16:42:10,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:42:10,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:42:10,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2022-02-20 16:42:10,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 16:42:10,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:42:10,378 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:42:10,379 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:42:11,134 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:42:11,140 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:42:11,140 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-02-20 16:42:11,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:42:11 BoogieIcfgContainer [2022-02-20 16:42:11,142 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:42:11,143 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:42:11,143 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:42:11,146 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:42:11,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:42:09" (1/3) ... [2022-02-20 16:42:11,146 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3579820c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:42:11, skipping insertion in model container [2022-02-20 16:42:11,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:10" (2/3) ... [2022-02-20 16:42:11,147 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3579820c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:42:11, skipping insertion in model container [2022-02-20 16:42:11,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:42:11" (3/3) ... [2022-02-20 16:42:11,153 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_0710.c [2022-02-20 16:42:11,157 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:42:11,159 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:42:11,206 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:42:11,215 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:11,215 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:42:11,230 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 33 states have (on average 1.606060606060606) internal successors, (53), 34 states have internal predecessors, (53), 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:11,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 16:42:11,234 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:42:11,234 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:42:11,235 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:42:11,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:42:11,245 INFO L85 PathProgramCache]: Analyzing trace with hash 860611220, now seen corresponding path program 1 times [2022-02-20 16:42:11,256 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:42:11,257 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1847525136] [2022-02-20 16:42:11,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:42:11,258 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:42:11,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:42:11,263 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:11,274 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:11,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:42:11,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:42:11,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:42:11,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:42:11,512 INFO L290 TraceCheckUtils]: 0: Hoare triple {38#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)); {38#true} is VALID [2022-02-20 16:42:11,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {38#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~res~0#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {38#true} is VALID [2022-02-20 16:42:11,513 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#true} assume ~fp.lt~FLOAT(main_~x~0#1, ~fp.neg~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; {38#true} is VALID [2022-02-20 16:42:11,514 INFO L290 TraceCheckUtils]: 3: Hoare triple {38#true} assume !true; {39#false} is VALID [2022-02-20 16:42:11,514 INFO L290 TraceCheckUtils]: 4: Hoare triple {39#false} __ieee754_sqrtf_~hx~0#1 := ~bvand32(2147483647bv32, __ieee754_sqrtf_~ix~0#1); {39#false} is VALID [2022-02-20 16:42:11,514 INFO L290 TraceCheckUtils]: 5: Hoare triple {39#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); {39#false} is VALID [2022-02-20 16:42:11,515 INFO L290 TraceCheckUtils]: 6: Hoare triple {39#false} main_#t~ret8#1 := __ieee754_sqrtf_#res#1;assume { :end_inline___ieee754_sqrtf } true;main_~res~0#1 := main_#t~ret8#1;havoc main_#t~ret8#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); {39#false} is VALID [2022-02-20 16:42:11,515 INFO L290 TraceCheckUtils]: 7: Hoare triple {39#false} main_#t~ret9#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true; {39#false} is VALID [2022-02-20 16:42:11,516 INFO L290 TraceCheckUtils]: 8: Hoare triple {39#false} assume 0bv32 == main_#t~ret9#1;havoc main_#t~ret9#1; {39#false} is VALID [2022-02-20 16:42:11,516 INFO L290 TraceCheckUtils]: 9: Hoare triple {39#false} assume !false; {39#false} is VALID [2022-02-20 16:42:11,517 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:11,517 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:42:11,518 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:42:11,518 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1847525136] [2022-02-20 16:42:11,518 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1847525136] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:42:11,519 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:42:11,519 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:42:11,523 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244905977] [2022-02-20 16:42:11,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:42:11,528 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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:11,529 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:42:11,531 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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:11,607 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:11,608 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:42:11,608 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:42:11,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:42:11,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:42:11,631 INFO L87 Difference]: Start difference. First operand has 35 states, 33 states have (on average 1.606060606060606) internal successors, (53), 34 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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:12,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:12,299 INFO L93 Difference]: Finished difference Result 67 states and 102 transitions. [2022-02-20 16:42:12,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:42:12,299 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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:12,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:42:12,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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:12,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 102 transitions. [2022-02-20 16:42:12,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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:12,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 102 transitions. [2022-02-20 16:42:12,310 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 102 transitions. [2022-02-20 16:42:12,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:42:12,809 INFO L225 Difference]: With dead ends: 67 [2022-02-20 16:42:12,809 INFO L226 Difference]: Without dead ends: 31 [2022-02-20 16:42:12,811 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 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:12,814 INFO L933 BasicCegarLoop]: 46 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, 46 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:12,815 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 46 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:12,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-02-20 16:42:12,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-02-20 16:42:12,836 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:42:12,837 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 states have internal predecessors, (41), 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:12,837 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 states have internal predecessors, (41), 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:12,838 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 states have internal predecessors, (41), 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:12,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:12,841 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2022-02-20 16:42:12,841 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2022-02-20 16:42:12,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:12,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:12,842 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 states have internal predecessors, (41), 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 31 states. [2022-02-20 16:42:12,843 INFO L87 Difference]: Start difference. First operand has 31 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 states have internal predecessors, (41), 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 31 states. [2022-02-20 16:42:12,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:12,846 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2022-02-20 16:42:12,846 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2022-02-20 16:42:12,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:12,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:12,847 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:42:12,847 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:42:12,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 states have internal predecessors, (41), 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:12,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2022-02-20 16:42:12,851 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 10 [2022-02-20 16:42:12,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:42:12,851 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2022-02-20 16:42:12,851 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 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:12,852 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2022-02-20 16:42:12,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:42:12,852 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:42:12,852 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:42:12,871 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:13,071 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:13,072 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:42:13,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:42:13,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1279985196, now seen corresponding path program 1 times [2022-02-20 16:42:13,073 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:42:13,075 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1723461277] [2022-02-20 16:42:13,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:42:13,075 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:42:13,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:42:13,076 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:13,093 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:13,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:42:13,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 18 conjunts are in the unsatisfiable core [2022-02-20 16:42:13,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:42:13,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:42:22,900 INFO L290 TraceCheckUtils]: 0: Hoare triple {249#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)); {254#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:42:22,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {254#(= currentRoundingMode roundNearestTiesToEven)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~res~0#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {254#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:42:22,902 INFO L290 TraceCheckUtils]: 2: Hoare triple {254#(= currentRoundingMode roundNearestTiesToEven)} assume ~fp.lt~FLOAT(main_~x~0#1, ~fp.neg~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; {261#(and (fp.lt |ULTIMATE.start___ieee754_sqrtf_~x#1| (fp.neg (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:42:22,947 INFO L290 TraceCheckUtils]: 3: Hoare triple {261#(and (fp.lt |ULTIMATE.start___ieee754_sqrtf_~x#1| (fp.neg (_ +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; {265#(and (fp.lt |ULTIMATE.start___ieee754_sqrtf_~x#1| (fp.neg (_ +zero 8 24))) (= |ULTIMATE.start___ieee754_sqrtf_~x#1| (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|))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:42:22,948 INFO L290 TraceCheckUtils]: 4: Hoare triple {265#(and (fp.lt |ULTIMATE.start___ieee754_sqrtf_~x#1| (fp.neg (_ +zero 8 24))) (= |ULTIMATE.start___ieee754_sqrtf_~x#1| (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|))) (= currentRoundingMode roundNearestTiesToEven))} goto; {265#(and (fp.lt |ULTIMATE.start___ieee754_sqrtf_~x#1| (fp.neg (_ +zero 8 24))) (= |ULTIMATE.start___ieee754_sqrtf_~x#1| (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|))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:42:22,950 INFO L290 TraceCheckUtils]: 5: Hoare triple {265#(and (fp.lt |ULTIMATE.start___ieee754_sqrtf_~x#1| (fp.neg (_ +zero 8 24))) (= |ULTIMATE.start___ieee754_sqrtf_~x#1| (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|))) (= currentRoundingMode roundNearestTiesToEven))} __ieee754_sqrtf_~hx~0#1 := ~bvand32(2147483647bv32, __ieee754_sqrtf_~ix~0#1); {272#(and (fp.lt |ULTIMATE.start___ieee754_sqrtf_~x#1| (fp.neg (_ +zero 8 24))) (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|) (= |ULTIMATE.start___ieee754_sqrtf_~x#1| (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|))))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:42:23,040 INFO L290 TraceCheckUtils]: 6: Hoare triple {272#(and (fp.lt |ULTIMATE.start___ieee754_sqrtf_~x#1| (fp.neg (_ +zero 8 24))) (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|) (= |ULTIMATE.start___ieee754_sqrtf_~x#1| (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|))))) (= 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); {276#(exists ((|ULTIMATE.start___ieee754_sqrtf_~ix~0#1| (_ BitVec 32))) (and (fp.lt (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.neg (_ +zero 8 24))) (not (bvult (bvand (_ bv2147483647 32) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|) (_ bv2139095040 32))) (= (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven (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 ((_ 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 ((_ 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|))) |ULTIMATE.start___ieee754_sqrtf_#res#1|)))} is VALID [2022-02-20 16:42:23,091 INFO L290 TraceCheckUtils]: 7: Hoare triple {276#(exists ((|ULTIMATE.start___ieee754_sqrtf_~ix~0#1| (_ BitVec 32))) (and (fp.lt (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.neg (_ +zero 8 24))) (not (bvult (bvand (_ bv2147483647 32) |ULTIMATE.start___ieee754_sqrtf_~ix~0#1|) (_ bv2139095040 32))) (= (fp.add roundNearestTiesToEven (fp.mul roundNearestTiesToEven (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 ((_ 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 ((_ 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|))) |ULTIMATE.start___ieee754_sqrtf_#res#1|)))} main_#t~ret8#1 := __ieee754_sqrtf_#res#1;assume { :end_inline___ieee754_sqrtf } true;main_~res~0#1 := main_#t~ret8#1;havoc main_#t~ret8#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); {280#(= (_ bv1 32) |ULTIMATE.start_isnan_float_#res#1|)} is VALID [2022-02-20 16:42:23,092 INFO L290 TraceCheckUtils]: 8: Hoare triple {280#(= (_ bv1 32) |ULTIMATE.start_isnan_float_#res#1|)} main_#t~ret9#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true; {284#(= (_ bv1 32) |ULTIMATE.start_main_#t~ret9#1|)} is VALID [2022-02-20 16:42:23,092 INFO L290 TraceCheckUtils]: 9: Hoare triple {284#(= (_ bv1 32) |ULTIMATE.start_main_#t~ret9#1|)} assume 0bv32 == main_#t~ret9#1;havoc main_#t~ret9#1; {250#false} is VALID [2022-02-20 16:42:23,093 INFO L290 TraceCheckUtils]: 10: Hoare triple {250#false} assume !false; {250#false} is VALID [2022-02-20 16:42:23,093 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:23,093 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:42:23,093 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:42:23,093 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1723461277] [2022-02-20 16:42:23,094 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1723461277] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:42:23,094 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:42:23,094 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 16:42:23,094 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001789406] [2022-02-20 16:42:23,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:42:23,095 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 16:42:23,095 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:42:23,096 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:23,587 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:42:23,587 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 16:42:23,587 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:42:23,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 16:42:23,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=50, Unknown=2, NotChecked=0, Total=72 [2022-02-20 16:42:23,588 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:55,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:55,127 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-02-20 16:42:55,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 16:42:55,128 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 16:42:55,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:42:55,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:55,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 45 transitions. [2022-02-20 16:42:55,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:55,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 45 transitions. [2022-02-20 16:42:55,131 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 45 transitions. [2022-02-20 16:42:55,666 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:42:55,668 INFO L225 Difference]: With dead ends: 36 [2022-02-20 16:42:55,668 INFO L226 Difference]: Without dead ends: 31 [2022-02-20 16:42:55,669 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=30, Invalid=77, Unknown=3, NotChecked=0, Total=110 [2022-02-20 16:42:55,670 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 6 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 14 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-02-20 16:42:55,670 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 180 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 14 Unchecked, 2.6s Time] [2022-02-20 16:42:55,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-02-20 16:42:55,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-02-20 16:42:55,673 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:42:55,674 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 30 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:55,674 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 30 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:55,675 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 30 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:55,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:55,677 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2022-02-20 16:42:55,677 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 40 transitions. [2022-02-20 16:42:55,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:55,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:55,678 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 30 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 31 states. [2022-02-20 16:42:55,678 INFO L87 Difference]: Start difference. First operand has 31 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 30 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 31 states. [2022-02-20 16:42:55,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:55,680 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2022-02-20 16:42:55,680 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 40 transitions. [2022-02-20 16:42:55,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:55,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:55,681 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:42:55,681 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:42:55,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 30 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:55,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 40 transitions. [2022-02-20 16:42:55,683 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 40 transitions. Word has length 11 [2022-02-20 16:42:55,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:42:55,683 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 40 transitions. [2022-02-20 16:42:55,683 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:55,684 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 40 transitions. [2022-02-20 16:42:55,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 16:42:55,684 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:42:55,684 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:42:55,695 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:55,887 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:55,888 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:42:55,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:42:55,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1000761490, now seen corresponding path program 1 times [2022-02-20 16:42:55,893 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:42:55,894 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1586584113] [2022-02-20 16:42:55,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:42:55,894 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:42:55,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:42:55,895 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:55,898 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:55,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:42:55,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 16:42:55,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:42:55,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:42:59,959 INFO L290 TraceCheckUtils]: 0: Hoare triple {437#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)); {437#true} is VALID [2022-02-20 16:42:59,959 INFO L290 TraceCheckUtils]: 1: Hoare triple {437#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet7#1, main_#t~ret8#1, main_#t~ret9#1, main_~res~0#1, main_~x~0#1;main_~x~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {437#true} is VALID [2022-02-20 16:42:59,960 INFO L290 TraceCheckUtils]: 2: Hoare triple {437#true} assume ~fp.lt~FLOAT(main_~x~0#1, ~fp.neg~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; {448#(fp.lt |ULTIMATE.start___ieee754_sqrtf_~x#1| (fp.neg (_ +zero 8 24)))} is VALID [2022-02-20 16:42:59,963 INFO L290 TraceCheckUtils]: 3: Hoare triple {448#(fp.lt |ULTIMATE.start___ieee754_sqrtf_~x#1| (fp.neg (_ +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; {452#(fp.lt (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.neg (_ +zero 8 24)))} is VALID [2022-02-20 16:42:59,963 INFO L290 TraceCheckUtils]: 4: Hoare triple {452#(fp.lt (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.neg (_ +zero 8 24)))} goto; {452#(fp.lt (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.neg (_ +zero 8 24)))} is VALID [2022-02-20 16:42:59,964 INFO L290 TraceCheckUtils]: 5: Hoare triple {452#(fp.lt (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.neg (_ +zero 8 24)))} __ieee754_sqrtf_~hx~0#1 := ~bvand32(2147483647bv32, __ieee754_sqrtf_~ix~0#1); {459#(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|) (fp.lt (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.neg (_ +zero 8 24)))))} is VALID [2022-02-20 16:42:59,965 INFO L290 TraceCheckUtils]: 6: Hoare triple {459#(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|) (fp.lt (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.neg (_ +zero 8 24)))))} assume !!~bvult32(__ieee754_sqrtf_~hx~0#1, 2139095040bv32); {459#(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|) (fp.lt (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.neg (_ +zero 8 24)))))} is VALID [2022-02-20 16:42:59,966 INFO L290 TraceCheckUtils]: 7: Hoare triple {459#(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|) (fp.lt (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.neg (_ +zero 8 24)))))} assume 0bv32 == __ieee754_sqrtf_~hx~0#1;__ieee754_sqrtf_#res#1 := __ieee754_sqrtf_~x#1; {438#false} is VALID [2022-02-20 16:42:59,966 INFO L290 TraceCheckUtils]: 8: Hoare triple {438#false} main_#t~ret8#1 := __ieee754_sqrtf_#res#1;assume { :end_inline___ieee754_sqrtf } true;main_~res~0#1 := main_#t~ret8#1;havoc main_#t~ret8#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); {438#false} is VALID [2022-02-20 16:42:59,966 INFO L290 TraceCheckUtils]: 9: Hoare triple {438#false} main_#t~ret9#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true; {438#false} is VALID [2022-02-20 16:42:59,966 INFO L290 TraceCheckUtils]: 10: Hoare triple {438#false} assume 0bv32 == main_#t~ret9#1;havoc main_#t~ret9#1; {438#false} is VALID [2022-02-20 16:42:59,967 INFO L290 TraceCheckUtils]: 11: Hoare triple {438#false} assume !false; {438#false} is VALID [2022-02-20 16:42:59,967 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:59,967 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:42:59,967 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:42:59,967 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1586584113] [2022-02-20 16:42:59,967 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1586584113] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:42:59,968 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:42:59,968 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:42:59,968 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983178993] [2022-02-20 16:42:59,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:42:59,968 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 12 [2022-02-20 16:42:59,969 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:42:59,969 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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:59,986 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:42:59,986 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:42:59,986 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:42:59,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:42:59,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=12, Unknown=1, NotChecked=0, Total=20 [2022-02-20 16:42:59,987 INFO L87 Difference]: Start difference. First operand 31 states and 40 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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)