./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_1230.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_1230.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 95e4857f2e80c4b2a09349ad506a32e395132bf666c8dc52d9ee1d4dade10d91 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:46:39,735 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:46:39,736 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:46:39,755 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:46:39,755 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:46:39,756 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:46:39,757 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:46:39,758 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:46:39,759 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:46:39,760 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:46:39,760 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:46:39,761 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:46:39,761 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:46:39,762 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:46:39,763 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:46:39,763 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:46:39,764 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:46:39,765 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:46:39,766 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:46:39,767 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:46:39,768 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:46:39,769 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:46:39,770 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:46:39,770 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:46:39,772 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:46:39,772 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:46:39,772 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:46:39,773 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:46:39,773 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:46:39,774 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:46:39,774 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:46:39,775 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:46:39,775 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:46:39,776 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:46:39,776 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:46:39,777 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:46:39,777 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:46:39,777 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:46:39,778 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:46:39,778 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:46:39,779 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:46:39,779 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:46:39,803 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:46:39,803 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:46:39,803 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:46:39,804 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:46:39,804 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:46:39,804 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:46:39,805 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:46:39,805 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:46:39,805 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:46:39,805 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:46:39,806 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:46:39,806 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:46:39,806 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:46:39,806 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:46:39,806 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:46:39,806 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:46:39,807 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:46:39,807 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:46:39,807 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:46:39,807 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:46:39,807 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:46:39,808 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:46:39,808 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:46:39,808 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:46:39,808 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:39,808 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:46:39,809 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:46:39,809 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:46:39,809 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:46:39,809 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:46:39,809 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:46:39,809 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:46:39,810 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:46:39,810 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 -> 95e4857f2e80c4b2a09349ad506a32e395132bf666c8dc52d9ee1d4dade10d91 [2022-02-20 16:46:39,959 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:46:39,973 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:46:39,975 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:46:39,976 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:46:39,978 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:46:39,979 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1230.c [2022-02-20 16:46:40,043 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80941c5c3/648bbf63c38748bfb6759f24d56c030d/FLAG5d74c6b61 [2022-02-20 16:46:40,404 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:46:40,405 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1230.c [2022-02-20 16:46:40,413 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80941c5c3/648bbf63c38748bfb6759f24d56c030d/FLAG5d74c6b61 [2022-02-20 16:46:40,832 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/80941c5c3/648bbf63c38748bfb6759f24d56c030d [2022-02-20 16:46:40,836 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:46:40,842 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:46:40,859 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:40,859 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:46:40,862 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:46:40,863 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:40" (1/1) ... [2022-02-20 16:46:40,863 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75e15061 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:40, skipping insertion in model container [2022-02-20 16:46:40,864 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:40" (1/1) ... [2022-02-20 16:46:40,868 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:46:40,901 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:46:41,082 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_1230.c[1411,1424] [2022-02-20 16:46:41,084 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:41,089 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:46:41,104 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_1230.c[1411,1424] [2022-02-20 16:46:41,105 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:41,114 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:46:41,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:41 WrapperNode [2022-02-20 16:46:41,115 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:41,116 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:41,116 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:46:41,116 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:46:41,121 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:41" (1/1) ... [2022-02-20 16:46:41,127 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:46:41" (1/1) ... [2022-02-20 16:46:41,141 INFO L137 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 50 [2022-02-20 16:46:41,141 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:41,142 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:46:41,142 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:46:41,142 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:46:41,147 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:41" (1/1) ... [2022-02-20 16:46:41,148 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:41" (1/1) ... [2022-02-20 16:46:41,149 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:41" (1/1) ... [2022-02-20 16:46:41,149 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:41" (1/1) ... [2022-02-20 16:46:41,154 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:41" (1/1) ... [2022-02-20 16:46:41,158 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:41" (1/1) ... [2022-02-20 16:46:41,159 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:41" (1/1) ... [2022-02-20 16:46:41,160 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:46:41,161 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:46:41,161 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:46:41,161 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:46:41,162 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:41" (1/1) ... [2022-02-20 16:46:41,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:41,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:46:41,209 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:46:41,231 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:46:41,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:46:41,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:46:41,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:46:41,250 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2022-02-20 16:46:41,250 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2022-02-20 16:46:41,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-02-20 16:46:41,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:46:41,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:46:41,251 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:46:41,251 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:46:41,307 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:46:41,308 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:46:41,532 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:46:41,548 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:46:41,548 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 16:46:41,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:41 BoogieIcfgContainer [2022-02-20 16:46:41,550 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:46:41,551 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:46:41,551 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:46:41,553 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:46:41,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:46:40" (1/3) ... [2022-02-20 16:46:41,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ca6888c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:41, skipping insertion in model container [2022-02-20 16:46:41,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:41" (2/3) ... [2022-02-20 16:46:41,555 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ca6888c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:41, skipping insertion in model container [2022-02-20 16:46:41,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:41" (3/3) ... [2022-02-20 16:46:41,561 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1230.c [2022-02-20 16:46:41,565 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:46:41,566 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:46:41,601 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:46:41,605 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:46:41,606 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:46:41,620 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:46:41,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 16:46:41,624 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:41,624 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:41,625 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:41,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:41,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1232868241, now seen corresponding path program 1 times [2022-02-20 16:46:41,636 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:46:41,636 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354519436] [2022-02-20 16:46:41,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:41,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:46:41,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:41,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:46:41,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:41,783 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#(and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~x := #in~x;havoc ~w~0; {30#true} is VALID [2022-02-20 16:46:41,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#true} assume !true; {31#false} is VALID [2022-02-20 16:46:41,785 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#false} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296;#res := 2; {31#false} is VALID [2022-02-20 16:46:41,785 INFO L290 TraceCheckUtils]: 3: Hoare triple {31#false} assume true; {31#false} is VALID [2022-02-20 16:46:41,785 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {31#false} {30#true} #69#return; {31#false} is VALID [2022-02-20 16:46:41,786 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3); {30#true} is VALID [2022-02-20 16:46:41,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_#t~ret9#1, main_~x~0#1, main_~y~0#1, main_~res~0#1;main_~x~0#1 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0);main_~y~0#1 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0);assume { :begin_inline_fmin_float } true;fmin_float_#in~x#1, fmin_float_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmin_float_#res#1;havoc fmin_float_#t~ret5#1, fmin_float_#t~ret6#1, fmin_float_#t~ite7#1, fmin_float_~x#1, fmin_float_~y#1;fmin_float_~x#1 := fmin_float_#in~x#1;fmin_float_~y#1 := fmin_float_#in~y#1; {30#true} is VALID [2022-02-20 16:46:41,788 INFO L272 TraceCheckUtils]: 2: Hoare triple {30#true} call fmin_float_#t~ret5#1 := __fpclassify_float(fmin_float_~x#1); {37#(and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:46:41,788 INFO L290 TraceCheckUtils]: 3: Hoare triple {37#(and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~x := #in~x;havoc ~w~0; {30#true} is VALID [2022-02-20 16:46:41,789 INFO L290 TraceCheckUtils]: 4: Hoare triple {30#true} assume !true; {31#false} is VALID [2022-02-20 16:46:41,789 INFO L290 TraceCheckUtils]: 5: Hoare triple {31#false} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296;#res := 2; {31#false} is VALID [2022-02-20 16:46:41,789 INFO L290 TraceCheckUtils]: 6: Hoare triple {31#false} assume true; {31#false} is VALID [2022-02-20 16:46:41,789 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {31#false} {30#true} #69#return; {31#false} is VALID [2022-02-20 16:46:41,789 INFO L290 TraceCheckUtils]: 8: Hoare triple {31#false} assume -2147483648 <= fmin_float_#t~ret5#1 && fmin_float_#t~ret5#1 <= 2147483647; {31#false} is VALID [2022-02-20 16:46:41,790 INFO L290 TraceCheckUtils]: 9: Hoare triple {31#false} assume 0 == fmin_float_#t~ret5#1;havoc fmin_float_#t~ret5#1;fmin_float_#res#1 := fmin_float_~y#1; {31#false} is VALID [2022-02-20 16:46:41,790 INFO L290 TraceCheckUtils]: 10: Hoare triple {31#false} main_#t~ret8#1 := fmin_float_#res#1;assume { :end_inline_fmin_float } true;main_~res~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_isnan_float } true;isnan_float_#in~x#1 := main_~res~0#1;havoc isnan_float_#res#1;havoc isnan_float_~x#1;isnan_float_~x#1 := isnan_float_#in~x#1;isnan_float_#res#1 := (if ~someBinaryFLOATComparisonOperation(isnan_float_~x#1, isnan_float_~x#1) then 1 else 0); {31#false} is VALID [2022-02-20 16:46:41,790 INFO L290 TraceCheckUtils]: 11: Hoare triple {31#false} main_#t~ret9#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647; {31#false} is VALID [2022-02-20 16:46:41,790 INFO L290 TraceCheckUtils]: 12: Hoare triple {31#false} assume 0 == main_#t~ret9#1;havoc main_#t~ret9#1; {31#false} is VALID [2022-02-20 16:46:41,791 INFO L290 TraceCheckUtils]: 13: Hoare triple {31#false} assume !false; {31#false} is VALID [2022-02-20 16:46:41,791 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:46:41,791 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:46:41,792 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354519436] [2022-02-20 16:46:41,792 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354519436] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:41,792 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:41,793 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:46:41,794 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674208274] [2022-02-20 16:46:41,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:41,798 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-02-20 16:46:41,800 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:41,802 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), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:46:41,823 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:41,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:46:41,824 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:46:41,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:46:41,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:46:41,844 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:46:41,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:41,937 INFO L93 Difference]: Finished difference Result 51 states and 72 transitions. [2022-02-20 16:46:41,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:46:41,937 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-02-20 16:46:41,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:41,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:46:41,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2022-02-20 16:46:41,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:46:41,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2022-02-20 16:46:41,957 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 72 transitions. [2022-02-20 16:46:42,023 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:42,030 INFO L225 Difference]: With dead ends: 51 [2022-02-20 16:46:42,031 INFO L226 Difference]: Without dead ends: 24 [2022-02-20 16:46:42,033 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:46:42,038 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:42,039 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 62 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:46:42,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-02-20 16:46:42,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-02-20 16:46:42,062 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:42,064 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:46:42,064 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:46:42,065 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:46:42,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:42,069 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2022-02-20 16:46:42,069 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2022-02-20 16:46:42,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:42,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:42,071 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 24 states. [2022-02-20 16:46:42,072 INFO L87 Difference]: Start difference. First operand has 24 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 24 states. [2022-02-20 16:46:42,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:42,076 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2022-02-20 16:46:42,076 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2022-02-20 16:46:42,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:42,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:42,077 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:42,077 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:42,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:46:42,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2022-02-20 16:46:42,083 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 14 [2022-02-20 16:46:42,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:42,084 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2022-02-20 16:46:42,084 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:46:42,084 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2022-02-20 16:46:42,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 16:46:42,085 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:42,085 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:42,085 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:46:42,086 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:42,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:42,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1566908876, now seen corresponding path program 1 times [2022-02-20 16:46:42,086 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:46:42,087 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964559785] [2022-02-20 16:46:42,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:42,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:46:42,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:42,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:46:42,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:42,222 INFO L290 TraceCheckUtils]: 0: Hoare triple {191#(and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~x := #in~x;havoc ~w~0; {182#true} is VALID [2022-02-20 16:46:42,222 INFO L290 TraceCheckUtils]: 1: Hoare triple {182#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4);call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4);call #t~mem4 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4);~w~0 := #t~mem4;havoc #t~mem4;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {182#true} is VALID [2022-02-20 16:46:42,223 INFO L290 TraceCheckUtils]: 2: Hoare triple {182#true} goto; {182#true} is VALID [2022-02-20 16:46:42,223 INFO L290 TraceCheckUtils]: 3: Hoare triple {182#true} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296;#res := 2; {192#(and (<= |__fpclassify_float_#res| 2) (<= 2 |__fpclassify_float_#res|))} is VALID [2022-02-20 16:46:42,224 INFO L290 TraceCheckUtils]: 4: Hoare triple {192#(and (<= |__fpclassify_float_#res| 2) (<= 2 |__fpclassify_float_#res|))} assume true; {192#(and (<= |__fpclassify_float_#res| 2) (<= 2 |__fpclassify_float_#res|))} is VALID [2022-02-20 16:46:42,224 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {192#(and (<= |__fpclassify_float_#res| 2) (<= 2 |__fpclassify_float_#res|))} {182#true} #69#return; {190#(= (+ (- 2) |ULTIMATE.start_fmin_float_#t~ret5#1|) 0)} is VALID [2022-02-20 16:46:42,225 INFO L290 TraceCheckUtils]: 0: Hoare triple {182#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3); {182#true} is VALID [2022-02-20 16:46:42,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {182#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_#t~ret9#1, main_~x~0#1, main_~y~0#1, main_~res~0#1;main_~x~0#1 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0);main_~y~0#1 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0);assume { :begin_inline_fmin_float } true;fmin_float_#in~x#1, fmin_float_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmin_float_#res#1;havoc fmin_float_#t~ret5#1, fmin_float_#t~ret6#1, fmin_float_#t~ite7#1, fmin_float_~x#1, fmin_float_~y#1;fmin_float_~x#1 := fmin_float_#in~x#1;fmin_float_~y#1 := fmin_float_#in~y#1; {182#true} is VALID [2022-02-20 16:46:42,226 INFO L272 TraceCheckUtils]: 2: Hoare triple {182#true} call fmin_float_#t~ret5#1 := __fpclassify_float(fmin_float_~x#1); {191#(and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:46:42,226 INFO L290 TraceCheckUtils]: 3: Hoare triple {191#(and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~x := #in~x;havoc ~w~0; {182#true} is VALID [2022-02-20 16:46:42,226 INFO L290 TraceCheckUtils]: 4: Hoare triple {182#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4);call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4);call #t~mem4 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4);~w~0 := #t~mem4;havoc #t~mem4;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {182#true} is VALID [2022-02-20 16:46:42,226 INFO L290 TraceCheckUtils]: 5: Hoare triple {182#true} goto; {182#true} is VALID [2022-02-20 16:46:42,227 INFO L290 TraceCheckUtils]: 6: Hoare triple {182#true} assume 0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296;#res := 2; {192#(and (<= |__fpclassify_float_#res| 2) (<= 2 |__fpclassify_float_#res|))} is VALID [2022-02-20 16:46:42,227 INFO L290 TraceCheckUtils]: 7: Hoare triple {192#(and (<= |__fpclassify_float_#res| 2) (<= 2 |__fpclassify_float_#res|))} assume true; {192#(and (<= |__fpclassify_float_#res| 2) (<= 2 |__fpclassify_float_#res|))} is VALID [2022-02-20 16:46:42,228 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {192#(and (<= |__fpclassify_float_#res| 2) (<= 2 |__fpclassify_float_#res|))} {182#true} #69#return; {190#(= (+ (- 2) |ULTIMATE.start_fmin_float_#t~ret5#1|) 0)} is VALID [2022-02-20 16:46:42,229 INFO L290 TraceCheckUtils]: 9: Hoare triple {190#(= (+ (- 2) |ULTIMATE.start_fmin_float_#t~ret5#1|) 0)} assume -2147483648 <= fmin_float_#t~ret5#1 && fmin_float_#t~ret5#1 <= 2147483647; {190#(= (+ (- 2) |ULTIMATE.start_fmin_float_#t~ret5#1|) 0)} is VALID [2022-02-20 16:46:42,229 INFO L290 TraceCheckUtils]: 10: Hoare triple {190#(= (+ (- 2) |ULTIMATE.start_fmin_float_#t~ret5#1|) 0)} assume 0 == fmin_float_#t~ret5#1;havoc fmin_float_#t~ret5#1;fmin_float_#res#1 := fmin_float_~y#1; {183#false} is VALID [2022-02-20 16:46:42,229 INFO L290 TraceCheckUtils]: 11: Hoare triple {183#false} main_#t~ret8#1 := fmin_float_#res#1;assume { :end_inline_fmin_float } true;main_~res~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_isnan_float } true;isnan_float_#in~x#1 := main_~res~0#1;havoc isnan_float_#res#1;havoc isnan_float_~x#1;isnan_float_~x#1 := isnan_float_#in~x#1;isnan_float_#res#1 := (if ~someBinaryFLOATComparisonOperation(isnan_float_~x#1, isnan_float_~x#1) then 1 else 0); {183#false} is VALID [2022-02-20 16:46:42,229 INFO L290 TraceCheckUtils]: 12: Hoare triple {183#false} main_#t~ret9#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647; {183#false} is VALID [2022-02-20 16:46:42,230 INFO L290 TraceCheckUtils]: 13: Hoare triple {183#false} assume 0 == main_#t~ret9#1;havoc main_#t~ret9#1; {183#false} is VALID [2022-02-20 16:46:42,230 INFO L290 TraceCheckUtils]: 14: Hoare triple {183#false} assume !false; {183#false} is VALID [2022-02-20 16:46:42,230 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:46:42,230 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:46:42,230 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964559785] [2022-02-20 16:46:42,230 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964559785] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:42,231 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:42,231 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:46:42,231 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922208742] [2022-02-20 16:46:42,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:42,232 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-02-20 16:46:42,232 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:42,232 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:46:42,243 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:42,243 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:46:42,243 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:46:42,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:46:42,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:46:42,244 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:46:42,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:42,314 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2022-02-20 16:46:42,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:46:42,314 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-02-20 16:46:42,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:42,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:46:42,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-02-20 16:46:42,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:46:42,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-02-20 16:46:42,317 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-02-20 16:46:42,345 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:42,346 INFO L225 Difference]: With dead ends: 33 [2022-02-20 16:46:42,346 INFO L226 Difference]: Without dead ends: 28 [2022-02-20 16:46:42,346 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:46:42,347 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:42,348 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 101 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:46:42,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-02-20 16:46:42,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-02-20 16:46:42,351 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:42,351 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:46:42,351 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:46:42,352 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:46:42,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:42,353 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-02-20 16:46:42,354 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-02-20 16:46:42,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:42,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:42,354 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 28 states. [2022-02-20 16:46:42,355 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 28 states. [2022-02-20 16:46:42,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:42,356 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-02-20 16:46:42,356 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-02-20 16:46:42,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:42,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:42,357 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:42,357 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:42,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:46:42,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2022-02-20 16:46:42,359 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 15 [2022-02-20 16:46:42,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:42,359 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2022-02-20 16:46:42,359 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:46:42,359 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-02-20 16:46:42,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 16:46:42,360 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:42,360 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:42,360 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:46:42,360 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:42,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:42,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1928564788, now seen corresponding path program 1 times [2022-02-20 16:46:42,361 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:46:42,361 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205193572] [2022-02-20 16:46:42,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:42,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:46:42,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:42,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:46:42,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:42,422 INFO L290 TraceCheckUtils]: 0: Hoare triple {336#(and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~x := #in~x;havoc ~w~0; {326#true} is VALID [2022-02-20 16:46:42,422 INFO L290 TraceCheckUtils]: 1: Hoare triple {326#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4);call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4);call #t~mem4 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4);~w~0 := #t~mem4;havoc #t~mem4;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {326#true} is VALID [2022-02-20 16:46:42,422 INFO L290 TraceCheckUtils]: 2: Hoare triple {326#true} goto; {326#true} is VALID [2022-02-20 16:46:42,423 INFO L290 TraceCheckUtils]: 3: Hoare triple {326#true} assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); {326#true} is VALID [2022-02-20 16:46:42,423 INFO L290 TraceCheckUtils]: 4: Hoare triple {326#true} assume (~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687);#res := 4; {337#(= |__fpclassify_float_#res| 4)} is VALID [2022-02-20 16:46:42,423 INFO L290 TraceCheckUtils]: 5: Hoare triple {337#(= |__fpclassify_float_#res| 4)} assume true; {337#(= |__fpclassify_float_#res| 4)} is VALID [2022-02-20 16:46:42,424 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {337#(= |__fpclassify_float_#res| 4)} {326#true} #69#return; {335#(<= 4 |ULTIMATE.start_fmin_float_#t~ret5#1|)} is VALID [2022-02-20 16:46:42,424 INFO L290 TraceCheckUtils]: 0: Hoare triple {326#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3); {326#true} is VALID [2022-02-20 16:46:42,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {326#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_#t~ret9#1, main_~x~0#1, main_~y~0#1, main_~res~0#1;main_~x~0#1 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0);main_~y~0#1 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0);assume { :begin_inline_fmin_float } true;fmin_float_#in~x#1, fmin_float_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmin_float_#res#1;havoc fmin_float_#t~ret5#1, fmin_float_#t~ret6#1, fmin_float_#t~ite7#1, fmin_float_~x#1, fmin_float_~y#1;fmin_float_~x#1 := fmin_float_#in~x#1;fmin_float_~y#1 := fmin_float_#in~y#1; {326#true} is VALID [2022-02-20 16:46:42,425 INFO L272 TraceCheckUtils]: 2: Hoare triple {326#true} call fmin_float_#t~ret5#1 := __fpclassify_float(fmin_float_~x#1); {336#(and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:46:42,425 INFO L290 TraceCheckUtils]: 3: Hoare triple {336#(and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~x := #in~x;havoc ~w~0; {326#true} is VALID [2022-02-20 16:46:42,426 INFO L290 TraceCheckUtils]: 4: Hoare triple {326#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4);call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4);call #t~mem4 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4);~w~0 := #t~mem4;havoc #t~mem4;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {326#true} is VALID [2022-02-20 16:46:42,426 INFO L290 TraceCheckUtils]: 5: Hoare triple {326#true} goto; {326#true} is VALID [2022-02-20 16:46:42,426 INFO L290 TraceCheckUtils]: 6: Hoare triple {326#true} assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); {326#true} is VALID [2022-02-20 16:46:42,426 INFO L290 TraceCheckUtils]: 7: Hoare triple {326#true} assume (~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687);#res := 4; {337#(= |__fpclassify_float_#res| 4)} is VALID [2022-02-20 16:46:42,427 INFO L290 TraceCheckUtils]: 8: Hoare triple {337#(= |__fpclassify_float_#res| 4)} assume true; {337#(= |__fpclassify_float_#res| 4)} is VALID [2022-02-20 16:46:42,427 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {337#(= |__fpclassify_float_#res| 4)} {326#true} #69#return; {335#(<= 4 |ULTIMATE.start_fmin_float_#t~ret5#1|)} is VALID [2022-02-20 16:46:42,428 INFO L290 TraceCheckUtils]: 10: Hoare triple {335#(<= 4 |ULTIMATE.start_fmin_float_#t~ret5#1|)} assume -2147483648 <= fmin_float_#t~ret5#1 && fmin_float_#t~ret5#1 <= 2147483647; {335#(<= 4 |ULTIMATE.start_fmin_float_#t~ret5#1|)} is VALID [2022-02-20 16:46:42,428 INFO L290 TraceCheckUtils]: 11: Hoare triple {335#(<= 4 |ULTIMATE.start_fmin_float_#t~ret5#1|)} assume 0 == fmin_float_#t~ret5#1;havoc fmin_float_#t~ret5#1;fmin_float_#res#1 := fmin_float_~y#1; {327#false} is VALID [2022-02-20 16:46:42,429 INFO L290 TraceCheckUtils]: 12: Hoare triple {327#false} main_#t~ret8#1 := fmin_float_#res#1;assume { :end_inline_fmin_float } true;main_~res~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_isnan_float } true;isnan_float_#in~x#1 := main_~res~0#1;havoc isnan_float_#res#1;havoc isnan_float_~x#1;isnan_float_~x#1 := isnan_float_#in~x#1;isnan_float_#res#1 := (if ~someBinaryFLOATComparisonOperation(isnan_float_~x#1, isnan_float_~x#1) then 1 else 0); {327#false} is VALID [2022-02-20 16:46:42,429 INFO L290 TraceCheckUtils]: 13: Hoare triple {327#false} main_#t~ret9#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647; {327#false} is VALID [2022-02-20 16:46:42,429 INFO L290 TraceCheckUtils]: 14: Hoare triple {327#false} assume 0 == main_#t~ret9#1;havoc main_#t~ret9#1; {327#false} is VALID [2022-02-20 16:46:42,429 INFO L290 TraceCheckUtils]: 15: Hoare triple {327#false} assume !false; {327#false} is VALID [2022-02-20 16:46:42,429 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:46:42,430 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:46:42,430 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205193572] [2022-02-20 16:46:42,430 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205193572] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:42,430 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:42,430 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:46:42,430 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071008550] [2022-02-20 16:46:42,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:42,431 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-20 16:46:42,431 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:42,431 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:46:42,442 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:42,443 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:46:42,443 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:46:42,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:46:42,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:46:42,443 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:46:42,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:42,516 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-02-20 16:46:42,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:46:42,517 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-20 16:46:42,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:42,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:46:42,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-02-20 16:46:42,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:46:42,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-02-20 16:46:42,519 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-02-20 16:46:42,546 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:42,547 INFO L225 Difference]: With dead ends: 37 [2022-02-20 16:46:42,547 INFO L226 Difference]: Without dead ends: 32 [2022-02-20 16:46:42,547 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:46:42,548 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:42,548 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 117 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:46:42,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-02-20 16:46:42,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2022-02-20 16:46:42,551 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:42,551 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:46:42,552 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:46:42,552 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:46:42,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:42,554 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-02-20 16:46:42,554 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-02-20 16:46:42,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:42,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:42,554 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 32 states. [2022-02-20 16:46:42,555 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 32 states. [2022-02-20 16:46:42,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:42,556 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-02-20 16:46:42,556 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-02-20 16:46:42,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:42,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:42,557 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:42,557 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:42,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:46:42,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2022-02-20 16:46:42,559 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 16 [2022-02-20 16:46:42,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:42,559 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2022-02-20 16:46:42,559 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:46:42,559 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-02-20 16:46:42,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 16:46:42,560 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:42,560 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:42,560 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 16:46:42,560 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:42,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:42,561 INFO L85 PathProgramCache]: Analyzing trace with hash -20784584, now seen corresponding path program 1 times [2022-02-20 16:46:42,561 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:46:42,561 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560575088] [2022-02-20 16:46:42,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:42,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:46:42,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:42,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:46:42,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:42,619 INFO L290 TraceCheckUtils]: 0: Hoare triple {494#(and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~x := #in~x;havoc ~w~0; {483#true} is VALID [2022-02-20 16:46:42,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {483#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4);call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4);call #t~mem4 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4);~w~0 := #t~mem4;havoc #t~mem4;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {483#true} is VALID [2022-02-20 16:46:42,620 INFO L290 TraceCheckUtils]: 2: Hoare triple {483#true} goto; {483#true} is VALID [2022-02-20 16:46:42,620 INFO L290 TraceCheckUtils]: 3: Hoare triple {483#true} assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); {483#true} is VALID [2022-02-20 16:46:42,620 INFO L290 TraceCheckUtils]: 4: Hoare triple {483#true} assume !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)); {483#true} is VALID [2022-02-20 16:46:42,621 INFO L290 TraceCheckUtils]: 5: Hoare triple {483#true} assume (~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255);#res := 3; {495#(and (<= 3 |__fpclassify_float_#res|) (<= |__fpclassify_float_#res| 3))} is VALID [2022-02-20 16:46:42,621 INFO L290 TraceCheckUtils]: 6: Hoare triple {495#(and (<= 3 |__fpclassify_float_#res|) (<= |__fpclassify_float_#res| 3))} assume true; {495#(and (<= 3 |__fpclassify_float_#res|) (<= |__fpclassify_float_#res| 3))} is VALID [2022-02-20 16:46:42,622 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {495#(and (<= 3 |__fpclassify_float_#res|) (<= |__fpclassify_float_#res| 3))} {483#true} #69#return; {493#(= (+ (- 3) |ULTIMATE.start_fmin_float_#t~ret5#1|) 0)} is VALID [2022-02-20 16:46:42,622 INFO L290 TraceCheckUtils]: 0: Hoare triple {483#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3); {483#true} is VALID [2022-02-20 16:46:42,622 INFO L290 TraceCheckUtils]: 1: Hoare triple {483#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_#t~ret9#1, main_~x~0#1, main_~y~0#1, main_~res~0#1;main_~x~0#1 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0);main_~y~0#1 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0);assume { :begin_inline_fmin_float } true;fmin_float_#in~x#1, fmin_float_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmin_float_#res#1;havoc fmin_float_#t~ret5#1, fmin_float_#t~ret6#1, fmin_float_#t~ite7#1, fmin_float_~x#1, fmin_float_~y#1;fmin_float_~x#1 := fmin_float_#in~x#1;fmin_float_~y#1 := fmin_float_#in~y#1; {483#true} is VALID [2022-02-20 16:46:42,623 INFO L272 TraceCheckUtils]: 2: Hoare triple {483#true} call fmin_float_#t~ret5#1 := __fpclassify_float(fmin_float_~x#1); {494#(and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:46:42,623 INFO L290 TraceCheckUtils]: 3: Hoare triple {494#(and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~x := #in~x;havoc ~w~0; {483#true} is VALID [2022-02-20 16:46:42,623 INFO L290 TraceCheckUtils]: 4: Hoare triple {483#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4);call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4);call #t~mem4 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4);~w~0 := #t~mem4;havoc #t~mem4;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {483#true} is VALID [2022-02-20 16:46:42,623 INFO L290 TraceCheckUtils]: 5: Hoare triple {483#true} goto; {483#true} is VALID [2022-02-20 16:46:42,624 INFO L290 TraceCheckUtils]: 6: Hoare triple {483#true} assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); {483#true} is VALID [2022-02-20 16:46:42,624 INFO L290 TraceCheckUtils]: 7: Hoare triple {483#true} assume !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)); {483#true} is VALID [2022-02-20 16:46:42,624 INFO L290 TraceCheckUtils]: 8: Hoare triple {483#true} assume (~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255);#res := 3; {495#(and (<= 3 |__fpclassify_float_#res|) (<= |__fpclassify_float_#res| 3))} is VALID [2022-02-20 16:46:42,625 INFO L290 TraceCheckUtils]: 9: Hoare triple {495#(and (<= 3 |__fpclassify_float_#res|) (<= |__fpclassify_float_#res| 3))} assume true; {495#(and (<= 3 |__fpclassify_float_#res|) (<= |__fpclassify_float_#res| 3))} is VALID [2022-02-20 16:46:42,625 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {495#(and (<= 3 |__fpclassify_float_#res|) (<= |__fpclassify_float_#res| 3))} {483#true} #69#return; {493#(= (+ (- 3) |ULTIMATE.start_fmin_float_#t~ret5#1|) 0)} is VALID [2022-02-20 16:46:42,626 INFO L290 TraceCheckUtils]: 11: Hoare triple {493#(= (+ (- 3) |ULTIMATE.start_fmin_float_#t~ret5#1|) 0)} assume -2147483648 <= fmin_float_#t~ret5#1 && fmin_float_#t~ret5#1 <= 2147483647; {493#(= (+ (- 3) |ULTIMATE.start_fmin_float_#t~ret5#1|) 0)} is VALID [2022-02-20 16:46:42,626 INFO L290 TraceCheckUtils]: 12: Hoare triple {493#(= (+ (- 3) |ULTIMATE.start_fmin_float_#t~ret5#1|) 0)} assume 0 == fmin_float_#t~ret5#1;havoc fmin_float_#t~ret5#1;fmin_float_#res#1 := fmin_float_~y#1; {484#false} is VALID [2022-02-20 16:46:42,626 INFO L290 TraceCheckUtils]: 13: Hoare triple {484#false} main_#t~ret8#1 := fmin_float_#res#1;assume { :end_inline_fmin_float } true;main_~res~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_isnan_float } true;isnan_float_#in~x#1 := main_~res~0#1;havoc isnan_float_#res#1;havoc isnan_float_~x#1;isnan_float_~x#1 := isnan_float_#in~x#1;isnan_float_#res#1 := (if ~someBinaryFLOATComparisonOperation(isnan_float_~x#1, isnan_float_~x#1) then 1 else 0); {484#false} is VALID [2022-02-20 16:46:42,627 INFO L290 TraceCheckUtils]: 14: Hoare triple {484#false} main_#t~ret9#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647; {484#false} is VALID [2022-02-20 16:46:42,627 INFO L290 TraceCheckUtils]: 15: Hoare triple {484#false} assume 0 == main_#t~ret9#1;havoc main_#t~ret9#1; {484#false} is VALID [2022-02-20 16:46:42,627 INFO L290 TraceCheckUtils]: 16: Hoare triple {484#false} assume !false; {484#false} is VALID [2022-02-20 16:46:42,627 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:46:42,627 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:46:42,628 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560575088] [2022-02-20 16:46:42,628 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560575088] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:42,628 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:42,628 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:46:42,628 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146350302] [2022-02-20 16:46:42,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:42,629 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-02-20 16:46:42,629 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:42,629 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:46:42,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:42,641 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:46:42,641 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:46:42,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:46:42,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:46:42,642 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:46:42,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:42,718 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-02-20 16:46:42,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:46:42,718 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-02-20 16:46:42,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:42,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:46:42,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-02-20 16:46:42,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:46:42,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-02-20 16:46:42,721 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-02-20 16:46:42,747 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:42,748 INFO L225 Difference]: With dead ends: 37 [2022-02-20 16:46:42,748 INFO L226 Difference]: Without dead ends: 32 [2022-02-20 16:46:42,748 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:46:42,749 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:42,750 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 117 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:46:42,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-02-20 16:46:42,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2022-02-20 16:46:42,752 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:42,752 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:46:42,752 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:46:42,753 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:46:42,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:42,754 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-02-20 16:46:42,754 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-02-20 16:46:42,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:42,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:42,755 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 32 states. [2022-02-20 16:46:42,755 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 32 states. [2022-02-20 16:46:42,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:42,765 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-02-20 16:46:42,765 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-02-20 16:46:42,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:42,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:42,765 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:42,766 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:42,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:46:42,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2022-02-20 16:46:42,767 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 17 [2022-02-20 16:46:42,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:42,767 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2022-02-20 16:46:42,767 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:46:42,767 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-02-20 16:46:42,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 16:46:42,768 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:42,768 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:42,768 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 16:46:42,768 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:42,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:42,769 INFO L85 PathProgramCache]: Analyzing trace with hash 1039043768, now seen corresponding path program 1 times [2022-02-20 16:46:42,769 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:46:42,769 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477822599] [2022-02-20 16:46:42,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:42,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:46:42,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:42,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:46:42,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:42,841 INFO L290 TraceCheckUtils]: 0: Hoare triple {653#(and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~x := #in~x;havoc ~w~0; {641#true} is VALID [2022-02-20 16:46:42,841 INFO L290 TraceCheckUtils]: 1: Hoare triple {641#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4);call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4);call #t~mem4 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4);~w~0 := #t~mem4;havoc #t~mem4;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {641#true} is VALID [2022-02-20 16:46:42,841 INFO L290 TraceCheckUtils]: 2: Hoare triple {641#true} goto; {641#true} is VALID [2022-02-20 16:46:42,841 INFO L290 TraceCheckUtils]: 3: Hoare triple {641#true} assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); {641#true} is VALID [2022-02-20 16:46:42,841 INFO L290 TraceCheckUtils]: 4: Hoare triple {641#true} assume !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)); {641#true} is VALID [2022-02-20 16:46:42,842 INFO L290 TraceCheckUtils]: 5: Hoare triple {641#true} assume !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)); {641#true} is VALID [2022-02-20 16:46:42,842 INFO L290 TraceCheckUtils]: 6: Hoare triple {641#true} assume 2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296;#res := 1; {654#(and (<= |__fpclassify_float_#res| 1) (<= 1 |__fpclassify_float_#res|))} is VALID [2022-02-20 16:46:42,842 INFO L290 TraceCheckUtils]: 7: Hoare triple {654#(and (<= |__fpclassify_float_#res| 1) (<= 1 |__fpclassify_float_#res|))} assume true; {654#(and (<= |__fpclassify_float_#res| 1) (<= 1 |__fpclassify_float_#res|))} is VALID [2022-02-20 16:46:42,843 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {654#(and (<= |__fpclassify_float_#res| 1) (<= 1 |__fpclassify_float_#res|))} {641#true} #69#return; {652#(= (+ (- 1) |ULTIMATE.start_fmin_float_#t~ret5#1|) 0)} is VALID [2022-02-20 16:46:42,843 INFO L290 TraceCheckUtils]: 0: Hoare triple {641#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(20, 2);call #Ultimate.allocInit(12, 3); {641#true} is VALID [2022-02-20 16:46:42,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {641#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_#t~ret9#1, main_~x~0#1, main_~y~0#1, main_~res~0#1;main_~x~0#1 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0);main_~y~0#1 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0);assume { :begin_inline_fmin_float } true;fmin_float_#in~x#1, fmin_float_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmin_float_#res#1;havoc fmin_float_#t~ret5#1, fmin_float_#t~ret6#1, fmin_float_#t~ite7#1, fmin_float_~x#1, fmin_float_~y#1;fmin_float_~x#1 := fmin_float_#in~x#1;fmin_float_~y#1 := fmin_float_#in~y#1; {641#true} is VALID [2022-02-20 16:46:42,844 INFO L272 TraceCheckUtils]: 2: Hoare triple {641#true} call fmin_float_#t~ret5#1 := __fpclassify_float(fmin_float_~x#1); {653#(and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:46:42,844 INFO L290 TraceCheckUtils]: 3: Hoare triple {653#(and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~x := #in~x;havoc ~w~0; {641#true} is VALID [2022-02-20 16:46:42,845 INFO L290 TraceCheckUtils]: 4: Hoare triple {641#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4);call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4);call #t~mem4 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4);~w~0 := #t~mem4;havoc #t~mem4;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {641#true} is VALID [2022-02-20 16:46:42,845 INFO L290 TraceCheckUtils]: 5: Hoare triple {641#true} goto; {641#true} is VALID [2022-02-20 16:46:42,845 INFO L290 TraceCheckUtils]: 6: Hoare triple {641#true} assume !(0 == ~w~0 % 4294967296 || 2147483648 == ~w~0 % 4294967296); {641#true} is VALID [2022-02-20 16:46:42,845 INFO L290 TraceCheckUtils]: 7: Hoare triple {641#true} assume !((~w~0 % 4294967296 >= 8388608 && ~w~0 % 4294967296 <= 2139095039) || (~w~0 % 4294967296 >= 2155872256 && ~w~0 % 4294967296 <= 4286578687)); {641#true} is VALID [2022-02-20 16:46:42,845 INFO L290 TraceCheckUtils]: 8: Hoare triple {641#true} assume !((~w~0 % 4294967296 >= 1 && ~w~0 % 4294967296 <= 8388607) || (~w~0 % 4294967296 >= 2147483649 && ~w~0 % 4294967296 <= 2155872255)); {641#true} is VALID [2022-02-20 16:46:42,846 INFO L290 TraceCheckUtils]: 9: Hoare triple {641#true} assume 2139095040 == ~w~0 % 4294967296 || 4286578688 == ~w~0 % 4294967296;#res := 1; {654#(and (<= |__fpclassify_float_#res| 1) (<= 1 |__fpclassify_float_#res|))} is VALID [2022-02-20 16:46:42,846 INFO L290 TraceCheckUtils]: 10: Hoare triple {654#(and (<= |__fpclassify_float_#res| 1) (<= 1 |__fpclassify_float_#res|))} assume true; {654#(and (<= |__fpclassify_float_#res| 1) (<= 1 |__fpclassify_float_#res|))} is VALID [2022-02-20 16:46:42,847 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {654#(and (<= |__fpclassify_float_#res| 1) (<= 1 |__fpclassify_float_#res|))} {641#true} #69#return; {652#(= (+ (- 1) |ULTIMATE.start_fmin_float_#t~ret5#1|) 0)} is VALID [2022-02-20 16:46:42,847 INFO L290 TraceCheckUtils]: 12: Hoare triple {652#(= (+ (- 1) |ULTIMATE.start_fmin_float_#t~ret5#1|) 0)} assume -2147483648 <= fmin_float_#t~ret5#1 && fmin_float_#t~ret5#1 <= 2147483647; {652#(= (+ (- 1) |ULTIMATE.start_fmin_float_#t~ret5#1|) 0)} is VALID [2022-02-20 16:46:42,848 INFO L290 TraceCheckUtils]: 13: Hoare triple {652#(= (+ (- 1) |ULTIMATE.start_fmin_float_#t~ret5#1|) 0)} assume 0 == fmin_float_#t~ret5#1;havoc fmin_float_#t~ret5#1;fmin_float_#res#1 := fmin_float_~y#1; {642#false} is VALID [2022-02-20 16:46:42,848 INFO L290 TraceCheckUtils]: 14: Hoare triple {642#false} main_#t~ret8#1 := fmin_float_#res#1;assume { :end_inline_fmin_float } true;main_~res~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_isnan_float } true;isnan_float_#in~x#1 := main_~res~0#1;havoc isnan_float_#res#1;havoc isnan_float_~x#1;isnan_float_~x#1 := isnan_float_#in~x#1;isnan_float_#res#1 := (if ~someBinaryFLOATComparisonOperation(isnan_float_~x#1, isnan_float_~x#1) then 1 else 0); {642#false} is VALID [2022-02-20 16:46:42,848 INFO L290 TraceCheckUtils]: 15: Hoare triple {642#false} main_#t~ret9#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true;assume -2147483648 <= main_#t~ret9#1 && main_#t~ret9#1 <= 2147483647; {642#false} is VALID [2022-02-20 16:46:42,848 INFO L290 TraceCheckUtils]: 16: Hoare triple {642#false} assume 0 == main_#t~ret9#1;havoc main_#t~ret9#1; {642#false} is VALID [2022-02-20 16:46:42,848 INFO L290 TraceCheckUtils]: 17: Hoare triple {642#false} assume !false; {642#false} is VALID [2022-02-20 16:46:42,848 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:46:42,849 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:46:42,849 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477822599] [2022-02-20 16:46:42,849 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477822599] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:42,849 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:42,849 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:46:42,849 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139396007] [2022-02-20 16:46:42,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:42,850 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-02-20 16:46:42,850 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:42,850 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:46:42,861 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:42,862 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:46:42,862 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:46:42,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:46:42,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:46:42,863 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:46:42,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:42,936 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-02-20 16:46:42,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:46:42,937 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-02-20 16:46:42,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:42,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:46:42,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-02-20 16:46:42,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:46:42,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-02-20 16:46:42,939 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-02-20 16:46:42,971 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:42,972 INFO L225 Difference]: With dead ends: 37 [2022-02-20 16:46:42,972 INFO L226 Difference]: Without dead ends: 32 [2022-02-20 16:46:42,972 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:46:42,973 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:42,973 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 117 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:46:42,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-02-20 16:46:42,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2022-02-20 16:46:42,976 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:42,976 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:46:42,976 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:46:42,976 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:46:42,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:42,977 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-02-20 16:46:42,978 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-02-20 16:46:42,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:42,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:42,978 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 32 states. [2022-02-20 16:46:42,978 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 32 states. [2022-02-20 16:46:42,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:42,980 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-02-20 16:46:42,980 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-02-20 16:46:42,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:42,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:42,980 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:42,980 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:42,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:46:42,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2022-02-20 16:46:42,982 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 18 [2022-02-20 16:46:42,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:42,982 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2022-02-20 16:46:42,982 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:46:42,982 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-02-20 16:46:42,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 16:46:42,983 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:42,983 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:42,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 16:46:42,983 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:42,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:42,983 INFO L85 PathProgramCache]: Analyzing trace with hash -768410695, now seen corresponding path program 1 times [2022-02-20 16:46:42,984 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:46:42,984 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567271122] [2022-02-20 16:46:42,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:42,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:46:42,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:46:42,999 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:46:43,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:46:43,026 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:46:43,027 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:46:43,027 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:46:43,028 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 16:46:43,030 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-02-20 16:46:43,032 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:46:43,039 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call #t~ret5 := __fpclassify_float(~x); [2022-02-20 16:46:43,039 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: callstack broken after backtranslation by InlinerBacktranslator at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:206) at de.uni_freiburg.informatik.ultimate.core.lib.results.UnprovableResult.getProgramExecutionAsString(UnprovableResult.java:132) at de.uni_freiburg.informatik.ultimate.core.lib.results.UnprovableResult.getLongDescription(UnprovableResult.java:125) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportLocationResults(TraceAbstractionStarter.java:607) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 16:46:43,042 INFO L158 Benchmark]: Toolchain (without parser) took 2201.94ms. Allocated memory was 109.1MB in the beginning and 132.1MB in the end (delta: 23.1MB). Free memory was 76.9MB in the beginning and 95.4MB in the end (delta: -18.5MB). Peak memory consumption was 4.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:43,042 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 109.1MB. Free memory was 64.0MB in the beginning and 63.9MB in the end (delta: 46.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:43,042 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.61ms. Allocated memory is still 109.1MB. Free memory was 76.6MB in the beginning and 82.9MB in the end (delta: -6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 16:46:43,043 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.43ms. Allocated memory is still 109.1MB. Free memory was 82.9MB in the beginning and 81.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:43,043 INFO L158 Benchmark]: Boogie Preprocessor took 18.57ms. Allocated memory is still 109.1MB. Free memory was 81.2MB in the beginning and 79.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:43,043 INFO L158 Benchmark]: RCFGBuilder took 388.92ms. Allocated memory is still 109.1MB. Free memory was 79.9MB in the beginning and 66.9MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 16:46:43,043 INFO L158 Benchmark]: TraceAbstraction took 1490.18ms. Allocated memory was 109.1MB in the beginning and 132.1MB in the end (delta: 23.1MB). Free memory was 66.5MB in the beginning and 95.4MB in the end (delta: -28.9MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:43,045 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 109.1MB. Free memory was 64.0MB in the beginning and 63.9MB in the end (delta: 46.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 256.61ms. Allocated memory is still 109.1MB. Free memory was 76.6MB in the beginning and 82.9MB in the end (delta: -6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.43ms. Allocated memory is still 109.1MB. Free memory was 82.9MB in the beginning and 81.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 18.57ms. Allocated memory is still 109.1MB. Free memory was 81.2MB in the beginning and 79.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 388.92ms. Allocated memory is still 109.1MB. Free memory was 79.9MB in the beginning and 66.9MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1490.18ms. Allocated memory was 109.1MB in the beginning and 132.1MB in the end (delta: 23.1MB). Free memory was 66.5MB in the beginning and 95.4MB in the end (delta: -28.9MB). 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 - ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: callstack broken after backtranslation by InlinerBacktranslator: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 16:46:43,081 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_1230.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 95e4857f2e80c4b2a09349ad506a32e395132bf666c8dc52d9ee1d4dade10d91 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:46:44,878 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:46:44,881 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:46:44,920 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:46:44,920 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:46:44,923 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:46:44,924 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:46:44,928 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:46:44,930 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:46:44,933 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:46:44,934 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:46:44,936 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:46:44,936 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:46:44,938 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:46:44,938 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:46:44,943 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:46:44,943 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:46:44,944 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:46:44,946 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:46:44,950 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:46:44,951 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:46:44,952 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:46:44,953 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:46:44,954 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:46:44,959 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:46:44,959 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:46:44,960 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:46:44,961 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:46:44,961 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:46:44,962 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:46:44,962 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:46:44,963 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:46:44,964 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:46:44,964 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:46:44,965 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:46:44,966 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:46:44,966 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:46:44,966 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:46:44,967 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:46:44,968 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:46:44,968 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:46:44,969 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:46:44,996 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:46:44,997 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:46:44,997 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:46:44,997 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:46:44,998 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:46:44,998 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:46:44,999 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:46:44,999 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:46:44,999 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:46:45,000 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:46:45,000 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:46:45,000 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:46:45,000 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:46:45,001 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:46:45,001 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:46:45,001 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:46:45,001 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:46:45,001 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:46:45,001 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:46:45,001 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:46:45,001 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:46:45,002 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:46:45,002 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:46:45,002 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:46:45,002 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:46:45,002 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:46:45,002 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:45,002 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:46:45,003 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:46:45,003 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:46:45,003 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:46:45,003 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:46:45,003 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:46:45,003 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:46:45,003 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:46:45,004 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:46:45,004 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 -> 95e4857f2e80c4b2a09349ad506a32e395132bf666c8dc52d9ee1d4dade10d91 [2022-02-20 16:46:45,279 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:46:45,314 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:46:45,316 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:46:45,316 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:46:45,317 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:46:45,318 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1230.c [2022-02-20 16:46:45,364 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13c01fb0e/dbbef2f95d114664afb8c2a22a16730b/FLAG41c136243 [2022-02-20 16:46:45,724 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:46:45,724 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1230.c [2022-02-20 16:46:45,729 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13c01fb0e/dbbef2f95d114664afb8c2a22a16730b/FLAG41c136243 [2022-02-20 16:46:45,743 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13c01fb0e/dbbef2f95d114664afb8c2a22a16730b [2022-02-20 16:46:45,745 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:46:45,747 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:46:45,750 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:45,750 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:46:45,752 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:46:45,753 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:45" (1/1) ... [2022-02-20 16:46:45,754 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@df450c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:45, skipping insertion in model container [2022-02-20 16:46:45,755 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:45" (1/1) ... [2022-02-20 16:46:45,759 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:46:45,770 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:46:45,926 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_1230.c[1411,1424] [2022-02-20 16:46:45,930 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:45,950 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:46:45,980 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_1230.c[1411,1424] [2022-02-20 16:46:45,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:46,002 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:46:46,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:46 WrapperNode [2022-02-20 16:46:46,002 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:46,003 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:46,003 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:46:46,003 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:46:46,008 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:46:46" (1/1) ... [2022-02-20 16:46:46,022 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:46:46" (1/1) ... [2022-02-20 16:46:46,042 INFO L137 Inliner]: procedures = 20, calls = 15, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 48 [2022-02-20 16:46:46,043 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:46,044 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:46:46,044 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:46:46,044 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:46:46,050 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:46" (1/1) ... [2022-02-20 16:46:46,050 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:46" (1/1) ... [2022-02-20 16:46:46,057 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:46" (1/1) ... [2022-02-20 16:46:46,058 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:46" (1/1) ... [2022-02-20 16:46:46,077 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:46" (1/1) ... [2022-02-20 16:46:46,081 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:46" (1/1) ... [2022-02-20 16:46:46,084 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:46" (1/1) ... [2022-02-20 16:46:46,087 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:46:46,091 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:46:46,091 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:46:46,091 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:46:46,092 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:46" (1/1) ... [2022-02-20 16:46:46,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:46,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:46:46,153 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:46:46,156 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:46:46,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:46:46,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:46:46,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:46:46,182 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_float [2022-02-20 16:46:46,182 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_float [2022-02-20 16:46:46,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 16:46:46,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:46:46,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:46:46,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2022-02-20 16:46:46,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:46:46,255 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:46:46,256 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:46:46,428 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:46:46,432 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:46:46,433 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 16:46:46,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:46 BoogieIcfgContainer [2022-02-20 16:46:46,434 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:46:46,435 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:46:46,435 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:46:46,437 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:46:46,439 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:46:45" (1/3) ... [2022-02-20 16:46:46,440 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@208dc8fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:46, skipping insertion in model container [2022-02-20 16:46:46,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:46" (2/3) ... [2022-02-20 16:46:46,441 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@208dc8fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:46, skipping insertion in model container [2022-02-20 16:46:46,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:46" (3/3) ... [2022-02-20 16:46:46,442 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1230.c [2022-02-20 16:46:46,445 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:46:46,446 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:46:46,483 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:46:46,489 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:46:46,489 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:46:46,503 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:46:46,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 16:46:46,507 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:46,508 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:46,508 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:46,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:46,512 INFO L85 PathProgramCache]: Analyzing trace with hash 2048951326, now seen corresponding path program 1 times [2022-02-20 16:46:46,520 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:46,521 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [245130281] [2022-02-20 16:46:46,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:46,522 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:46,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:46,533 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:46:46,534 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:46:46,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:46,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:46:46,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:46,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:46,705 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(20bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {28#true} is VALID [2022-02-20 16:46:46,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_#t~ret9#1, main_~x~0#1, main_~y~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());main_~y~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());assume { :begin_inline_fmin_float } true;fmin_float_#in~x#1, fmin_float_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmin_float_#res#1;havoc fmin_float_#t~ret5#1, fmin_float_#t~ret6#1, fmin_float_#t~ite7#1, fmin_float_~x#1, fmin_float_~y#1;fmin_float_~x#1 := fmin_float_#in~x#1;fmin_float_~y#1 := fmin_float_#in~y#1; {28#true} is VALID [2022-02-20 16:46:46,705 INFO L272 TraceCheckUtils]: 2: Hoare triple {28#true} call fmin_float_#t~ret5#1 := __fpclassify_float(fmin_float_~x#1); {28#true} is VALID [2022-02-20 16:46:46,706 INFO L290 TraceCheckUtils]: 3: Hoare triple {28#true} ~x := #in~x;havoc ~w~0; {28#true} is VALID [2022-02-20 16:46:46,706 INFO L290 TraceCheckUtils]: 4: Hoare triple {28#true} assume !true; {29#false} is VALID [2022-02-20 16:46:46,707 INFO L290 TraceCheckUtils]: 5: Hoare triple {29#false} assume 0bv32 == ~w~0 || 2147483648bv32 == ~w~0;#res := 2bv32; {29#false} is VALID [2022-02-20 16:46:46,707 INFO L290 TraceCheckUtils]: 6: Hoare triple {29#false} assume true; {29#false} is VALID [2022-02-20 16:46:46,707 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {29#false} {28#true} #67#return; {29#false} is VALID [2022-02-20 16:46:46,707 INFO L290 TraceCheckUtils]: 8: Hoare triple {29#false} assume 0bv32 == fmin_float_#t~ret5#1;havoc fmin_float_#t~ret5#1;fmin_float_#res#1 := fmin_float_~y#1; {29#false} is VALID [2022-02-20 16:46:46,707 INFO L290 TraceCheckUtils]: 9: Hoare triple {29#false} main_#t~ret8#1 := fmin_float_#res#1;assume { :end_inline_fmin_float } true;main_~res~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_isnan_float } true;isnan_float_#in~x#1 := main_~res~0#1;havoc isnan_float_#res#1;havoc isnan_float_~x#1;isnan_float_~x#1 := isnan_float_#in~x#1;isnan_float_#res#1 := (if !~fp.eq~FLOAT(isnan_float_~x#1, isnan_float_~x#1) then 1bv32 else 0bv32); {29#false} is VALID [2022-02-20 16:46:46,708 INFO L290 TraceCheckUtils]: 10: Hoare triple {29#false} main_#t~ret9#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true; {29#false} is VALID [2022-02-20 16:46:46,708 INFO L290 TraceCheckUtils]: 11: Hoare triple {29#false} assume 0bv32 == main_#t~ret9#1;havoc main_#t~ret9#1; {29#false} is VALID [2022-02-20 16:46:46,708 INFO L290 TraceCheckUtils]: 12: Hoare triple {29#false} assume !false; {29#false} is VALID [2022-02-20 16:46:46,709 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:46:46,709 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:46,709 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:46,710 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [245130281] [2022-02-20 16:46:46,710 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [245130281] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:46,710 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:46,710 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:46:46,711 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707675066] [2022-02-20 16:46:46,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:46,715 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-02-20 16:46:46,716 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:46,718 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:46:46,733 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:46,733 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:46:46,733 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:46,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:46:46,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:46:46,754 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:46:46,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:46,811 INFO L93 Difference]: Finished difference Result 47 states and 68 transitions. [2022-02-20 16:46:46,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:46:46,812 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-02-20 16:46:46,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:46,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:46:46,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 68 transitions. [2022-02-20 16:46:46,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:46:46,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 68 transitions. [2022-02-20 16:46:46,828 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 68 transitions. [2022-02-20 16:46:46,899 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:46,905 INFO L225 Difference]: With dead ends: 47 [2022-02-20 16:46:46,905 INFO L226 Difference]: Without dead ends: 22 [2022-02-20 16:46:46,907 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 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:46:46,909 INFO L933 BasicCegarLoop]: 32 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, 32 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:46:46,910 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:46:46,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-02-20 16:46:46,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-02-20 16:46:46,930 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:46,931 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:46:46,931 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:46:46,931 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:46:46,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:46,934 INFO L93 Difference]: Finished difference Result 22 states and 29 transitions. [2022-02-20 16:46:46,935 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2022-02-20 16:46:46,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:46,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:46,935 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 22 states. [2022-02-20 16:46:46,936 INFO L87 Difference]: Start difference. First operand has 22 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 22 states. [2022-02-20 16:46:46,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:46,943 INFO L93 Difference]: Finished difference Result 22 states and 29 transitions. [2022-02-20 16:46:46,943 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2022-02-20 16:46:46,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:46,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:46,944 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:46,944 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:46,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:46:46,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2022-02-20 16:46:46,947 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 29 transitions. Word has length 13 [2022-02-20 16:46:46,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:46,948 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 29 transitions. [2022-02-20 16:46:46,948 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:46:46,948 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2022-02-20 16:46:46,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 16:46:46,948 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:46,949 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:46,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 16:46:47,157 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:46:47,157 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:47,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:47,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1561923165, now seen corresponding path program 1 times [2022-02-20 16:46:47,159 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:47,159 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1317186481] [2022-02-20 16:46:47,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:47,159 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:47,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:47,161 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:46:47,162 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:46:47,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:47,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 16:46:47,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:47,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:47,305 INFO L290 TraceCheckUtils]: 0: Hoare triple {200#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(20bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {200#true} is VALID [2022-02-20 16:46:47,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {200#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_#t~ret9#1, main_~x~0#1, main_~y~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());main_~y~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());assume { :begin_inline_fmin_float } true;fmin_float_#in~x#1, fmin_float_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmin_float_#res#1;havoc fmin_float_#t~ret5#1, fmin_float_#t~ret6#1, fmin_float_#t~ite7#1, fmin_float_~x#1, fmin_float_~y#1;fmin_float_~x#1 := fmin_float_#in~x#1;fmin_float_~y#1 := fmin_float_#in~y#1; {200#true} is VALID [2022-02-20 16:46:47,306 INFO L272 TraceCheckUtils]: 2: Hoare triple {200#true} call fmin_float_#t~ret5#1 := __fpclassify_float(fmin_float_~x#1); {200#true} is VALID [2022-02-20 16:46:47,306 INFO L290 TraceCheckUtils]: 3: Hoare triple {200#true} ~x := #in~x;havoc ~w~0; {200#true} is VALID [2022-02-20 16:46:47,306 INFO L290 TraceCheckUtils]: 4: Hoare triple {200#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#gf_u~0.base, ~#gf_u~0.offset, 4bv32);~w~0 := #t~mem4;havoc #t~mem4;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {200#true} is VALID [2022-02-20 16:46:47,306 INFO L290 TraceCheckUtils]: 5: Hoare triple {200#true} goto; {200#true} is VALID [2022-02-20 16:46:47,307 INFO L290 TraceCheckUtils]: 6: Hoare triple {200#true} assume 0bv32 == ~w~0 || 2147483648bv32 == ~w~0;#res := 2bv32; {223#(= (_ bv2 32) |__fpclassify_float_#res|)} is VALID [2022-02-20 16:46:47,307 INFO L290 TraceCheckUtils]: 7: Hoare triple {223#(= (_ bv2 32) |__fpclassify_float_#res|)} assume true; {223#(= (_ bv2 32) |__fpclassify_float_#res|)} is VALID [2022-02-20 16:46:47,308 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {223#(= (_ bv2 32) |__fpclassify_float_#res|)} {200#true} #67#return; {230#(= |ULTIMATE.start_fmin_float_#t~ret5#1| (_ bv2 32))} is VALID [2022-02-20 16:46:47,309 INFO L290 TraceCheckUtils]: 9: Hoare triple {230#(= |ULTIMATE.start_fmin_float_#t~ret5#1| (_ bv2 32))} assume 0bv32 == fmin_float_#t~ret5#1;havoc fmin_float_#t~ret5#1;fmin_float_#res#1 := fmin_float_~y#1; {201#false} is VALID [2022-02-20 16:46:47,309 INFO L290 TraceCheckUtils]: 10: Hoare triple {201#false} main_#t~ret8#1 := fmin_float_#res#1;assume { :end_inline_fmin_float } true;main_~res~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_isnan_float } true;isnan_float_#in~x#1 := main_~res~0#1;havoc isnan_float_#res#1;havoc isnan_float_~x#1;isnan_float_~x#1 := isnan_float_#in~x#1;isnan_float_#res#1 := (if !~fp.eq~FLOAT(isnan_float_~x#1, isnan_float_~x#1) then 1bv32 else 0bv32); {201#false} is VALID [2022-02-20 16:46:47,309 INFO L290 TraceCheckUtils]: 11: Hoare triple {201#false} main_#t~ret9#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true; {201#false} is VALID [2022-02-20 16:46:47,309 INFO L290 TraceCheckUtils]: 12: Hoare triple {201#false} assume 0bv32 == main_#t~ret9#1;havoc main_#t~ret9#1; {201#false} is VALID [2022-02-20 16:46:47,309 INFO L290 TraceCheckUtils]: 13: Hoare triple {201#false} assume !false; {201#false} is VALID [2022-02-20 16:46:47,310 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:46:47,310 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:47,310 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:47,310 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1317186481] [2022-02-20 16:46:47,310 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1317186481] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:47,310 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:47,311 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:46:47,311 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33297934] [2022-02-20 16:46:47,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:47,312 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-02-20 16:46:47,312 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:47,312 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:46:47,324 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:47,325 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:46:47,325 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:47,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:46:47,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:46:47,326 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:46:47,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:47,403 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2022-02-20 16:46:47,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:46:47,403 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-02-20 16:46:47,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:47,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:46:47,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-02-20 16:46:47,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:46:47,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-02-20 16:46:47,406 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-02-20 16:46:47,442 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:47,444 INFO L225 Difference]: With dead ends: 30 [2022-02-20 16:46:47,444 INFO L226 Difference]: Without dead ends: 25 [2022-02-20 16:46:47,444 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:46:47,445 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:47,446 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:46:47,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-02-20 16:46:47,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-02-20 16:46:47,449 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:47,449 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:46:47,450 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:46:47,450 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:46:47,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:47,452 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2022-02-20 16:46:47,452 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2022-02-20 16:46:47,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:47,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:47,453 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 25 states. [2022-02-20 16:46:47,453 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 25 states. [2022-02-20 16:46:47,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:47,455 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2022-02-20 16:46:47,455 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2022-02-20 16:46:47,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:47,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:47,456 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:47,456 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:47,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:46:47,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2022-02-20 16:46:47,458 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 14 [2022-02-20 16:46:47,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:47,458 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2022-02-20 16:46:47,458 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:46:47,458 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2022-02-20 16:46:47,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 16:46:47,459 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:47,459 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:47,484 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:46:47,667 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:46:47,667 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:47,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:47,668 INFO L85 PathProgramCache]: Analyzing trace with hash -925102245, now seen corresponding path program 1 times [2022-02-20 16:46:47,668 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:47,669 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2061058666] [2022-02-20 16:46:47,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:47,669 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:47,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:47,670 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:46:47,672 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:46:47,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:47,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 16:46:47,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:47,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:47,792 INFO L290 TraceCheckUtils]: 0: Hoare triple {364#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(20bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {364#true} is VALID [2022-02-20 16:46:47,793 INFO L290 TraceCheckUtils]: 1: Hoare triple {364#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_#t~ret9#1, main_~x~0#1, main_~y~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());main_~y~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());assume { :begin_inline_fmin_float } true;fmin_float_#in~x#1, fmin_float_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmin_float_#res#1;havoc fmin_float_#t~ret5#1, fmin_float_#t~ret6#1, fmin_float_#t~ite7#1, fmin_float_~x#1, fmin_float_~y#1;fmin_float_~x#1 := fmin_float_#in~x#1;fmin_float_~y#1 := fmin_float_#in~y#1; {364#true} is VALID [2022-02-20 16:46:47,793 INFO L272 TraceCheckUtils]: 2: Hoare triple {364#true} call fmin_float_#t~ret5#1 := __fpclassify_float(fmin_float_~x#1); {364#true} is VALID [2022-02-20 16:46:47,793 INFO L290 TraceCheckUtils]: 3: Hoare triple {364#true} ~x := #in~x;havoc ~w~0; {364#true} is VALID [2022-02-20 16:46:47,793 INFO L290 TraceCheckUtils]: 4: Hoare triple {364#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#gf_u~0.base, ~#gf_u~0.offset, 4bv32);~w~0 := #t~mem4;havoc #t~mem4;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {364#true} is VALID [2022-02-20 16:46:47,794 INFO L290 TraceCheckUtils]: 5: Hoare triple {364#true} goto; {364#true} is VALID [2022-02-20 16:46:47,794 INFO L290 TraceCheckUtils]: 6: Hoare triple {364#true} assume !(0bv32 == ~w~0 || 2147483648bv32 == ~w~0); {364#true} is VALID [2022-02-20 16:46:47,795 INFO L290 TraceCheckUtils]: 7: Hoare triple {364#true} assume (~bvuge32(~w~0, 8388608bv32) && ~bvule32(~w~0, 2139095039bv32)) || (~bvuge32(~w~0, 2155872256bv32) && ~bvule32(~w~0, 4286578687bv32));#res := 4bv32; {390#(= (_ bv4 32) |__fpclassify_float_#res|)} is VALID [2022-02-20 16:46:47,795 INFO L290 TraceCheckUtils]: 8: Hoare triple {390#(= (_ bv4 32) |__fpclassify_float_#res|)} assume true; {390#(= (_ bv4 32) |__fpclassify_float_#res|)} is VALID [2022-02-20 16:46:47,796 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {390#(= (_ bv4 32) |__fpclassify_float_#res|)} {364#true} #67#return; {397#(= |ULTIMATE.start_fmin_float_#t~ret5#1| (_ bv4 32))} is VALID [2022-02-20 16:46:47,796 INFO L290 TraceCheckUtils]: 10: Hoare triple {397#(= |ULTIMATE.start_fmin_float_#t~ret5#1| (_ bv4 32))} assume 0bv32 == fmin_float_#t~ret5#1;havoc fmin_float_#t~ret5#1;fmin_float_#res#1 := fmin_float_~y#1; {365#false} is VALID [2022-02-20 16:46:47,797 INFO L290 TraceCheckUtils]: 11: Hoare triple {365#false} main_#t~ret8#1 := fmin_float_#res#1;assume { :end_inline_fmin_float } true;main_~res~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_isnan_float } true;isnan_float_#in~x#1 := main_~res~0#1;havoc isnan_float_#res#1;havoc isnan_float_~x#1;isnan_float_~x#1 := isnan_float_#in~x#1;isnan_float_#res#1 := (if !~fp.eq~FLOAT(isnan_float_~x#1, isnan_float_~x#1) then 1bv32 else 0bv32); {365#false} is VALID [2022-02-20 16:46:47,797 INFO L290 TraceCheckUtils]: 12: Hoare triple {365#false} main_#t~ret9#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true; {365#false} is VALID [2022-02-20 16:46:47,797 INFO L290 TraceCheckUtils]: 13: Hoare triple {365#false} assume 0bv32 == main_#t~ret9#1;havoc main_#t~ret9#1; {365#false} is VALID [2022-02-20 16:46:47,797 INFO L290 TraceCheckUtils]: 14: Hoare triple {365#false} assume !false; {365#false} is VALID [2022-02-20 16:46:47,797 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:46:47,798 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:47,798 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:47,798 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2061058666] [2022-02-20 16:46:47,798 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2061058666] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:47,798 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:47,799 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:46:47,799 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165661316] [2022-02-20 16:46:47,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:47,799 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-02-20 16:46:47,800 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:47,800 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:46:47,813 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:47,813 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:46:47,813 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:47,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:46:47,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:46:47,814 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:46:47,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:47,907 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2022-02-20 16:46:47,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:46:47,907 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-02-20 16:46:47,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:47,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:46:47,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-02-20 16:46:47,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:46:47,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-02-20 16:46:47,910 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-02-20 16:46:47,941 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:47,942 INFO L225 Difference]: With dead ends: 33 [2022-02-20 16:46:47,942 INFO L226 Difference]: Without dead ends: 28 [2022-02-20 16:46:47,943 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:46:47,944 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:47,944 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:46:47,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-02-20 16:46:47,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2022-02-20 16:46:47,947 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:47,947 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:46:47,947 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:46:47,947 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:46:47,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:47,952 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2022-02-20 16:46:47,952 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-02-20 16:46:47,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:47,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:47,953 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 28 states. [2022-02-20 16:46:47,953 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 28 states. [2022-02-20 16:46:47,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:47,954 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2022-02-20 16:46:47,954 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-02-20 16:46:47,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:47,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:47,955 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:47,955 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:47,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:46:47,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2022-02-20 16:46:47,957 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 15 [2022-02-20 16:46:47,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:47,957 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2022-02-20 16:46:47,957 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:46:47,957 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2022-02-20 16:46:47,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 16:46:47,958 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:47,958 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:47,968 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-20 16:46:48,166 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:46:48,167 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:48,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:48,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1962795417, now seen corresponding path program 1 times [2022-02-20 16:46:48,168 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:48,168 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1706044924] [2022-02-20 16:46:48,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:48,168 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:48,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:48,169 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:46:48,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-20 16:46:48,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:48,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 16:46:48,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:48,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:48,248 INFO L290 TraceCheckUtils]: 0: Hoare triple {540#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(20bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {540#true} is VALID [2022-02-20 16:46:48,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {540#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_#t~ret9#1, main_~x~0#1, main_~y~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());main_~y~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());assume { :begin_inline_fmin_float } true;fmin_float_#in~x#1, fmin_float_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmin_float_#res#1;havoc fmin_float_#t~ret5#1, fmin_float_#t~ret6#1, fmin_float_#t~ite7#1, fmin_float_~x#1, fmin_float_~y#1;fmin_float_~x#1 := fmin_float_#in~x#1;fmin_float_~y#1 := fmin_float_#in~y#1; {540#true} is VALID [2022-02-20 16:46:48,249 INFO L272 TraceCheckUtils]: 2: Hoare triple {540#true} call fmin_float_#t~ret5#1 := __fpclassify_float(fmin_float_~x#1); {540#true} is VALID [2022-02-20 16:46:48,249 INFO L290 TraceCheckUtils]: 3: Hoare triple {540#true} ~x := #in~x;havoc ~w~0; {540#true} is VALID [2022-02-20 16:46:48,249 INFO L290 TraceCheckUtils]: 4: Hoare triple {540#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#gf_u~0.base, ~#gf_u~0.offset, 4bv32);~w~0 := #t~mem4;havoc #t~mem4;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {540#true} is VALID [2022-02-20 16:46:48,249 INFO L290 TraceCheckUtils]: 5: Hoare triple {540#true} goto; {540#true} is VALID [2022-02-20 16:46:48,250 INFO L290 TraceCheckUtils]: 6: Hoare triple {540#true} assume !(0bv32 == ~w~0 || 2147483648bv32 == ~w~0); {540#true} is VALID [2022-02-20 16:46:48,250 INFO L290 TraceCheckUtils]: 7: Hoare triple {540#true} assume !((~bvuge32(~w~0, 8388608bv32) && ~bvule32(~w~0, 2139095039bv32)) || (~bvuge32(~w~0, 2155872256bv32) && ~bvule32(~w~0, 4286578687bv32))); {540#true} is VALID [2022-02-20 16:46:48,250 INFO L290 TraceCheckUtils]: 8: Hoare triple {540#true} assume (~bvuge32(~w~0, 1bv32) && ~bvule32(~w~0, 8388607bv32)) || (~bvuge32(~w~0, 2147483649bv32) && ~bvule32(~w~0, 2155872255bv32));#res := 3bv32; {569#(= (_ bv3 32) |__fpclassify_float_#res|)} is VALID [2022-02-20 16:46:48,251 INFO L290 TraceCheckUtils]: 9: Hoare triple {569#(= (_ bv3 32) |__fpclassify_float_#res|)} assume true; {569#(= (_ bv3 32) |__fpclassify_float_#res|)} is VALID [2022-02-20 16:46:48,251 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {569#(= (_ bv3 32) |__fpclassify_float_#res|)} {540#true} #67#return; {576#(= |ULTIMATE.start_fmin_float_#t~ret5#1| (_ bv3 32))} is VALID [2022-02-20 16:46:48,252 INFO L290 TraceCheckUtils]: 11: Hoare triple {576#(= |ULTIMATE.start_fmin_float_#t~ret5#1| (_ bv3 32))} assume 0bv32 == fmin_float_#t~ret5#1;havoc fmin_float_#t~ret5#1;fmin_float_#res#1 := fmin_float_~y#1; {541#false} is VALID [2022-02-20 16:46:48,252 INFO L290 TraceCheckUtils]: 12: Hoare triple {541#false} main_#t~ret8#1 := fmin_float_#res#1;assume { :end_inline_fmin_float } true;main_~res~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_isnan_float } true;isnan_float_#in~x#1 := main_~res~0#1;havoc isnan_float_#res#1;havoc isnan_float_~x#1;isnan_float_~x#1 := isnan_float_#in~x#1;isnan_float_#res#1 := (if !~fp.eq~FLOAT(isnan_float_~x#1, isnan_float_~x#1) then 1bv32 else 0bv32); {541#false} is VALID [2022-02-20 16:46:48,252 INFO L290 TraceCheckUtils]: 13: Hoare triple {541#false} main_#t~ret9#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true; {541#false} is VALID [2022-02-20 16:46:48,252 INFO L290 TraceCheckUtils]: 14: Hoare triple {541#false} assume 0bv32 == main_#t~ret9#1;havoc main_#t~ret9#1; {541#false} is VALID [2022-02-20 16:46:48,253 INFO L290 TraceCheckUtils]: 15: Hoare triple {541#false} assume !false; {541#false} is VALID [2022-02-20 16:46:48,253 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:46:48,253 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:48,253 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:48,253 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1706044924] [2022-02-20 16:46:48,254 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1706044924] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:48,254 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:48,254 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:46:48,254 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621626822] [2022-02-20 16:46:48,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:48,255 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-20 16:46:48,255 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:48,255 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:46:48,268 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:48,268 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:46:48,268 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:48,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:46:48,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:46:48,269 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:46:48,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:48,344 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2022-02-20 16:46:48,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:46:48,345 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-02-20 16:46:48,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:48,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:46:48,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-02-20 16:46:48,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:46:48,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-02-20 16:46:48,347 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-02-20 16:46:48,378 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:48,379 INFO L225 Difference]: With dead ends: 33 [2022-02-20 16:46:48,379 INFO L226 Difference]: Without dead ends: 28 [2022-02-20 16:46:48,379 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:46:48,380 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:48,380 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:46:48,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-02-20 16:46:48,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2022-02-20 16:46:48,383 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:48,383 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:46:48,383 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:46:48,383 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:46:48,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:48,385 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2022-02-20 16:46:48,385 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-02-20 16:46:48,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:48,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:48,386 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 28 states. [2022-02-20 16:46:48,386 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 28 states. [2022-02-20 16:46:48,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:48,387 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2022-02-20 16:46:48,388 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-02-20 16:46:48,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:48,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:48,388 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:48,388 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:48,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:46:48,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2022-02-20 16:46:48,390 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 16 [2022-02-20 16:46:48,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:48,390 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2022-02-20 16:46:48,390 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:46:48,391 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2022-02-20 16:46:48,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 16:46:48,391 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:48,391 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:48,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-02-20 16:46:48,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:46:48,600 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:48,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:48,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1417426806, now seen corresponding path program 1 times [2022-02-20 16:46:48,601 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:48,601 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [436389914] [2022-02-20 16:46:48,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:48,601 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:48,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:48,602 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:46:48,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-02-20 16:46:48,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:48,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 16:46:48,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:48,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:48,794 INFO L290 TraceCheckUtils]: 0: Hoare triple {719#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(20bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {719#true} is VALID [2022-02-20 16:46:48,796 INFO L290 TraceCheckUtils]: 1: Hoare triple {719#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_#t~ret9#1, main_~x~0#1, main_~y~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());main_~y~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());assume { :begin_inline_fmin_float } true;fmin_float_#in~x#1, fmin_float_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmin_float_#res#1;havoc fmin_float_#t~ret5#1, fmin_float_#t~ret6#1, fmin_float_#t~ite7#1, fmin_float_~x#1, fmin_float_~y#1;fmin_float_~x#1 := fmin_float_#in~x#1;fmin_float_~y#1 := fmin_float_#in~y#1; {727#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_float_~y#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:48,797 INFO L272 TraceCheckUtils]: 2: Hoare triple {727#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_float_~y#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} call fmin_float_#t~ret5#1 := __fpclassify_float(fmin_float_~x#1); {719#true} is VALID [2022-02-20 16:46:48,797 INFO L290 TraceCheckUtils]: 3: Hoare triple {719#true} ~x := #in~x;havoc ~w~0; {719#true} is VALID [2022-02-20 16:46:48,797 INFO L290 TraceCheckUtils]: 4: Hoare triple {719#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#gf_u~0.base, ~#gf_u~0.offset, 4bv32);~w~0 := #t~mem4;havoc #t~mem4;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {719#true} is VALID [2022-02-20 16:46:48,797 INFO L290 TraceCheckUtils]: 5: Hoare triple {719#true} goto; {719#true} is VALID [2022-02-20 16:46:48,797 INFO L290 TraceCheckUtils]: 6: Hoare triple {719#true} assume !(0bv32 == ~w~0 || 2147483648bv32 == ~w~0); {719#true} is VALID [2022-02-20 16:46:48,797 INFO L290 TraceCheckUtils]: 7: Hoare triple {719#true} assume !((~bvuge32(~w~0, 8388608bv32) && ~bvule32(~w~0, 2139095039bv32)) || (~bvuge32(~w~0, 2155872256bv32) && ~bvule32(~w~0, 4286578687bv32))); {719#true} is VALID [2022-02-20 16:46:48,798 INFO L290 TraceCheckUtils]: 8: Hoare triple {719#true} assume !((~bvuge32(~w~0, 1bv32) && ~bvule32(~w~0, 8388607bv32)) || (~bvuge32(~w~0, 2147483649bv32) && ~bvule32(~w~0, 2155872255bv32))); {719#true} is VALID [2022-02-20 16:46:48,798 INFO L290 TraceCheckUtils]: 9: Hoare triple {719#true} assume !(2139095040bv32 == ~w~0 || 4286578688bv32 == ~w~0);#res := 0bv32; {719#true} is VALID [2022-02-20 16:46:48,798 INFO L290 TraceCheckUtils]: 10: Hoare triple {719#true} assume true; {719#true} is VALID [2022-02-20 16:46:48,799 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {719#true} {727#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_float_~y#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} #67#return; {727#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_float_~y#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:48,799 INFO L290 TraceCheckUtils]: 12: Hoare triple {727#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_float_~y#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} assume 0bv32 == fmin_float_#t~ret5#1;havoc fmin_float_#t~ret5#1;fmin_float_#res#1 := fmin_float_~y#1; {761#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_float_#res#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:48,801 INFO L290 TraceCheckUtils]: 13: Hoare triple {761#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_float_#res#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} main_#t~ret8#1 := fmin_float_#res#1;assume { :end_inline_fmin_float } true;main_~res~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_isnan_float } true;isnan_float_#in~x#1 := main_~res~0#1;havoc isnan_float_#res#1;havoc isnan_float_~x#1;isnan_float_~x#1 := isnan_float_#in~x#1;isnan_float_#res#1 := (if !~fp.eq~FLOAT(isnan_float_~x#1, isnan_float_~x#1) then 1bv32 else 0bv32); {765#(= (_ bv1 32) |ULTIMATE.start_isnan_float_#res#1|)} is VALID [2022-02-20 16:46:48,801 INFO L290 TraceCheckUtils]: 14: Hoare triple {765#(= (_ bv1 32) |ULTIMATE.start_isnan_float_#res#1|)} main_#t~ret9#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true; {769#(= (_ bv1 32) |ULTIMATE.start_main_#t~ret9#1|)} is VALID [2022-02-20 16:46:48,802 INFO L290 TraceCheckUtils]: 15: Hoare triple {769#(= (_ bv1 32) |ULTIMATE.start_main_#t~ret9#1|)} assume 0bv32 == main_#t~ret9#1;havoc main_#t~ret9#1; {720#false} is VALID [2022-02-20 16:46:48,802 INFO L290 TraceCheckUtils]: 16: Hoare triple {720#false} assume !false; {720#false} is VALID [2022-02-20 16:46:48,802 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:46:48,802 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:48,802 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:48,803 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [436389914] [2022-02-20 16:46:48,803 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [436389914] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:48,803 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:48,803 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 16:46:48,803 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785391204] [2022-02-20 16:46:48,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:48,804 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-02-20 16:46:48,804 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:48,804 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:46:48,821 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:48,821 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 16:46:48,821 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:48,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 16:46:48,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 16:46:48,822 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:46:48,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:48,978 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-02-20 16:46:48,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 16:46:48,978 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-02-20 16:46:48,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:48,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:46:48,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2022-02-20 16:46:48,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:46:48,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2022-02-20 16:46:48,980 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 37 transitions. [2022-02-20 16:46:49,016 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:49,017 INFO L225 Difference]: With dead ends: 35 [2022-02-20 16:46:49,017 INFO L226 Difference]: Without dead ends: 30 [2022-02-20 16:46:49,018 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:46:49,018 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 8 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 14 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:49,018 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 113 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 14 Unchecked, 0.0s Time] [2022-02-20 16:46:49,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-02-20 16:46:49,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 22. [2022-02-20 16:46:49,021 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:49,021 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 22 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:46:49,021 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 22 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:46:49,021 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 22 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:46:49,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:49,022 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-02-20 16:46:49,022 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-02-20 16:46:49,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:49,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:49,023 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 30 states. [2022-02-20 16:46:49,023 INFO L87 Difference]: Start difference. First operand has 22 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 30 states. [2022-02-20 16:46:49,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:49,024 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-02-20 16:46:49,025 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-02-20 16:46:49,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:49,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:49,025 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:49,025 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:49,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:46:49,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2022-02-20 16:46:49,026 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 17 [2022-02-20 16:46:49,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:49,027 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2022-02-20 16:46:49,027 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:46:49,027 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-02-20 16:46:49,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 16:46:49,027 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:49,028 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:49,048 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-02-20 16:46:49,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:46:49,236 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:49,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:49,236 INFO L85 PathProgramCache]: Analyzing trace with hash 642927512, now seen corresponding path program 1 times [2022-02-20 16:46:49,236 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:49,237 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [196052322] [2022-02-20 16:46:49,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:49,237 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:49,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:49,238 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:46:49,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-02-20 16:46:49,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:49,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 16:46:49,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:49,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:49,352 INFO L290 TraceCheckUtils]: 0: Hoare triple {910#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(20bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {910#true} is VALID [2022-02-20 16:46:49,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {910#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_#t~ret9#1, main_~x~0#1, main_~y~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());main_~y~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());assume { :begin_inline_fmin_float } true;fmin_float_#in~x#1, fmin_float_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmin_float_#res#1;havoc fmin_float_#t~ret5#1, fmin_float_#t~ret6#1, fmin_float_#t~ite7#1, fmin_float_~x#1, fmin_float_~y#1;fmin_float_~x#1 := fmin_float_#in~x#1;fmin_float_~y#1 := fmin_float_#in~y#1; {910#true} is VALID [2022-02-20 16:46:49,353 INFO L272 TraceCheckUtils]: 2: Hoare triple {910#true} call fmin_float_#t~ret5#1 := __fpclassify_float(fmin_float_~x#1); {910#true} is VALID [2022-02-20 16:46:49,353 INFO L290 TraceCheckUtils]: 3: Hoare triple {910#true} ~x := #in~x;havoc ~w~0; {910#true} is VALID [2022-02-20 16:46:49,353 INFO L290 TraceCheckUtils]: 4: Hoare triple {910#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#gf_u~0.base, ~#gf_u~0.offset, 4bv32);~w~0 := #t~mem4;havoc #t~mem4;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {910#true} is VALID [2022-02-20 16:46:49,353 INFO L290 TraceCheckUtils]: 5: Hoare triple {910#true} goto; {910#true} is VALID [2022-02-20 16:46:49,354 INFO L290 TraceCheckUtils]: 6: Hoare triple {910#true} assume 0bv32 == ~w~0 || 2147483648bv32 == ~w~0;#res := 2bv32; {910#true} is VALID [2022-02-20 16:46:49,360 INFO L290 TraceCheckUtils]: 7: Hoare triple {910#true} assume true; {910#true} is VALID [2022-02-20 16:46:49,360 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {910#true} {910#true} #67#return; {910#true} is VALID [2022-02-20 16:46:49,360 INFO L290 TraceCheckUtils]: 9: Hoare triple {910#true} assume !(0bv32 == fmin_float_#t~ret5#1);havoc fmin_float_#t~ret5#1; {910#true} is VALID [2022-02-20 16:46:49,360 INFO L272 TraceCheckUtils]: 10: Hoare triple {910#true} call fmin_float_#t~ret6#1 := __fpclassify_float(fmin_float_~y#1); {910#true} is VALID [2022-02-20 16:46:49,360 INFO L290 TraceCheckUtils]: 11: Hoare triple {910#true} ~x := #in~x;havoc ~w~0; {910#true} is VALID [2022-02-20 16:46:49,361 INFO L290 TraceCheckUtils]: 12: Hoare triple {910#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#gf_u~0.base, ~#gf_u~0.offset, 4bv32);~w~0 := #t~mem4;havoc #t~mem4;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {910#true} is VALID [2022-02-20 16:46:49,361 INFO L290 TraceCheckUtils]: 13: Hoare triple {910#true} goto; {910#true} is VALID [2022-02-20 16:46:49,362 INFO L290 TraceCheckUtils]: 14: Hoare triple {910#true} assume 0bv32 == ~w~0 || 2147483648bv32 == ~w~0;#res := 2bv32; {957#(= (_ bv2 32) |__fpclassify_float_#res|)} is VALID [2022-02-20 16:46:49,362 INFO L290 TraceCheckUtils]: 15: Hoare triple {957#(= (_ bv2 32) |__fpclassify_float_#res|)} assume true; {957#(= (_ bv2 32) |__fpclassify_float_#res|)} is VALID [2022-02-20 16:46:49,363 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {957#(= (_ bv2 32) |__fpclassify_float_#res|)} {910#true} #69#return; {964#(= |ULTIMATE.start_fmin_float_#t~ret6#1| (_ bv2 32))} is VALID [2022-02-20 16:46:49,363 INFO L290 TraceCheckUtils]: 17: Hoare triple {964#(= |ULTIMATE.start_fmin_float_#t~ret6#1| (_ bv2 32))} assume 0bv32 == fmin_float_#t~ret6#1;havoc fmin_float_#t~ret6#1;fmin_float_#res#1 := fmin_float_~x#1; {911#false} is VALID [2022-02-20 16:46:49,363 INFO L290 TraceCheckUtils]: 18: Hoare triple {911#false} main_#t~ret8#1 := fmin_float_#res#1;assume { :end_inline_fmin_float } true;main_~res~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_isnan_float } true;isnan_float_#in~x#1 := main_~res~0#1;havoc isnan_float_#res#1;havoc isnan_float_~x#1;isnan_float_~x#1 := isnan_float_#in~x#1;isnan_float_#res#1 := (if !~fp.eq~FLOAT(isnan_float_~x#1, isnan_float_~x#1) then 1bv32 else 0bv32); {911#false} is VALID [2022-02-20 16:46:49,364 INFO L290 TraceCheckUtils]: 19: Hoare triple {911#false} main_#t~ret9#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true; {911#false} is VALID [2022-02-20 16:46:49,364 INFO L290 TraceCheckUtils]: 20: Hoare triple {911#false} assume 0bv32 == main_#t~ret9#1;havoc main_#t~ret9#1; {911#false} is VALID [2022-02-20 16:46:49,364 INFO L290 TraceCheckUtils]: 21: Hoare triple {911#false} assume !false; {911#false} is VALID [2022-02-20 16:46:49,364 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 16:46:49,364 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:49,365 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:49,365 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [196052322] [2022-02-20 16:46:49,365 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [196052322] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:49,365 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:49,365 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:46:49,365 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295206464] [2022-02-20 16:46:49,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:49,366 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-02-20 16:46:49,366 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:49,366 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:46:49,384 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:49,384 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:46:49,384 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:49,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:46:49,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:46:49,385 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:46:49,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:49,453 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2022-02-20 16:46:49,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:46:49,453 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-02-20 16:46:49,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:49,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:46:49,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-02-20 16:46:49,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:46:49,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-02-20 16:46:49,455 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 37 transitions. [2022-02-20 16:46:49,483 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:49,484 INFO L225 Difference]: With dead ends: 30 [2022-02-20 16:46:49,484 INFO L226 Difference]: Without dead ends: 25 [2022-02-20 16:46:49,485 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:46:49,485 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:49,486 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:46:49,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-02-20 16:46:49,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-02-20 16:46:49,488 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:49,488 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:46:49,488 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:46:49,489 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:46:49,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:49,490 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2022-02-20 16:46:49,490 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-02-20 16:46:49,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:49,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:49,491 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 25 states. [2022-02-20 16:46:49,491 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 25 states. [2022-02-20 16:46:49,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:49,492 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2022-02-20 16:46:49,492 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-02-20 16:46:49,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:49,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:49,492 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:49,493 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:49,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:46:49,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2022-02-20 16:46:49,494 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 22 [2022-02-20 16:46:49,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:49,494 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-02-20 16:46:49,494 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:46:49,494 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-02-20 16:46:49,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 16:46:49,495 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:49,495 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:49,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-02-20 16:46:49,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:46:49,703 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:49,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:49,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1233179256, now seen corresponding path program 1 times [2022-02-20 16:46:49,704 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:49,704 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1000241561] [2022-02-20 16:46:49,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:49,704 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:49,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:49,706 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:46:49,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-02-20 16:46:49,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:49,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 16:46:49,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:49,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:49,807 INFO L290 TraceCheckUtils]: 0: Hoare triple {1098#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(20bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {1098#true} is VALID [2022-02-20 16:46:49,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {1098#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_#t~ret9#1, main_~x~0#1, main_~y~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());main_~y~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());assume { :begin_inline_fmin_float } true;fmin_float_#in~x#1, fmin_float_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmin_float_#res#1;havoc fmin_float_#t~ret5#1, fmin_float_#t~ret6#1, fmin_float_#t~ite7#1, fmin_float_~x#1, fmin_float_~y#1;fmin_float_~x#1 := fmin_float_#in~x#1;fmin_float_~y#1 := fmin_float_#in~y#1; {1098#true} is VALID [2022-02-20 16:46:49,808 INFO L272 TraceCheckUtils]: 2: Hoare triple {1098#true} call fmin_float_#t~ret5#1 := __fpclassify_float(fmin_float_~x#1); {1098#true} is VALID [2022-02-20 16:46:49,808 INFO L290 TraceCheckUtils]: 3: Hoare triple {1098#true} ~x := #in~x;havoc ~w~0; {1098#true} is VALID [2022-02-20 16:46:49,808 INFO L290 TraceCheckUtils]: 4: Hoare triple {1098#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#gf_u~0.base, ~#gf_u~0.offset, 4bv32);~w~0 := #t~mem4;havoc #t~mem4;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {1098#true} is VALID [2022-02-20 16:46:49,809 INFO L290 TraceCheckUtils]: 5: Hoare triple {1098#true} goto; {1098#true} is VALID [2022-02-20 16:46:49,809 INFO L290 TraceCheckUtils]: 6: Hoare triple {1098#true} assume 0bv32 == ~w~0 || 2147483648bv32 == ~w~0;#res := 2bv32; {1098#true} is VALID [2022-02-20 16:46:49,809 INFO L290 TraceCheckUtils]: 7: Hoare triple {1098#true} assume true; {1098#true} is VALID [2022-02-20 16:46:49,809 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1098#true} {1098#true} #67#return; {1098#true} is VALID [2022-02-20 16:46:49,809 INFO L290 TraceCheckUtils]: 9: Hoare triple {1098#true} assume !(0bv32 == fmin_float_#t~ret5#1);havoc fmin_float_#t~ret5#1; {1098#true} is VALID [2022-02-20 16:46:49,809 INFO L272 TraceCheckUtils]: 10: Hoare triple {1098#true} call fmin_float_#t~ret6#1 := __fpclassify_float(fmin_float_~y#1); {1098#true} is VALID [2022-02-20 16:46:49,810 INFO L290 TraceCheckUtils]: 11: Hoare triple {1098#true} ~x := #in~x;havoc ~w~0; {1098#true} is VALID [2022-02-20 16:46:49,810 INFO L290 TraceCheckUtils]: 12: Hoare triple {1098#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#gf_u~0.base, ~#gf_u~0.offset, 4bv32);~w~0 := #t~mem4;havoc #t~mem4;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {1098#true} is VALID [2022-02-20 16:46:49,810 INFO L290 TraceCheckUtils]: 13: Hoare triple {1098#true} goto; {1098#true} is VALID [2022-02-20 16:46:49,810 INFO L290 TraceCheckUtils]: 14: Hoare triple {1098#true} assume !(0bv32 == ~w~0 || 2147483648bv32 == ~w~0); {1098#true} is VALID [2022-02-20 16:46:49,811 INFO L290 TraceCheckUtils]: 15: Hoare triple {1098#true} assume (~bvuge32(~w~0, 8388608bv32) && ~bvule32(~w~0, 2139095039bv32)) || (~bvuge32(~w~0, 2155872256bv32) && ~bvule32(~w~0, 4286578687bv32));#res := 4bv32; {1148#(= (_ bv4 32) |__fpclassify_float_#res|)} is VALID [2022-02-20 16:46:49,811 INFO L290 TraceCheckUtils]: 16: Hoare triple {1148#(= (_ bv4 32) |__fpclassify_float_#res|)} assume true; {1148#(= (_ bv4 32) |__fpclassify_float_#res|)} is VALID [2022-02-20 16:46:49,812 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1148#(= (_ bv4 32) |__fpclassify_float_#res|)} {1098#true} #69#return; {1155#(= |ULTIMATE.start_fmin_float_#t~ret6#1| (_ bv4 32))} is VALID [2022-02-20 16:46:49,812 INFO L290 TraceCheckUtils]: 18: Hoare triple {1155#(= |ULTIMATE.start_fmin_float_#t~ret6#1| (_ bv4 32))} assume 0bv32 == fmin_float_#t~ret6#1;havoc fmin_float_#t~ret6#1;fmin_float_#res#1 := fmin_float_~x#1; {1099#false} is VALID [2022-02-20 16:46:49,813 INFO L290 TraceCheckUtils]: 19: Hoare triple {1099#false} main_#t~ret8#1 := fmin_float_#res#1;assume { :end_inline_fmin_float } true;main_~res~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_isnan_float } true;isnan_float_#in~x#1 := main_~res~0#1;havoc isnan_float_#res#1;havoc isnan_float_~x#1;isnan_float_~x#1 := isnan_float_#in~x#1;isnan_float_#res#1 := (if !~fp.eq~FLOAT(isnan_float_~x#1, isnan_float_~x#1) then 1bv32 else 0bv32); {1099#false} is VALID [2022-02-20 16:46:49,813 INFO L290 TraceCheckUtils]: 20: Hoare triple {1099#false} main_#t~ret9#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true; {1099#false} is VALID [2022-02-20 16:46:49,813 INFO L290 TraceCheckUtils]: 21: Hoare triple {1099#false} assume 0bv32 == main_#t~ret9#1;havoc main_#t~ret9#1; {1099#false} is VALID [2022-02-20 16:46:49,813 INFO L290 TraceCheckUtils]: 22: Hoare triple {1099#false} assume !false; {1099#false} is VALID [2022-02-20 16:46:49,813 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 16:46:49,813 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:49,814 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:49,814 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1000241561] [2022-02-20 16:46:49,814 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1000241561] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:49,814 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:49,814 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:46:49,814 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356539942] [2022-02-20 16:46:49,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:49,815 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2022-02-20 16:46:49,815 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:49,815 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:46:49,843 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:49,843 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:46:49,843 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:49,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:46:49,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:46:49,844 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:46:49,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:49,921 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2022-02-20 16:46:49,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:46:49,921 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2022-02-20 16:46:49,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:49,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:46:49,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-02-20 16:46:49,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:46:49,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-02-20 16:46:49,923 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 37 transitions. [2022-02-20 16:46:49,947 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:49,948 INFO L225 Difference]: With dead ends: 33 [2022-02-20 16:46:49,948 INFO L226 Difference]: Without dead ends: 28 [2022-02-20 16:46:49,949 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:46:49,949 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:49,949 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:46:49,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-02-20 16:46:49,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2022-02-20 16:46:49,951 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:49,952 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:46:49,952 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:46:49,957 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:46:49,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:49,958 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-02-20 16:46:49,958 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-02-20 16:46:49,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:49,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:49,959 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 28 states. [2022-02-20 16:46:49,959 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 28 states. [2022-02-20 16:46:49,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:49,960 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-02-20 16:46:49,960 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-02-20 16:46:49,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:49,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:49,961 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:49,961 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:49,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:46:49,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2022-02-20 16:46:49,962 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 23 [2022-02-20 16:46:49,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:49,962 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-02-20 16:46:49,962 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:46:49,962 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-02-20 16:46:49,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 16:46:49,963 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:49,963 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:49,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-02-20 16:46:50,171 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:46:50,171 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:50,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:50,172 INFO L85 PathProgramCache]: Analyzing trace with hash 977434878, now seen corresponding path program 1 times [2022-02-20 16:46:50,172 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:50,172 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1342788246] [2022-02-20 16:46:50,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:50,172 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:50,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:50,173 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:46:50,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-02-20 16:46:50,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:50,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 16:46:50,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:50,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:50,315 INFO L290 TraceCheckUtils]: 0: Hoare triple {1298#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(20bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {1298#true} is VALID [2022-02-20 16:46:50,317 INFO L290 TraceCheckUtils]: 1: Hoare triple {1298#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_#t~ret9#1, main_~x~0#1, main_~y~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());main_~y~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());assume { :begin_inline_fmin_float } true;fmin_float_#in~x#1, fmin_float_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmin_float_#res#1;havoc fmin_float_#t~ret5#1, fmin_float_#t~ret6#1, fmin_float_#t~ite7#1, fmin_float_~x#1, fmin_float_~y#1;fmin_float_~x#1 := fmin_float_#in~x#1;fmin_float_~y#1 := fmin_float_#in~y#1; {1306#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_float_~y#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:50,317 INFO L272 TraceCheckUtils]: 2: Hoare triple {1306#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_float_~y#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} call fmin_float_#t~ret5#1 := __fpclassify_float(fmin_float_~x#1); {1298#true} is VALID [2022-02-20 16:46:50,317 INFO L290 TraceCheckUtils]: 3: Hoare triple {1298#true} ~x := #in~x;havoc ~w~0; {1298#true} is VALID [2022-02-20 16:46:50,317 INFO L290 TraceCheckUtils]: 4: Hoare triple {1298#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#gf_u~0.base, ~#gf_u~0.offset, 4bv32);~w~0 := #t~mem4;havoc #t~mem4;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {1298#true} is VALID [2022-02-20 16:46:50,318 INFO L290 TraceCheckUtils]: 5: Hoare triple {1298#true} goto; {1298#true} is VALID [2022-02-20 16:46:50,318 INFO L290 TraceCheckUtils]: 6: Hoare triple {1298#true} assume 0bv32 == ~w~0 || 2147483648bv32 == ~w~0;#res := 2bv32; {1298#true} is VALID [2022-02-20 16:46:50,318 INFO L290 TraceCheckUtils]: 7: Hoare triple {1298#true} assume true; {1298#true} is VALID [2022-02-20 16:46:50,319 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1298#true} {1306#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_float_~y#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} #67#return; {1306#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_float_~y#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:50,319 INFO L290 TraceCheckUtils]: 9: Hoare triple {1306#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_float_~y#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} assume !(0bv32 == fmin_float_#t~ret5#1);havoc fmin_float_#t~ret5#1; {1306#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_float_~y#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:50,319 INFO L272 TraceCheckUtils]: 10: Hoare triple {1306#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_float_~y#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} call fmin_float_#t~ret6#1 := __fpclassify_float(fmin_float_~y#1); {1298#true} is VALID [2022-02-20 16:46:50,319 INFO L290 TraceCheckUtils]: 11: Hoare triple {1298#true} ~x := #in~x;havoc ~w~0; {1298#true} is VALID [2022-02-20 16:46:50,319 INFO L290 TraceCheckUtils]: 12: Hoare triple {1298#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#gf_u~0.base, ~#gf_u~0.offset, 4bv32);~w~0 := #t~mem4;havoc #t~mem4;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {1298#true} is VALID [2022-02-20 16:46:50,320 INFO L290 TraceCheckUtils]: 13: Hoare triple {1298#true} goto; {1298#true} is VALID [2022-02-20 16:46:50,320 INFO L290 TraceCheckUtils]: 14: Hoare triple {1298#true} assume 0bv32 == ~w~0 || 2147483648bv32 == ~w~0;#res := 2bv32; {1298#true} is VALID [2022-02-20 16:46:50,320 INFO L290 TraceCheckUtils]: 15: Hoare triple {1298#true} assume true; {1298#true} is VALID [2022-02-20 16:46:50,321 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1298#true} {1306#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_float_~y#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} #69#return; {1306#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_float_~y#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:50,321 INFO L290 TraceCheckUtils]: 17: Hoare triple {1306#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_float_~y#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} assume !(0bv32 == fmin_float_#t~ret6#1);havoc fmin_float_#t~ret6#1; {1306#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_float_~y#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:50,322 INFO L290 TraceCheckUtils]: 18: Hoare triple {1306#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_float_~y#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} assume ~fp.lt~FLOAT(fmin_float_~x#1, fmin_float_~y#1);fmin_float_#t~ite7#1 := fmin_float_~x#1; {1299#false} is VALID [2022-02-20 16:46:50,323 INFO L290 TraceCheckUtils]: 19: Hoare triple {1299#false} fmin_float_#res#1 := fmin_float_#t~ite7#1;havoc fmin_float_#t~ite7#1; {1299#false} is VALID [2022-02-20 16:46:50,323 INFO L290 TraceCheckUtils]: 20: Hoare triple {1299#false} main_#t~ret8#1 := fmin_float_#res#1;assume { :end_inline_fmin_float } true;main_~res~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_isnan_float } true;isnan_float_#in~x#1 := main_~res~0#1;havoc isnan_float_#res#1;havoc isnan_float_~x#1;isnan_float_~x#1 := isnan_float_#in~x#1;isnan_float_#res#1 := (if !~fp.eq~FLOAT(isnan_float_~x#1, isnan_float_~x#1) then 1bv32 else 0bv32); {1299#false} is VALID [2022-02-20 16:46:50,323 INFO L290 TraceCheckUtils]: 21: Hoare triple {1299#false} main_#t~ret9#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true; {1299#false} is VALID [2022-02-20 16:46:50,323 INFO L290 TraceCheckUtils]: 22: Hoare triple {1299#false} assume 0bv32 == main_#t~ret9#1;havoc main_#t~ret9#1; {1299#false} is VALID [2022-02-20 16:46:50,323 INFO L290 TraceCheckUtils]: 23: Hoare triple {1299#false} assume !false; {1299#false} is VALID [2022-02-20 16:46:50,323 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 16:46:50,324 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:50,324 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:50,324 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1342788246] [2022-02-20 16:46:50,324 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1342788246] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:50,324 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:50,324 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:46:50,324 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896550674] [2022-02-20 16:46:50,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:50,325 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-02-20 16:46:50,325 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:50,325 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:46:50,346 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:50,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:46:50,346 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:50,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:46:50,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:46:50,347 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:46:50,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:50,394 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-02-20 16:46:50,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:46:50,395 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-02-20 16:46:50,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:50,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:46:50,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-02-20 16:46:50,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:46:50,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-02-20 16:46:50,396 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 37 transitions. [2022-02-20 16:46:50,458 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:50,459 INFO L225 Difference]: With dead ends: 36 [2022-02-20 16:46:50,459 INFO L226 Difference]: Without dead ends: 30 [2022-02-20 16:46:50,460 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 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:46:50,460 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 5 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:50,460 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 50 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 1 Unchecked, 0.0s Time] [2022-02-20 16:46:50,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-02-20 16:46:50,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2022-02-20 16:46:50,462 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:50,462 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 25 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:46:50,462 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 25 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:46:50,463 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 25 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:46:50,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:50,464 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-02-20 16:46:50,464 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-02-20 16:46:50,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:50,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:50,464 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 30 states. [2022-02-20 16:46:50,464 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 30 states. [2022-02-20 16:46:50,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:50,465 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-02-20 16:46:50,466 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-02-20 16:46:50,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:50,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:50,466 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:50,466 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:50,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:46:50,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2022-02-20 16:46:50,467 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 24 [2022-02-20 16:46:50,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:50,468 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2022-02-20 16:46:50,468 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:46:50,468 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-02-20 16:46:50,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 16:46:50,468 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:50,468 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:50,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-02-20 16:46:50,676 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:46:50,677 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:50,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:50,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1034693180, now seen corresponding path program 1 times [2022-02-20 16:46:50,677 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:50,678 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1619374288] [2022-02-20 16:46:50,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:50,678 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:50,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:50,679 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:46:50,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-02-20 16:46:50,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:50,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 16:46:50,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:50,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:50,945 INFO L290 TraceCheckUtils]: 0: Hoare triple {1509#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(20bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {1509#true} is VALID [2022-02-20 16:46:50,947 INFO L290 TraceCheckUtils]: 1: Hoare triple {1509#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_#t~ret9#1, main_~x~0#1, main_~y~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());main_~y~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());assume { :begin_inline_fmin_float } true;fmin_float_#in~x#1, fmin_float_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmin_float_#res#1;havoc fmin_float_#t~ret5#1, fmin_float_#t~ret6#1, fmin_float_#t~ite7#1, fmin_float_~x#1, fmin_float_~y#1;fmin_float_~x#1 := fmin_float_#in~x#1;fmin_float_~y#1 := fmin_float_#in~y#1; {1517#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_float_~y#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:50,947 INFO L272 TraceCheckUtils]: 2: Hoare triple {1517#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_float_~y#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} call fmin_float_#t~ret5#1 := __fpclassify_float(fmin_float_~x#1); {1509#true} is VALID [2022-02-20 16:46:50,948 INFO L290 TraceCheckUtils]: 3: Hoare triple {1509#true} ~x := #in~x;havoc ~w~0; {1509#true} is VALID [2022-02-20 16:46:50,948 INFO L290 TraceCheckUtils]: 4: Hoare triple {1509#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#gf_u~0.base, ~#gf_u~0.offset, 4bv32);~w~0 := #t~mem4;havoc #t~mem4;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {1509#true} is VALID [2022-02-20 16:46:50,948 INFO L290 TraceCheckUtils]: 5: Hoare triple {1509#true} goto; {1509#true} is VALID [2022-02-20 16:46:50,948 INFO L290 TraceCheckUtils]: 6: Hoare triple {1509#true} assume 0bv32 == ~w~0 || 2147483648bv32 == ~w~0;#res := 2bv32; {1509#true} is VALID [2022-02-20 16:46:50,948 INFO L290 TraceCheckUtils]: 7: Hoare triple {1509#true} assume true; {1509#true} is VALID [2022-02-20 16:46:50,949 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1509#true} {1517#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_float_~y#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} #67#return; {1517#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_float_~y#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:50,949 INFO L290 TraceCheckUtils]: 9: Hoare triple {1517#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_float_~y#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} assume !(0bv32 == fmin_float_#t~ret5#1);havoc fmin_float_#t~ret5#1; {1517#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_float_~y#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:50,949 INFO L272 TraceCheckUtils]: 10: Hoare triple {1517#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_float_~y#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} call fmin_float_#t~ret6#1 := __fpclassify_float(fmin_float_~y#1); {1509#true} is VALID [2022-02-20 16:46:50,950 INFO L290 TraceCheckUtils]: 11: Hoare triple {1509#true} ~x := #in~x;havoc ~w~0; {1509#true} is VALID [2022-02-20 16:46:50,950 INFO L290 TraceCheckUtils]: 12: Hoare triple {1509#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#gf_u~0.base, ~#gf_u~0.offset, 4bv32);~w~0 := #t~mem4;havoc #t~mem4;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {1509#true} is VALID [2022-02-20 16:46:50,950 INFO L290 TraceCheckUtils]: 13: Hoare triple {1509#true} goto; {1509#true} is VALID [2022-02-20 16:46:50,950 INFO L290 TraceCheckUtils]: 14: Hoare triple {1509#true} assume 0bv32 == ~w~0 || 2147483648bv32 == ~w~0;#res := 2bv32; {1509#true} is VALID [2022-02-20 16:46:50,950 INFO L290 TraceCheckUtils]: 15: Hoare triple {1509#true} assume true; {1509#true} is VALID [2022-02-20 16:46:50,951 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1509#true} {1517#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_float_~y#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} #69#return; {1517#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_float_~y#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:50,951 INFO L290 TraceCheckUtils]: 17: Hoare triple {1517#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_float_~y#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} assume !(0bv32 == fmin_float_#t~ret6#1);havoc fmin_float_#t~ret6#1; {1517#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_float_~y#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:50,952 INFO L290 TraceCheckUtils]: 18: Hoare triple {1517#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_float_~y#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} assume !~fp.lt~FLOAT(fmin_float_~x#1, fmin_float_~y#1);fmin_float_#t~ite7#1 := fmin_float_~y#1; {1569#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_float_#t~ite7#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:50,952 INFO L290 TraceCheckUtils]: 19: Hoare triple {1569#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_float_#t~ite7#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} fmin_float_#res#1 := fmin_float_#t~ite7#1;havoc fmin_float_#t~ite7#1; {1573#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_float_#res#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:50,954 INFO L290 TraceCheckUtils]: 20: Hoare triple {1573#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_float_#res#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} main_#t~ret8#1 := fmin_float_#res#1;assume { :end_inline_fmin_float } true;main_~res~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_isnan_float } true;isnan_float_#in~x#1 := main_~res~0#1;havoc isnan_float_#res#1;havoc isnan_float_~x#1;isnan_float_~x#1 := isnan_float_#in~x#1;isnan_float_#res#1 := (if !~fp.eq~FLOAT(isnan_float_~x#1, isnan_float_~x#1) then 1bv32 else 0bv32); {1577#(= (_ bv1 32) |ULTIMATE.start_isnan_float_#res#1|)} is VALID [2022-02-20 16:46:50,954 INFO L290 TraceCheckUtils]: 21: Hoare triple {1577#(= (_ bv1 32) |ULTIMATE.start_isnan_float_#res#1|)} main_#t~ret9#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true; {1581#(= (_ bv1 32) |ULTIMATE.start_main_#t~ret9#1|)} is VALID [2022-02-20 16:46:50,954 INFO L290 TraceCheckUtils]: 22: Hoare triple {1581#(= (_ bv1 32) |ULTIMATE.start_main_#t~ret9#1|)} assume 0bv32 == main_#t~ret9#1;havoc main_#t~ret9#1; {1510#false} is VALID [2022-02-20 16:46:50,955 INFO L290 TraceCheckUtils]: 23: Hoare triple {1510#false} assume !false; {1510#false} is VALID [2022-02-20 16:46:50,955 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 16:46:50,955 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:50,955 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:50,955 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1619374288] [2022-02-20 16:46:50,955 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1619374288] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:50,956 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:50,956 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 16:46:50,956 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373956881] [2022-02-20 16:46:50,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:50,957 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-02-20 16:46:50,957 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:50,957 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:46:50,976 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:50,976 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 16:46:50,976 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:50,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 16:46:50,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:46:50,977 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:46:51,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:51,174 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-02-20 16:46:51,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 16:46:51,175 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-02-20 16:46:51,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:51,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:46:51,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2022-02-20 16:46:51,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:46:51,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2022-02-20 16:46:51,176 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 31 transitions. [2022-02-20 16:46:51,208 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:51,209 INFO L225 Difference]: With dead ends: 30 [2022-02-20 16:46:51,209 INFO L226 Difference]: Without dead ends: 22 [2022-02-20 16:46:51,209 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-02-20 16:46:51,210 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 14 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:51,210 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 131 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 14 Unchecked, 0.0s Time] [2022-02-20 16:46:51,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-02-20 16:46:51,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-02-20 16:46:51,212 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:51,212 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 16:46:51,212 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 16:46:51,212 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 16:46:51,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:51,213 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-02-20 16:46:51,213 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-02-20 16:46:51,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:51,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:51,213 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Second operand 22 states. [2022-02-20 16:46:51,216 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Second operand 22 states. [2022-02-20 16:46:51,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:51,219 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-02-20 16:46:51,219 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-02-20 16:46:51,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:51,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:51,219 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:51,220 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:51,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 16:46:51,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-02-20 16:46:51,220 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 24 [2022-02-20 16:46:51,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:51,221 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-02-20 16:46:51,221 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:46:51,221 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-02-20 16:46:51,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 16:46:51,222 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:51,222 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:51,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-02-20 16:46:51,430 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:46:51,430 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:51,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:51,431 INFO L85 PathProgramCache]: Analyzing trace with hash -881640172, now seen corresponding path program 1 times [2022-02-20 16:46:51,431 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:51,432 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [576770214] [2022-02-20 16:46:51,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:51,432 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:51,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:51,433 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:46:51,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-02-20 16:46:51,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:51,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 16:46:51,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:51,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:51,554 INFO L290 TraceCheckUtils]: 0: Hoare triple {1699#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(20bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {1699#true} is VALID [2022-02-20 16:46:51,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {1699#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_#t~ret9#1, main_~x~0#1, main_~y~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());main_~y~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());assume { :begin_inline_fmin_float } true;fmin_float_#in~x#1, fmin_float_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmin_float_#res#1;havoc fmin_float_#t~ret5#1, fmin_float_#t~ret6#1, fmin_float_#t~ite7#1, fmin_float_~x#1, fmin_float_~y#1;fmin_float_~x#1 := fmin_float_#in~x#1;fmin_float_~y#1 := fmin_float_#in~y#1; {1699#true} is VALID [2022-02-20 16:46:51,554 INFO L272 TraceCheckUtils]: 2: Hoare triple {1699#true} call fmin_float_#t~ret5#1 := __fpclassify_float(fmin_float_~x#1); {1699#true} is VALID [2022-02-20 16:46:51,554 INFO L290 TraceCheckUtils]: 3: Hoare triple {1699#true} ~x := #in~x;havoc ~w~0; {1699#true} is VALID [2022-02-20 16:46:51,555 INFO L290 TraceCheckUtils]: 4: Hoare triple {1699#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#gf_u~0.base, ~#gf_u~0.offset, 4bv32);~w~0 := #t~mem4;havoc #t~mem4;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {1699#true} is VALID [2022-02-20 16:46:51,555 INFO L290 TraceCheckUtils]: 5: Hoare triple {1699#true} goto; {1699#true} is VALID [2022-02-20 16:46:51,555 INFO L290 TraceCheckUtils]: 6: Hoare triple {1699#true} assume 0bv32 == ~w~0 || 2147483648bv32 == ~w~0;#res := 2bv32; {1699#true} is VALID [2022-02-20 16:46:51,556 INFO L290 TraceCheckUtils]: 7: Hoare triple {1699#true} assume true; {1699#true} is VALID [2022-02-20 16:46:51,556 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1699#true} {1699#true} #67#return; {1699#true} is VALID [2022-02-20 16:46:51,556 INFO L290 TraceCheckUtils]: 9: Hoare triple {1699#true} assume !(0bv32 == fmin_float_#t~ret5#1);havoc fmin_float_#t~ret5#1; {1699#true} is VALID [2022-02-20 16:46:51,557 INFO L272 TraceCheckUtils]: 10: Hoare triple {1699#true} call fmin_float_#t~ret6#1 := __fpclassify_float(fmin_float_~y#1); {1699#true} is VALID [2022-02-20 16:46:51,557 INFO L290 TraceCheckUtils]: 11: Hoare triple {1699#true} ~x := #in~x;havoc ~w~0; {1699#true} is VALID [2022-02-20 16:46:51,557 INFO L290 TraceCheckUtils]: 12: Hoare triple {1699#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#gf_u~0.base, ~#gf_u~0.offset, 4bv32);~w~0 := #t~mem4;havoc #t~mem4;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {1699#true} is VALID [2022-02-20 16:46:51,557 INFO L290 TraceCheckUtils]: 13: Hoare triple {1699#true} goto; {1699#true} is VALID [2022-02-20 16:46:51,557 INFO L290 TraceCheckUtils]: 14: Hoare triple {1699#true} assume !(0bv32 == ~w~0 || 2147483648bv32 == ~w~0); {1699#true} is VALID [2022-02-20 16:46:51,558 INFO L290 TraceCheckUtils]: 15: Hoare triple {1699#true} assume !((~bvuge32(~w~0, 8388608bv32) && ~bvule32(~w~0, 2139095039bv32)) || (~bvuge32(~w~0, 2155872256bv32) && ~bvule32(~w~0, 4286578687bv32))); {1699#true} is VALID [2022-02-20 16:46:51,558 INFO L290 TraceCheckUtils]: 16: Hoare triple {1699#true} assume (~bvuge32(~w~0, 1bv32) && ~bvule32(~w~0, 8388607bv32)) || (~bvuge32(~w~0, 2147483649bv32) && ~bvule32(~w~0, 2155872255bv32));#res := 3bv32; {1752#(= (_ bv3 32) |__fpclassify_float_#res|)} is VALID [2022-02-20 16:46:51,558 INFO L290 TraceCheckUtils]: 17: Hoare triple {1752#(= (_ bv3 32) |__fpclassify_float_#res|)} assume true; {1752#(= (_ bv3 32) |__fpclassify_float_#res|)} is VALID [2022-02-20 16:46:51,559 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1752#(= (_ bv3 32) |__fpclassify_float_#res|)} {1699#true} #69#return; {1759#(= |ULTIMATE.start_fmin_float_#t~ret6#1| (_ bv3 32))} is VALID [2022-02-20 16:46:51,559 INFO L290 TraceCheckUtils]: 19: Hoare triple {1759#(= |ULTIMATE.start_fmin_float_#t~ret6#1| (_ bv3 32))} assume 0bv32 == fmin_float_#t~ret6#1;havoc fmin_float_#t~ret6#1;fmin_float_#res#1 := fmin_float_~x#1; {1700#false} is VALID [2022-02-20 16:46:51,559 INFO L290 TraceCheckUtils]: 20: Hoare triple {1700#false} main_#t~ret8#1 := fmin_float_#res#1;assume { :end_inline_fmin_float } true;main_~res~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_isnan_float } true;isnan_float_#in~x#1 := main_~res~0#1;havoc isnan_float_#res#1;havoc isnan_float_~x#1;isnan_float_~x#1 := isnan_float_#in~x#1;isnan_float_#res#1 := (if !~fp.eq~FLOAT(isnan_float_~x#1, isnan_float_~x#1) then 1bv32 else 0bv32); {1700#false} is VALID [2022-02-20 16:46:51,559 INFO L290 TraceCheckUtils]: 21: Hoare triple {1700#false} main_#t~ret9#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true; {1700#false} is VALID [2022-02-20 16:46:51,560 INFO L290 TraceCheckUtils]: 22: Hoare triple {1700#false} assume 0bv32 == main_#t~ret9#1;havoc main_#t~ret9#1; {1700#false} is VALID [2022-02-20 16:46:51,560 INFO L290 TraceCheckUtils]: 23: Hoare triple {1700#false} assume !false; {1700#false} is VALID [2022-02-20 16:46:51,560 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 16:46:51,560 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:51,560 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:51,560 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [576770214] [2022-02-20 16:46:51,560 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [576770214] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:51,560 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:51,560 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:46:51,560 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019452888] [2022-02-20 16:46:51,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:51,561 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-02-20 16:46:51,561 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:51,561 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:46:51,575 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:51,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:46:51,576 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:51,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:46:51,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:46:51,576 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:46:51,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:51,649 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-02-20 16:46:51,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:46:51,650 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-02-20 16:46:51,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:51,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:46:51,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-02-20 16:46:51,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:46:51,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-02-20 16:46:51,651 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 32 transitions. [2022-02-20 16:46:51,682 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:51,683 INFO L225 Difference]: With dead ends: 30 [2022-02-20 16:46:51,683 INFO L226 Difference]: Without dead ends: 24 [2022-02-20 16:46:51,683 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:46:51,684 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:51,684 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:46:51,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-02-20 16:46:51,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2022-02-20 16:46:51,686 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:51,686 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 16:46:51,686 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 16:46:51,687 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 16:46:51,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:51,688 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-02-20 16:46:51,689 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-02-20 16:46:51,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:51,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:51,689 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Second operand 24 states. [2022-02-20 16:46:51,689 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Second operand 24 states. [2022-02-20 16:46:51,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:51,690 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-02-20 16:46:51,690 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-02-20 16:46:51,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:51,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:51,690 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:51,691 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:51,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 16:46:51,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-02-20 16:46:51,691 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 24 [2022-02-20 16:46:51,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:51,692 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-02-20 16:46:51,692 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:46:51,692 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-02-20 16:46:51,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 16:46:51,692 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:51,692 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:51,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Ended with exit code 0 [2022-02-20 16:46:51,900 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:46:51,901 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:51,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:51,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1550253923, now seen corresponding path program 1 times [2022-02-20 16:46:51,901 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:51,901 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2095305985] [2022-02-20 16:46:51,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:51,902 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:51,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:51,903 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:46:51,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-02-20 16:46:51,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:52,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 16:46:52,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:52,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:52,123 INFO L290 TraceCheckUtils]: 0: Hoare triple {1888#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(20bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {1888#true} is VALID [2022-02-20 16:46:52,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {1888#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret8#1, main_#t~ret9#1, main_~x~0#1, main_~y~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());main_~y~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());assume { :begin_inline_fmin_float } true;fmin_float_#in~x#1, fmin_float_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmin_float_#res#1;havoc fmin_float_#t~ret5#1, fmin_float_#t~ret6#1, fmin_float_#t~ite7#1, fmin_float_~x#1, fmin_float_~y#1;fmin_float_~x#1 := fmin_float_#in~x#1;fmin_float_~y#1 := fmin_float_#in~y#1; {1896#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:52,125 INFO L272 TraceCheckUtils]: 2: Hoare triple {1896#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} call fmin_float_#t~ret5#1 := __fpclassify_float(fmin_float_~x#1); {1888#true} is VALID [2022-02-20 16:46:52,125 INFO L290 TraceCheckUtils]: 3: Hoare triple {1888#true} ~x := #in~x;havoc ~w~0; {1888#true} is VALID [2022-02-20 16:46:52,126 INFO L290 TraceCheckUtils]: 4: Hoare triple {1888#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#gf_u~0.base, ~#gf_u~0.offset, 4bv32);~w~0 := #t~mem4;havoc #t~mem4;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {1888#true} is VALID [2022-02-20 16:46:52,126 INFO L290 TraceCheckUtils]: 5: Hoare triple {1888#true} goto; {1888#true} is VALID [2022-02-20 16:46:52,126 INFO L290 TraceCheckUtils]: 6: Hoare triple {1888#true} assume 0bv32 == ~w~0 || 2147483648bv32 == ~w~0;#res := 2bv32; {1888#true} is VALID [2022-02-20 16:46:52,126 INFO L290 TraceCheckUtils]: 7: Hoare triple {1888#true} assume true; {1888#true} is VALID [2022-02-20 16:46:52,126 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1888#true} {1896#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} #67#return; {1896#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:52,131 INFO L290 TraceCheckUtils]: 9: Hoare triple {1896#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} assume !(0bv32 == fmin_float_#t~ret5#1);havoc fmin_float_#t~ret5#1; {1896#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:52,131 INFO L272 TraceCheckUtils]: 10: Hoare triple {1896#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} call fmin_float_#t~ret6#1 := __fpclassify_float(fmin_float_~y#1); {1888#true} is VALID [2022-02-20 16:46:52,132 INFO L290 TraceCheckUtils]: 11: Hoare triple {1888#true} ~x := #in~x;havoc ~w~0; {1888#true} is VALID [2022-02-20 16:46:52,132 INFO L290 TraceCheckUtils]: 12: Hoare triple {1888#true} call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4bv32);call #t~mem4 := read~intINTTYPE4(~#gf_u~0.base, ~#gf_u~0.offset, 4bv32);~w~0 := #t~mem4;havoc #t~mem4;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; {1888#true} is VALID [2022-02-20 16:46:52,132 INFO L290 TraceCheckUtils]: 13: Hoare triple {1888#true} goto; {1888#true} is VALID [2022-02-20 16:46:52,132 INFO L290 TraceCheckUtils]: 14: Hoare triple {1888#true} assume !(0bv32 == ~w~0 || 2147483648bv32 == ~w~0); {1888#true} is VALID [2022-02-20 16:46:52,132 INFO L290 TraceCheckUtils]: 15: Hoare triple {1888#true} assume !((~bvuge32(~w~0, 8388608bv32) && ~bvule32(~w~0, 2139095039bv32)) || (~bvuge32(~w~0, 2155872256bv32) && ~bvule32(~w~0, 4286578687bv32))); {1888#true} is VALID [2022-02-20 16:46:52,132 INFO L290 TraceCheckUtils]: 16: Hoare triple {1888#true} assume !((~bvuge32(~w~0, 1bv32) && ~bvule32(~w~0, 8388607bv32)) || (~bvuge32(~w~0, 2147483649bv32) && ~bvule32(~w~0, 2155872255bv32))); {1888#true} is VALID [2022-02-20 16:46:52,133 INFO L290 TraceCheckUtils]: 17: Hoare triple {1888#true} assume !(2139095040bv32 == ~w~0 || 4286578688bv32 == ~w~0);#res := 0bv32; {1888#true} is VALID [2022-02-20 16:46:52,133 INFO L290 TraceCheckUtils]: 18: Hoare triple {1888#true} assume true; {1888#true} is VALID [2022-02-20 16:46:52,133 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {1888#true} {1896#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} #69#return; {1896#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:52,134 INFO L290 TraceCheckUtils]: 20: Hoare triple {1896#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} assume 0bv32 == fmin_float_#t~ret6#1;havoc fmin_float_#t~ret6#1;fmin_float_#res#1 := fmin_float_~x#1; {1954#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_float_#res#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:52,136 INFO L290 TraceCheckUtils]: 21: Hoare triple {1954#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_float_#res#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} main_#t~ret8#1 := fmin_float_#res#1;assume { :end_inline_fmin_float } true;main_~res~0#1 := main_#t~ret8#1;havoc main_#t~ret8#1;assume { :begin_inline_isnan_float } true;isnan_float_#in~x#1 := main_~res~0#1;havoc isnan_float_#res#1;havoc isnan_float_~x#1;isnan_float_~x#1 := isnan_float_#in~x#1;isnan_float_#res#1 := (if !~fp.eq~FLOAT(isnan_float_~x#1, isnan_float_~x#1) then 1bv32 else 0bv32); {1958#(= (_ bv1 32) |ULTIMATE.start_isnan_float_#res#1|)} is VALID [2022-02-20 16:46:52,136 INFO L290 TraceCheckUtils]: 22: Hoare triple {1958#(= (_ bv1 32) |ULTIMATE.start_isnan_float_#res#1|)} main_#t~ret9#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true; {1962#(= (_ bv1 32) |ULTIMATE.start_main_#t~ret9#1|)} is VALID [2022-02-20 16:46:52,136 INFO L290 TraceCheckUtils]: 23: Hoare triple {1962#(= (_ bv1 32) |ULTIMATE.start_main_#t~ret9#1|)} assume 0bv32 == main_#t~ret9#1;havoc main_#t~ret9#1; {1889#false} is VALID [2022-02-20 16:46:52,136 INFO L290 TraceCheckUtils]: 24: Hoare triple {1889#false} assume !false; {1889#false} is VALID [2022-02-20 16:46:52,137 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 16:46:52,137 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:52,137 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:52,138 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2095305985] [2022-02-20 16:46:52,138 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2095305985] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:52,138 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:52,138 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 16:46:52,138 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487460965] [2022-02-20 16:46:52,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:52,140 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2022-02-20 16:46:52,141 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:52,141 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:46:52,162 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:52,163 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 16:46:52,163 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:52,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 16:46:52,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 16:46:52,164 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:46:52,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:52,323 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-02-20 16:46:52,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 16:46:52,323 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2022-02-20 16:46:52,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:52,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:46:52,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2022-02-20 16:46:52,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:46:52,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2022-02-20 16:46:52,331 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 24 transitions. [2022-02-20 16:46:52,369 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:52,369 INFO L225 Difference]: With dead ends: 22 [2022-02-20 16:46:52,369 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 16:46:52,370 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:46:52,371 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 1 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:52,371 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 89 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 5 Unchecked, 0.0s Time] [2022-02-20 16:46:52,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 16:46:52,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 16:46:52,372 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:52,372 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:52,372 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:52,372 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:52,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:52,373 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:46:52,373 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:46:52,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:52,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:52,373 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 16:46:52,373 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 16:46:52,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:52,374 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:46:52,374 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:46:52,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:52,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:52,374 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:52,374 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:52,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:52,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 16:46:52,375 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2022-02-20 16:46:52,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:52,375 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 16:46:52,375 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:46:52,375 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:46:52,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:52,377 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:46:52,386 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Ended with exit code 0 [2022-02-20 16:46:52,585 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:46:52,587 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 16:46:52,670 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 16:46:52,670 INFO L858 garLoopResultBuilder]: For program point L60(lines 60 63) no Hoare annotation was computed. [2022-02-20 16:46:52,671 INFO L854 garLoopResultBuilder]: At program point L46(line 46) the Hoare annotation is: (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res#1|) [2022-02-20 16:46:52,671 INFO L858 garLoopResultBuilder]: For program point L42(line 42) no Hoare annotation was computed. [2022-02-20 16:46:52,671 INFO L858 garLoopResultBuilder]: For program point L42-2(line 42) no Hoare annotation was computed. [2022-02-20 16:46:52,671 INFO L854 garLoopResultBuilder]: At program point L42-3(lines 36 43) the Hoare annotation is: (exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_float_#res#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24)))) [2022-02-20 16:46:52,671 INFO L861 garLoopResultBuilder]: At program point L65(lines 48 66) the Hoare annotation is: true [2022-02-20 16:46:52,671 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 16:46:52,671 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 16:46:52,672 INFO L858 garLoopResultBuilder]: For program point L61(line 61) no Hoare annotation was computed. [2022-02-20 16:46:52,672 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 16:46:52,672 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 61) no Hoare annotation was computed. [2022-02-20 16:46:52,672 INFO L854 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: (and (exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24)))) (exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_float_~y#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))) [2022-02-20 16:46:52,672 INFO L858 garLoopResultBuilder]: For program point L39-1(lines 39 40) no Hoare annotation was computed. [2022-02-20 16:46:52,672 INFO L854 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (and (exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24)))) (exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_float_~y#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))) [2022-02-20 16:46:52,672 INFO L858 garLoopResultBuilder]: For program point L37-1(lines 37 38) no Hoare annotation was computed. [2022-02-20 16:46:52,673 INFO L858 garLoopResultBuilder]: For program point __fpclassify_floatFINAL(lines 13 34) no Hoare annotation was computed. [2022-02-20 16:46:52,673 INFO L858 garLoopResultBuilder]: For program point L27(lines 27 33) no Hoare annotation was computed. [2022-02-20 16:46:52,673 INFO L858 garLoopResultBuilder]: For program point L30(lines 30 33) no Hoare annotation was computed. [2022-02-20 16:46:52,673 INFO L858 garLoopResultBuilder]: For program point L24(lines 24 33) no Hoare annotation was computed. [2022-02-20 16:46:52,673 INFO L858 garLoopResultBuilder]: For program point L16-1(lines 16 20) no Hoare annotation was computed. [2022-02-20 16:46:52,673 INFO L861 garLoopResultBuilder]: At program point L16-2(lines 16 20) the Hoare annotation is: true [2022-02-20 16:46:52,673 INFO L858 garLoopResultBuilder]: For program point L16-3(lines 13 34) no Hoare annotation was computed. [2022-02-20 16:46:52,673 INFO L861 garLoopResultBuilder]: At program point __fpclassify_floatENTRY(lines 13 34) the Hoare annotation is: true [2022-02-20 16:46:52,674 INFO L858 garLoopResultBuilder]: For program point __fpclassify_floatEXIT(lines 13 34) no Hoare annotation was computed. [2022-02-20 16:46:52,675 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:52,676 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:46:52,678 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:46:52,678 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:46:52,678 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2022-02-20 16:46:52,678 WARN L170 areAnnotationChecker]: L16-3 has no Hoare annotation [2022-02-20 16:46:52,679 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-02-20 16:46:52,679 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2022-02-20 16:46:52,679 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2022-02-20 16:46:52,679 WARN L170 areAnnotationChecker]: L16-3 has no Hoare annotation [2022-02-20 16:46:52,679 WARN L170 areAnnotationChecker]: L16-3 has no Hoare annotation [2022-02-20 16:46:52,679 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-02-20 16:46:52,679 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-02-20 16:46:52,679 WARN L170 areAnnotationChecker]: __fpclassify_floatFINAL has no Hoare annotation [2022-02-20 16:46:52,679 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-02-20 16:46:52,679 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-02-20 16:46:52,681 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2022-02-20 16:46:52,681 WARN L170 areAnnotationChecker]: __fpclassify_floatEXIT has no Hoare annotation [2022-02-20 16:46:52,681 WARN L170 areAnnotationChecker]: __fpclassify_floatEXIT has no Hoare annotation [2022-02-20 16:46:52,681 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 16:46:52,681 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 16:46:52,682 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2022-02-20 16:46:52,682 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2022-02-20 16:46:52,682 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2022-02-20 16:46:52,682 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-02-20 16:46:52,682 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-02-20 16:46:52,682 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2022-02-20 16:46:52,682 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2022-02-20 16:46:52,682 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-02-20 16:46:52,682 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-02-20 16:46:52,682 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2022-02-20 16:46:52,683 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2022-02-20 16:46:52,683 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:46:52,683 WARN L170 areAnnotationChecker]: L42-2 has no Hoare annotation [2022-02-20 16:46:52,683 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:46:52,683 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 16:46:52,687 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:52,688 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:52,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:46:52 BoogieIcfgContainer [2022-02-20 16:46:52,689 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:46:52,689 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:46:52,689 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:46:52,689 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:46:52,690 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:46" (3/4) ... [2022-02-20 16:46:52,691 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 16:46:52,694 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __fpclassify_float [2022-02-20 16:46:52,696 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2022-02-20 16:46:52,697 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2022-02-20 16:46:52,697 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 16:46:52,697 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 16:46:52,711 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists currentRoundingMode : FloatRoundingMode :: \result == ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) [2022-02-20 16:46:52,711 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: 1bv32 == \result [2022-02-20 16:46:52,716 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 16:46:52,716 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:46:52,716 INFO L158 Benchmark]: Toolchain (without parser) took 6969.69ms. Allocated memory was 54.5MB in the beginning and 98.6MB in the end (delta: 44.0MB). Free memory was 31.7MB in the beginning and 38.6MB in the end (delta: -6.9MB). Peak memory consumption was 36.3MB. Max. memory is 16.1GB. [2022-02-20 16:46:52,717 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 54.5MB. Free memory was 36.2MB in the beginning and 36.2MB in the end (delta: 37.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:52,717 INFO L158 Benchmark]: CACSL2BoogieTranslator took 252.78ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 31.5MB in the beginning and 48.8MB in the end (delta: -17.3MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. [2022-02-20 16:46:52,717 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.83ms. Allocated memory is still 67.1MB. Free memory was 48.8MB in the beginning and 47.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:52,717 INFO L158 Benchmark]: Boogie Preprocessor took 46.55ms. Allocated memory is still 67.1MB. Free memory was 47.1MB in the beginning and 45.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:52,718 INFO L158 Benchmark]: RCFGBuilder took 343.38ms. Allocated memory is still 67.1MB. Free memory was 45.4MB in the beginning and 46.8MB in the end (delta: -1.3MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. [2022-02-20 16:46:52,718 INFO L158 Benchmark]: TraceAbstraction took 6253.58ms. Allocated memory was 67.1MB in the beginning and 98.6MB in the end (delta: 31.5MB). Free memory was 46.1MB in the beginning and 41.2MB in the end (delta: 4.9MB). Peak memory consumption was 36.9MB. Max. memory is 16.1GB. [2022-02-20 16:46:52,718 INFO L158 Benchmark]: Witness Printer took 26.97ms. Allocated memory is still 98.6MB. Free memory was 41.2MB in the beginning and 38.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:52,719 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 54.5MB. Free memory was 36.2MB in the beginning and 36.2MB in the end (delta: 37.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 252.78ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 31.5MB in the beginning and 48.8MB in the end (delta: -17.3MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.83ms. Allocated memory is still 67.1MB. Free memory was 48.8MB in the beginning and 47.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.55ms. Allocated memory is still 67.1MB. Free memory was 47.1MB in the beginning and 45.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 343.38ms. Allocated memory is still 67.1MB. Free memory was 45.4MB in the beginning and 46.8MB in the end (delta: -1.3MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. * TraceAbstraction took 6253.58ms. Allocated memory was 67.1MB in the beginning and 98.6MB in the end (delta: 31.5MB). Free memory was 46.1MB in the beginning and 41.2MB in the end (delta: 4.9MB). Peak memory consumption was 36.9MB. Max. memory is 16.1GB. * Witness Printer took 26.97ms. Allocated memory is still 98.6MB. Free memory was 41.2MB in the beginning and 38.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 61]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.2s, OverallIterations: 11, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 21 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 20 mSDsluCounter, 891 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 34 IncrementalHoareTripleChecker+Unchecked, 583 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 63 IncrementalHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 308 mSDtfsCounter, 63 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 209 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=0, InterpolantAutomatonStates: 48, 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, 11 MinimizatonAttempts, 24 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 11 PreInvPairs, 19 NumberOfFragments, 43 HoareAnnotationTreeSize, 11 FomulaSimplifications, 12 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 16 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 217 NumberOfCodeBlocks, 217 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 206 ConstructedInterpolants, 20 QuantifiedInterpolants, 374 SizeOfPredicates, 32 NumberOfNonLiveVariables, 779 ConjunctsInSsa, 54 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 36/36 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: 1bv32 == \result - InvariantResult [Line: 36]: Loop Invariant [2022-02-20 16:46:52,730 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:46:52,730 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: (\exists currentRoundingMode : FloatRoundingMode :: \result == ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) - InvariantResult [Line: 48]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-02-20 16:46:52,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE