./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_0832a.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_0832a.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 ccec72d1445b0e5a7d371146f8f1ae3659440ba0ebb02d40d87a31c04bfcf378 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:42:54,595 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:42:54,598 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:42:54,636 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:42:54,637 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:42:54,641 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:42:54,643 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:42:54,647 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:42:54,650 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:42:54,656 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:42:54,656 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:42:54,658 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:42:54,658 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:42:54,660 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:42:54,662 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:42:54,666 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:42:54,667 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:42:54,668 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:42:54,671 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:42:54,674 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:42:54,678 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:42:54,679 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:42:54,681 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:42:54,682 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:42:54,686 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:42:54,687 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:42:54,687 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:42:54,689 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:42:54,689 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:42:54,690 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:42:54,690 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:42:54,691 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:42:54,693 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:42:54,694 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:42:54,695 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:42:54,696 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:42:54,696 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:42:54,696 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:42:54,697 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:42:54,697 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:42:54,698 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:42:54,699 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:54,739 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:42:54,740 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:42:54,740 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:42:54,740 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:42:54,741 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:42:54,741 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:42:54,742 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:42:54,742 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:42:54,742 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:42:54,743 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:42:54,744 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:42:54,744 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:42:54,744 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:42:54,744 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:42:54,744 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:42:54,745 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:42:54,745 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:42:54,745 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:42:54,745 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:42:54,745 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:42:54,745 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:42:54,746 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:42:54,746 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:42:54,746 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:42:54,746 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:42:54,747 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:42:54,747 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:42:54,747 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:42:54,747 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:42:54,747 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:42:54,748 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:42:54,748 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:42:54,748 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:42:54,748 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 -> ccec72d1445b0e5a7d371146f8f1ae3659440ba0ebb02d40d87a31c04bfcf378 [2022-02-20 16:42:54,973 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:42:54,998 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:42:55,001 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:42:55,003 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:42:55,003 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:42:55,005 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0832a.c [2022-02-20 16:42:55,084 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53564696f/446777fe287c4a2093c661828ba88224/FLAGdd7825d3b [2022-02-20 16:42:55,469 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:42:55,469 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0832a.c [2022-02-20 16:42:55,478 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53564696f/446777fe287c4a2093c661828ba88224/FLAGdd7825d3b [2022-02-20 16:42:55,491 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53564696f/446777fe287c4a2093c661828ba88224 [2022-02-20 16:42:55,494 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:42:55,496 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:42:55,497 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:42:55,497 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:42:55,504 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:42:55,506 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:42:55" (1/1) ... [2022-02-20 16:42:55,506 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38d1dc5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:55, skipping insertion in model container [2022-02-20 16:42:55,507 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:42:55" (1/1) ... [2022-02-20 16:42:55,513 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:42:55,534 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:42:55,720 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_0832a.c[3180,3193] [2022-02-20 16:42:55,723 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:42:55,731 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:42:55,761 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_0832a.c[3180,3193] [2022-02-20 16:42:55,762 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:42:55,776 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:42:55,777 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:55 WrapperNode [2022-02-20 16:42:55,777 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:42:55,778 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:42:55,778 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:42:55,778 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:42:55,785 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:55" (1/1) ... [2022-02-20 16:42:55,803 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:55" (1/1) ... [2022-02-20 16:42:55,848 INFO L137 Inliner]: procedures = 18, calls = 42, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 184 [2022-02-20 16:42:55,851 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:42:55,852 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:42:55,852 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:42:55,852 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:42:55,860 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:55" (1/1) ... [2022-02-20 16:42:55,860 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:55" (1/1) ... [2022-02-20 16:42:55,873 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:55" (1/1) ... [2022-02-20 16:42:55,875 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:55" (1/1) ... [2022-02-20 16:42:55,891 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:55" (1/1) ... [2022-02-20 16:42:55,911 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:55" (1/1) ... [2022-02-20 16:42:55,914 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:55" (1/1) ... [2022-02-20 16:42:55,921 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:42:55,925 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:42:55,926 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:42:55,927 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:42:55,928 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:55" (1/1) ... [2022-02-20 16:42:55,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:42:55,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:42:55,961 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:55,979 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:56,001 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:42:56,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:42:56,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:42:56,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:42:56,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-02-20 16:42:56,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-02-20 16:42:56,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:42:56,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:42:56,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:42:56,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-02-20 16:42:56,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:42:56,103 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:42:56,104 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:42:56,416 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:42:56,422 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:42:56,426 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2022-02-20 16:42:56,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:42:56 BoogieIcfgContainer [2022-02-20 16:42:56,430 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:42:56,432 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:42:56,432 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:42:56,435 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:42:56,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:42:55" (1/3) ... [2022-02-20 16:42:56,436 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1983775e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:42:56, skipping insertion in model container [2022-02-20 16:42:56,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:42:55" (2/3) ... [2022-02-20 16:42:56,437 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1983775e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:42:56, skipping insertion in model container [2022-02-20 16:42:56,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:42:56" (3/3) ... [2022-02-20 16:42:56,442 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_0832a.c [2022-02-20 16:42:56,447 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:42:56,448 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:42:56,499 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:42:56,513 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:56,513 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:42:56,530 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 41 states have (on average 1.7560975609756098) internal successors, (72), 42 states have internal predecessors, (72), 0 states have call successors, (0), 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:56,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 16:42:56,534 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:42:56,535 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:42:56,536 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:42:56,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:42:56,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1829501204, now seen corresponding path program 1 times [2022-02-20 16:42:56,554 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:42:56,555 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112838852] [2022-02-20 16:42:56,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:42:56,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:42:56,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:42:56,688 INFO L290 TraceCheckUtils]: 0: Hoare triple {46#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~one_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; {46#true} is VALID [2022-02-20 16:42:56,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {46#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret17#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := 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; {46#true} is VALID [2022-02-20 16:42:56,690 INFO L290 TraceCheckUtils]: 2: Hoare triple {46#true} assume !true; {47#false} is VALID [2022-02-20 16:42:56,690 INFO L290 TraceCheckUtils]: 3: Hoare triple {47#false} assume 0 == (if __ieee754_expf_~sx~0#1 >= 0 then 0 else 1);__ieee754_expf_~xsb~0#1 := 0; {47#false} is VALID [2022-02-20 16:42:56,691 INFO L290 TraceCheckUtils]: 4: Hoare triple {47#false} assume 0 == __ieee754_expf_~sx~0#1;__ieee754_expf_~hx~0#1 := 0; {47#false} is VALID [2022-02-20 16:42:56,691 INFO L290 TraceCheckUtils]: 5: Hoare triple {47#false} assume __ieee754_expf_~hx~0#1 % 4294967296 > 2139095040;__ieee754_expf_#res#1 := ~someBinaryArithmeticFLOAToperation(__ieee754_expf_~x#1, __ieee754_expf_~x#1); {47#false} is VALID [2022-02-20 16:42:56,691 INFO L290 TraceCheckUtils]: 6: Hoare triple {47#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; {47#false} is VALID [2022-02-20 16:42:56,691 INFO L290 TraceCheckUtils]: 7: Hoare triple {47#false} assume ~someBinaryFLOATComparisonOperation(main_~res~0#1, 1.0); {47#false} is VALID [2022-02-20 16:42:56,692 INFO L290 TraceCheckUtils]: 8: Hoare triple {47#false} assume !false; {47#false} is VALID [2022-02-20 16:42:56,693 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:56,693 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:42:56,693 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112838852] [2022-02-20 16:42:56,694 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112838852] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:42:56,694 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:42:56,695 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:42:56,696 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398875318] [2022-02-20 16:42:56,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:42:56,701 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:56,703 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:42:56,705 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:56,718 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:56,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:42:56,719 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:42:56,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:42:56,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:42:56,750 INFO L87 Difference]: Start difference. First operand has 43 states, 41 states have (on average 1.7560975609756098) internal successors, (72), 42 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:56,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:56,845 INFO L93 Difference]: Finished difference Result 83 states and 140 transitions. [2022-02-20 16:42:56,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:42:56,845 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:56,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:42:56,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:56,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 140 transitions. [2022-02-20 16:42:56,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:56,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 140 transitions. [2022-02-20 16:42:56,872 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 140 transitions. [2022-02-20 16:42:57,011 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:42:57,023 INFO L225 Difference]: With dead ends: 83 [2022-02-20 16:42:57,023 INFO L226 Difference]: Without dead ends: 39 [2022-02-20 16:42:57,026 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:57,032 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:42:57,033 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:42:57,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-02-20 16:42:57,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-02-20 16:42:57,055 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:42:57,056 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 38 states have (on average 1.394736842105263) internal successors, (53), 38 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:57,057 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 38 states have (on average 1.394736842105263) internal successors, (53), 38 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:57,057 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 38 states have (on average 1.394736842105263) internal successors, (53), 38 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:57,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:57,060 INFO L93 Difference]: Finished difference Result 39 states and 53 transitions. [2022-02-20 16:42:57,060 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 53 transitions. [2022-02-20 16:42:57,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:57,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:57,061 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 38 states have (on average 1.394736842105263) internal successors, (53), 38 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 39 states. [2022-02-20 16:42:57,062 INFO L87 Difference]: Start difference. First operand has 39 states, 38 states have (on average 1.394736842105263) internal successors, (53), 38 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 39 states. [2022-02-20 16:42:57,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:57,064 INFO L93 Difference]: Finished difference Result 39 states and 53 transitions. [2022-02-20 16:42:57,064 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 53 transitions. [2022-02-20 16:42:57,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:57,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:57,065 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:42:57,065 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:42:57,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.394736842105263) internal successors, (53), 38 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:57,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2022-02-20 16:42:57,069 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 53 transitions. Word has length 9 [2022-02-20 16:42:57,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:42:57,069 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 53 transitions. [2022-02-20 16:42:57,069 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:57,070 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 53 transitions. [2022-02-20 16:42:57,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 16:42:57,070 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:42:57,070 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:42:57,071 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:42:57,071 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:42:57,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:42:57,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1558849609, now seen corresponding path program 1 times [2022-02-20 16:42:57,072 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:42:57,072 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841828380] [2022-02-20 16:42:57,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:42:57,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:42:57,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:42:57,173 INFO L290 TraceCheckUtils]: 0: Hoare triple {264#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 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; {264#true} is VALID [2022-02-20 16:42:57,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {264#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret17#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := 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; {264#true} is VALID [2022-02-20 16:42:57,179 INFO L290 TraceCheckUtils]: 2: Hoare triple {264#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; {264#true} is VALID [2022-02-20 16:42:57,179 INFO L290 TraceCheckUtils]: 3: Hoare triple {264#true} goto; {264#true} is VALID [2022-02-20 16:42:57,179 INFO L290 TraceCheckUtils]: 4: Hoare triple {264#true} assume 0 == (if __ieee754_expf_~sx~0#1 >= 0 then 0 else 1);__ieee754_expf_~xsb~0#1 := 0; {264#true} is VALID [2022-02-20 16:42:57,180 INFO L290 TraceCheckUtils]: 5: Hoare triple {264#true} assume 0 == __ieee754_expf_~sx~0#1;__ieee754_expf_~hx~0#1 := 0; {266#(= |ULTIMATE.start___ieee754_expf_~hx~0#1| 0)} is VALID [2022-02-20 16:42:57,181 INFO L290 TraceCheckUtils]: 6: Hoare triple {266#(= |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); {265#false} is VALID [2022-02-20 16:42:57,181 INFO L290 TraceCheckUtils]: 7: Hoare triple {265#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; {265#false} is VALID [2022-02-20 16:42:57,181 INFO L290 TraceCheckUtils]: 8: Hoare triple {265#false} assume ~someBinaryFLOATComparisonOperation(main_~res~0#1, 1.0); {265#false} is VALID [2022-02-20 16:42:57,182 INFO L290 TraceCheckUtils]: 9: Hoare triple {265#false} assume !false; {265#false} is VALID [2022-02-20 16:42:57,182 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:57,182 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:42:57,183 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841828380] [2022-02-20 16:42:57,183 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841828380] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:42:57,183 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:42:57,183 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:42:57,184 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766180550] [2022-02-20 16:42:57,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:42:57,185 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 16:42:57,186 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:42:57,187 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:57,198 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:57,198 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:42:57,199 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:42:57,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:42:57,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:42:57,200 INFO L87 Difference]: Start difference. First operand 39 states and 53 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:57,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:57,309 INFO L93 Difference]: Finished difference Result 84 states and 109 transitions. [2022-02-20 16:42:57,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:42:57,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 16:42:57,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:42:57,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:57,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2022-02-20 16:42:57,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:57,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2022-02-20 16:42:57,314 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 109 transitions. [2022-02-20 16:42:57,413 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:42:57,419 INFO L225 Difference]: With dead ends: 84 [2022-02-20 16:42:57,419 INFO L226 Difference]: Without dead ends: 63 [2022-02-20 16:42:57,420 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:57,421 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 27 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 85 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:57,421 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 85 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:57,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-02-20 16:42:57,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 45. [2022-02-20 16:42:57,425 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:42:57,425 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 45 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 44 states have internal predecessors, (60), 0 states have call successors, (0), 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,426 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 45 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 44 states have internal predecessors, (60), 0 states have call successors, (0), 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,426 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 45 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 44 states have internal predecessors, (60), 0 states have call successors, (0), 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,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:57,429 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2022-02-20 16:42:57,429 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2022-02-20 16:42:57,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:57,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:57,430 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 44 states have internal predecessors, (60), 0 states have call successors, (0), 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 63 states. [2022-02-20 16:42:57,430 INFO L87 Difference]: Start difference. First operand has 45 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 44 states have internal predecessors, (60), 0 states have call successors, (0), 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 63 states. [2022-02-20 16:42:57,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:57,433 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2022-02-20 16:42:57,433 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 80 transitions. [2022-02-20 16:42:57,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:57,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:57,434 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:42:57,434 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:42:57,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 44 states have internal predecessors, (60), 0 states have call successors, (0), 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,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2022-02-20 16:42:57,436 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 10 [2022-02-20 16:42:57,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:42:57,437 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 60 transitions. [2022-02-20 16:42:57,437 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:57,437 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2022-02-20 16:42:57,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 16:42:57,438 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:42:57,438 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:42:57,438 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:42:57,438 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:42:57,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:42:57,439 INFO L85 PathProgramCache]: Analyzing trace with hash -921463484, now seen corresponding path program 1 times [2022-02-20 16:42:57,439 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:42:57,440 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685396093] [2022-02-20 16:42:57,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:42:57,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:42:57,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:42:57,487 INFO L290 TraceCheckUtils]: 0: Hoare triple {538#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~one_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; {538#true} is VALID [2022-02-20 16:42:57,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {538#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret17#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := 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; {538#true} is VALID [2022-02-20 16:42:57,488 INFO L290 TraceCheckUtils]: 2: Hoare triple {538#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; {538#true} is VALID [2022-02-20 16:42:57,488 INFO L290 TraceCheckUtils]: 3: Hoare triple {538#true} goto; {538#true} is VALID [2022-02-20 16:42:57,488 INFO L290 TraceCheckUtils]: 4: Hoare triple {538#true} assume 0 == (if __ieee754_expf_~sx~0#1 >= 0 then 0 else 1);__ieee754_expf_~xsb~0#1 := 0; {538#true} is VALID [2022-02-20 16:42:57,489 INFO L290 TraceCheckUtils]: 5: Hoare triple {538#true} assume 0 == __ieee754_expf_~sx~0#1;__ieee754_expf_~hx~0#1 := 0; {540#(<= |ULTIMATE.start___ieee754_expf_~sx~0#1| 0)} is VALID [2022-02-20 16:42:57,489 INFO L290 TraceCheckUtils]: 6: Hoare triple {540#(<= |ULTIMATE.start___ieee754_expf_~sx~0#1| 0)} assume !(__ieee754_expf_~hx~0#1 % 4294967296 > 2139095040); {540#(<= |ULTIMATE.start___ieee754_expf_~sx~0#1| 0)} is VALID [2022-02-20 16:42:57,490 INFO L290 TraceCheckUtils]: 7: Hoare triple {540#(<= |ULTIMATE.start___ieee754_expf_~sx~0#1| 0)} assume !(2139095040 == __ieee754_expf_~hx~0#1 % 4294967296); {540#(<= |ULTIMATE.start___ieee754_expf_~sx~0#1| 0)} is VALID [2022-02-20 16:42:57,490 INFO L290 TraceCheckUtils]: 8: Hoare triple {540#(<= |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); {539#false} is VALID [2022-02-20 16:42:57,491 INFO L290 TraceCheckUtils]: 9: Hoare triple {539#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; {539#false} is VALID [2022-02-20 16:42:57,491 INFO L290 TraceCheckUtils]: 10: Hoare triple {539#false} assume ~someBinaryFLOATComparisonOperation(main_~res~0#1, 1.0); {539#false} is VALID [2022-02-20 16:42:57,491 INFO L290 TraceCheckUtils]: 11: Hoare triple {539#false} assume !false; {539#false} is VALID [2022-02-20 16:42:57,491 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:57,492 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:42:57,492 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685396093] [2022-02-20 16:42:57,492 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685396093] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:42:57,492 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:42:57,492 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:42:57,493 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302592972] [2022-02-20 16:42:57,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:42:57,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 16:42:57,494 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:42:57,494 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:57,504 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:42:57,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:42:57,505 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:42:57,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:42:57,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:42:57,506 INFO L87 Difference]: Start difference. First operand 45 states and 60 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:57,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:57,633 INFO L93 Difference]: Finished difference Result 81 states and 107 transitions. [2022-02-20 16:42:57,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:42:57,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 16:42:57,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:42:57,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:57,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 100 transitions. [2022-02-20 16:42:57,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:57,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 100 transitions. [2022-02-20 16:42:57,641 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 100 transitions. [2022-02-20 16:42:57,735 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:42:57,740 INFO L225 Difference]: With dead ends: 81 [2022-02-20 16:42:57,740 INFO L226 Difference]: Without dead ends: 77 [2022-02-20 16:42:57,740 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:57,742 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 41 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 101 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:57,742 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 101 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:57,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-02-20 16:42:57,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 52. [2022-02-20 16:42:57,747 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:42:57,747 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 52 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 51 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:57,748 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 52 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 51 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:57,748 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 52 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 51 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:57,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:57,750 INFO L93 Difference]: Finished difference Result 77 states and 102 transitions. [2022-02-20 16:42:57,751 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 102 transitions. [2022-02-20 16:42:57,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:57,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:57,752 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 51 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 77 states. [2022-02-20 16:42:57,753 INFO L87 Difference]: Start difference. First operand has 52 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 51 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 77 states. [2022-02-20 16:42:57,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:42:57,757 INFO L93 Difference]: Finished difference Result 77 states and 102 transitions. [2022-02-20 16:42:57,758 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 102 transitions. [2022-02-20 16:42:57,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:42:57,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:42:57,760 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:42:57,760 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:42:57,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 51 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:57,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 70 transitions. [2022-02-20 16:42:57,762 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 70 transitions. Word has length 12 [2022-02-20 16:42:57,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:42:57,762 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 70 transitions. [2022-02-20 16:42:57,762 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:42:57,763 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 70 transitions. [2022-02-20 16:42:57,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 16:42:57,763 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:42:57,763 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:42:57,764 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 16:42:57,764 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:42:57,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:42:57,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1308032193, now seen corresponding path program 1 times [2022-02-20 16:42:57,765 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:42:57,765 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278266715] [2022-02-20 16:42:57,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:42:57,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:42:57,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:42:57,799 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:42:57,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:42:57,872 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:42:57,873 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:42:57,874 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:42:57,875 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 16:42:57,878 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-02-20 16:42:57,881 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:42:57,909 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:42:57,910 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:42:57,910 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2022-02-20 16:42:57,910 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2022-02-20 16:42:57,910 WARN L170 areAnnotationChecker]: L43-1 has no Hoare annotation [2022-02-20 16:42:57,910 WARN L170 areAnnotationChecker]: L43-1 has no Hoare annotation [2022-02-20 16:42:57,910 WARN L170 areAnnotationChecker]: L43-3 has no Hoare annotation [2022-02-20 16:42:57,910 WARN L170 areAnnotationChecker]: L43-3 has no Hoare annotation [2022-02-20 16:42:57,910 WARN L170 areAnnotationChecker]: L48-7 has no Hoare annotation [2022-02-20 16:42:57,911 WARN L170 areAnnotationChecker]: L48-7 has no Hoare annotation [2022-02-20 16:42:57,911 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-02-20 16:42:57,911 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-02-20 16:42:57,911 WARN L170 areAnnotationChecker]: L49-7 has no Hoare annotation [2022-02-20 16:42:57,911 WARN L170 areAnnotationChecker]: L49-7 has no Hoare annotation [2022-02-20 16:42:57,911 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2022-02-20 16:42:57,911 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2022-02-20 16:42:57,911 WARN L170 areAnnotationChecker]: L48-3 has no Hoare annotation [2022-02-20 16:42:57,911 WARN L170 areAnnotationChecker]: L48-3 has no Hoare annotation [2022-02-20 16:42:57,912 WARN L170 areAnnotationChecker]: L109 has no Hoare annotation [2022-02-20 16:42:57,912 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-02-20 16:42:57,912 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2022-02-20 16:42:57,912 WARN L170 areAnnotationChecker]: L49-3 has no Hoare annotation [2022-02-20 16:42:57,912 WARN L170 areAnnotationChecker]: L49-3 has no Hoare annotation [2022-02-20 16:42:57,912 WARN L170 areAnnotationChecker]: L48-5 has no Hoare annotation [2022-02-20 16:42:57,912 WARN L170 areAnnotationChecker]: L48-5 has no Hoare annotation [2022-02-20 16:42:57,912 WARN L170 areAnnotationChecker]: L123 has no Hoare annotation [2022-02-20 16:42:57,912 WARN L170 areAnnotationChecker]: L123 has no Hoare annotation [2022-02-20 16:42:57,912 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-02-20 16:42:57,913 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-02-20 16:42:57,913 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-02-20 16:42:57,913 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-02-20 16:42:57,913 WARN L170 areAnnotationChecker]: L49-5 has no Hoare annotation [2022-02-20 16:42:57,913 WARN L170 areAnnotationChecker]: L49-5 has no Hoare annotation [2022-02-20 16:42:57,913 WARN L170 areAnnotationChecker]: L124 has no Hoare annotation [2022-02-20 16:42:57,913 WARN L170 areAnnotationChecker]: L124 has no Hoare annotation [2022-02-20 16:42:57,913 WARN L170 areAnnotationChecker]: L128 has no Hoare annotation [2022-02-20 16:42:57,913 WARN L170 areAnnotationChecker]: L54-2 has no Hoare annotation [2022-02-20 16:42:57,914 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-02-20 16:42:57,914 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-02-20 16:42:57,914 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:42:57,914 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2022-02-20 16:42:57,914 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2022-02-20 16:42:57,914 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2022-02-20 16:42:57,914 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2022-02-20 16:42:57,914 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-02-20 16:42:57,914 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-02-20 16:42:57,914 WARN L170 areAnnotationChecker]: L61-2 has no Hoare annotation [2022-02-20 16:42:57,915 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2022-02-20 16:42:57,915 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2022-02-20 16:42:57,915 WARN L170 areAnnotationChecker]: L72-2 has no Hoare annotation [2022-02-20 16:42:57,915 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2022-02-20 16:42:57,915 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2022-02-20 16:42:57,915 WARN L170 areAnnotationChecker]: L84 has no Hoare annotation [2022-02-20 16:42:57,915 WARN L170 areAnnotationChecker]: L84 has no Hoare annotation [2022-02-20 16:42:57,915 WARN L170 areAnnotationChecker]: L86-2 has no Hoare annotation [2022-02-20 16:42:57,915 WARN L170 areAnnotationChecker]: L86-2 has no Hoare annotation [2022-02-20 16:42:57,916 WARN L170 areAnnotationChecker]: L99-2 has no Hoare annotation [2022-02-20 16:42:57,916 WARN L170 areAnnotationChecker]: L99-2 has no Hoare annotation [2022-02-20 16:42:57,916 WARN L170 areAnnotationChecker]: L86-1 has no Hoare annotation [2022-02-20 16:42:57,916 WARN L170 areAnnotationChecker]: L86-1 has no Hoare annotation [2022-02-20 16:42:57,916 WARN L170 areAnnotationChecker]: L91-1 has no Hoare annotation [2022-02-20 16:42:57,916 WARN L170 areAnnotationChecker]: L91-1 has no Hoare annotation [2022-02-20 16:42:57,916 WARN L170 areAnnotationChecker]: L99-1 has no Hoare annotation [2022-02-20 16:42:57,916 WARN L170 areAnnotationChecker]: L99-1 has no Hoare annotation [2022-02-20 16:42:57,916 WARN L170 areAnnotationChecker]: L104-1 has no Hoare annotation [2022-02-20 16:42:57,916 WARN L170 areAnnotationChecker]: L104-1 has no Hoare annotation [2022-02-20 16:42:57,917 WARN L170 areAnnotationChecker]: L91 has no Hoare annotation [2022-02-20 16:42:57,917 WARN L170 areAnnotationChecker]: L91 has no Hoare annotation [2022-02-20 16:42:57,917 WARN L170 areAnnotationChecker]: L91-2 has no Hoare annotation [2022-02-20 16:42:57,917 WARN L170 areAnnotationChecker]: L104 has no Hoare annotation [2022-02-20 16:42:57,917 WARN L170 areAnnotationChecker]: L104 has no Hoare annotation [2022-02-20 16:42:57,917 WARN L170 areAnnotationChecker]: L104-2 has no Hoare annotation [2022-02-20 16:42:57,917 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:57,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:42:57 BoogieIcfgContainer [2022-02-20 16:42:57,918 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:42:57,919 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:42:57,919 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:42:57,919 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:42:57,920 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:56" (3/4) ... [2022-02-20 16:42:57,922 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 16:42:57,922 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:42:57,924 INFO L158 Benchmark]: Toolchain (without parser) took 2427.81ms. Allocated memory was 83.9MB in the beginning and 121.6MB in the end (delta: 37.7MB). Free memory was 49.9MB in the beginning and 88.3MB in the end (delta: -38.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:42:57,924 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 83.9MB. Free memory was 62.8MB in the beginning and 62.8MB in the end (delta: 24.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:42:57,924 INFO L158 Benchmark]: CACSL2BoogieTranslator took 280.02ms. Allocated memory was 83.9MB in the beginning and 100.7MB in the end (delta: 16.8MB). Free memory was 49.6MB in the beginning and 74.1MB in the end (delta: -24.5MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. [2022-02-20 16:42:57,925 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.05ms. Allocated memory is still 100.7MB. Free memory was 74.1MB in the beginning and 71.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:42:57,925 INFO L158 Benchmark]: Boogie Preprocessor took 72.26ms. Allocated memory is still 100.7MB. Free memory was 71.4MB in the beginning and 69.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:42:57,926 INFO L158 Benchmark]: RCFGBuilder took 505.24ms. Allocated memory is still 100.7MB. Free memory was 69.3MB in the beginning and 73.3MB in the end (delta: -4.0MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. [2022-02-20 16:42:57,926 INFO L158 Benchmark]: TraceAbstraction took 1486.66ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 72.6MB in the beginning and 89.1MB in the end (delta: -16.5MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. [2022-02-20 16:42:57,927 INFO L158 Benchmark]: Witness Printer took 3.58ms. Allocated memory is still 121.6MB. Free memory was 89.1MB in the beginning and 88.3MB in the end (delta: 788.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:42:57,929 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.19ms. Allocated memory is still 83.9MB. Free memory was 62.8MB in the beginning and 62.8MB in the end (delta: 24.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 280.02ms. Allocated memory was 83.9MB in the beginning and 100.7MB in the end (delta: 16.8MB). Free memory was 49.6MB in the beginning and 74.1MB in the end (delta: -24.5MB). Peak memory consumption was 7.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.05ms. Allocated memory is still 100.7MB. Free memory was 74.1MB in the beginning and 71.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.26ms. Allocated memory is still 100.7MB. Free memory was 71.4MB in the beginning and 69.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 505.24ms. Allocated memory is still 100.7MB. Free memory was 69.3MB in the beginning and 73.3MB in the end (delta: -4.0MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. * TraceAbstraction took 1486.66ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 72.6MB in the beginning and 89.1MB in the end (delta: -16.5MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. * Witness Printer took 3.58ms. Allocated memory is still 121.6MB. Free memory was 89.1MB in the beginning and 88.3MB in the end (delta: 788.0kB). 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: 124]: 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 123, 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] [L119] float x = 0.0f; [L120] 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)=0, 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=0] [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)=0, 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=0, xsb=0] [L49] hx = sx & 0x7fffffff VAL [\old(x)=0, 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=0, xsb=0] [L51] COND TRUE ((hx) > 0x7f800000L) [L52] return x + x; VAL [\old(x)=0, 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=0, xsb=0] [L120] RET, EXPR __ieee754_expf(x) [L120] float res = __ieee754_expf(x); [L123] COND TRUE res != 1.0f 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=1000000000000000000000000000001, twom100_exp=39443045261/50000000000000000000000000000000000000000, x=0] [L124] 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=1000000000000000000000000000001, twom100_exp=39443045261/50000000000000000000000000000000000000000, x=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 43 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 68 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 68 mSDsluCounter, 242 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 75 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 38 IncrementalHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 167 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=52occurred 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, 43 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 44 NumberOfCodeBlocks, 44 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 28 ConstructedInterpolants, 0 QuantifiedInterpolants, 36 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:57,978 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_0832a.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 ccec72d1445b0e5a7d371146f8f1ae3659440ba0ebb02d40d87a31c04bfcf378 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:42:59,944 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:42:59,947 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:42:59,988 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:42:59,988 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:42:59,993 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:42:59,995 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:43:00,000 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:43:00,003 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:43:00,006 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:43:00,007 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:43:00,009 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:43:00,009 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:43:00,014 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:43:00,016 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:43:00,017 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:43:00,018 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:43:00,019 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:43:00,024 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:43:00,026 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:43:00,030 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:43:00,035 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:43:00,036 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:43:00,036 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:43:00,039 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:43:00,040 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:43:00,041 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:43:00,041 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:43:00,043 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:43:00,043 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:43:00,044 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:43:00,044 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:43:00,046 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:43:00,046 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:43:00,047 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:43:00,048 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:43:00,048 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:43:00,049 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:43:00,049 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:43:00,050 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:43:00,051 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:43:00,055 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:43:00,099 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:43:00,099 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:43:00,100 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:43:00,101 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:43:00,101 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:43:00,102 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:43:00,103 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:43:00,103 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:43:00,103 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:43:00,103 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:43:00,104 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:43:00,105 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:43:00,105 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:43:00,105 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:43:00,105 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:43:00,105 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:43:00,106 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:43:00,106 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:43:00,106 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:43:00,106 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:43:00,106 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:43:00,107 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:43:00,107 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:43:00,107 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:43:00,107 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:43:00,108 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:43:00,108 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:43:00,108 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:43:00,108 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:43:00,108 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:43:00,109 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:43:00,109 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:43:00,109 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:43:00,109 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:43:00,110 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:43:00,110 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:43:00,110 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 -> ccec72d1445b0e5a7d371146f8f1ae3659440ba0ebb02d40d87a31c04bfcf378 [2022-02-20 16:43:00,422 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:43:00,439 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:43:00,442 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:43:00,443 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:43:00,443 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:43:00,445 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0832a.c [2022-02-20 16:43:00,498 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de7f4b6c4/0c5c8f5a40c74236bdffb16c807d781d/FLAGfb54d6e1a [2022-02-20 16:43:00,954 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:43:00,955 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0832a.c [2022-02-20 16:43:00,962 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de7f4b6c4/0c5c8f5a40c74236bdffb16c807d781d/FLAGfb54d6e1a [2022-02-20 16:43:00,984 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de7f4b6c4/0c5c8f5a40c74236bdffb16c807d781d [2022-02-20 16:43:00,987 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:43:00,989 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:43:00,991 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:43:00,991 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:43:00,994 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:43:00,995 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:43:00" (1/1) ... [2022-02-20 16:43:00,996 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11a66205 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:43:00, skipping insertion in model container [2022-02-20 16:43:00,997 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:43:00" (1/1) ... [2022-02-20 16:43:01,013 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:43:01,036 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:43:01,250 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_0832a.c[3180,3193] [2022-02-20 16:43:01,259 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:43:01,286 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:43:01,345 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_0832a.c[3180,3193] [2022-02-20 16:43:01,346 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:43:01,370 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:43:01,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:43:01 WrapperNode [2022-02-20 16:43:01,372 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:43:01,374 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:43:01,374 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:43:01,374 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:43:01,380 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:43:01" (1/1) ... [2022-02-20 16:43:01,404 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:43:01" (1/1) ... [2022-02-20 16:43:01,444 INFO L137 Inliner]: procedures = 21, calls = 42, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 162 [2022-02-20 16:43:01,444 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:43:01,449 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:43:01,449 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:43:01,450 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:43:01,459 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:43:01" (1/1) ... [2022-02-20 16:43:01,460 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:43:01" (1/1) ... [2022-02-20 16:43:01,473 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:43:01" (1/1) ... [2022-02-20 16:43:01,477 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:43:01" (1/1) ... [2022-02-20 16:43:01,492 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:43:01" (1/1) ... [2022-02-20 16:43:01,497 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:43:01" (1/1) ... [2022-02-20 16:43:01,505 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:43:01" (1/1) ... [2022-02-20 16:43:01,509 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:43:01,510 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:43:01,510 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:43:01,510 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:43:01,511 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:43:01" (1/1) ... [2022-02-20 16:43:01,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:43:01,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:43:01,544 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:43:01,545 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:43:01,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:43:01,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2022-02-20 16:43:01,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:43:01,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:43:01,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2022-02-20 16:43:01,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 16:43:01,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:43:01,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:43:01,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2022-02-20 16:43:01,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 16:43:01,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:43:01,703 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:43:01,705 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:43:11,664 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:43:11,672 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:43:11,673 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2022-02-20 16:43:11,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:43:11 BoogieIcfgContainer [2022-02-20 16:43:11,675 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:43:11,676 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:43:11,677 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:43:11,679 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:43:11,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:43:00" (1/3) ... [2022-02-20 16:43:11,680 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ea76c5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:43:11, skipping insertion in model container [2022-02-20 16:43:11,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:43:01" (2/3) ... [2022-02-20 16:43:11,681 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ea76c5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:43:11, skipping insertion in model container [2022-02-20 16:43:11,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:43:11" (3/3) ... [2022-02-20 16:43:11,682 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_0832a.c [2022-02-20 16:43:11,686 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:43:11,686 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:43:11,719 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:43:11,726 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:43:11,727 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:43:11,739 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 35 states have internal predecessors, (57), 0 states have call successors, (0), 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,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 16:43:11,742 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:43:11,743 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:43:11,743 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:43:11,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:43:11,748 INFO L85 PathProgramCache]: Analyzing trace with hash 354246130, now seen corresponding path program 1 times [2022-02-20 16:43:11,759 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:43:11,760 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1712676462] [2022-02-20 16:43:11,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:43:11,761 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:43:11,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:43:11,766 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:43:11,776 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:43:12,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:43:12,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:43:12,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:43:12,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:43:12,251 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~one_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)); {39#true} is VALID [2022-02-20 16:43:12,252 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret15#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~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; {39#true} is VALID [2022-02-20 16:43:12,254 INFO L290 TraceCheckUtils]: 2: Hoare triple {39#true} assume !true; {40#false} is VALID [2022-02-20 16:43:12,254 INFO L290 TraceCheckUtils]: 3: Hoare triple {40#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); {40#false} is VALID [2022-02-20 16:43:12,254 INFO L290 TraceCheckUtils]: 4: Hoare triple {40#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); {40#false} is VALID [2022-02-20 16:43:12,255 INFO L290 TraceCheckUtils]: 5: Hoare triple {40#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; {40#false} is VALID [2022-02-20 16:43:12,255 INFO L290 TraceCheckUtils]: 6: Hoare triple {40#false} assume !~fp.eq~FLOAT(main_~res~0#1, ~to_fp~FLOAT(currentRoundingMode, 1.0)); {40#false} is VALID [2022-02-20 16:43:12,256 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#false} assume !false; {40#false} is VALID [2022-02-20 16:43:12,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:43:12,258 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:43:12,258 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:43:12,259 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1712676462] [2022-02-20 16:43:12,259 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1712676462] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:43:12,259 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:43:12,259 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:43:12,261 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56105703] [2022-02-20 16:43:12,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:43:12,266 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 16:43:12,266 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:43:12,269 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:43:12,303 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:43:12,303 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:43:12,304 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:43:12,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:43:12,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:43:12,337 INFO L87 Difference]: Start difference. First operand has 36 states, 34 states have (on average 1.6764705882352942) internal successors, (57), 35 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:43:21,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:43:21,384 INFO L93 Difference]: Finished difference Result 70 states and 112 transitions. [2022-02-20 16:43:21,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:43:21,384 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 16:43:21,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:43:21,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:43:21,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 112 transitions. [2022-02-20 16:43:21,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:43:21,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 112 transitions. [2022-02-20 16:43:21,398 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 112 transitions. [2022-02-20 16:43:23,733 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:43:23,740 INFO L225 Difference]: With dead ends: 70 [2022-02-20 16:43:23,741 INFO L226 Difference]: Without dead ends: 33 [2022-02-20 16:43:23,743 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:43:23,748 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:43:23,750 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:43:23,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-02-20 16:43:23,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-02-20 16:43:23,770 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:43:23,771 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 0 states have call successors, (0), 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:23,772 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 0 states have call successors, (0), 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:23,772 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 0 states have call successors, (0), 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:23,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:43:23,775 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-02-20 16:43:23,775 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-02-20 16:43:23,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:43:23,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:43:23,776 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 0 states have call successors, (0), 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 33 states. [2022-02-20 16:43:23,776 INFO L87 Difference]: Start difference. First operand has 33 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 0 states have call successors, (0), 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 33 states. [2022-02-20 16:43:23,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:43:23,780 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-02-20 16:43:23,780 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-02-20 16:43:23,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:43:23,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:43:23,781 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:43:23,781 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:43:23,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 0 states have call successors, (0), 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:23,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 43 transitions. [2022-02-20 16:43:23,784 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 43 transitions. Word has length 8 [2022-02-20 16:43:23,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:43:23,785 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 43 transitions. [2022-02-20 16:43:23,785 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:43:23,785 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-02-20 16:43:23,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 16:43:23,785 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:43:23,786 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:43:23,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-02-20 16:43:23,999 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:24,000 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:43:24,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:43:24,001 INFO L85 PathProgramCache]: Analyzing trace with hash 325000437, now seen corresponding path program 1 times [2022-02-20 16:43:24,001 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:43:24,001 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2026876627] [2022-02-20 16:43:24,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:43:24,002 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:43:24,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:43:24,003 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:24,005 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:24,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:43:24,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 16:43:24,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:43:24,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:43:24,650 INFO L290 TraceCheckUtils]: 0: Hoare triple {247#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~one_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)); {247#true} is VALID [2022-02-20 16:43:24,651 INFO L290 TraceCheckUtils]: 1: Hoare triple {247#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret15#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~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; {255#(= |ULTIMATE.start___ieee754_expf_~x#1| (_ +zero 8 24))} is VALID [2022-02-20 16:43:24,652 INFO L290 TraceCheckUtils]: 2: Hoare triple {255#(= |ULTIMATE.start___ieee754_expf_~x#1| (_ +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; {259#(= (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|)) (_ +zero 8 24))} is VALID [2022-02-20 16:43:24,653 INFO L290 TraceCheckUtils]: 3: Hoare triple {259#(= (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|)) (_ +zero 8 24))} goto; {259#(= (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|)) (_ +zero 8 24))} is VALID [2022-02-20 16:43:24,654 INFO L290 TraceCheckUtils]: 4: Hoare triple {259#(= (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|)) (_ +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); {266#(exists ((|ULTIMATE.start___ieee754_expf_~sx~0#1| (_ BitVec 32))) (and (= |ULTIMATE.start___ieee754_expf_~hx~0#1| (bvand (_ bv2147483647 32) |ULTIMATE.start___ieee754_expf_~sx~0#1|)) (= (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|)) (_ +zero 8 24))))} is VALID [2022-02-20 16:43:24,661 INFO L290 TraceCheckUtils]: 5: Hoare triple {266#(exists ((|ULTIMATE.start___ieee754_expf_~sx~0#1| (_ BitVec 32))) (and (= |ULTIMATE.start___ieee754_expf_~hx~0#1| (bvand (_ bv2147483647 32) |ULTIMATE.start___ieee754_expf_~sx~0#1|)) (= (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|)) (_ +zero 8 24))))} assume ~bvugt32(__ieee754_expf_~hx~0#1, 2139095040bv32);__ieee754_expf_#res#1 := ~fp.add~FLOAT(currentRoundingMode, __ieee754_expf_~x#1, __ieee754_expf_~x#1); {248#false} is VALID [2022-02-20 16:43:24,661 INFO L290 TraceCheckUtils]: 6: Hoare triple {248#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; {248#false} is VALID [2022-02-20 16:43:24,661 INFO L290 TraceCheckUtils]: 7: Hoare triple {248#false} assume !~fp.eq~FLOAT(main_~res~0#1, ~to_fp~FLOAT(currentRoundingMode, 1.0)); {248#false} is VALID [2022-02-20 16:43:24,661 INFO L290 TraceCheckUtils]: 8: Hoare triple {248#false} assume !false; {248#false} is VALID [2022-02-20 16:43:24,661 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:24,662 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:43:24,662 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:43:24,662 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2026876627] [2022-02-20 16:43:24,662 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2026876627] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:43:24,662 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:43:24,662 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:43:24,663 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661908912] [2022-02-20 16:43:24,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:43:24,664 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 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:24,664 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:43:24,664 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 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:24,686 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:43:24,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:43:24,686 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:43:24,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:43:24,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:43:24,687 INFO L87 Difference]: Start difference. First operand 33 states and 43 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 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:30,984 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s 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:37,362 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 16:43:47,425 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:56,058 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 16:44:00,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:44:00,912 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-02-20 16:44:00,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:44:00,912 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 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:44:00,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:44:00,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 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:44:00,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2022-02-20 16:44:00,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 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:44:00,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2022-02-20 16:44:00,914 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 46 transitions. [2022-02-20 16:44:02,169 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:44:02,170 INFO L225 Difference]: With dead ends: 37 [2022-02-20 16:44:02,171 INFO L226 Difference]: Without dead ends: 33 [2022-02-20 16:44:02,171 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:44:02,172 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 4 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 13 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2022-02-20 16:44:02,172 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 128 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 4 Unknown, 13 Unchecked, 9.4s Time] [2022-02-20 16:44:02,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-02-20 16:44:02,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-02-20 16:44:02,176 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:44:02,176 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 32 states have (on average 1.3125) internal successors, (42), 32 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:44:02,177 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 32 states have (on average 1.3125) internal successors, (42), 32 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:44:02,177 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 32 states have (on average 1.3125) internal successors, (42), 32 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:44:02,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:44:02,179 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2022-02-20 16:44:02,179 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2022-02-20 16:44:02,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:44:02,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:44:02,180 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 32 states have (on average 1.3125) internal successors, (42), 32 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 33 states. [2022-02-20 16:44:02,180 INFO L87 Difference]: Start difference. First operand has 33 states, 32 states have (on average 1.3125) internal successors, (42), 32 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 33 states. [2022-02-20 16:44:02,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:44:02,182 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2022-02-20 16:44:02,182 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2022-02-20 16:44:02,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:44:02,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:44:02,182 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:44:02,183 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:44:02,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.3125) internal successors, (42), 32 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:44:02,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2022-02-20 16:44:02,184 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 9 [2022-02-20 16:44:02,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:44:02,185 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2022-02-20 16:44:02,185 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 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:44:02,185 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2022-02-20 16:44:02,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:44:02,186 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:44:02,186 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:44:02,205 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:44:02,395 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:44:02,396 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:44:02,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:44:02,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1239545392, now seen corresponding path program 1 times [2022-02-20 16:44:02,397 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:44:02,397 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1638016328] [2022-02-20 16:44:02,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:44:02,398 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:44:02,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:44:02,400 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:44:02,404 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:44:02,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:44:02,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 16:44:02,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:44:02,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:44:03,014 INFO L290 TraceCheckUtils]: 0: Hoare triple {427#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~one_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)); {427#true} is VALID [2022-02-20 16:44:03,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {427#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret15#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~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; {435#(= |ULTIMATE.start___ieee754_expf_~x#1| (_ +zero 8 24))} is VALID [2022-02-20 16:44:03,018 INFO L290 TraceCheckUtils]: 2: Hoare triple {435#(= |ULTIMATE.start___ieee754_expf_~x#1| (_ +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; {439#(= (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|)) (_ +zero 8 24))} is VALID [2022-02-20 16:44:03,019 INFO L290 TraceCheckUtils]: 3: Hoare triple {439#(= (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|)) (_ +zero 8 24))} goto; {439#(= (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|)) (_ +zero 8 24))} is VALID [2022-02-20 16:44:03,019 INFO L290 TraceCheckUtils]: 4: Hoare triple {439#(= (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|)) (_ +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); {439#(= (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|)) (_ +zero 8 24))} is VALID [2022-02-20 16:44:03,019 INFO L290 TraceCheckUtils]: 5: Hoare triple {439#(= (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|)) (_ +zero 8 24))} assume !~bvugt32(__ieee754_expf_~hx~0#1, 2139095040bv32); {439#(= (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|)) (_ +zero 8 24))} is VALID [2022-02-20 16:44:03,020 INFO L290 TraceCheckUtils]: 6: Hoare triple {439#(= (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|)) (_ +zero 8 24))} assume !(2139095040bv32 == __ieee754_expf_~hx~0#1); {439#(= (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|)) (_ +zero 8 24))} is VALID [2022-02-20 16:44:03,053 INFO L290 TraceCheckUtils]: 7: Hoare triple {439#(= (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|)) (_ +zero 8 24))} assume ~bvsgt32(__ieee754_expf_~sx~0#1, 1118925335bv32);__ieee754_expf_#res#1 := ~fp.mul~FLOAT(currentRoundingMode, ~huge_exp~0, ~huge_exp~0); {428#false} is VALID [2022-02-20 16:44:03,053 INFO L290 TraceCheckUtils]: 8: Hoare triple {428#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; {428#false} is VALID [2022-02-20 16:44:03,054 INFO L290 TraceCheckUtils]: 9: Hoare triple {428#false} assume !~fp.eq~FLOAT(main_~res~0#1, ~to_fp~FLOAT(currentRoundingMode, 1.0)); {428#false} is VALID [2022-02-20 16:44:03,054 INFO L290 TraceCheckUtils]: 10: Hoare triple {428#false} assume !false; {428#false} is VALID [2022-02-20 16:44:03,054 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:44:03,054 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:44:03,054 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:44:03,055 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1638016328] [2022-02-20 16:44:03,055 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1638016328] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:44:03,055 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:44:03,055 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:44:03,055 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052198802] [2022-02-20 16:44:03,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:44:03,056 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 16:44:03,056 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:44:03,056 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:44:03,104 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:44:03,104 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:44:03,104 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:44:03,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:44:03,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:44:03,105 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:44:05,773 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-02-20 16:44:08,016 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []