./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_0831.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_0831.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 ae08d3dbde40e32197902417be767e9b8a44048ec2abbe937f73d3dc278c75f1 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:42:42,270 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:42:42,272 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:42:42,291 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:42:42,291 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:42:42,292 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:42:42,293 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:42:42,294 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:42:42,298 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:42:42,302 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:42:42,303 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:42:42,305 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:42:42,305 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:42:42,307 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:42:42,309 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:42:42,310 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:42:42,311 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:42:42,312 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:42:42,315 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:42:42,317 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:42:42,320 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:42:42,321 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:42:42,322 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:42:42,323 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:42:42,327 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:42:42,327 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:42:42,327 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:42:42,328 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:42:42,328 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:42:42,328 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:42:42,329 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:42:42,329 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:42:42,329 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:42:42,330 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:42:42,330 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:42:42,331 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:42:42,331 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:42:42,331 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:42:42,331 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:42:42,332 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:42:42,332 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:42:42,334 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 16:42:42,356 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:42:42,356 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:42:42,356 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:42:42,356 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:42:42,357 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:42:42,357 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:42:42,357 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:42:42,358 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:42:42,358 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:42:42,358 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:42:42,358 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:42:42,358 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:42:42,358 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:42:42,358 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:42:42,359 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:42:42,359 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:42:42,359 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:42:42,359 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:42:42,359 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:42:42,359 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:42:42,359 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:42:42,360 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:42:42,360 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:42:42,360 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:42:42,360 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:42:42,360 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:42:42,360 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:42:42,362 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:42:42,362 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:42:42,362 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:42:42,362 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:42:42,362 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:42:42,363 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:42:42,363 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 -> ae08d3dbde40e32197902417be767e9b8a44048ec2abbe937f73d3dc278c75f1 [2022-02-20 16:42:42,587 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:42:42,604 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:42:42,606 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:42:42,607 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:42:42,607 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:42:42,613 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0831.c [2022-02-20 16:42:42,658 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16f4e57cd/e8fb77c4657b46ed8529bee1c8caeda2/FLAG77e81856e [2022-02-20 16:42:43,047 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:42:43,048 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0831.c [2022-02-20 16:42:43,055 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16f4e57cd/e8fb77c4657b46ed8529bee1c8caeda2/FLAG77e81856e [2022-02-20 16:42:43,067 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16f4e57cd/e8fb77c4657b46ed8529bee1c8caeda2 [2022-02-20 16:42:43,069 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:42:43,070 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:42:43,074 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:42:43,074 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:42:43,077 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:42:43,081 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:42:43" (1/1) ... [2022-02-20 16:42:43,082 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f96578e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:43, skipping insertion in model container [2022-02-20 16:42:43,082 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:42:43" (1/1) ... [2022-02-20 16:42:43,087 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:42:43,106 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:42:43,336 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_0831.c[3205,3218] [2022-02-20 16:42:43,357 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:42:43,372 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:42:43,426 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_0831.c[3205,3218] [2022-02-20 16:42:43,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:42:43,448 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:42:43,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:43 WrapperNode [2022-02-20 16:42:43,452 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:42:43,454 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:42:43,454 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:42:43,454 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:42:43,482 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:43" (1/1) ... [2022-02-20 16:42:43,498 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:43" (1/1) ... [2022-02-20 16:42:43,548 INFO L137 Inliner]: procedures = 18, calls = 43, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 191 [2022-02-20 16:42:43,549 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:42:43,550 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:42:43,550 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:42:43,550 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:42:43,556 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:43" (1/1) ... [2022-02-20 16:42:43,556 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:43" (1/1) ... [2022-02-20 16:42:43,567 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:43" (1/1) ... [2022-02-20 16:42:43,568 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:43" (1/1) ... [2022-02-20 16:42:43,588 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:43" (1/1) ... [2022-02-20 16:42:43,592 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:43" (1/1) ... [2022-02-20 16:42:43,593 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:43" (1/1) ... [2022-02-20 16:42:43,595 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:42:43,598 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:42:43,598 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:42:43,598 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:42:43,599 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:43" (1/1) ... [2022-02-20 16:42:43,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:42:43,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:42:43,623 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:43,625 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:43,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:42:43,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:42:43,658 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:42:43,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:42:43,658 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-02-20 16:42:43,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-02-20 16:42:43,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:42:43,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:42:43,659 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:42:43,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-02-20 16:42:43,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:42:43,725 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:42:43,726 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:42:44,087 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:42:44,093 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:42:44,098 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2022-02-20 16:42:44,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:42:44 BoogieIcfgContainer [2022-02-20 16:42:44,101 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:42:44,102 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:42:44,102 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:42:44,105 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:42:44,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:42:43" (1/3) ... [2022-02-20 16:42:44,106 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25ca6b7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:42:44, skipping insertion in model container [2022-02-20 16:42:44,106 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:43" (2/3) ... [2022-02-20 16:42:44,106 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25ca6b7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:42:44, skipping insertion in model container [2022-02-20 16:42:44,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:42:44" (3/3) ... [2022-02-20 16:42:44,110 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_0831.c [2022-02-20 16:42:44,117 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:42:44,117 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:42:44,148 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:42:44,153 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:44,153 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:42:44,165 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 42 states have (on average 1.7380952380952381) internal successors, (73), 43 states have internal predecessors, (73), 0 states have call successors, (0), 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:44,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 16:42:44,168 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:42:44,169 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:42:44,169 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:42:44,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:42:44,173 INFO L85 PathProgramCache]: Analyzing trace with hash -879963233, now seen corresponding path program 1 times [2022-02-20 16:42:44,180 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:42:44,180 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123611250] [2022-02-20 16:42:44,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:42:44,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:42:44,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:42:44,308 INFO L290 TraceCheckUtils]: 0: Hoare triple {47#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_exp~0 := 1.0;~#halF_exp~0.base, ~#halF_exp~0.offset := 4, 0;call #Ultimate.allocInit(8, 4);call write~init~real(0.5, ~#halF_exp~0.base, ~#halF_exp~0.offset, 4);call write~init~real(~someUnaryDOUBLEoperation(0.5), ~#halF_exp~0.base, 4 + ~#halF_exp~0.offset, 4);~huge_exp~0 := 1.0E30;~twom100_exp~0 := 7.8886090522E-31;~#ln2HI_exp~0.base, ~#ln2HI_exp~0.offset := 5, 0;call #Ultimate.allocInit(8, 5);call write~init~real(0.69313812256, ~#ln2HI_exp~0.base, ~#ln2HI_exp~0.offset, 4);call write~init~real(~someUnaryDOUBLEoperation(0.69313812256), ~#ln2HI_exp~0.base, 4 + ~#ln2HI_exp~0.offset, 4);~#ln2LO_exp~0.base, ~#ln2LO_exp~0.offset := 6, 0;call #Ultimate.allocInit(8, 6);call write~init~real(9.0580006145E-6, ~#ln2LO_exp~0.base, ~#ln2LO_exp~0.offset, 4);call write~init~real(~someUnaryDOUBLEoperation(9.0580006145E-6), ~#ln2LO_exp~0.base, 4 + ~#ln2LO_exp~0.offset, 4);~invln2_exp~0 := 1.4426950216;~P1_exp~0 := 0.16666667163;~P2_exp~0 := ~someUnaryDOUBLEoperation(0.002777777845);~P3_exp~0 := 6.613755977E-5;~P4_exp~0 := ~someUnaryDOUBLEoperation(1.6533901999E-6);~P5_exp~0 := 4.1381369442E-8; {47#true} is VALID [2022-02-20 16:42:44,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {47#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret17#1, main_#t~ret18#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0);assume { :begin_inline___ieee754_expf } true;__ieee754_expf_#in~x#1 := main_~x~0#1;havoc __ieee754_expf_#res#1;havoc __ieee754_expf_#t~mem4#1, __ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset, __ieee754_expf_#t~ite7#1, __ieee754_expf_#t~mem8#1, __ieee754_expf_#t~mem9#1, __ieee754_expf_#t~mem10#1, __ieee754_expf_#t~mem11#1, __ieee754_expf_#t~mem12#1, __ieee754_expf_#t~mem13#1, __ieee754_expf_~#gf_u~1#1.base, __ieee754_expf_~#gf_u~1#1.offset, __ieee754_expf_#t~mem14#1, __ieee754_expf_~#sf_u~0#1.base, __ieee754_expf_~#sf_u~0#1.offset, __ieee754_expf_~hy~0#1, __ieee754_expf_#t~mem15#1, __ieee754_expf_~#gf_u~2#1.base, __ieee754_expf_~#gf_u~2#1.offset, __ieee754_expf_#t~mem16#1, __ieee754_expf_~#sf_u~1#1.base, __ieee754_expf_~#sf_u~1#1.offset, __ieee754_expf_~hy~1#1, __ieee754_expf_~x#1, __ieee754_expf_~y~0#1, __ieee754_expf_~hi~0#1, __ieee754_expf_~lo~0#1, __ieee754_expf_~c~0#1, __ieee754_expf_~t~0#1, __ieee754_expf_~k~0#1, __ieee754_expf_~xsb~0#1, __ieee754_expf_~sx~0#1, __ieee754_expf_~hx~0#1, __ieee754_expf_#t~nondet5#1, __ieee754_expf_#t~nondet6#1;__ieee754_expf_~x#1 := __ieee754_expf_#in~x#1;havoc __ieee754_expf_~y~0#1;havoc __ieee754_expf_~hi~0#1;havoc __ieee754_expf_~lo~0#1;havoc __ieee754_expf_~c~0#1;havoc __ieee754_expf_~t~0#1;__ieee754_expf_~k~0#1 := 0;havoc __ieee754_expf_~xsb~0#1;havoc __ieee754_expf_~sx~0#1;havoc __ieee754_expf_~hx~0#1; {47#true} is VALID [2022-02-20 16:42:44,310 INFO L290 TraceCheckUtils]: 2: Hoare triple {47#true} assume !true; {48#false} is VALID [2022-02-20 16:42:44,310 INFO L290 TraceCheckUtils]: 3: Hoare triple {48#false} assume 0 == (if __ieee754_expf_~sx~0#1 >= 0 then 0 else 1);__ieee754_expf_~xsb~0#1 := 0; {48#false} is VALID [2022-02-20 16:42:44,310 INFO L290 TraceCheckUtils]: 4: Hoare triple {48#false} assume 0 == __ieee754_expf_~sx~0#1;__ieee754_expf_~hx~0#1 := 0; {48#false} is VALID [2022-02-20 16:42:44,310 INFO L290 TraceCheckUtils]: 5: Hoare triple {48#false} assume __ieee754_expf_~hx~0#1 % 4294967296 > 2139095040;__ieee754_expf_#res#1 := ~someBinaryArithmeticFLOAToperation(__ieee754_expf_~x#1, __ieee754_expf_~x#1); {48#false} is VALID [2022-02-20 16:42:44,311 INFO L290 TraceCheckUtils]: 6: Hoare triple {48#false} main_#t~ret17#1 := __ieee754_expf_#res#1;assume { :end_inline___ieee754_expf } true;main_~res~0#1 := main_#t~ret17#1;havoc main_#t~ret17#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); {48#false} is VALID [2022-02-20 16:42:44,311 INFO L290 TraceCheckUtils]: 7: Hoare triple {48#false} main_#t~ret18#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true;assume -2147483648 <= main_#t~ret18#1 && main_#t~ret18#1 <= 2147483647; {48#false} is VALID [2022-02-20 16:42:44,311 INFO L290 TraceCheckUtils]: 8: Hoare triple {48#false} assume 0 == main_#t~ret18#1;havoc main_#t~ret18#1; {48#false} is VALID [2022-02-20 16:42:44,311 INFO L290 TraceCheckUtils]: 9: Hoare triple {48#false} assume !false; {48#false} is VALID [2022-02-20 16:42:44,312 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:44,313 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:42:44,313 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123611250] [2022-02-20 16:42:44,314 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123611250] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:42:44,314 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:42:44,314 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:42:44,315 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756054544] [2022-02-20 16:42:44,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:42:44,320 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:44,322 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:42:44,324 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:44,337 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:44,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:42:44,338 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:42:44,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:42:44,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:42:44,358 INFO L87 Difference]: Start difference. First operand has 44 states, 42 states have (on average 1.7380952380952381) internal successors, (73), 43 states have internal predecessors, (73), 0 states have call successors, (0), 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:44,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:44,428 INFO L93 Difference]: Finished difference Result 85 states and 142 transitions. [2022-02-20 16:42:44,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:42:44,428 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:44,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:42:44,429 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:44,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 142 transitions. [2022-02-20 16:42:44,437 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:44,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 142 transitions. [2022-02-20 16:42:44,440 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 142 transitions. [2022-02-20 16:42:44,567 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:42:44,573 INFO L225 Difference]: With dead ends: 85 [2022-02-20 16:42:44,573 INFO L226 Difference]: Without dead ends: 40 [2022-02-20 16:42:44,575 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:44,577 INFO L933 BasicCegarLoop]: 57 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, 57 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:44,578 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 57 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:44,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-02-20 16:42:44,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-02-20 16:42:44,596 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:42:44,597 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 40 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 39 states have internal predecessors, (54), 0 states have call successors, (0), 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:44,597 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 40 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 39 states have internal predecessors, (54), 0 states have call successors, (0), 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:44,598 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 40 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 39 states have internal predecessors, (54), 0 states have call successors, (0), 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:44,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:44,600 INFO L93 Difference]: Finished difference Result 40 states and 54 transitions. [2022-02-20 16:42:44,600 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 54 transitions. [2022-02-20 16:42:44,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:44,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:44,601 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 39 states have internal predecessors, (54), 0 states have call successors, (0), 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 40 states. [2022-02-20 16:42:44,602 INFO L87 Difference]: Start difference. First operand has 40 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 39 states have internal predecessors, (54), 0 states have call successors, (0), 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 40 states. [2022-02-20 16:42:44,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:44,604 INFO L93 Difference]: Finished difference Result 40 states and 54 transitions. [2022-02-20 16:42:44,604 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 54 transitions. [2022-02-20 16:42:44,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:44,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:44,604 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:42:44,605 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:42:44,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 39 states have internal predecessors, (54), 0 states have call successors, (0), 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:44,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 54 transitions. [2022-02-20 16:42:44,607 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 54 transitions. Word has length 10 [2022-02-20 16:42:44,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:42:44,608 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 54 transitions. [2022-02-20 16:42:44,608 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:44,608 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 54 transitions. [2022-02-20 16:42:44,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:42:44,609 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:42:44,609 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:42:44,609 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:42:44,609 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:42:44,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:42:44,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1079696866, now seen corresponding path program 1 times [2022-02-20 16:42:44,610 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:42:44,610 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222857511] [2022-02-20 16:42:44,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:42:44,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:42:44,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:42:44,667 INFO L290 TraceCheckUtils]: 0: Hoare triple {273#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_exp~0 := 1.0;~#halF_exp~0.base, ~#halF_exp~0.offset := 4, 0;call #Ultimate.allocInit(8, 4);call write~init~real(0.5, ~#halF_exp~0.base, ~#halF_exp~0.offset, 4);call write~init~real(~someUnaryDOUBLEoperation(0.5), ~#halF_exp~0.base, 4 + ~#halF_exp~0.offset, 4);~huge_exp~0 := 1.0E30;~twom100_exp~0 := 7.8886090522E-31;~#ln2HI_exp~0.base, ~#ln2HI_exp~0.offset := 5, 0;call #Ultimate.allocInit(8, 5);call write~init~real(0.69313812256, ~#ln2HI_exp~0.base, ~#ln2HI_exp~0.offset, 4);call write~init~real(~someUnaryDOUBLEoperation(0.69313812256), ~#ln2HI_exp~0.base, 4 + ~#ln2HI_exp~0.offset, 4);~#ln2LO_exp~0.base, ~#ln2LO_exp~0.offset := 6, 0;call #Ultimate.allocInit(8, 6);call write~init~real(9.0580006145E-6, ~#ln2LO_exp~0.base, ~#ln2LO_exp~0.offset, 4);call write~init~real(~someUnaryDOUBLEoperation(9.0580006145E-6), ~#ln2LO_exp~0.base, 4 + ~#ln2LO_exp~0.offset, 4);~invln2_exp~0 := 1.4426950216;~P1_exp~0 := 0.16666667163;~P2_exp~0 := ~someUnaryDOUBLEoperation(0.002777777845);~P3_exp~0 := 6.613755977E-5;~P4_exp~0 := ~someUnaryDOUBLEoperation(1.6533901999E-6);~P5_exp~0 := 4.1381369442E-8; {273#true} is VALID [2022-02-20 16:42:44,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {273#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret17#1, main_#t~ret18#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0);assume { :begin_inline___ieee754_expf } true;__ieee754_expf_#in~x#1 := main_~x~0#1;havoc __ieee754_expf_#res#1;havoc __ieee754_expf_#t~mem4#1, __ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset, __ieee754_expf_#t~ite7#1, __ieee754_expf_#t~mem8#1, __ieee754_expf_#t~mem9#1, __ieee754_expf_#t~mem10#1, __ieee754_expf_#t~mem11#1, __ieee754_expf_#t~mem12#1, __ieee754_expf_#t~mem13#1, __ieee754_expf_~#gf_u~1#1.base, __ieee754_expf_~#gf_u~1#1.offset, __ieee754_expf_#t~mem14#1, __ieee754_expf_~#sf_u~0#1.base, __ieee754_expf_~#sf_u~0#1.offset, __ieee754_expf_~hy~0#1, __ieee754_expf_#t~mem15#1, __ieee754_expf_~#gf_u~2#1.base, __ieee754_expf_~#gf_u~2#1.offset, __ieee754_expf_#t~mem16#1, __ieee754_expf_~#sf_u~1#1.base, __ieee754_expf_~#sf_u~1#1.offset, __ieee754_expf_~hy~1#1, __ieee754_expf_~x#1, __ieee754_expf_~y~0#1, __ieee754_expf_~hi~0#1, __ieee754_expf_~lo~0#1, __ieee754_expf_~c~0#1, __ieee754_expf_~t~0#1, __ieee754_expf_~k~0#1, __ieee754_expf_~xsb~0#1, __ieee754_expf_~sx~0#1, __ieee754_expf_~hx~0#1, __ieee754_expf_#t~nondet5#1, __ieee754_expf_#t~nondet6#1;__ieee754_expf_~x#1 := __ieee754_expf_#in~x#1;havoc __ieee754_expf_~y~0#1;havoc __ieee754_expf_~hi~0#1;havoc __ieee754_expf_~lo~0#1;havoc __ieee754_expf_~c~0#1;havoc __ieee754_expf_~t~0#1;__ieee754_expf_~k~0#1 := 0;havoc __ieee754_expf_~xsb~0#1;havoc __ieee754_expf_~sx~0#1;havoc __ieee754_expf_~hx~0#1; {273#true} is VALID [2022-02-20 16:42:44,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {273#true} call __ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4);call write~real(__ieee754_expf_~x#1, __ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset, 4);call __ieee754_expf_#t~mem4#1 := read~int(__ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset, 4);__ieee754_expf_~sx~0#1 := (if __ieee754_expf_#t~mem4#1 % 4294967296 % 4294967296 <= 2147483647 then __ieee754_expf_#t~mem4#1 % 4294967296 % 4294967296 else __ieee754_expf_#t~mem4#1 % 4294967296 % 4294967296 - 4294967296);havoc __ieee754_expf_#t~mem4#1;call ULTIMATE.dealloc(__ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset);havoc __ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset; {273#true} is VALID [2022-02-20 16:42:44,668 INFO L290 TraceCheckUtils]: 3: Hoare triple {273#true} goto; {273#true} is VALID [2022-02-20 16:42:44,668 INFO L290 TraceCheckUtils]: 4: Hoare triple {273#true} assume 0 == (if __ieee754_expf_~sx~0#1 >= 0 then 0 else 1);__ieee754_expf_~xsb~0#1 := 0; {273#true} is VALID [2022-02-20 16:42:44,668 INFO L290 TraceCheckUtils]: 5: Hoare triple {273#true} assume 0 == __ieee754_expf_~sx~0#1;__ieee754_expf_~hx~0#1 := 0; {275#(= |ULTIMATE.start___ieee754_expf_~hx~0#1| 0)} is VALID [2022-02-20 16:42:44,669 INFO L290 TraceCheckUtils]: 6: Hoare triple {275#(= |ULTIMATE.start___ieee754_expf_~hx~0#1| 0)} assume __ieee754_expf_~hx~0#1 % 4294967296 > 2139095040;__ieee754_expf_#res#1 := ~someBinaryArithmeticFLOAToperation(__ieee754_expf_~x#1, __ieee754_expf_~x#1); {274#false} is VALID [2022-02-20 16:42:44,669 INFO L290 TraceCheckUtils]: 7: Hoare triple {274#false} main_#t~ret17#1 := __ieee754_expf_#res#1;assume { :end_inline___ieee754_expf } true;main_~res~0#1 := main_#t~ret17#1;havoc main_#t~ret17#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); {274#false} is VALID [2022-02-20 16:42:44,669 INFO L290 TraceCheckUtils]: 8: Hoare triple {274#false} main_#t~ret18#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true;assume -2147483648 <= main_#t~ret18#1 && main_#t~ret18#1 <= 2147483647; {274#false} is VALID [2022-02-20 16:42:44,669 INFO L290 TraceCheckUtils]: 9: Hoare triple {274#false} assume 0 == main_#t~ret18#1;havoc main_#t~ret18#1; {274#false} is VALID [2022-02-20 16:42:44,670 INFO L290 TraceCheckUtils]: 10: Hoare triple {274#false} assume !false; {274#false} is VALID [2022-02-20 16:42:44,670 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:44,670 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:42:44,670 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222857511] [2022-02-20 16:42:44,670 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222857511] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:42:44,670 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:42:44,671 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:42:44,671 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900003662] [2022-02-20 16:42:44,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:42:44,672 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:44,672 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:42:44,672 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:44,682 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:44,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:42:44,682 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:42:44,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:42:44,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:42:44,683 INFO L87 Difference]: Start difference. First operand 40 states and 54 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:44,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:44,808 INFO L93 Difference]: Finished difference Result 87 states and 112 transitions. [2022-02-20 16:42:44,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:42:44,808 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:44,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:42:44,809 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:44,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2022-02-20 16:42:44,811 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:44,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2022-02-20 16:42:44,812 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 112 transitions. [2022-02-20 16:42:44,907 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:42:44,909 INFO L225 Difference]: With dead ends: 87 [2022-02-20 16:42:44,909 INFO L226 Difference]: Without dead ends: 65 [2022-02-20 16:42:44,910 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:44,911 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 28 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:42:44,911 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 87 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:42:44,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-02-20 16:42:44,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 46. [2022-02-20 16:42:44,915 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:42:44,916 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 46 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 45 states have internal predecessors, (61), 0 states have call successors, (0), 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:44,916 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 46 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 45 states have internal predecessors, (61), 0 states have call successors, (0), 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:44,916 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 46 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 45 states have internal predecessors, (61), 0 states have call successors, (0), 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:44,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:44,919 INFO L93 Difference]: Finished difference Result 65 states and 82 transitions. [2022-02-20 16:42:44,919 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 82 transitions. [2022-02-20 16:42:44,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:44,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:44,920 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 45 states have internal predecessors, (61), 0 states have call successors, (0), 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 65 states. [2022-02-20 16:42:44,920 INFO L87 Difference]: Start difference. First operand has 46 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 45 states have internal predecessors, (61), 0 states have call successors, (0), 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 65 states. [2022-02-20 16:42:44,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:44,922 INFO L93 Difference]: Finished difference Result 65 states and 82 transitions. [2022-02-20 16:42:44,922 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 82 transitions. [2022-02-20 16:42:44,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:44,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:44,923 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:42:44,923 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:42:44,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 45 states have internal predecessors, (61), 0 states have call successors, (0), 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:44,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 61 transitions. [2022-02-20 16:42:44,925 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 61 transitions. Word has length 11 [2022-02-20 16:42:44,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:42:44,925 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 61 transitions. [2022-02-20 16:42:44,925 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:44,926 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 61 transitions. [2022-02-20 16:42:44,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 16:42:44,926 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:42:44,926 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:42:44,926 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:42:44,927 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:42:44,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:42:44,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1499402311, now seen corresponding path program 1 times [2022-02-20 16:42:44,927 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:42:44,928 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205791564] [2022-02-20 16:42:44,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:42:44,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:42:44,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:42:44,993 INFO L290 TraceCheckUtils]: 0: Hoare triple {559#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_exp~0 := 1.0;~#halF_exp~0.base, ~#halF_exp~0.offset := 4, 0;call #Ultimate.allocInit(8, 4);call write~init~real(0.5, ~#halF_exp~0.base, ~#halF_exp~0.offset, 4);call write~init~real(~someUnaryDOUBLEoperation(0.5), ~#halF_exp~0.base, 4 + ~#halF_exp~0.offset, 4);~huge_exp~0 := 1.0E30;~twom100_exp~0 := 7.8886090522E-31;~#ln2HI_exp~0.base, ~#ln2HI_exp~0.offset := 5, 0;call #Ultimate.allocInit(8, 5);call write~init~real(0.69313812256, ~#ln2HI_exp~0.base, ~#ln2HI_exp~0.offset, 4);call write~init~real(~someUnaryDOUBLEoperation(0.69313812256), ~#ln2HI_exp~0.base, 4 + ~#ln2HI_exp~0.offset, 4);~#ln2LO_exp~0.base, ~#ln2LO_exp~0.offset := 6, 0;call #Ultimate.allocInit(8, 6);call write~init~real(9.0580006145E-6, ~#ln2LO_exp~0.base, ~#ln2LO_exp~0.offset, 4);call write~init~real(~someUnaryDOUBLEoperation(9.0580006145E-6), ~#ln2LO_exp~0.base, 4 + ~#ln2LO_exp~0.offset, 4);~invln2_exp~0 := 1.4426950216;~P1_exp~0 := 0.16666667163;~P2_exp~0 := ~someUnaryDOUBLEoperation(0.002777777845);~P3_exp~0 := 6.613755977E-5;~P4_exp~0 := ~someUnaryDOUBLEoperation(1.6533901999E-6);~P5_exp~0 := 4.1381369442E-8; {559#true} is VALID [2022-02-20 16:42:44,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {559#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret17#1, main_#t~ret18#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0);assume { :begin_inline___ieee754_expf } true;__ieee754_expf_#in~x#1 := main_~x~0#1;havoc __ieee754_expf_#res#1;havoc __ieee754_expf_#t~mem4#1, __ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset, __ieee754_expf_#t~ite7#1, __ieee754_expf_#t~mem8#1, __ieee754_expf_#t~mem9#1, __ieee754_expf_#t~mem10#1, __ieee754_expf_#t~mem11#1, __ieee754_expf_#t~mem12#1, __ieee754_expf_#t~mem13#1, __ieee754_expf_~#gf_u~1#1.base, __ieee754_expf_~#gf_u~1#1.offset, __ieee754_expf_#t~mem14#1, __ieee754_expf_~#sf_u~0#1.base, __ieee754_expf_~#sf_u~0#1.offset, __ieee754_expf_~hy~0#1, __ieee754_expf_#t~mem15#1, __ieee754_expf_~#gf_u~2#1.base, __ieee754_expf_~#gf_u~2#1.offset, __ieee754_expf_#t~mem16#1, __ieee754_expf_~#sf_u~1#1.base, __ieee754_expf_~#sf_u~1#1.offset, __ieee754_expf_~hy~1#1, __ieee754_expf_~x#1, __ieee754_expf_~y~0#1, __ieee754_expf_~hi~0#1, __ieee754_expf_~lo~0#1, __ieee754_expf_~c~0#1, __ieee754_expf_~t~0#1, __ieee754_expf_~k~0#1, __ieee754_expf_~xsb~0#1, __ieee754_expf_~sx~0#1, __ieee754_expf_~hx~0#1, __ieee754_expf_#t~nondet5#1, __ieee754_expf_#t~nondet6#1;__ieee754_expf_~x#1 := __ieee754_expf_#in~x#1;havoc __ieee754_expf_~y~0#1;havoc __ieee754_expf_~hi~0#1;havoc __ieee754_expf_~lo~0#1;havoc __ieee754_expf_~c~0#1;havoc __ieee754_expf_~t~0#1;__ieee754_expf_~k~0#1 := 0;havoc __ieee754_expf_~xsb~0#1;havoc __ieee754_expf_~sx~0#1;havoc __ieee754_expf_~hx~0#1; {559#true} is VALID [2022-02-20 16:42:44,993 INFO L290 TraceCheckUtils]: 2: Hoare triple {559#true} call __ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4);call write~real(__ieee754_expf_~x#1, __ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset, 4);call __ieee754_expf_#t~mem4#1 := read~int(__ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset, 4);__ieee754_expf_~sx~0#1 := (if __ieee754_expf_#t~mem4#1 % 4294967296 % 4294967296 <= 2147483647 then __ieee754_expf_#t~mem4#1 % 4294967296 % 4294967296 else __ieee754_expf_#t~mem4#1 % 4294967296 % 4294967296 - 4294967296);havoc __ieee754_expf_#t~mem4#1;call ULTIMATE.dealloc(__ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset);havoc __ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset; {559#true} is VALID [2022-02-20 16:42:44,993 INFO L290 TraceCheckUtils]: 3: Hoare triple {559#true} goto; {559#true} is VALID [2022-02-20 16:42:44,994 INFO L290 TraceCheckUtils]: 4: Hoare triple {559#true} assume 0 == (if __ieee754_expf_~sx~0#1 >= 0 then 0 else 1);__ieee754_expf_~xsb~0#1 := 0; {559#true} is VALID [2022-02-20 16:42:44,994 INFO L290 TraceCheckUtils]: 5: Hoare triple {559#true} assume 0 == __ieee754_expf_~sx~0#1;__ieee754_expf_~hx~0#1 := 0; {561#(<= |ULTIMATE.start___ieee754_expf_~sx~0#1| 0)} is VALID [2022-02-20 16:42:44,995 INFO L290 TraceCheckUtils]: 6: Hoare triple {561#(<= |ULTIMATE.start___ieee754_expf_~sx~0#1| 0)} assume !(__ieee754_expf_~hx~0#1 % 4294967296 > 2139095040); {561#(<= |ULTIMATE.start___ieee754_expf_~sx~0#1| 0)} is VALID [2022-02-20 16:42:44,995 INFO L290 TraceCheckUtils]: 7: Hoare triple {561#(<= |ULTIMATE.start___ieee754_expf_~sx~0#1| 0)} assume !(2139095040 == __ieee754_expf_~hx~0#1 % 4294967296); {561#(<= |ULTIMATE.start___ieee754_expf_~sx~0#1| 0)} is VALID [2022-02-20 16:42:44,996 INFO L290 TraceCheckUtils]: 8: Hoare triple {561#(<= |ULTIMATE.start___ieee754_expf_~sx~0#1| 0)} assume __ieee754_expf_~sx~0#1 > 1118925335;__ieee754_expf_#res#1 := ~someBinaryArithmeticFLOAToperation(~huge_exp~0, ~huge_exp~0); {560#false} is VALID [2022-02-20 16:42:44,996 INFO L290 TraceCheckUtils]: 9: Hoare triple {560#false} main_#t~ret17#1 := __ieee754_expf_#res#1;assume { :end_inline___ieee754_expf } true;main_~res~0#1 := main_#t~ret17#1;havoc main_#t~ret17#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); {560#false} is VALID [2022-02-20 16:42:44,996 INFO L290 TraceCheckUtils]: 10: Hoare triple {560#false} main_#t~ret18#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true;assume -2147483648 <= main_#t~ret18#1 && main_#t~ret18#1 <= 2147483647; {560#false} is VALID [2022-02-20 16:42:44,996 INFO L290 TraceCheckUtils]: 11: Hoare triple {560#false} assume 0 == main_#t~ret18#1;havoc main_#t~ret18#1; {560#false} is VALID [2022-02-20 16:42:44,996 INFO L290 TraceCheckUtils]: 12: Hoare triple {560#false} assume !false; {560#false} is VALID [2022-02-20 16:42:44,996 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:44,997 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:42:44,997 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205791564] [2022-02-20 16:42:44,997 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205791564] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:42:44,997 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:42:44,997 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:42:44,997 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006523114] [2022-02-20 16:42:44,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:42:44,998 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 16:42:44,998 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:42:44,998 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:45,007 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:42:45,008 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:42:45,008 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:42:45,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:42:45,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:42:45,009 INFO L87 Difference]: Start difference. First operand 46 states and 61 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:45,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:45,091 INFO L93 Difference]: Finished difference Result 84 states and 110 transitions. [2022-02-20 16:42:45,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:42:45,092 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 16:42:45,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:42:45,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:45,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2022-02-20 16:42:45,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:45,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2022-02-20 16:42:45,095 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 103 transitions. [2022-02-20 16:42:45,168 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:42:45,170 INFO L225 Difference]: With dead ends: 84 [2022-02-20 16:42:45,170 INFO L226 Difference]: Without dead ends: 79 [2022-02-20 16:42:45,171 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:45,171 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 42 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:42:45,172 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 104 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:42:45,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-02-20 16:42:45,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 53. [2022-02-20 16:42:45,191 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:42:45,192 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 53 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 52 states have internal predecessors, (71), 0 states have call successors, (0), 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:45,192 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 53 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 52 states have internal predecessors, (71), 0 states have call successors, (0), 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:45,192 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 53 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 52 states have internal predecessors, (71), 0 states have call successors, (0), 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:45,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:45,194 INFO L93 Difference]: Finished difference Result 79 states and 104 transitions. [2022-02-20 16:42:45,194 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 104 transitions. [2022-02-20 16:42:45,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:45,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:45,195 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 52 states have internal predecessors, (71), 0 states have call successors, (0), 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 79 states. [2022-02-20 16:42:45,195 INFO L87 Difference]: Start difference. First operand has 53 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 52 states have internal predecessors, (71), 0 states have call successors, (0), 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 79 states. [2022-02-20 16:42:45,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:45,197 INFO L93 Difference]: Finished difference Result 79 states and 104 transitions. [2022-02-20 16:42:45,197 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 104 transitions. [2022-02-20 16:42:45,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:45,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:45,198 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:42:45,198 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:42:45,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 52 states have internal predecessors, (71), 0 states have call successors, (0), 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:45,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 71 transitions. [2022-02-20 16:42:45,200 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 71 transitions. Word has length 13 [2022-02-20 16:42:45,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:42:45,200 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 71 transitions. [2022-02-20 16:42:45,200 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:45,201 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 71 transitions. [2022-02-20 16:42:45,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 16:42:45,201 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:42:45,201 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:42:45,201 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 16:42:45,202 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:42:45,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:42:45,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1894293076, now seen corresponding path program 1 times [2022-02-20 16:42:45,202 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:42:45,203 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406569255] [2022-02-20 16:42:45,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:42:45,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:42:45,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:42:45,236 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:42:45,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:42:45,268 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:42:45,268 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:42:45,269 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:42:45,270 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 16:42:45,272 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-02-20 16:42:45,274 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:42:45,301 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:42:45,302 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:42:45,302 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2022-02-20 16:42:45,302 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2022-02-20 16:42:45,302 WARN L170 areAnnotationChecker]: L43-1 has no Hoare annotation [2022-02-20 16:42:45,302 WARN L170 areAnnotationChecker]: L43-1 has no Hoare annotation [2022-02-20 16:42:45,302 WARN L170 areAnnotationChecker]: L43-3 has no Hoare annotation [2022-02-20 16:42:45,302 WARN L170 areAnnotationChecker]: L43-3 has no Hoare annotation [2022-02-20 16:42:45,302 WARN L170 areAnnotationChecker]: L48-7 has no Hoare annotation [2022-02-20 16:42:45,303 WARN L170 areAnnotationChecker]: L48-7 has no Hoare annotation [2022-02-20 16:42:45,303 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-02-20 16:42:45,303 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-02-20 16:42:45,303 WARN L170 areAnnotationChecker]: L49-7 has no Hoare annotation [2022-02-20 16:42:45,303 WARN L170 areAnnotationChecker]: L49-7 has no Hoare annotation [2022-02-20 16:42:45,303 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2022-02-20 16:42:45,303 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2022-02-20 16:42:45,303 WARN L170 areAnnotationChecker]: L48-3 has no Hoare annotation [2022-02-20 16:42:45,304 WARN L170 areAnnotationChecker]: L48-3 has no Hoare annotation [2022-02-20 16:42:45,304 WARN L170 areAnnotationChecker]: L109 has no Hoare annotation [2022-02-20 16:42:45,304 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-02-20 16:42:45,304 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-02-20 16:42:45,304 WARN L170 areAnnotationChecker]: L49-3 has no Hoare annotation [2022-02-20 16:42:45,304 WARN L170 areAnnotationChecker]: L49-3 has no Hoare annotation [2022-02-20 16:42:45,304 WARN L170 areAnnotationChecker]: L48-5 has no Hoare annotation [2022-02-20 16:42:45,304 WARN L170 areAnnotationChecker]: L48-5 has no Hoare annotation [2022-02-20 16:42:45,304 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-02-20 16:42:45,305 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-02-20 16:42:45,305 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-02-20 16:42:45,305 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-02-20 16:42:45,305 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-02-20 16:42:45,305 WARN L170 areAnnotationChecker]: L49-5 has no Hoare annotation [2022-02-20 16:42:45,305 WARN L170 areAnnotationChecker]: L49-5 has no Hoare annotation [2022-02-20 16:42:45,305 WARN L170 areAnnotationChecker]: L122 has no Hoare annotation [2022-02-20 16:42:45,305 WARN L170 areAnnotationChecker]: L122 has no Hoare annotation [2022-02-20 16:42:45,305 WARN L170 areAnnotationChecker]: L54-2 has no Hoare annotation [2022-02-20 16:42:45,306 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-02-20 16:42:45,306 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-02-20 16:42:45,306 WARN L170 areAnnotationChecker]: L123 has no Hoare annotation [2022-02-20 16:42:45,306 WARN L170 areAnnotationChecker]: L123 has no Hoare annotation [2022-02-20 16:42:45,306 WARN L170 areAnnotationChecker]: L127 has no Hoare annotation [2022-02-20 16:42:45,306 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2022-02-20 16:42:45,306 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2022-02-20 16:42:45,306 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:42:45,306 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2022-02-20 16:42:45,306 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2022-02-20 16:42:45,307 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-02-20 16:42:45,307 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-02-20 16:42:45,307 WARN L170 areAnnotationChecker]: L61-2 has no Hoare annotation [2022-02-20 16:42:45,307 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2022-02-20 16:42:45,307 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2022-02-20 16:42:45,307 WARN L170 areAnnotationChecker]: L72-2 has no Hoare annotation [2022-02-20 16:42:45,307 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2022-02-20 16:42:45,307 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2022-02-20 16:42:45,307 WARN L170 areAnnotationChecker]: L84 has no Hoare annotation [2022-02-20 16:42:45,308 WARN L170 areAnnotationChecker]: L84 has no Hoare annotation [2022-02-20 16:42:45,308 WARN L170 areAnnotationChecker]: L86-2 has no Hoare annotation [2022-02-20 16:42:45,308 WARN L170 areAnnotationChecker]: L86-2 has no Hoare annotation [2022-02-20 16:42:45,308 WARN L170 areAnnotationChecker]: L99-2 has no Hoare annotation [2022-02-20 16:42:45,308 WARN L170 areAnnotationChecker]: L99-2 has no Hoare annotation [2022-02-20 16:42:45,308 WARN L170 areAnnotationChecker]: L86-1 has no Hoare annotation [2022-02-20 16:42:45,308 WARN L170 areAnnotationChecker]: L86-1 has no Hoare annotation [2022-02-20 16:42:45,308 WARN L170 areAnnotationChecker]: L91-1 has no Hoare annotation [2022-02-20 16:42:45,308 WARN L170 areAnnotationChecker]: L91-1 has no Hoare annotation [2022-02-20 16:42:45,309 WARN L170 areAnnotationChecker]: L99-1 has no Hoare annotation [2022-02-20 16:42:45,309 WARN L170 areAnnotationChecker]: L99-1 has no Hoare annotation [2022-02-20 16:42:45,309 WARN L170 areAnnotationChecker]: L104-1 has no Hoare annotation [2022-02-20 16:42:45,309 WARN L170 areAnnotationChecker]: L104-1 has no Hoare annotation [2022-02-20 16:42:45,309 WARN L170 areAnnotationChecker]: L91 has no Hoare annotation [2022-02-20 16:42:45,309 WARN L170 areAnnotationChecker]: L91 has no Hoare annotation [2022-02-20 16:42:45,309 WARN L170 areAnnotationChecker]: L91-2 has no Hoare annotation [2022-02-20 16:42:45,309 WARN L170 areAnnotationChecker]: L104 has no Hoare annotation [2022-02-20 16:42:45,309 WARN L170 areAnnotationChecker]: L104 has no Hoare annotation [2022-02-20 16:42:45,310 WARN L170 areAnnotationChecker]: L104-2 has no Hoare annotation [2022-02-20 16:42:45,310 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:45,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:42:45 BoogieIcfgContainer [2022-02-20 16:42:45,311 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:42:45,311 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:42:45,311 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:42:45,311 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:42:45,312 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:44" (3/4) ... [2022-02-20 16:42:45,314 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 16:42:45,314 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:42:45,315 INFO L158 Benchmark]: Toolchain (without parser) took 2244.99ms. Allocated memory was 102.8MB in the beginning and 123.7MB in the end (delta: 21.0MB). Free memory was 68.3MB in the beginning and 95.2MB in the end (delta: -27.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:42:45,316 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 102.8MB. Free memory is still 84.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:42:45,316 INFO L158 Benchmark]: CACSL2BoogieTranslator took 378.63ms. Allocated memory is still 102.8MB. Free memory was 68.1MB in the beginning and 76.1MB in the end (delta: -7.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 16:42:45,316 INFO L158 Benchmark]: Boogie Procedure Inliner took 95.46ms. Allocated memory is still 102.8MB. Free memory was 76.1MB in the beginning and 73.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:42:45,317 INFO L158 Benchmark]: Boogie Preprocessor took 45.09ms. Allocated memory is still 102.8MB. Free memory was 73.3MB in the beginning and 71.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:42:45,317 INFO L158 Benchmark]: RCFGBuilder took 503.68ms. Allocated memory is still 102.8MB. Free memory was 71.2MB in the beginning and 51.9MB in the end (delta: 19.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-02-20 16:42:45,317 INFO L158 Benchmark]: TraceAbstraction took 1208.32ms. Allocated memory was 102.8MB in the beginning and 123.7MB in the end (delta: 21.0MB). Free memory was 51.5MB in the beginning and 95.2MB in the end (delta: -43.7MB). Peak memory consumption was 18.0MB. Max. memory is 16.1GB. [2022-02-20 16:42:45,318 INFO L158 Benchmark]: Witness Printer took 3.21ms. Allocated memory is still 123.7MB. Free memory is still 95.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:42:45,319 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.41ms. Allocated memory is still 102.8MB. Free memory is still 84.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 378.63ms. Allocated memory is still 102.8MB. Free memory was 68.1MB in the beginning and 76.1MB in the end (delta: -7.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 95.46ms. Allocated memory is still 102.8MB. Free memory was 76.1MB in the beginning and 73.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.09ms. Allocated memory is still 102.8MB. Free memory was 73.3MB in the beginning and 71.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 503.68ms. Allocated memory is still 102.8MB. Free memory was 71.2MB in the beginning and 51.9MB in the end (delta: 19.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1208.32ms. Allocated memory was 102.8MB in the beginning and 123.7MB in the end (delta: 21.0MB). Free memory was 51.5MB in the beginning and 95.2MB in the end (delta: -43.7MB). Peak memory consumption was 18.0MB. Max. memory is 16.1GB. * Witness Printer took 3.21ms. Allocated memory is still 123.7MB. Free memory is still 95.2MB. 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: 123]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 15, overapproximation of someUnaryDOUBLEoperation at line 21, overapproximation of someBinaryArithmeticFLOAToperation at line 52. Possible FailurePath: [L17-L36] static const float one_exp = 1.0, halF_exp[2] = { 0.5, -0.5, }, huge_exp = 1.0e+30, twom100_exp = 7.8886090522e-31, ln2HI_exp[2] = { 6.9313812256e-01, -6.9313812256e-01, }, ln2LO_exp[2] = { 9.0580006145e-06, -9.0580006145e-06, }, invln2_exp = 1.4426950216e+00, P1_exp = 1.6666667163e-01, P2_exp = -2.7777778450e-03, P3_exp = 6.6137559770e-05, P4_exp = -1.6533901999e-06, P5_exp = 4.1381369442e-08; VAL [halF_exp={4:0}, huge_exp=1000000000000000000000000000000, invln2_exp=1803368777/1250000000, ln2HI_exp={5:0}, ln2LO_exp={6:0}, one_exp=1, P1_exp=16666667163/100000000000, P3_exp=6613755977/100000000000000, P5_exp=20690684721/500000000000000000, twom100_exp=39443045261/50000000000000000000000000000000000000000] [L118] float x = 0.0f / 0.0f; [L119] CALL, EXPR __ieee754_expf(x) [L39] float y, hi, lo, c, t; [L40] __int32_t k = 0, xsb, sx; [L41] __uint32_t hx; VAL [\old(x)=1000000000000000000000000000001, halF_exp={4:0}, huge_exp=1000000000000000000000000000000, invln2_exp=1803368777/1250000000, k=0, ln2HI_exp={5:0}, ln2LO_exp={6:0}, one_exp=1, P1_exp=16666667163/100000000000, P3_exp=6613755977/100000000000000, P5_exp=20690684721/500000000000000000, twom100_exp=39443045261/50000000000000000000000000000000000000000, x=1000000000000000000000000000001] [L44] ieee_float_shape_type gf_u; [L45] gf_u.value = (x) [L46] EXPR gf_u.word [L46] (sx) = gf_u.word [L48] xsb = (sx >> 31) & 1 VAL [\old(x)=1000000000000000000000000000001, halF_exp={4:0}, huge_exp=1000000000000000000000000000000, invln2_exp=1803368777/1250000000, k=0, ln2HI_exp={5:0}, ln2LO_exp={6:0}, one_exp=1, P1_exp=16666667163/100000000000, P3_exp=6613755977/100000000000000, P5_exp=20690684721/500000000000000000, sx=2147483647, twom100_exp=39443045261/50000000000000000000000000000000000000000, x=1000000000000000000000000000001, xsb=0] [L49] hx = sx & 0x7fffffff VAL [\old(x)=1000000000000000000000000000001, halF_exp={4:0}, huge_exp=1000000000000000000000000000000, hx=2139095041, hx = sx & 0x7fffffff=2147483647, invln2_exp=1803368777/1250000000, k=0, ln2HI_exp={5:0}, ln2LO_exp={6:0}, one_exp=1, P1_exp=16666667163/100000000000, P3_exp=6613755977/100000000000000, P5_exp=20690684721/500000000000000000, sx=2147483647, twom100_exp=39443045261/50000000000000000000000000000000000000000, x=1000000000000000000000000000001, xsb=0] [L51] COND TRUE ((hx) > 0x7f800000L) [L52] return x + x; VAL [\old(x)=1000000000000000000000000000001, halF_exp={4:0}, huge_exp=1000000000000000000000000000000, hx=2139095041, hx = sx & 0x7fffffff=2147483647, invln2_exp=1803368777/1250000000, k=0, ln2HI_exp={5:0}, ln2LO_exp={6:0}, one_exp=1, P1_exp=16666667163/100000000000, P3_exp=6613755977/100000000000000, P5_exp=20690684721/500000000000000000, sx=2147483647, twom100_exp=39443045261/50000000000000000000000000000000000000000, x=1000000000000000000000000000001, xsb=0] [L119] RET, EXPR __ieee754_expf(x) [L119] float res = __ieee754_expf(x); [L122] CALL, EXPR isnan_float(res) [L15] return x != x; VAL [\old(x)=1000000000000000000000000000002, \result=0, halF_exp={4:0}, huge_exp=1000000000000000000000000000000, hx = sx & 0x7fffffff=2147483647, invln2_exp=1803368777/1250000000, ln2HI_exp={5:0}, ln2LO_exp={6:0}, one_exp=1, P1_exp=16666667163/100000000000, P3_exp=6613755977/100000000000000, P5_exp=20690684721/500000000000000000, twom100_exp=39443045261/50000000000000000000000000000000000000000, x=1000000000000000000000000000002] [L122] RET, EXPR isnan_float(res) [L122] COND TRUE !isnan_float(res) [L123] reach_error() VAL [halF_exp={4:0}, huge_exp=1000000000000000000000000000000, hx = sx & 0x7fffffff=2147483647, invln2_exp=1803368777/1250000000, ln2HI_exp={5:0}, ln2LO_exp={6:0}, one_exp=1, P1_exp=16666667163/100000000000, P3_exp=6613755977/100000000000000, P5_exp=20690684721/500000000000000000, res=1000000000000000000000000000002, twom100_exp=39443045261/50000000000000000000000000000000000000000, x=1000000000000000000000000000001] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 44 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 70 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 70 mSDsluCounter, 248 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 77 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 38 IncrementalHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 171 mSDtfsCounter, 38 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred in iteration=3, InterpolantAutomatonStates: 8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 45 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 48 NumberOfCodeBlocks, 48 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 31 ConstructedInterpolants, 0 QuantifiedInterpolants, 39 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-02-20 16:42:45,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/float_req_bl_0831.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 ae08d3dbde40e32197902417be767e9b8a44048ec2abbe937f73d3dc278c75f1 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:42:47,096 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:42:47,098 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:42:47,138 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:42:47,139 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:42:47,141 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:42:47,142 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:42:47,146 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:42:47,148 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:42:47,151 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:42:47,152 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:42:47,155 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:42:47,156 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:42:47,158 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:42:47,159 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:42:47,161 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:42:47,162 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:42:47,162 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:42:47,164 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:42:47,168 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:42:47,169 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:42:47,170 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:42:47,171 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:42:47,172 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:42:47,177 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:42:47,178 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:42:47,178 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:42:47,179 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:42:47,180 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:42:47,180 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:42:47,181 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:42:47,181 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:42:47,182 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:42:47,183 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:42:47,184 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:42:47,184 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:42:47,185 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:42:47,185 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:42:47,185 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:42:47,186 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:42:47,187 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:42:47,190 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:47,219 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:42:47,219 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:42:47,220 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:42:47,220 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:42:47,221 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:42:47,221 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:42:47,222 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:42:47,222 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:42:47,222 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:42:47,223 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:42:47,223 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:42:47,223 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:42:47,224 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:42:47,224 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:42:47,224 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:42:47,224 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:42:47,224 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:42:47,224 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:42:47,224 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:42:47,225 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:42:47,225 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:42:47,225 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:42:47,225 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:42:47,225 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:42:47,225 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:42:47,225 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:42:47,226 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:42:47,226 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:42:47,226 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:42:47,226 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:42:47,226 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:42:47,226 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:42:47,227 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:42:47,227 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:42:47,227 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:42:47,227 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:42:47,227 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 -> ae08d3dbde40e32197902417be767e9b8a44048ec2abbe937f73d3dc278c75f1 [2022-02-20 16:42:47,510 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:42:47,533 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:42:47,535 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:42:47,536 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:42:47,537 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:42:47,538 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0831.c [2022-02-20 16:42:47,598 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eeceeccf2/0811283923d647948033888ca9d59c97/FLAG50a000e67 [2022-02-20 16:42:47,951 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:42:47,952 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0831.c [2022-02-20 16:42:47,958 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eeceeccf2/0811283923d647948033888ca9d59c97/FLAG50a000e67 [2022-02-20 16:42:48,355 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eeceeccf2/0811283923d647948033888ca9d59c97 [2022-02-20 16:42:48,358 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:42:48,359 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:42:48,362 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:42:48,362 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:42:48,365 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:42:48,366 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:42:48" (1/1) ... [2022-02-20 16:42:48,367 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@719fa267 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:48, skipping insertion in model container [2022-02-20 16:42:48,367 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:42:48" (1/1) ... [2022-02-20 16:42:48,372 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:42:48,393 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:42:48,542 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_0831.c[3205,3218] [2022-02-20 16:42:48,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:42:48,559 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:42:48,596 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_0831.c[3205,3218] [2022-02-20 16:42:48,603 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:42:48,638 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:42:48,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:48 WrapperNode [2022-02-20 16:42:48,639 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:42:48,640 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:42:48,640 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:42:48,640 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:42:48,645 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:48" (1/1) ... [2022-02-20 16:42:48,663 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:48" (1/1) ... [2022-02-20 16:42:48,702 INFO L137 Inliner]: procedures = 21, calls = 43, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 168 [2022-02-20 16:42:48,703 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:42:48,704 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:42:48,705 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:42:48,705 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:42:48,710 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:48" (1/1) ... [2022-02-20 16:42:48,711 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:48" (1/1) ... [2022-02-20 16:42:48,726 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:48" (1/1) ... [2022-02-20 16:42:48,726 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:48" (1/1) ... [2022-02-20 16:42:48,734 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:48" (1/1) ... [2022-02-20 16:42:48,745 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:48" (1/1) ... [2022-02-20 16:42:48,749 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:48" (1/1) ... [2022-02-20 16:42:48,758 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:42:48,762 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:42:48,763 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:42:48,763 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:42:48,763 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:48" (1/1) ... [2022-02-20 16:42:48,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:42:48,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:42:48,805 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:48,829 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:48,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:42:48,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2022-02-20 16:42:48,853 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:42:48,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:42:48,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2022-02-20 16:42:48,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 16:42:48,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:42:48,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:42:48,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2022-02-20 16:42:48,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 16:42:48,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:42:48,916 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:42:48,917 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:42:57,612 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:42:57,618 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:42:57,618 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2022-02-20 16:42:57,619 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:42:57 BoogieIcfgContainer [2022-02-20 16:42:57,620 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:42:57,621 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:42:57,622 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:42:57,624 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:42:57,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:42:48" (1/3) ... [2022-02-20 16:42:57,624 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d84e890 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:42:57, skipping insertion in model container [2022-02-20 16:42:57,625 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:48" (2/3) ... [2022-02-20 16:42:57,625 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d84e890 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:42:57, skipping insertion in model container [2022-02-20 16:42:57,625 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:42:57" (3/3) ... [2022-02-20 16:42:57,626 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_0831.c [2022-02-20 16:42:57,630 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:42:57,630 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:42:57,664 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:42:57,669 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:57,670 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:42:57,682 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 36 states have internal predecessors, (58), 0 states have call successors, (0), 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:57,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 16:42:57,685 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:42:57,686 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:42:57,687 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:42:57,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:42:57,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1903272656, now seen corresponding path program 1 times [2022-02-20 16:42:57,702 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:42:57,703 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [879129163] [2022-02-20 16:42:57,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:42:57,704 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:42:57,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:42:57,706 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:57,709 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:58,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:42:58,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:42:58,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:42:58,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:42:58,170 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#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_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~#halF_exp~0.base, ~#halF_exp~0.offset := 4bv32, 0bv32;call #Ultimate.allocInit(8bv32, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.5)), ~#halF_exp~0.base, ~#halF_exp~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.5))), ~#halF_exp~0.base, ~bvadd32(4bv32, ~#halF_exp~0.offset), 4bv32);~huge_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E30));~twom100_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 7.8886090522E-31));~#ln2HI_exp~0.base, ~#ln2HI_exp~0.offset := 5bv32, 0bv32;call #Ultimate.allocInit(8bv32, 5bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.69313812256)), ~#ln2HI_exp~0.base, ~#ln2HI_exp~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.69313812256))), ~#ln2HI_exp~0.base, ~bvadd32(4bv32, ~#ln2HI_exp~0.offset), 4bv32);~#ln2LO_exp~0.base, ~#ln2LO_exp~0.offset := 6bv32, 0bv32;call #Ultimate.allocInit(8bv32, 6bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 9.0580006145E-6)), ~#ln2LO_exp~0.base, ~#ln2LO_exp~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 9.0580006145E-6))), ~#ln2LO_exp~0.base, ~bvadd32(4bv32, ~#ln2LO_exp~0.offset), 4bv32);~invln2_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.4426950216));~P1_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.16666667163));~P2_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.002777777845)));~P3_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 6.613755977E-5));~P4_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.6533901999E-6)));~P5_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 4.1381369442E-8)); {40#true} is VALID [2022-02-20 16:42:58,171 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret15#1, main_#t~ret16#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());assume { :begin_inline___ieee754_expf } true;__ieee754_expf_#in~x#1 := main_~x~0#1;havoc __ieee754_expf_#res#1;havoc __ieee754_expf_#t~mem4#1, __ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset, __ieee754_expf_#t~ite5#1, __ieee754_expf_#t~mem6#1, __ieee754_expf_#t~mem7#1, __ieee754_expf_#t~mem8#1, __ieee754_expf_#t~mem9#1, __ieee754_expf_#t~mem10#1, __ieee754_expf_#t~mem11#1, __ieee754_expf_~#gf_u~1#1.base, __ieee754_expf_~#gf_u~1#1.offset, __ieee754_expf_#t~mem12#1, __ieee754_expf_~#sf_u~0#1.base, __ieee754_expf_~#sf_u~0#1.offset, __ieee754_expf_~hy~0#1, __ieee754_expf_#t~mem13#1, __ieee754_expf_~#gf_u~2#1.base, __ieee754_expf_~#gf_u~2#1.offset, __ieee754_expf_#t~mem14#1, __ieee754_expf_~#sf_u~1#1.base, __ieee754_expf_~#sf_u~1#1.offset, __ieee754_expf_~hy~1#1, __ieee754_expf_~x#1, __ieee754_expf_~y~0#1, __ieee754_expf_~hi~0#1, __ieee754_expf_~lo~0#1, __ieee754_expf_~c~0#1, __ieee754_expf_~t~0#1, __ieee754_expf_~k~0#1, __ieee754_expf_~xsb~0#1, __ieee754_expf_~sx~0#1, __ieee754_expf_~hx~0#1;__ieee754_expf_~x#1 := __ieee754_expf_#in~x#1;havoc __ieee754_expf_~y~0#1;havoc __ieee754_expf_~hi~0#1;havoc __ieee754_expf_~lo~0#1;havoc __ieee754_expf_~c~0#1;havoc __ieee754_expf_~t~0#1;__ieee754_expf_~k~0#1 := 0bv32;havoc __ieee754_expf_~xsb~0#1;havoc __ieee754_expf_~sx~0#1;havoc __ieee754_expf_~hx~0#1; {40#true} is VALID [2022-02-20 16:42:58,177 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} assume !true; {41#false} is VALID [2022-02-20 16:42:58,177 INFO L290 TraceCheckUtils]: 3: Hoare triple {41#false} __ieee754_expf_~xsb~0#1 := ~bvand32(1bv32, ~bvashr32(__ieee754_expf_~sx~0#1, 31bv32));__ieee754_expf_~hx~0#1 := ~bvand32(2147483647bv32, __ieee754_expf_~sx~0#1); {41#false} is VALID [2022-02-20 16:42:58,177 INFO L290 TraceCheckUtils]: 4: Hoare triple {41#false} assume ~bvugt32(__ieee754_expf_~hx~0#1, 2139095040bv32);__ieee754_expf_#res#1 := ~fp.add~FLOAT(currentRoundingMode, __ieee754_expf_~x#1, __ieee754_expf_~x#1); {41#false} is VALID [2022-02-20 16:42:58,178 INFO L290 TraceCheckUtils]: 5: Hoare triple {41#false} main_#t~ret15#1 := __ieee754_expf_#res#1;assume { :end_inline___ieee754_expf } true;main_~res~0#1 := main_#t~ret15#1;havoc main_#t~ret15#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); {41#false} is VALID [2022-02-20 16:42:58,178 INFO L290 TraceCheckUtils]: 6: Hoare triple {41#false} main_#t~ret16#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true; {41#false} is VALID [2022-02-20 16:42:58,178 INFO L290 TraceCheckUtils]: 7: Hoare triple {41#false} assume 0bv32 == main_#t~ret16#1;havoc main_#t~ret16#1; {41#false} is VALID [2022-02-20 16:42:58,178 INFO L290 TraceCheckUtils]: 8: Hoare triple {41#false} assume !false; {41#false} is VALID [2022-02-20 16:42:58,179 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:58,179 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:42:58,180 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:42:58,180 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [879129163] [2022-02-20 16:42:58,181 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [879129163] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:42:58,181 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:42:58,181 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:42:58,182 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341178322] [2022-02-20 16:42:58,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:42:58,187 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 16:42:58,187 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:42:58,189 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:58,222 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:42:58,223 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:42:58,223 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:42:58,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:42:58,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:42:58,240 INFO L87 Difference]: Start difference. First operand has 37 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 36 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:43:07,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:43:07,722 INFO L93 Difference]: Finished difference Result 72 states and 114 transitions. [2022-02-20 16:43:07,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:43:07,723 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 16:43:07,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:43:07,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:43:07,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 114 transitions. [2022-02-20 16:43:07,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:43:07,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 114 transitions. [2022-02-20 16:43:07,735 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 114 transitions. [2022-02-20 16:43:10,035 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:43:10,041 INFO L225 Difference]: With dead ends: 72 [2022-02-20 16:43:10,041 INFO L226 Difference]: Without dead ends: 34 [2022-02-20 16:43:10,043 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:43:10,052 INFO L933 BasicCegarLoop]: 47 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, 47 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:43:10,054 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:43:10,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-02-20 16:43:10,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-02-20 16:43:10,077 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:43:10,078 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 33 states have internal predecessors, (44), 0 states have call successors, (0), 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:43:10,079 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 33 states have internal predecessors, (44), 0 states have call successors, (0), 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:43:10,079 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 33 states have internal predecessors, (44), 0 states have call successors, (0), 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:43:10,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:43:10,083 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2022-02-20 16:43:10,083 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2022-02-20 16:43:10,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:43:10,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:43:10,084 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 33 states have internal predecessors, (44), 0 states have call successors, (0), 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 34 states. [2022-02-20 16:43:10,084 INFO L87 Difference]: Start difference. First operand has 34 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 33 states have internal predecessors, (44), 0 states have call successors, (0), 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 34 states. [2022-02-20 16:43:10,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:43:10,086 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2022-02-20 16:43:10,086 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2022-02-20 16:43:10,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:43:10,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:43:10,086 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:43:10,098 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:43:10,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 33 states have internal predecessors, (44), 0 states have call successors, (0), 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:43:10,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2022-02-20 16:43:10,101 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 44 transitions. Word has length 9 [2022-02-20 16:43:10,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:43:10,102 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 44 transitions. [2022-02-20 16:43:10,102 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:43:10,102 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2022-02-20 16:43:10,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 16:43:10,103 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:43:10,103 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:43:10,129 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:43:10,310 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:43:10,311 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:43:10,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:43:10,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1485078157, now seen corresponding path program 1 times [2022-02-20 16:43:10,312 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:43:10,312 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1099401830] [2022-02-20 16:43:10,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:43:10,313 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:43:10,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:43:10,334 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:43:10,335 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:43:10,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:43:10,717 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 16:43:10,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:43:10,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:43:11,131 INFO L290 TraceCheckUtils]: 0: Hoare triple {259#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_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~#halF_exp~0.base, ~#halF_exp~0.offset := 4bv32, 0bv32;call #Ultimate.allocInit(8bv32, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.5)), ~#halF_exp~0.base, ~#halF_exp~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.5))), ~#halF_exp~0.base, ~bvadd32(4bv32, ~#halF_exp~0.offset), 4bv32);~huge_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E30));~twom100_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 7.8886090522E-31));~#ln2HI_exp~0.base, ~#ln2HI_exp~0.offset := 5bv32, 0bv32;call #Ultimate.allocInit(8bv32, 5bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.69313812256)), ~#ln2HI_exp~0.base, ~#ln2HI_exp~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.69313812256))), ~#ln2HI_exp~0.base, ~bvadd32(4bv32, ~#ln2HI_exp~0.offset), 4bv32);~#ln2LO_exp~0.base, ~#ln2LO_exp~0.offset := 6bv32, 0bv32;call #Ultimate.allocInit(8bv32, 6bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 9.0580006145E-6)), ~#ln2LO_exp~0.base, ~#ln2LO_exp~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 9.0580006145E-6))), ~#ln2LO_exp~0.base, ~bvadd32(4bv32, ~#ln2LO_exp~0.offset), 4bv32);~invln2_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.4426950216));~P1_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.16666667163));~P2_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.002777777845)));~P3_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 6.613755977E-5));~P4_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.6533901999E-6)));~P5_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 4.1381369442E-8)); {264#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:43:11,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {264#(= currentRoundingMode roundNearestTiesToEven)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret15#1, main_#t~ret16#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());assume { :begin_inline___ieee754_expf } true;__ieee754_expf_#in~x#1 := main_~x~0#1;havoc __ieee754_expf_#res#1;havoc __ieee754_expf_#t~mem4#1, __ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset, __ieee754_expf_#t~ite5#1, __ieee754_expf_#t~mem6#1, __ieee754_expf_#t~mem7#1, __ieee754_expf_#t~mem8#1, __ieee754_expf_#t~mem9#1, __ieee754_expf_#t~mem10#1, __ieee754_expf_#t~mem11#1, __ieee754_expf_~#gf_u~1#1.base, __ieee754_expf_~#gf_u~1#1.offset, __ieee754_expf_#t~mem12#1, __ieee754_expf_~#sf_u~0#1.base, __ieee754_expf_~#sf_u~0#1.offset, __ieee754_expf_~hy~0#1, __ieee754_expf_#t~mem13#1, __ieee754_expf_~#gf_u~2#1.base, __ieee754_expf_~#gf_u~2#1.offset, __ieee754_expf_#t~mem14#1, __ieee754_expf_~#sf_u~1#1.base, __ieee754_expf_~#sf_u~1#1.offset, __ieee754_expf_~hy~1#1, __ieee754_expf_~x#1, __ieee754_expf_~y~0#1, __ieee754_expf_~hi~0#1, __ieee754_expf_~lo~0#1, __ieee754_expf_~c~0#1, __ieee754_expf_~t~0#1, __ieee754_expf_~k~0#1, __ieee754_expf_~xsb~0#1, __ieee754_expf_~sx~0#1, __ieee754_expf_~hx~0#1;__ieee754_expf_~x#1 := __ieee754_expf_#in~x#1;havoc __ieee754_expf_~y~0#1;havoc __ieee754_expf_~hi~0#1;havoc __ieee754_expf_~lo~0#1;havoc __ieee754_expf_~c~0#1;havoc __ieee754_expf_~t~0#1;__ieee754_expf_~k~0#1 := 0bv32;havoc __ieee754_expf_~xsb~0#1;havoc __ieee754_expf_~sx~0#1;havoc __ieee754_expf_~hx~0#1; {268#(and (= |ULTIMATE.start___ieee754_expf_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:43:11,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {268#(and (= |ULTIMATE.start___ieee754_expf_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} call __ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__ieee754_expf_~x#1, __ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset, 4bv32);call __ieee754_expf_#t~mem4#1 := read~intINTTYPE4(__ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset, 4bv32);__ieee754_expf_~sx~0#1 := __ieee754_expf_#t~mem4#1;havoc __ieee754_expf_#t~mem4#1;call ULTIMATE.dealloc(__ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset);havoc __ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset; {268#(and (= |ULTIMATE.start___ieee754_expf_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:43:11,133 INFO L290 TraceCheckUtils]: 3: Hoare triple {268#(and (= |ULTIMATE.start___ieee754_expf_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} goto; {268#(and (= |ULTIMATE.start___ieee754_expf_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:43:11,133 INFO L290 TraceCheckUtils]: 4: Hoare triple {268#(and (= |ULTIMATE.start___ieee754_expf_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} __ieee754_expf_~xsb~0#1 := ~bvand32(1bv32, ~bvashr32(__ieee754_expf_~sx~0#1, 31bv32));__ieee754_expf_~hx~0#1 := ~bvand32(2147483647bv32, __ieee754_expf_~sx~0#1); {268#(and (= |ULTIMATE.start___ieee754_expf_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:43:11,134 INFO L290 TraceCheckUtils]: 5: Hoare triple {268#(and (= |ULTIMATE.start___ieee754_expf_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} assume ~bvugt32(__ieee754_expf_~hx~0#1, 2139095040bv32);__ieee754_expf_#res#1 := ~fp.add~FLOAT(currentRoundingMode, __ieee754_expf_~x#1, __ieee754_expf_~x#1); {281#(= |ULTIMATE.start___ieee754_expf_#res#1| (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (_ +zero 8 24) (_ +zero 8 24)) (fp.div roundNearestTiesToEven (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:43:11,134 INFO L290 TraceCheckUtils]: 6: Hoare triple {281#(= |ULTIMATE.start___ieee754_expf_#res#1| (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (_ +zero 8 24) (_ +zero 8 24)) (fp.div roundNearestTiesToEven (_ +zero 8 24) (_ +zero 8 24))))} main_#t~ret15#1 := __ieee754_expf_#res#1;assume { :end_inline___ieee754_expf } true;main_~res~0#1 := main_#t~ret15#1;havoc main_#t~ret15#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); {285#(= (_ bv1 32) |ULTIMATE.start_isnan_float_#res#1|)} is VALID [2022-02-20 16:43:11,135 INFO L290 TraceCheckUtils]: 7: Hoare triple {285#(= (_ bv1 32) |ULTIMATE.start_isnan_float_#res#1|)} main_#t~ret16#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true; {289#(= |ULTIMATE.start_main_#t~ret16#1| (_ bv1 32))} is VALID [2022-02-20 16:43:11,135 INFO L290 TraceCheckUtils]: 8: Hoare triple {289#(= |ULTIMATE.start_main_#t~ret16#1| (_ bv1 32))} assume 0bv32 == main_#t~ret16#1;havoc main_#t~ret16#1; {260#false} is VALID [2022-02-20 16:43:11,135 INFO L290 TraceCheckUtils]: 9: Hoare triple {260#false} assume !false; {260#false} is VALID [2022-02-20 16:43:11,136 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:43:11,136 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:43:11,136 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:43:11,136 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1099401830] [2022-02-20 16:43:11,136 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1099401830] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:43:11,136 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:43:11,136 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 16:43:11,136 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106341334] [2022-02-20 16:43:11,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:43:11,137 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 16:43:11,137 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:43:11,138 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:43:11,162 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:43:11,163 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 16:43:11,163 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:43:11,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 16:43:11,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:43:11,164 INFO L87 Difference]: Start difference. First operand 34 states and 44 transitions. Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:43:16,500 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-20 16:43:18,731 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 16:43:23,785 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 16:43:28,171 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 16:43:38,862 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 16:43:42,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:43:42,573 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2022-02-20 16:43:42,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 16:43:42,573 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 16:43:42,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:43:42,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:43:42,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2022-02-20 16:43:42,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:43:42,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2022-02-20 16:43:42,576 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 58 transitions. [2022-02-20 16:43:44,140 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:43:44,141 INFO L225 Difference]: With dead ends: 50 [2022-02-20 16:43:44,141 INFO L226 Difference]: Without dead ends: 42 [2022-02-20 16:43:44,141 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-02-20 16:43:44,142 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 30 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:43:44,142 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 143 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 5 Unknown, 0 Unchecked, 14.0s Time] [2022-02-20 16:43:44,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-02-20 16:43:44,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 34. [2022-02-20 16:43:44,145 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:43:44,145 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 34 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 states have internal predecessors, (42), 0 states have call successors, (0), 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:43:44,146 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 34 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 states have internal predecessors, (42), 0 states have call successors, (0), 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:43:44,146 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 34 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 states have internal predecessors, (42), 0 states have call successors, (0), 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:43:44,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:43:44,147 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2022-02-20 16:43:44,147 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2022-02-20 16:43:44,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:43:44,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:43:44,148 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 states. [2022-02-20 16:43:44,148 INFO L87 Difference]: Start difference. First operand has 34 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 states. [2022-02-20 16:43:44,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:43:44,150 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2022-02-20 16:43:44,150 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2022-02-20 16:43:44,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:43:44,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:43:44,151 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:43:44,151 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:43:44,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 states have internal predecessors, (42), 0 states have call successors, (0), 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:43:44,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2022-02-20 16:43:44,154 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 10 [2022-02-20 16:43:44,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:43:44,154 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-02-20 16:43:44,154 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:43:44,155 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-02-20 16:43:44,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 16:43:44,155 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:43:44,155 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:43:44,174 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:43:44,373 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:43:44,373 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:43:44,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:43:44,374 INFO L85 PathProgramCache]: Analyzing trace with hash 228797714, now seen corresponding path program 1 times [2022-02-20 16:43:44,374 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:43:44,374 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [754849400] [2022-02-20 16:43:44,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:43:44,374 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:43:44,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:43:44,377 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:43:44,379 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:43:44,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:43:44,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 16:43:44,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:43:44,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:43:45,035 INFO L290 TraceCheckUtils]: 0: Hoare triple {485#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_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~#halF_exp~0.base, ~#halF_exp~0.offset := 4bv32, 0bv32;call #Ultimate.allocInit(8bv32, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.5)), ~#halF_exp~0.base, ~#halF_exp~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.5))), ~#halF_exp~0.base, ~bvadd32(4bv32, ~#halF_exp~0.offset), 4bv32);~huge_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0E30));~twom100_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 7.8886090522E-31));~#ln2HI_exp~0.base, ~#ln2HI_exp~0.offset := 5bv32, 0bv32;call #Ultimate.allocInit(8bv32, 5bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.69313812256)), ~#ln2HI_exp~0.base, ~#ln2HI_exp~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.69313812256))), ~#ln2HI_exp~0.base, ~bvadd32(4bv32, ~#ln2HI_exp~0.offset), 4bv32);~#ln2LO_exp~0.base, ~#ln2LO_exp~0.offset := 6bv32, 0bv32;call #Ultimate.allocInit(8bv32, 6bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 9.0580006145E-6)), ~#ln2LO_exp~0.base, ~#ln2LO_exp~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 9.0580006145E-6))), ~#ln2LO_exp~0.base, ~bvadd32(4bv32, ~#ln2LO_exp~0.offset), 4bv32);~invln2_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.4426950216));~P1_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.16666667163));~P2_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 0.002777777845)));~P3_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 6.613755977E-5));~P4_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.6533901999E-6)));~P5_exp~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 4.1381369442E-8)); {485#true} is VALID [2022-02-20 16:43:45,037 INFO L290 TraceCheckUtils]: 1: Hoare triple {485#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret15#1, main_#t~ret16#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());assume { :begin_inline___ieee754_expf } true;__ieee754_expf_#in~x#1 := main_~x~0#1;havoc __ieee754_expf_#res#1;havoc __ieee754_expf_#t~mem4#1, __ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset, __ieee754_expf_#t~ite5#1, __ieee754_expf_#t~mem6#1, __ieee754_expf_#t~mem7#1, __ieee754_expf_#t~mem8#1, __ieee754_expf_#t~mem9#1, __ieee754_expf_#t~mem10#1, __ieee754_expf_#t~mem11#1, __ieee754_expf_~#gf_u~1#1.base, __ieee754_expf_~#gf_u~1#1.offset, __ieee754_expf_#t~mem12#1, __ieee754_expf_~#sf_u~0#1.base, __ieee754_expf_~#sf_u~0#1.offset, __ieee754_expf_~hy~0#1, __ieee754_expf_#t~mem13#1, __ieee754_expf_~#gf_u~2#1.base, __ieee754_expf_~#gf_u~2#1.offset, __ieee754_expf_#t~mem14#1, __ieee754_expf_~#sf_u~1#1.base, __ieee754_expf_~#sf_u~1#1.offset, __ieee754_expf_~hy~1#1, __ieee754_expf_~x#1, __ieee754_expf_~y~0#1, __ieee754_expf_~hi~0#1, __ieee754_expf_~lo~0#1, __ieee754_expf_~c~0#1, __ieee754_expf_~t~0#1, __ieee754_expf_~k~0#1, __ieee754_expf_~xsb~0#1, __ieee754_expf_~sx~0#1, __ieee754_expf_~hx~0#1;__ieee754_expf_~x#1 := __ieee754_expf_#in~x#1;havoc __ieee754_expf_~y~0#1;havoc __ieee754_expf_~hi~0#1;havoc __ieee754_expf_~lo~0#1;havoc __ieee754_expf_~c~0#1;havoc __ieee754_expf_~t~0#1;__ieee754_expf_~k~0#1 := 0bv32;havoc __ieee754_expf_~xsb~0#1;havoc __ieee754_expf_~sx~0#1;havoc __ieee754_expf_~hx~0#1; {493#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start___ieee754_expf_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:43:45,042 INFO L290 TraceCheckUtils]: 2: Hoare triple {493#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start___ieee754_expf_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} call __ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__ieee754_expf_~x#1, __ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset, 4bv32);call __ieee754_expf_#t~mem4#1 := read~intINTTYPE4(__ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset, 4bv32);__ieee754_expf_~sx~0#1 := __ieee754_expf_#t~mem4#1;havoc __ieee754_expf_#t~mem4#1;call ULTIMATE.dealloc(__ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset);havoc __ieee754_expf_~#gf_u~0#1.base, __ieee754_expf_~#gf_u~0#1.offset; {497#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_expf_~sx~0#1|)) (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:43:45,043 INFO L290 TraceCheckUtils]: 3: Hoare triple {497#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_expf_~sx~0#1|)) (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} goto; {497#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_expf_~sx~0#1|)) (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:43:45,043 INFO L290 TraceCheckUtils]: 4: Hoare triple {497#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_expf_~sx~0#1|)) (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} __ieee754_expf_~xsb~0#1 := ~bvand32(1bv32, ~bvashr32(__ieee754_expf_~sx~0#1, 31bv32));__ieee754_expf_~hx~0#1 := ~bvand32(2147483647bv32, __ieee754_expf_~sx~0#1); {504#(and (exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_expf_~sx~0#1|)) (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24)))) (= |ULTIMATE.start___ieee754_expf_~hx~0#1| (bvand (_ bv2147483647 32) |ULTIMATE.start___ieee754_expf_~sx~0#1|)))} is VALID [2022-02-20 16:43:45,049 INFO L290 TraceCheckUtils]: 5: Hoare triple {504#(and (exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_expf_~sx~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_expf_~sx~0#1|)) (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24)))) (= |ULTIMATE.start___ieee754_expf_~hx~0#1| (bvand (_ bv2147483647 32) |ULTIMATE.start___ieee754_expf_~sx~0#1|)))} assume !~bvugt32(__ieee754_expf_~hx~0#1, 2139095040bv32); {486#false} is VALID [2022-02-20 16:43:45,050 INFO L290 TraceCheckUtils]: 6: Hoare triple {486#false} assume !(2139095040bv32 == __ieee754_expf_~hx~0#1); {486#false} is VALID [2022-02-20 16:43:45,050 INFO L290 TraceCheckUtils]: 7: Hoare triple {486#false} assume ~bvsgt32(__ieee754_expf_~sx~0#1, 1118925335bv32);__ieee754_expf_#res#1 := ~fp.mul~FLOAT(currentRoundingMode, ~huge_exp~0, ~huge_exp~0); {486#false} is VALID [2022-02-20 16:43:45,050 INFO L290 TraceCheckUtils]: 8: Hoare triple {486#false} main_#t~ret15#1 := __ieee754_expf_#res#1;assume { :end_inline___ieee754_expf } true;main_~res~0#1 := main_#t~ret15#1;havoc main_#t~ret15#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); {486#false} is VALID [2022-02-20 16:43:45,050 INFO L290 TraceCheckUtils]: 9: Hoare triple {486#false} main_#t~ret16#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true; {486#false} is VALID [2022-02-20 16:43:45,050 INFO L290 TraceCheckUtils]: 10: Hoare triple {486#false} assume 0bv32 == main_#t~ret16#1;havoc main_#t~ret16#1; {486#false} is VALID [2022-02-20 16:43:45,050 INFO L290 TraceCheckUtils]: 11: Hoare triple {486#false} assume !false; {486#false} is VALID [2022-02-20 16:43:45,050 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:43:45,050 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:43:45,051 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:43:45,051 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [754849400] [2022-02-20 16:43:45,051 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [754849400] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:43:45,051 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:43:45,051 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:43:45,051 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821052944] [2022-02-20 16:43:45,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:43:45,051 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:43:45,052 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:43:45,052 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:43:45,096 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:43:45,096 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:43:45,096 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:43:45,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:43:45,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:43:45,097 INFO L87 Difference]: Start difference. First operand 34 states and 42 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) [2022-02-20 16:43:45,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:43:45,156 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2022-02-20 16:43:45,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:43:45,156 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:43:45,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:43:45,156 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-02-20 16:43:45,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-02-20 16:43:45,157 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-02-20 16:43:45,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-02-20 16:43:45,158 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 42 transitions. [2022-02-20 16:43:46,345 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:43:46,346 INFO L225 Difference]: With dead ends: 34 [2022-02-20 16:43:46,346 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 16:43:46,346 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:43:46,347 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:43:46,348 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 7 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 3 Unchecked, 0.0s Time] [2022-02-20 16:43:46,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 16:43:46,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 16:43:46,348 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:43:46,348 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:43:46,349 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:43:46,349 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:43:46,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:43:46,349 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:43:46,349 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:43:46,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:43:46,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:43:46,349 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 16:43:46,349 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 16:43:46,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:43:46,349 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:43:46,349 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:43:46,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:43:46,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:43:46,350 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:43:46,350 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:43:46,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:43:46,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 16:43:46,350 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2022-02-20 16:43:46,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:43:46,350 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 16:43:46,350 INFO L471 AbstractCegarLoop]: INTERPOLANT 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) [2022-02-20 16:43:46,350 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:43:46,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:43:46,352 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:43:46,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-02-20 16:43:46,567 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:43:46,569 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 16:43:46,732 INFO L858 garLoopResultBuilder]: For program point L60(lines 60 75) no Hoare annotation was computed. [2022-02-20 16:43:46,733 INFO L861 garLoopResultBuilder]: At program point L127(lines 113 128) the Hoare annotation is: true [2022-02-20 16:43:46,733 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 16:43:46,733 INFO L858 garLoopResultBuilder]: For program point L61(lines 61 70) no Hoare annotation was computed. [2022-02-20 16:43:46,733 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 16:43:46,733 INFO L858 garLoopResultBuilder]: For program point L61-2(lines 61 70) no Hoare annotation was computed. [2022-02-20 16:43:46,733 INFO L858 garLoopResultBuilder]: For program point L53(lines 53 54) no Hoare annotation was computed. [2022-02-20 16:43:46,733 INFO L858 garLoopResultBuilder]: For program point L86-1(lines 86 90) no Hoare annotation was computed. [2022-02-20 16:43:46,733 INFO L854 garLoopResultBuilder]: At program point L86-2(lines 86 90) the Hoare annotation is: false [2022-02-20 16:43:46,733 INFO L858 garLoopResultBuilder]: For program point L54(line 54) no Hoare annotation was computed. [2022-02-20 16:43:46,733 INFO L858 garLoopResultBuilder]: For program point L54-2(line 54) no Hoare annotation was computed. [2022-02-20 16:43:46,733 INFO L858 garLoopResultBuilder]: For program point L104(lines 104 108) no Hoare annotation was computed. [2022-02-20 16:43:46,733 INFO L858 garLoopResultBuilder]: For program point L104-1(lines 97 110) no Hoare annotation was computed. [2022-02-20 16:43:46,733 INFO L858 garLoopResultBuilder]: For program point L104-2(lines 104 108) no Hoare annotation was computed. [2022-02-20 16:43:46,733 INFO L858 garLoopResultBuilder]: For program point L55(lines 55 56) no Hoare annotation was computed. [2022-02-20 16:43:46,734 INFO L858 garLoopResultBuilder]: For program point L80(lines 80 83) no Hoare annotation was computed. [2022-02-20 16:43:46,734 INFO L858 garLoopResultBuilder]: For program point L72(lines 72 75) no Hoare annotation was computed. [2022-02-20 16:43:46,734 INFO L858 garLoopResultBuilder]: For program point L72-2(lines 60 75) no Hoare annotation was computed. [2022-02-20 16:43:46,734 INFO L858 garLoopResultBuilder]: For program point L122(lines 122 125) no Hoare annotation was computed. [2022-02-20 16:43:46,734 INFO L854 garLoopResultBuilder]: At program point L15(line 15) the Hoare annotation is: (and (= |ULTIMATE.start___ieee754_expf_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))) (= |ULTIMATE.start___ieee754_expf_#res#1| (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 8 24) (_ +zero 8 24)))) (fp.add roundNearestTiesToEven .cse0 .cse0))) (= currentRoundingMode roundNearestTiesToEven) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res#1|)) [2022-02-20 16:43:46,734 INFO L858 garLoopResultBuilder]: For program point L73(lines 73 74) no Hoare annotation was computed. [2022-02-20 16:43:46,734 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 16:43:46,734 INFO L858 garLoopResultBuilder]: For program point L123(line 123) no Hoare annotation was computed. [2022-02-20 16:43:46,734 INFO L858 garLoopResultBuilder]: For program point L57(lines 57 58) no Hoare annotation was computed. [2022-02-20 16:43:46,734 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 123) no Hoare annotation was computed. [2022-02-20 16:43:46,734 INFO L858 garLoopResultBuilder]: For program point L99-1(lines 99 103) no Hoare annotation was computed. [2022-02-20 16:43:46,734 INFO L854 garLoopResultBuilder]: At program point L99-2(lines 99 103) the Hoare annotation is: false [2022-02-20 16:43:46,734 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 16:43:46,734 INFO L858 garLoopResultBuilder]: For program point L91(lines 91 95) no Hoare annotation was computed. [2022-02-20 16:43:46,735 INFO L858 garLoopResultBuilder]: For program point L91-1(lines 84 97) no Hoare annotation was computed. [2022-02-20 16:43:46,735 INFO L858 garLoopResultBuilder]: For program point L91-2(lines 91 95) no Hoare annotation was computed. [2022-02-20 16:43:46,735 INFO L858 garLoopResultBuilder]: For program point L84(lines 84 110) no Hoare annotation was computed. [2022-02-20 16:43:46,735 INFO L858 garLoopResultBuilder]: For program point L51(lines 51 52) no Hoare annotation was computed. [2022-02-20 16:43:46,735 INFO L854 garLoopResultBuilder]: At program point L109(lines 38 111) the Hoare annotation is: (and (= |ULTIMATE.start___ieee754_expf_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))) (= |ULTIMATE.start___ieee754_expf_#res#1| (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 8 24) (_ +zero 8 24)))) (fp.add roundNearestTiesToEven .cse0 .cse0))) (= currentRoundingMode roundNearestTiesToEven)) [2022-02-20 16:43:46,735 INFO L858 garLoopResultBuilder]: For program point L43-1(lines 43 47) no Hoare annotation was computed. [2022-02-20 16:43:46,735 INFO L854 garLoopResultBuilder]: At program point L43-2(lines 43 47) the Hoare annotation is: (and (exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start___ieee754_expf_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24)))) (= currentRoundingMode roundNearestTiesToEven)) [2022-02-20 16:43:46,735 INFO L858 garLoopResultBuilder]: For program point L43-3(lines 43 47) no Hoare annotation was computed. [2022-02-20 16:43:46,737 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 16:43:46,738 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:43:46,741 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:43:46,741 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:43:46,741 WARN L170 areAnnotationChecker]: L43-1 has no Hoare annotation [2022-02-20 16:43:46,741 WARN L170 areAnnotationChecker]: L43-3 has no Hoare annotation [2022-02-20 16:43:46,741 WARN L170 areAnnotationChecker]: L43-1 has no Hoare annotation [2022-02-20 16:43:46,741 WARN L170 areAnnotationChecker]: L43-1 has no Hoare annotation [2022-02-20 16:43:46,742 WARN L170 areAnnotationChecker]: L43-3 has no Hoare annotation [2022-02-20 16:43:46,742 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2022-02-20 16:43:46,742 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2022-02-20 16:43:46,743 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-02-20 16:43:46,743 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-02-20 16:43:46,743 WARN L170 areAnnotationChecker]: L122 has no Hoare annotation [2022-02-20 16:43:46,743 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-02-20 16:43:46,743 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-02-20 16:43:46,743 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-02-20 16:43:46,743 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-02-20 16:43:46,743 WARN L170 areAnnotationChecker]: L122 has no Hoare annotation [2022-02-20 16:43:46,743 WARN L170 areAnnotationChecker]: L122 has no Hoare annotation [2022-02-20 16:43:46,743 WARN L170 areAnnotationChecker]: L54-2 has no Hoare annotation [2022-02-20 16:43:46,744 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-02-20 16:43:46,744 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-02-20 16:43:46,744 WARN L170 areAnnotationChecker]: L123 has no Hoare annotation [2022-02-20 16:43:46,744 WARN L170 areAnnotationChecker]: L123 has no Hoare annotation [2022-02-20 16:43:46,744 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:43:46,744 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2022-02-20 16:43:46,744 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2022-02-20 16:43:46,744 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:43:46,744 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2022-02-20 16:43:46,744 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2022-02-20 16:43:46,744 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-02-20 16:43:46,745 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-02-20 16:43:46,745 WARN L170 areAnnotationChecker]: L61-2 has no Hoare annotation [2022-02-20 16:43:46,745 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2022-02-20 16:43:46,745 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2022-02-20 16:43:46,745 WARN L170 areAnnotationChecker]: L72-2 has no Hoare annotation [2022-02-20 16:43:46,745 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2022-02-20 16:43:46,745 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2022-02-20 16:43:46,745 WARN L170 areAnnotationChecker]: L84 has no Hoare annotation [2022-02-20 16:43:46,745 WARN L170 areAnnotationChecker]: L84 has no Hoare annotation [2022-02-20 16:43:46,745 WARN L170 areAnnotationChecker]: L86-1 has no Hoare annotation [2022-02-20 16:43:46,745 WARN L170 areAnnotationChecker]: L91-1 has no Hoare annotation [2022-02-20 16:43:46,746 WARN L170 areAnnotationChecker]: L99-1 has no Hoare annotation [2022-02-20 16:43:46,746 WARN L170 areAnnotationChecker]: L104-1 has no Hoare annotation [2022-02-20 16:43:46,746 WARN L170 areAnnotationChecker]: L86-1 has no Hoare annotation [2022-02-20 16:43:46,746 WARN L170 areAnnotationChecker]: L86-1 has no Hoare annotation [2022-02-20 16:43:46,746 WARN L170 areAnnotationChecker]: L91-1 has no Hoare annotation [2022-02-20 16:43:46,746 WARN L170 areAnnotationChecker]: L91-1 has no Hoare annotation [2022-02-20 16:43:46,746 WARN L170 areAnnotationChecker]: L99-1 has no Hoare annotation [2022-02-20 16:43:46,747 WARN L170 areAnnotationChecker]: L99-1 has no Hoare annotation [2022-02-20 16:43:46,747 WARN L170 areAnnotationChecker]: L104-1 has no Hoare annotation [2022-02-20 16:43:46,747 WARN L170 areAnnotationChecker]: L104-1 has no Hoare annotation [2022-02-20 16:43:46,747 WARN L170 areAnnotationChecker]: L91 has no Hoare annotation [2022-02-20 16:43:46,747 WARN L170 areAnnotationChecker]: L91 has no Hoare annotation [2022-02-20 16:43:46,747 WARN L170 areAnnotationChecker]: L91-2 has no Hoare annotation [2022-02-20 16:43:46,747 WARN L170 areAnnotationChecker]: L104 has no Hoare annotation [2022-02-20 16:43:46,747 WARN L170 areAnnotationChecker]: L104 has no Hoare annotation [2022-02-20 16:43:46,747 WARN L170 areAnnotationChecker]: L104-2 has no Hoare annotation [2022-02-20 16:43:46,747 INFO L163 areAnnotationChecker]: CFG has 1 edges. 1 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 16:43:46,753 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:43:46,754 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:43:46,754 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:43:46,754 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:43:46,757 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:43:46,757 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:43:46,757 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:43:46,758 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:43:46,759 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:43:46,759 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:43:46,759 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:43:46,759 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:43:46,760 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:43:46,760 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:43:46,761 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:43:46,761 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:43:46,761 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:43:46,761 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:43:46,761 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:43:46,762 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:43:46,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:43:46 BoogieIcfgContainer [2022-02-20 16:43:46,762 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:43:46,763 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:43:46,763 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:43:46,763 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:43:46,766 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:57" (3/4) ... [2022-02-20 16:43:46,768 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 16:43:46,777 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2022-02-20 16:43:46,777 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2022-02-20 16:43:46,777 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 16:43:46,777 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 16:43:46,805 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists currentRoundingMode : FloatRoundingMode :: x == ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven [2022-02-20 16:43:46,805 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (x == ~fp.div~FLOAT(unknown-currentRoundingMode-unknown, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && \result == ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()), ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()))) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven [2022-02-20 16:43:46,806 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((x == ~fp.div~FLOAT(unknown-currentRoundingMode-unknown, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && \result == ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()), ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()))) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && 1bv32 == \result [2022-02-20 16:43:46,822 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 16:43:46,822 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:43:46,823 INFO L158 Benchmark]: Toolchain (without parser) took 58463.67ms. Allocated memory was 67.1MB in the beginning and 88.1MB in the end (delta: 21.0MB). Free memory was 47.8MB in the beginning and 48.2MB in the end (delta: -430.0kB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. [2022-02-20 16:43:46,823 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 67.1MB. Free memory was 49.3MB in the beginning and 49.3MB in the end (delta: 48.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:43:46,823 INFO L158 Benchmark]: CACSL2BoogieTranslator took 277.31ms. Allocated memory is still 67.1MB. Free memory was 47.5MB in the beginning and 46.1MB in the end (delta: 1.4MB). Peak memory consumption was 11.4MB. Max. memory is 16.1GB. [2022-02-20 16:43:46,824 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.08ms. Allocated memory is still 67.1MB. Free memory was 46.1MB in the beginning and 43.5MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 16:43:46,824 INFO L158 Benchmark]: Boogie Preprocessor took 57.25ms. Allocated memory is still 67.1MB. Free memory was 43.5MB in the beginning and 41.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:43:46,824 INFO L158 Benchmark]: RCFGBuilder took 8857.58ms. Allocated memory was 67.1MB in the beginning and 88.1MB in the end (delta: 21.0MB). Free memory was 41.0MB in the beginning and 62.8MB in the end (delta: -21.9MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. [2022-02-20 16:43:46,824 INFO L158 Benchmark]: TraceAbstraction took 49141.39ms. Allocated memory is still 88.1MB. Free memory was 62.5MB in the beginning and 51.8MB in the end (delta: 10.7MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. [2022-02-20 16:43:46,825 INFO L158 Benchmark]: Witness Printer took 59.57ms. Allocated memory is still 88.1MB. Free memory was 51.8MB in the beginning and 48.2MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 16:43:46,826 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 67.1MB. Free memory was 49.3MB in the beginning and 49.3MB in the end (delta: 48.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 277.31ms. Allocated memory is still 67.1MB. Free memory was 47.5MB in the beginning and 46.1MB in the end (delta: 1.4MB). Peak memory consumption was 11.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.08ms. Allocated memory is still 67.1MB. Free memory was 46.1MB in the beginning and 43.5MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.25ms. Allocated memory is still 67.1MB. Free memory was 43.5MB in the beginning and 41.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 8857.58ms. Allocated memory was 67.1MB in the beginning and 88.1MB in the end (delta: 21.0MB). Free memory was 41.0MB in the beginning and 62.8MB in the end (delta: -21.9MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. * TraceAbstraction took 49141.39ms. Allocated memory is still 88.1MB. Free memory was 62.5MB in the beginning and 51.8MB in the end (delta: 10.7MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. * Witness Printer took 59.57ms. Allocated memory is still 88.1MB. Free memory was 51.8MB in the beginning and 48.2MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 123]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 49.1s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 46.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 5 mSolverCounterUnknown, 30 SdHoareTripleChecker+Valid, 14.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 30 mSDsluCounter, 197 SdHoareTripleChecker+Invalid, 13.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 3 IncrementalHoareTripleChecker+Unchecked, 118 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 54 IncrementalHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 79 mSDtfsCounter, 54 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=0, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 8 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 10 NumberOfFragments, 61 HoareAnnotationTreeSize, 6 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 6 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 31 NumberOfCodeBlocks, 31 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 28 ConstructedInterpolants, 4 QuantifiedInterpolants, 129 SizeOfPredicates, 14 NumberOfNonLiveVariables, 218 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 38]: Loop Invariant [2022-02-20 16:43:46,833 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:43:46,833 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:43:46,833 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:43:46,833 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:43:46,834 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:43:46,834 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:43:46,834 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:43:46,834 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (x == ~fp.div~FLOAT(unknown-currentRoundingMode-unknown, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && \result == ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()), ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()))) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 43]: Loop Invariant [2022-02-20 16:43:46,835 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:43:46,835 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:43:46,835 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:43:46,835 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (\exists currentRoundingMode : FloatRoundingMode :: x == ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven - InvariantResult [Line: 15]: Loop Invariant [2022-02-20 16:43:46,836 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:43:46,836 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:43:46,836 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:43:46,836 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:43:46,836 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:43:46,836 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:43:46,836 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:43:46,837 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((x == ~fp.div~FLOAT(unknown-currentRoundingMode-unknown, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && \result == ~fp.add~FLOAT(~roundNearestTiesToEven, ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()), ~fp.div~FLOAT(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()))) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && 1bv32 == \result - InvariantResult [Line: 86]: Loop Invariant Derived loop invariant: 0 RESULT: Ultimate proved your program to be correct! [2022-02-20 16:43:46,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE