./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_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/double_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 7a8b477e0de82621230934ea5797a52ab61045346694bc3bac8acbd53f389ba3 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:37:06,161 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:37:06,163 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:37:06,194 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:37:06,195 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:37:06,197 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:37:06,200 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:37:06,202 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:37:06,204 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:37:06,208 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:37:06,208 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:37:06,209 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:37:06,210 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:37:06,211 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:37:06,212 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:37:06,214 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:37:06,215 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:37:06,216 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:37:06,217 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:37:06,221 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:37:06,222 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:37:06,223 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:37:06,225 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:37:06,225 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:37:06,230 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:37:06,230 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:37:06,230 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:37:06,232 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:37:06,232 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:37:06,232 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:37:06,233 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:37:06,233 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:37:06,234 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:37:06,235 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:37:06,236 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:37:06,236 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:37:06,237 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:37:06,237 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:37:06,237 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:37:06,238 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:37:06,238 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:37:06,240 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:37:06,265 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:37:06,265 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:37:06,266 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:37:06,266 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:37:06,266 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:37:06,267 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:37:06,267 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:37:06,267 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:37:06,267 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:37:06,267 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:37:06,268 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:37:06,268 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:37:06,268 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:37:06,269 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:37:06,269 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:37:06,269 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:37:06,269 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:37:06,269 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:37:06,269 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:37:06,269 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:37:06,269 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:37:06,270 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:37:06,270 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:37:06,270 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:37:06,270 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:37:06,270 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:37:06,270 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:37:06,271 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:37:06,271 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:37:06,272 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:37:06,272 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:37:06,272 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:37:06,272 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:37:06,272 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 -> 7a8b477e0de82621230934ea5797a52ab61045346694bc3bac8acbd53f389ba3 [2022-02-20 16:37:06,482 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:37:06,510 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:37:06,513 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:37:06,513 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:37:06,514 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:37:06,515 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1230.c [2022-02-20 16:37:06,555 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af7c4f87d/9a8b6c00d7594fcaadc809e8b01da4e3/FLAG45cce3ee3 [2022-02-20 16:37:06,926 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:37:06,928 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1230.c [2022-02-20 16:37:06,933 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af7c4f87d/9a8b6c00d7594fcaadc809e8b01da4e3/FLAG45cce3ee3 [2022-02-20 16:37:06,947 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af7c4f87d/9a8b6c00d7594fcaadc809e8b01da4e3 [2022-02-20 16:37:06,949 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:37:06,950 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:37:06,953 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:37:06,953 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:37:06,956 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:37:06,957 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:37:06" (1/1) ... [2022-02-20 16:37:06,957 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3936790e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:06, skipping insertion in model container [2022-02-20 16:37:06,958 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:37:06" (1/1) ... [2022-02-20 16:37:06,964 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:37:06,975 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:37:07,153 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/double_req_bl_1230.c[1667,1680] [2022-02-20 16:37:07,155 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:37:07,165 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:37:07,194 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/double_req_bl_1230.c[1667,1680] [2022-02-20 16:37:07,196 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:37:07,206 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:37:07,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:07 WrapperNode [2022-02-20 16:37:07,206 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:37:07,207 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:37:07,207 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:37:07,207 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:37:07,212 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:37:07" (1/1) ... [2022-02-20 16:37:07,223 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:37:07" (1/1) ... [2022-02-20 16:37:07,240 INFO L137 Inliner]: procedures = 18, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 50 [2022-02-20 16:37:07,241 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:37:07,241 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:37:07,242 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:37:07,242 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:37:07,247 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:07" (1/1) ... [2022-02-20 16:37:07,247 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:07" (1/1) ... [2022-02-20 16:37:07,251 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:07" (1/1) ... [2022-02-20 16:37:07,251 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:07" (1/1) ... [2022-02-20 16:37:07,263 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:07" (1/1) ... [2022-02-20 16:37:07,266 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:07" (1/1) ... [2022-02-20 16:37:07,267 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:07" (1/1) ... [2022-02-20 16:37:07,273 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:37:07,274 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:37:07,275 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:37:07,275 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:37:07,276 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:07" (1/1) ... [2022-02-20 16:37:07,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:37:07,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:37:07,299 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:37:07,316 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:37:07,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:37:07,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:37:07,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:37:07,332 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2022-02-20 16:37:07,332 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2022-02-20 16:37:07,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-02-20 16:37:07,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:37:07,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:37:07,333 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:37:07,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:37:07,400 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:37:07,402 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:37:07,613 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:37:07,617 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:37:07,617 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 16:37:07,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:37:07 BoogieIcfgContainer [2022-02-20 16:37:07,619 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:37:07,620 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:37:07,620 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:37:07,630 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:37:07,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:37:06" (1/3) ... [2022-02-20 16:37:07,631 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63e4b466 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:37:07, skipping insertion in model container [2022-02-20 16:37:07,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:07" (2/3) ... [2022-02-20 16:37:07,632 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63e4b466 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:37:07, skipping insertion in model container [2022-02-20 16:37:07,632 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:37:07" (3/3) ... [2022-02-20 16:37:07,633 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_1230.c [2022-02-20 16:37:07,636 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:37:07,636 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:37:07,664 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:37:07,672 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:37:07,672 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:37:07,684 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:37:07,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 16:37:07,689 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:37:07,690 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:37:07,690 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:37:07,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:37:07,698 INFO L85 PathProgramCache]: Analyzing trace with hash 525089809, now seen corresponding path program 1 times [2022-02-20 16:37:07,703 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:37:07,704 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129005127] [2022-02-20 16:37:07,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:37:07,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:37:07,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:07,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:37:07,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:07,870 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 ~msw~0;havoc ~lsw~0; {30#true} is VALID [2022-02-20 16:37:07,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#true} assume !true; {31#false} is VALID [2022-02-20 16:37:07,873 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#false} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 2; {31#false} is VALID [2022-02-20 16:37:07,873 INFO L290 TraceCheckUtils]: 3: Hoare triple {31#false} assume true; {31#false} is VALID [2022-02-20 16:37:07,873 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {31#false} {30#true} #69#return; {31#false} is VALID [2022-02-20 16:37:07,874 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(21, 2);call #Ultimate.allocInit(12, 3); {30#true} is VALID [2022-02-20 16:37:07,874 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~ret9#1, main_#t~ret10#1, main_~x~0#1, main_~y~0#1, main_~res~0#1;main_~x~0#1 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0);main_~y~0#1 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0);assume { :begin_inline_fmin_double } true;fmin_double_#in~x#1, fmin_double_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmin_double_#res#1;havoc fmin_double_#t~ret6#1, fmin_double_#t~ret7#1, fmin_double_#t~ite8#1, fmin_double_~x#1, fmin_double_~y#1;fmin_double_~x#1 := fmin_double_#in~x#1;fmin_double_~y#1 := fmin_double_#in~y#1; {30#true} is VALID [2022-02-20 16:37:07,876 INFO L272 TraceCheckUtils]: 2: Hoare triple {30#true} call fmin_double_#t~ret6#1 := __fpclassify_double(fmin_double_~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:37:07,877 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 ~msw~0;havoc ~lsw~0; {30#true} is VALID [2022-02-20 16:37:07,877 INFO L290 TraceCheckUtils]: 4: Hoare triple {30#true} assume !true; {31#false} is VALID [2022-02-20 16:37:07,878 INFO L290 TraceCheckUtils]: 5: Hoare triple {31#false} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 2; {31#false} is VALID [2022-02-20 16:37:07,878 INFO L290 TraceCheckUtils]: 6: Hoare triple {31#false} assume true; {31#false} is VALID [2022-02-20 16:37:07,878 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {31#false} {30#true} #69#return; {31#false} is VALID [2022-02-20 16:37:07,879 INFO L290 TraceCheckUtils]: 8: Hoare triple {31#false} assume -2147483648 <= fmin_double_#t~ret6#1 && fmin_double_#t~ret6#1 <= 2147483647; {31#false} is VALID [2022-02-20 16:37:07,879 INFO L290 TraceCheckUtils]: 9: Hoare triple {31#false} assume 0 == fmin_double_#t~ret6#1;havoc fmin_double_#t~ret6#1;fmin_double_#res#1 := fmin_double_~y#1; {31#false} is VALID [2022-02-20 16:37:07,879 INFO L290 TraceCheckUtils]: 10: Hoare triple {31#false} main_#t~ret9#1 := fmin_double_#res#1;assume { :end_inline_fmin_double } true;main_~res~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;assume { :begin_inline_isnan_double } true;isnan_double_#in~x#1 := main_~res~0#1;havoc isnan_double_#res#1;havoc isnan_double_~x#1;isnan_double_~x#1 := isnan_double_#in~x#1;isnan_double_#res#1 := (if ~someBinaryDOUBLEComparisonOperation(isnan_double_~x#1, isnan_double_~x#1) then 1 else 0); {31#false} is VALID [2022-02-20 16:37:07,879 INFO L290 TraceCheckUtils]: 11: Hoare triple {31#false} main_#t~ret10#1 := isnan_double_#res#1;assume { :end_inline_isnan_double } true;assume -2147483648 <= main_#t~ret10#1 && main_#t~ret10#1 <= 2147483647; {31#false} is VALID [2022-02-20 16:37:07,879 INFO L290 TraceCheckUtils]: 12: Hoare triple {31#false} assume 0 == main_#t~ret10#1;havoc main_#t~ret10#1; {31#false} is VALID [2022-02-20 16:37:07,880 INFO L290 TraceCheckUtils]: 13: Hoare triple {31#false} assume !false; {31#false} is VALID [2022-02-20 16:37:07,880 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:37:07,880 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:37:07,881 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129005127] [2022-02-20 16:37:07,881 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129005127] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:37:07,881 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:37:07,881 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:37:07,883 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924633733] [2022-02-20 16:37:07,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:37:07,887 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:37:07,888 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:37:07,890 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:37:07,911 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:37:07,911 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:37:07,911 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:37:07,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:37:07,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:37:07,933 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:37:08,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:08,034 INFO L93 Difference]: Finished difference Result 51 states and 72 transitions. [2022-02-20 16:37:08,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:37:08,035 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:37:08,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:37:08,037 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:37:08,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2022-02-20 16:37:08,044 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:37:08,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2022-02-20 16:37:08,046 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 72 transitions. [2022-02-20 16:37:08,106 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:37:08,112 INFO L225 Difference]: With dead ends: 51 [2022-02-20 16:37:08,112 INFO L226 Difference]: Without dead ends: 24 [2022-02-20 16:37:08,114 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:37:08,116 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:37:08,117 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:37:08,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-02-20 16:37:08,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-02-20 16:37:08,135 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:37:08,136 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:37:08,137 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:37:08,137 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:37:08,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:08,139 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2022-02-20 16:37:08,139 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2022-02-20 16:37:08,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:08,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:08,140 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:37:08,141 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:37:08,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:08,143 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2022-02-20 16:37:08,143 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2022-02-20 16:37:08,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:08,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:08,143 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:37:08,143 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:37:08,144 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:37:08,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2022-02-20 16:37:08,146 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 14 [2022-02-20 16:37:08,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:37:08,146 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2022-02-20 16:37:08,147 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:37:08,147 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2022-02-20 16:37:08,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 16:37:08,147 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:37:08,148 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:37:08,148 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:37:08,148 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:37:08,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:37:08,149 INFO L85 PathProgramCache]: Analyzing trace with hash -395826406, now seen corresponding path program 1 times [2022-02-20 16:37:08,149 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:37:08,149 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568807436] [2022-02-20 16:37:08,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:37:08,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:37:08,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:08,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:37:08,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:08,237 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 ~msw~0;havoc ~lsw~0; {182#true} is VALID [2022-02-20 16:37:08,238 INFO L290 TraceCheckUtils]: 1: Hoare triple {182#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8);call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8);call #t~mem4 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4);~msw~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4);~lsw~0 := #t~mem5;havoc #t~mem5;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {182#true} is VALID [2022-02-20 16:37:08,238 INFO L290 TraceCheckUtils]: 2: Hoare triple {182#true} goto; {182#true} is VALID [2022-02-20 16:37:08,239 INFO L290 TraceCheckUtils]: 3: Hoare triple {182#true} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 2; {192#(and (<= |__fpclassify_double_#res| 2) (<= 2 |__fpclassify_double_#res|))} is VALID [2022-02-20 16:37:08,239 INFO L290 TraceCheckUtils]: 4: Hoare triple {192#(and (<= |__fpclassify_double_#res| 2) (<= 2 |__fpclassify_double_#res|))} assume true; {192#(and (<= |__fpclassify_double_#res| 2) (<= 2 |__fpclassify_double_#res|))} is VALID [2022-02-20 16:37:08,240 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {192#(and (<= |__fpclassify_double_#res| 2) (<= 2 |__fpclassify_double_#res|))} {182#true} #69#return; {190#(= (+ (- 2) |ULTIMATE.start_fmin_double_#t~ret6#1|) 0)} is VALID [2022-02-20 16:37:08,240 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(21, 2);call #Ultimate.allocInit(12, 3); {182#true} is VALID [2022-02-20 16:37:08,240 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~ret9#1, main_#t~ret10#1, main_~x~0#1, main_~y~0#1, main_~res~0#1;main_~x~0#1 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0);main_~y~0#1 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0);assume { :begin_inline_fmin_double } true;fmin_double_#in~x#1, fmin_double_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmin_double_#res#1;havoc fmin_double_#t~ret6#1, fmin_double_#t~ret7#1, fmin_double_#t~ite8#1, fmin_double_~x#1, fmin_double_~y#1;fmin_double_~x#1 := fmin_double_#in~x#1;fmin_double_~y#1 := fmin_double_#in~y#1; {182#true} is VALID [2022-02-20 16:37:08,241 INFO L272 TraceCheckUtils]: 2: Hoare triple {182#true} call fmin_double_#t~ret6#1 := __fpclassify_double(fmin_double_~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:37:08,241 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 ~msw~0;havoc ~lsw~0; {182#true} is VALID [2022-02-20 16:37:08,242 INFO L290 TraceCheckUtils]: 4: Hoare triple {182#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8);call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8);call #t~mem4 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4);~msw~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4);~lsw~0 := #t~mem5;havoc #t~mem5;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {182#true} is VALID [2022-02-20 16:37:08,242 INFO L290 TraceCheckUtils]: 5: Hoare triple {182#true} goto; {182#true} is VALID [2022-02-20 16:37:08,242 INFO L290 TraceCheckUtils]: 6: Hoare triple {182#true} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 2; {192#(and (<= |__fpclassify_double_#res| 2) (<= 2 |__fpclassify_double_#res|))} is VALID [2022-02-20 16:37:08,243 INFO L290 TraceCheckUtils]: 7: Hoare triple {192#(and (<= |__fpclassify_double_#res| 2) (<= 2 |__fpclassify_double_#res|))} assume true; {192#(and (<= |__fpclassify_double_#res| 2) (<= 2 |__fpclassify_double_#res|))} is VALID [2022-02-20 16:37:08,243 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {192#(and (<= |__fpclassify_double_#res| 2) (<= 2 |__fpclassify_double_#res|))} {182#true} #69#return; {190#(= (+ (- 2) |ULTIMATE.start_fmin_double_#t~ret6#1|) 0)} is VALID [2022-02-20 16:37:08,244 INFO L290 TraceCheckUtils]: 9: Hoare triple {190#(= (+ (- 2) |ULTIMATE.start_fmin_double_#t~ret6#1|) 0)} assume -2147483648 <= fmin_double_#t~ret6#1 && fmin_double_#t~ret6#1 <= 2147483647; {190#(= (+ (- 2) |ULTIMATE.start_fmin_double_#t~ret6#1|) 0)} is VALID [2022-02-20 16:37:08,244 INFO L290 TraceCheckUtils]: 10: Hoare triple {190#(= (+ (- 2) |ULTIMATE.start_fmin_double_#t~ret6#1|) 0)} assume 0 == fmin_double_#t~ret6#1;havoc fmin_double_#t~ret6#1;fmin_double_#res#1 := fmin_double_~y#1; {183#false} is VALID [2022-02-20 16:37:08,245 INFO L290 TraceCheckUtils]: 11: Hoare triple {183#false} main_#t~ret9#1 := fmin_double_#res#1;assume { :end_inline_fmin_double } true;main_~res~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;assume { :begin_inline_isnan_double } true;isnan_double_#in~x#1 := main_~res~0#1;havoc isnan_double_#res#1;havoc isnan_double_~x#1;isnan_double_~x#1 := isnan_double_#in~x#1;isnan_double_#res#1 := (if ~someBinaryDOUBLEComparisonOperation(isnan_double_~x#1, isnan_double_~x#1) then 1 else 0); {183#false} is VALID [2022-02-20 16:37:08,245 INFO L290 TraceCheckUtils]: 12: Hoare triple {183#false} main_#t~ret10#1 := isnan_double_#res#1;assume { :end_inline_isnan_double } true;assume -2147483648 <= main_#t~ret10#1 && main_#t~ret10#1 <= 2147483647; {183#false} is VALID [2022-02-20 16:37:08,245 INFO L290 TraceCheckUtils]: 13: Hoare triple {183#false} assume 0 == main_#t~ret10#1;havoc main_#t~ret10#1; {183#false} is VALID [2022-02-20 16:37:08,245 INFO L290 TraceCheckUtils]: 14: Hoare triple {183#false} assume !false; {183#false} is VALID [2022-02-20 16:37:08,245 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:37:08,246 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:37:08,246 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568807436] [2022-02-20 16:37:08,246 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568807436] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:37:08,246 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:37:08,246 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:37:08,246 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200796753] [2022-02-20 16:37:08,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:37:08,248 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:37:08,248 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:37:08,248 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:37:08,259 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:37:08,259 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:37:08,260 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:37:08,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:37:08,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:37:08,261 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:37:08,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:08,332 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2022-02-20 16:37:08,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:37:08,332 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:37:08,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:37:08,333 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:37:08,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-02-20 16:37:08,334 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:37:08,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-02-20 16:37:08,336 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-02-20 16:37:08,363 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:37:08,365 INFO L225 Difference]: With dead ends: 33 [2022-02-20 16:37:08,365 INFO L226 Difference]: Without dead ends: 28 [2022-02-20 16:37:08,365 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:37:08,366 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:37:08,366 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:37:08,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-02-20 16:37:08,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-02-20 16:37:08,370 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:37:08,370 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:37:08,370 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:37:08,370 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:37:08,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:08,372 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-02-20 16:37:08,372 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-02-20 16:37:08,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:08,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:08,373 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:37:08,373 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:37:08,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:08,375 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-02-20 16:37:08,375 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-02-20 16:37:08,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:08,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:08,376 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:37:08,376 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:37:08,376 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:37:08,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2022-02-20 16:37:08,378 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 15 [2022-02-20 16:37:08,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:37:08,378 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2022-02-20 16:37:08,378 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:37:08,378 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-02-20 16:37:08,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 16:37:08,379 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:37:08,379 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:37:08,379 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:37:08,380 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:37:08,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:37:08,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1214793076, now seen corresponding path program 1 times [2022-02-20 16:37:08,380 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:37:08,381 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517052809] [2022-02-20 16:37:08,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:37:08,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:37:08,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:08,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:37:08,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:08,505 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 ~msw~0;havoc ~lsw~0; {326#true} is VALID [2022-02-20 16:37:08,505 INFO L290 TraceCheckUtils]: 1: Hoare triple {326#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8);call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8);call #t~mem4 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4);~msw~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4);~lsw~0 := #t~mem5;havoc #t~mem5;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {326#true} is VALID [2022-02-20 16:37:08,505 INFO L290 TraceCheckUtils]: 2: Hoare triple {326#true} goto; {326#true} is VALID [2022-02-20 16:37:08,505 INFO L290 TraceCheckUtils]: 3: Hoare triple {326#true} assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); {326#true} is VALID [2022-02-20 16:37:08,506 INFO L290 TraceCheckUtils]: 4: Hoare triple {326#true} assume (~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719);#res := 4; {337#(= |__fpclassify_double_#res| 4)} is VALID [2022-02-20 16:37:08,506 INFO L290 TraceCheckUtils]: 5: Hoare triple {337#(= |__fpclassify_double_#res| 4)} assume true; {337#(= |__fpclassify_double_#res| 4)} is VALID [2022-02-20 16:37:08,507 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {337#(= |__fpclassify_double_#res| 4)} {326#true} #69#return; {335#(= (+ (- 4) |ULTIMATE.start_fmin_double_#t~ret6#1|) 0)} is VALID [2022-02-20 16:37:08,507 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(21, 2);call #Ultimate.allocInit(12, 3); {326#true} is VALID [2022-02-20 16:37:08,508 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~ret9#1, main_#t~ret10#1, main_~x~0#1, main_~y~0#1, main_~res~0#1;main_~x~0#1 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0);main_~y~0#1 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0);assume { :begin_inline_fmin_double } true;fmin_double_#in~x#1, fmin_double_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmin_double_#res#1;havoc fmin_double_#t~ret6#1, fmin_double_#t~ret7#1, fmin_double_#t~ite8#1, fmin_double_~x#1, fmin_double_~y#1;fmin_double_~x#1 := fmin_double_#in~x#1;fmin_double_~y#1 := fmin_double_#in~y#1; {326#true} is VALID [2022-02-20 16:37:08,508 INFO L272 TraceCheckUtils]: 2: Hoare triple {326#true} call fmin_double_#t~ret6#1 := __fpclassify_double(fmin_double_~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:37:08,509 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 ~msw~0;havoc ~lsw~0; {326#true} is VALID [2022-02-20 16:37:08,509 INFO L290 TraceCheckUtils]: 4: Hoare triple {326#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8);call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8);call #t~mem4 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4);~msw~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4);~lsw~0 := #t~mem5;havoc #t~mem5;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {326#true} is VALID [2022-02-20 16:37:08,509 INFO L290 TraceCheckUtils]: 5: Hoare triple {326#true} goto; {326#true} is VALID [2022-02-20 16:37:08,509 INFO L290 TraceCheckUtils]: 6: Hoare triple {326#true} assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); {326#true} is VALID [2022-02-20 16:37:08,510 INFO L290 TraceCheckUtils]: 7: Hoare triple {326#true} assume (~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719);#res := 4; {337#(= |__fpclassify_double_#res| 4)} is VALID [2022-02-20 16:37:08,510 INFO L290 TraceCheckUtils]: 8: Hoare triple {337#(= |__fpclassify_double_#res| 4)} assume true; {337#(= |__fpclassify_double_#res| 4)} is VALID [2022-02-20 16:37:08,511 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {337#(= |__fpclassify_double_#res| 4)} {326#true} #69#return; {335#(= (+ (- 4) |ULTIMATE.start_fmin_double_#t~ret6#1|) 0)} is VALID [2022-02-20 16:37:08,511 INFO L290 TraceCheckUtils]: 10: Hoare triple {335#(= (+ (- 4) |ULTIMATE.start_fmin_double_#t~ret6#1|) 0)} assume -2147483648 <= fmin_double_#t~ret6#1 && fmin_double_#t~ret6#1 <= 2147483647; {335#(= (+ (- 4) |ULTIMATE.start_fmin_double_#t~ret6#1|) 0)} is VALID [2022-02-20 16:37:08,512 INFO L290 TraceCheckUtils]: 11: Hoare triple {335#(= (+ (- 4) |ULTIMATE.start_fmin_double_#t~ret6#1|) 0)} assume 0 == fmin_double_#t~ret6#1;havoc fmin_double_#t~ret6#1;fmin_double_#res#1 := fmin_double_~y#1; {327#false} is VALID [2022-02-20 16:37:08,512 INFO L290 TraceCheckUtils]: 12: Hoare triple {327#false} main_#t~ret9#1 := fmin_double_#res#1;assume { :end_inline_fmin_double } true;main_~res~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;assume { :begin_inline_isnan_double } true;isnan_double_#in~x#1 := main_~res~0#1;havoc isnan_double_#res#1;havoc isnan_double_~x#1;isnan_double_~x#1 := isnan_double_#in~x#1;isnan_double_#res#1 := (if ~someBinaryDOUBLEComparisonOperation(isnan_double_~x#1, isnan_double_~x#1) then 1 else 0); {327#false} is VALID [2022-02-20 16:37:08,512 INFO L290 TraceCheckUtils]: 13: Hoare triple {327#false} main_#t~ret10#1 := isnan_double_#res#1;assume { :end_inline_isnan_double } true;assume -2147483648 <= main_#t~ret10#1 && main_#t~ret10#1 <= 2147483647; {327#false} is VALID [2022-02-20 16:37:08,512 INFO L290 TraceCheckUtils]: 14: Hoare triple {327#false} assume 0 == main_#t~ret10#1;havoc main_#t~ret10#1; {327#false} is VALID [2022-02-20 16:37:08,512 INFO L290 TraceCheckUtils]: 15: Hoare triple {327#false} assume !false; {327#false} is VALID [2022-02-20 16:37:08,513 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:37:08,513 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:37:08,513 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517052809] [2022-02-20 16:37:08,513 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517052809] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:37:08,513 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:37:08,513 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:37:08,514 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054552761] [2022-02-20 16:37:08,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:37:08,514 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:37:08,514 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:37:08,515 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:37:08,526 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:37:08,526 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:37:08,526 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:37:08,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:37:08,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:37:08,530 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:37:08,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:08,629 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-02-20 16:37:08,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:37:08,629 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:37:08,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:37:08,630 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:37:08,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-02-20 16:37:08,631 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:37:08,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-02-20 16:37:08,632 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-02-20 16:37:08,661 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:37:08,662 INFO L225 Difference]: With dead ends: 37 [2022-02-20 16:37:08,662 INFO L226 Difference]: Without dead ends: 32 [2022-02-20 16:37:08,662 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:37:08,663 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:37:08,664 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:37:08,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-02-20 16:37:08,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2022-02-20 16:37:08,667 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:37:08,667 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:37:08,667 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:37:08,668 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:37:08,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:08,669 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-02-20 16:37:08,670 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-02-20 16:37:08,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:08,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:08,670 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:37:08,671 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:37:08,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:08,672 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-02-20 16:37:08,672 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-02-20 16:37:08,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:08,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:08,673 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:37:08,673 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:37:08,673 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:37:08,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2022-02-20 16:37:08,675 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 16 [2022-02-20 16:37:08,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:37:08,675 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2022-02-20 16:37:08,675 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:37:08,675 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-02-20 16:37:08,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 16:37:08,676 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:37:08,676 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:37:08,676 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 16:37:08,676 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:37:08,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:37:08,677 INFO L85 PathProgramCache]: Analyzing trace with hash 964506206, now seen corresponding path program 1 times [2022-02-20 16:37:08,677 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:37:08,677 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579142933] [2022-02-20 16:37:08,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:37:08,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:37:08,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:08,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:37:08,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:08,737 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 ~msw~0;havoc ~lsw~0; {483#true} is VALID [2022-02-20 16:37:08,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {483#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8);call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8);call #t~mem4 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4);~msw~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4);~lsw~0 := #t~mem5;havoc #t~mem5;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {483#true} is VALID [2022-02-20 16:37:08,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {483#true} goto; {483#true} is VALID [2022-02-20 16:37:08,738 INFO L290 TraceCheckUtils]: 3: Hoare triple {483#true} assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); {483#true} is VALID [2022-02-20 16:37:08,738 INFO L290 TraceCheckUtils]: 4: Hoare triple {483#true} assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); {483#true} is VALID [2022-02-20 16:37:08,739 INFO L290 TraceCheckUtils]: 5: Hoare triple {483#true} assume ~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223);#res := 3; {495#(and (<= |__fpclassify_double_#res| 3) (<= 3 |__fpclassify_double_#res|))} is VALID [2022-02-20 16:37:08,739 INFO L290 TraceCheckUtils]: 6: Hoare triple {495#(and (<= |__fpclassify_double_#res| 3) (<= 3 |__fpclassify_double_#res|))} assume true; {495#(and (<= |__fpclassify_double_#res| 3) (<= 3 |__fpclassify_double_#res|))} is VALID [2022-02-20 16:37:08,740 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {495#(and (<= |__fpclassify_double_#res| 3) (<= 3 |__fpclassify_double_#res|))} {483#true} #69#return; {493#(= (+ (- 3) |ULTIMATE.start_fmin_double_#t~ret6#1|) 0)} is VALID [2022-02-20 16:37:08,740 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(21, 2);call #Ultimate.allocInit(12, 3); {483#true} is VALID [2022-02-20 16:37:08,740 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~ret9#1, main_#t~ret10#1, main_~x~0#1, main_~y~0#1, main_~res~0#1;main_~x~0#1 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0);main_~y~0#1 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0);assume { :begin_inline_fmin_double } true;fmin_double_#in~x#1, fmin_double_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmin_double_#res#1;havoc fmin_double_#t~ret6#1, fmin_double_#t~ret7#1, fmin_double_#t~ite8#1, fmin_double_~x#1, fmin_double_~y#1;fmin_double_~x#1 := fmin_double_#in~x#1;fmin_double_~y#1 := fmin_double_#in~y#1; {483#true} is VALID [2022-02-20 16:37:08,741 INFO L272 TraceCheckUtils]: 2: Hoare triple {483#true} call fmin_double_#t~ret6#1 := __fpclassify_double(fmin_double_~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:37:08,741 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 ~msw~0;havoc ~lsw~0; {483#true} is VALID [2022-02-20 16:37:08,741 INFO L290 TraceCheckUtils]: 4: Hoare triple {483#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8);call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8);call #t~mem4 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4);~msw~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4);~lsw~0 := #t~mem5;havoc #t~mem5;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {483#true} is VALID [2022-02-20 16:37:08,742 INFO L290 TraceCheckUtils]: 5: Hoare triple {483#true} goto; {483#true} is VALID [2022-02-20 16:37:08,742 INFO L290 TraceCheckUtils]: 6: Hoare triple {483#true} assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); {483#true} is VALID [2022-02-20 16:37:08,742 INFO L290 TraceCheckUtils]: 7: Hoare triple {483#true} assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); {483#true} is VALID [2022-02-20 16:37:08,743 INFO L290 TraceCheckUtils]: 8: Hoare triple {483#true} assume ~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223);#res := 3; {495#(and (<= |__fpclassify_double_#res| 3) (<= 3 |__fpclassify_double_#res|))} is VALID [2022-02-20 16:37:08,743 INFO L290 TraceCheckUtils]: 9: Hoare triple {495#(and (<= |__fpclassify_double_#res| 3) (<= 3 |__fpclassify_double_#res|))} assume true; {495#(and (<= |__fpclassify_double_#res| 3) (<= 3 |__fpclassify_double_#res|))} is VALID [2022-02-20 16:37:08,744 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {495#(and (<= |__fpclassify_double_#res| 3) (<= 3 |__fpclassify_double_#res|))} {483#true} #69#return; {493#(= (+ (- 3) |ULTIMATE.start_fmin_double_#t~ret6#1|) 0)} is VALID [2022-02-20 16:37:08,744 INFO L290 TraceCheckUtils]: 11: Hoare triple {493#(= (+ (- 3) |ULTIMATE.start_fmin_double_#t~ret6#1|) 0)} assume -2147483648 <= fmin_double_#t~ret6#1 && fmin_double_#t~ret6#1 <= 2147483647; {493#(= (+ (- 3) |ULTIMATE.start_fmin_double_#t~ret6#1|) 0)} is VALID [2022-02-20 16:37:08,745 INFO L290 TraceCheckUtils]: 12: Hoare triple {493#(= (+ (- 3) |ULTIMATE.start_fmin_double_#t~ret6#1|) 0)} assume 0 == fmin_double_#t~ret6#1;havoc fmin_double_#t~ret6#1;fmin_double_#res#1 := fmin_double_~y#1; {484#false} is VALID [2022-02-20 16:37:08,745 INFO L290 TraceCheckUtils]: 13: Hoare triple {484#false} main_#t~ret9#1 := fmin_double_#res#1;assume { :end_inline_fmin_double } true;main_~res~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;assume { :begin_inline_isnan_double } true;isnan_double_#in~x#1 := main_~res~0#1;havoc isnan_double_#res#1;havoc isnan_double_~x#1;isnan_double_~x#1 := isnan_double_#in~x#1;isnan_double_#res#1 := (if ~someBinaryDOUBLEComparisonOperation(isnan_double_~x#1, isnan_double_~x#1) then 1 else 0); {484#false} is VALID [2022-02-20 16:37:08,745 INFO L290 TraceCheckUtils]: 14: Hoare triple {484#false} main_#t~ret10#1 := isnan_double_#res#1;assume { :end_inline_isnan_double } true;assume -2147483648 <= main_#t~ret10#1 && main_#t~ret10#1 <= 2147483647; {484#false} is VALID [2022-02-20 16:37:08,745 INFO L290 TraceCheckUtils]: 15: Hoare triple {484#false} assume 0 == main_#t~ret10#1;havoc main_#t~ret10#1; {484#false} is VALID [2022-02-20 16:37:08,745 INFO L290 TraceCheckUtils]: 16: Hoare triple {484#false} assume !false; {484#false} is VALID [2022-02-20 16:37:08,746 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:37:08,746 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:37:08,746 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579142933] [2022-02-20 16:37:08,746 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579142933] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:37:08,746 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:37:08,746 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:37:08,747 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855438838] [2022-02-20 16:37:08,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:37:08,747 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:37:08,747 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:37:08,748 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:37:08,759 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:37:08,759 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:37:08,759 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:37:08,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:37:08,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:37:08,760 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:37:08,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:08,839 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-02-20 16:37:08,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:37:08,839 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:37:08,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:37:08,840 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:37:08,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-02-20 16:37:08,841 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:37:08,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-02-20 16:37:08,842 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-02-20 16:37:08,873 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:37:08,874 INFO L225 Difference]: With dead ends: 37 [2022-02-20 16:37:08,874 INFO L226 Difference]: Without dead ends: 32 [2022-02-20 16:37:08,875 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:37:08,876 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:37:08,876 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:37:08,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-02-20 16:37:08,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2022-02-20 16:37:08,879 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:37:08,879 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:37:08,879 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:37:08,879 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:37:08,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:08,881 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-02-20 16:37:08,881 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-02-20 16:37:08,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:08,881 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:08,882 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:37:08,882 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:37:08,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:08,884 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-02-20 16:37:08,884 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-02-20 16:37:08,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:08,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:08,884 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:37:08,884 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:37:08,885 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:37:08,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2022-02-20 16:37:08,886 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 17 [2022-02-20 16:37:08,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:37:08,886 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2022-02-20 16:37:08,887 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:37:08,887 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-02-20 16:37:08,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 16:37:08,887 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:37:08,887 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:37:08,888 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 16:37:08,888 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:37:08,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:37:08,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1139302728, now seen corresponding path program 1 times [2022-02-20 16:37:08,889 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:37:08,889 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388338994] [2022-02-20 16:37:08,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:37:08,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:37:08,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:08,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:37:08,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:08,967 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 ~msw~0;havoc ~lsw~0; {641#true} is VALID [2022-02-20 16:37:08,967 INFO L290 TraceCheckUtils]: 1: Hoare triple {641#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8);call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8);call #t~mem4 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4);~msw~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4);~lsw~0 := #t~mem5;havoc #t~mem5;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {641#true} is VALID [2022-02-20 16:37:08,968 INFO L290 TraceCheckUtils]: 2: Hoare triple {641#true} goto; {641#true} is VALID [2022-02-20 16:37:08,968 INFO L290 TraceCheckUtils]: 3: Hoare triple {641#true} assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); {641#true} is VALID [2022-02-20 16:37:08,968 INFO L290 TraceCheckUtils]: 4: Hoare triple {641#true} assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); {641#true} is VALID [2022-02-20 16:37:08,968 INFO L290 TraceCheckUtils]: 5: Hoare triple {641#true} assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); {641#true} is VALID [2022-02-20 16:37:08,969 INFO L290 TraceCheckUtils]: 6: Hoare triple {641#true} assume (2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 1; {654#(and (<= |__fpclassify_double_#res| 1) (<= 1 |__fpclassify_double_#res|))} is VALID [2022-02-20 16:37:08,969 INFO L290 TraceCheckUtils]: 7: Hoare triple {654#(and (<= |__fpclassify_double_#res| 1) (<= 1 |__fpclassify_double_#res|))} assume true; {654#(and (<= |__fpclassify_double_#res| 1) (<= 1 |__fpclassify_double_#res|))} is VALID [2022-02-20 16:37:08,970 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {654#(and (<= |__fpclassify_double_#res| 1) (<= 1 |__fpclassify_double_#res|))} {641#true} #69#return; {652#(= (+ (- 1) |ULTIMATE.start_fmin_double_#t~ret6#1|) 0)} is VALID [2022-02-20 16:37:08,970 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(21, 2);call #Ultimate.allocInit(12, 3); {641#true} is VALID [2022-02-20 16:37:08,971 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~ret9#1, main_#t~ret10#1, main_~x~0#1, main_~y~0#1, main_~res~0#1;main_~x~0#1 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0);main_~y~0#1 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0);assume { :begin_inline_fmin_double } true;fmin_double_#in~x#1, fmin_double_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmin_double_#res#1;havoc fmin_double_#t~ret6#1, fmin_double_#t~ret7#1, fmin_double_#t~ite8#1, fmin_double_~x#1, fmin_double_~y#1;fmin_double_~x#1 := fmin_double_#in~x#1;fmin_double_~y#1 := fmin_double_#in~y#1; {641#true} is VALID [2022-02-20 16:37:08,973 INFO L272 TraceCheckUtils]: 2: Hoare triple {641#true} call fmin_double_#t~ret6#1 := __fpclassify_double(fmin_double_~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:37:08,973 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 ~msw~0;havoc ~lsw~0; {641#true} is VALID [2022-02-20 16:37:08,973 INFO L290 TraceCheckUtils]: 4: Hoare triple {641#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8);call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8);call #t~mem4 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4);~msw~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4);~lsw~0 := #t~mem5;havoc #t~mem5;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {641#true} is VALID [2022-02-20 16:37:08,974 INFO L290 TraceCheckUtils]: 5: Hoare triple {641#true} goto; {641#true} is VALID [2022-02-20 16:37:08,974 INFO L290 TraceCheckUtils]: 6: Hoare triple {641#true} assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); {641#true} is VALID [2022-02-20 16:37:08,974 INFO L290 TraceCheckUtils]: 7: Hoare triple {641#true} assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); {641#true} is VALID [2022-02-20 16:37:08,974 INFO L290 TraceCheckUtils]: 8: Hoare triple {641#true} assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); {641#true} is VALID [2022-02-20 16:37:08,975 INFO L290 TraceCheckUtils]: 9: Hoare triple {641#true} assume (2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 1; {654#(and (<= |__fpclassify_double_#res| 1) (<= 1 |__fpclassify_double_#res|))} is VALID [2022-02-20 16:37:08,977 INFO L290 TraceCheckUtils]: 10: Hoare triple {654#(and (<= |__fpclassify_double_#res| 1) (<= 1 |__fpclassify_double_#res|))} assume true; {654#(and (<= |__fpclassify_double_#res| 1) (<= 1 |__fpclassify_double_#res|))} is VALID [2022-02-20 16:37:08,978 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {654#(and (<= |__fpclassify_double_#res| 1) (<= 1 |__fpclassify_double_#res|))} {641#true} #69#return; {652#(= (+ (- 1) |ULTIMATE.start_fmin_double_#t~ret6#1|) 0)} is VALID [2022-02-20 16:37:08,979 INFO L290 TraceCheckUtils]: 12: Hoare triple {652#(= (+ (- 1) |ULTIMATE.start_fmin_double_#t~ret6#1|) 0)} assume -2147483648 <= fmin_double_#t~ret6#1 && fmin_double_#t~ret6#1 <= 2147483647; {652#(= (+ (- 1) |ULTIMATE.start_fmin_double_#t~ret6#1|) 0)} is VALID [2022-02-20 16:37:08,979 INFO L290 TraceCheckUtils]: 13: Hoare triple {652#(= (+ (- 1) |ULTIMATE.start_fmin_double_#t~ret6#1|) 0)} assume 0 == fmin_double_#t~ret6#1;havoc fmin_double_#t~ret6#1;fmin_double_#res#1 := fmin_double_~y#1; {642#false} is VALID [2022-02-20 16:37:08,979 INFO L290 TraceCheckUtils]: 14: Hoare triple {642#false} main_#t~ret9#1 := fmin_double_#res#1;assume { :end_inline_fmin_double } true;main_~res~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;assume { :begin_inline_isnan_double } true;isnan_double_#in~x#1 := main_~res~0#1;havoc isnan_double_#res#1;havoc isnan_double_~x#1;isnan_double_~x#1 := isnan_double_#in~x#1;isnan_double_#res#1 := (if ~someBinaryDOUBLEComparisonOperation(isnan_double_~x#1, isnan_double_~x#1) then 1 else 0); {642#false} is VALID [2022-02-20 16:37:08,980 INFO L290 TraceCheckUtils]: 15: Hoare triple {642#false} main_#t~ret10#1 := isnan_double_#res#1;assume { :end_inline_isnan_double } true;assume -2147483648 <= main_#t~ret10#1 && main_#t~ret10#1 <= 2147483647; {642#false} is VALID [2022-02-20 16:37:08,980 INFO L290 TraceCheckUtils]: 16: Hoare triple {642#false} assume 0 == main_#t~ret10#1;havoc main_#t~ret10#1; {642#false} is VALID [2022-02-20 16:37:08,980 INFO L290 TraceCheckUtils]: 17: Hoare triple {642#false} assume !false; {642#false} is VALID [2022-02-20 16:37:08,980 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:37:08,980 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:37:08,981 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388338994] [2022-02-20 16:37:08,981 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388338994] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:37:08,981 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:37:08,981 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:37:08,981 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357353745] [2022-02-20 16:37:08,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:37:08,982 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:37:08,982 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:37:08,982 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:37:08,995 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:37:08,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:37:08,995 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:37:08,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:37:08,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:37:08,996 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:37:09,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:09,079 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-02-20 16:37:09,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:37:09,079 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:37:09,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:37:09,080 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:37:09,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-02-20 16:37:09,081 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:37:09,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-02-20 16:37:09,082 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-02-20 16:37:09,111 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:37:09,112 INFO L225 Difference]: With dead ends: 37 [2022-02-20 16:37:09,112 INFO L226 Difference]: Without dead ends: 32 [2022-02-20 16:37:09,112 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:37:09,113 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:37:09,113 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:37:09,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-02-20 16:37:09,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2022-02-20 16:37:09,115 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:37:09,116 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:37:09,116 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:37:09,116 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:37:09,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:09,118 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-02-20 16:37:09,118 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-02-20 16:37:09,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:09,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:09,118 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:37:09,119 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:37:09,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:09,120 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-02-20 16:37:09,120 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-02-20 16:37:09,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:09,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:09,121 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:37:09,121 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:37:09,121 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:37:09,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2022-02-20 16:37:09,122 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 18 [2022-02-20 16:37:09,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:37:09,122 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2022-02-20 16:37:09,123 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:37:09,123 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-02-20 16:37:09,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 16:37:09,123 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:37:09,123 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:37:09,124 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 16:37:09,124 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:37:09,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:37:09,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1348210105, now seen corresponding path program 1 times [2022-02-20 16:37:09,124 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:37:09,125 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798328454] [2022-02-20 16:37:09,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:37:09,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:37:09,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:37:09,141 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:37:09,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:37:09,160 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:37:09,160 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:37:09,160 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:37:09,162 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 16:37:09,163 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-02-20 16:37:09,165 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:37:09,172 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call #t~ret6 := __fpclassify_double(~x); [2022-02-20 16:37:09,172 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:37:09,175 INFO L158 Benchmark]: Toolchain (without parser) took 2224.28ms. Allocated memory was 104.9MB in the beginning and 130.0MB in the end (delta: 25.2MB). Free memory was 68.0MB in the beginning and 88.9MB in the end (delta: -20.9MB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. [2022-02-20 16:37:09,175 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 104.9MB. Free memory was 85.3MB in the beginning and 85.2MB in the end (delta: 78.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:37:09,175 INFO L158 Benchmark]: CACSL2BoogieTranslator took 253.64ms. Allocated memory is still 104.9MB. Free memory was 67.8MB in the beginning and 80.6MB in the end (delta: -12.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 16:37:09,175 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.69ms. Allocated memory is still 104.9MB. Free memory was 80.6MB in the beginning and 79.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:37:09,176 INFO L158 Benchmark]: Boogie Preprocessor took 31.65ms. Allocated memory is still 104.9MB. Free memory was 79.0MB in the beginning and 77.7MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:37:09,176 INFO L158 Benchmark]: RCFGBuilder took 345.04ms. Allocated memory is still 104.9MB. Free memory was 77.7MB in the beginning and 64.3MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 16:37:09,176 INFO L158 Benchmark]: TraceAbstraction took 1554.47ms. Allocated memory was 104.9MB in the beginning and 130.0MB in the end (delta: 25.2MB). Free memory was 63.6MB in the beginning and 88.9MB in the end (delta: -25.3MB). Peak memory consumption was 2.8MB. Max. memory is 16.1GB. [2022-02-20 16:37:09,177 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 104.9MB. Free memory was 85.3MB in the beginning and 85.2MB in the end (delta: 78.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 253.64ms. Allocated memory is still 104.9MB. Free memory was 67.8MB in the beginning and 80.6MB in the end (delta: -12.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.69ms. Allocated memory is still 104.9MB. Free memory was 80.6MB in the beginning and 79.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.65ms. Allocated memory is still 104.9MB. Free memory was 79.0MB in the beginning and 77.7MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 345.04ms. Allocated memory is still 104.9MB. Free memory was 77.7MB in the beginning and 64.3MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1554.47ms. Allocated memory was 104.9MB in the beginning and 130.0MB in the end (delta: 25.2MB). Free memory was 63.6MB in the beginning and 88.9MB in the end (delta: -25.3MB). Peak memory consumption was 2.8MB. 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:37:09,201 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/double_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 7a8b477e0de82621230934ea5797a52ab61045346694bc3bac8acbd53f389ba3 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:37:11,273 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:37:11,275 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:37:11,308 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:37:11,309 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:37:11,312 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:37:11,313 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:37:11,316 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:37:11,318 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:37:11,321 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:37:11,322 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:37:11,325 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:37:11,325 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:37:11,331 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:37:11,332 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:37:11,334 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:37:11,335 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:37:11,336 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:37:11,337 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:37:11,341 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:37:11,342 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:37:11,343 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:37:11,344 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:37:11,345 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:37:11,350 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:37:11,350 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:37:11,350 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:37:11,351 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:37:11,352 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:37:11,352 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:37:11,352 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:37:11,353 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:37:11,354 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:37:11,355 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:37:11,355 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:37:11,356 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:37:11,356 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:37:11,356 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:37:11,356 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:37:11,358 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:37:11,358 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:37:11,361 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:37:11,388 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:37:11,388 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:37:11,389 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:37:11,389 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:37:11,390 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:37:11,390 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:37:11,391 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:37:11,391 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:37:11,391 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:37:11,391 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:37:11,392 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:37:11,392 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:37:11,392 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:37:11,393 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:37:11,393 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:37:11,393 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:37:11,393 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:37:11,393 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:37:11,393 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:37:11,393 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:37:11,394 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:37:11,394 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:37:11,394 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:37:11,394 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:37:11,394 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:37:11,394 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:37:11,395 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:37:11,395 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:37:11,395 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:37:11,395 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:37:11,395 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:37:11,395 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:37:11,396 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:37:11,396 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:37:11,396 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:37:11,396 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:37:11,396 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 -> 7a8b477e0de82621230934ea5797a52ab61045346694bc3bac8acbd53f389ba3 [2022-02-20 16:37:11,634 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:37:11,653 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:37:11,655 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:37:11,656 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:37:11,656 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:37:11,657 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1230.c [2022-02-20 16:37:11,709 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2fc18cb4/c72ac87a4fd34059bab3b0a2cc4391c1/FLAG3fe5b0860 [2022-02-20 16:37:12,111 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:37:12,111 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1230.c [2022-02-20 16:37:12,116 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2fc18cb4/c72ac87a4fd34059bab3b0a2cc4391c1/FLAG3fe5b0860 [2022-02-20 16:37:12,127 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2fc18cb4/c72ac87a4fd34059bab3b0a2cc4391c1 [2022-02-20 16:37:12,129 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:37:12,131 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:37:12,133 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:37:12,133 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:37:12,136 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:37:12,140 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:37:12" (1/1) ... [2022-02-20 16:37:12,141 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9a343c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:12, skipping insertion in model container [2022-02-20 16:37:12,141 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:37:12" (1/1) ... [2022-02-20 16:37:12,146 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:37:12,156 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:37:12,291 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/double_req_bl_1230.c[1667,1680] [2022-02-20 16:37:12,294 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:37:12,329 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:37:12,373 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/double_req_bl_1230.c[1667,1680] [2022-02-20 16:37:12,374 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:37:12,405 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:37:12,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:12 WrapperNode [2022-02-20 16:37:12,406 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:37:12,407 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:37:12,407 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:37:12,407 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:37:12,411 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:37:12" (1/1) ... [2022-02-20 16:37:12,439 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:37:12" (1/1) ... [2022-02-20 16:37:12,472 INFO L137 Inliner]: procedures = 21, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 48 [2022-02-20 16:37:12,473 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:37:12,473 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:37:12,474 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:37:12,474 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:37:12,479 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:12" (1/1) ... [2022-02-20 16:37:12,479 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:12" (1/1) ... [2022-02-20 16:37:12,482 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:12" (1/1) ... [2022-02-20 16:37:12,483 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:12" (1/1) ... [2022-02-20 16:37:12,493 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:12" (1/1) ... [2022-02-20 16:37:12,500 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:12" (1/1) ... [2022-02-20 16:37:12,516 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:12" (1/1) ... [2022-02-20 16:37:12,521 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:37:12,525 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:37:12,525 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:37:12,525 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:37:12,526 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:12" (1/1) ... [2022-02-20 16:37:12,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:37:12,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:37:12,562 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:37:12,580 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:37:12,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:37:12,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2022-02-20 16:37:12,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:37:12,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:37:12,617 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2022-02-20 16:37:12,617 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2022-02-20 16:37:12,617 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 16:37:12,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:37:12,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:37:12,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:37:12,675 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:37:12,676 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:37:12,889 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:37:12,893 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:37:12,893 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 16:37:12,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:37:12 BoogieIcfgContainer [2022-02-20 16:37:12,895 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:37:12,896 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:37:12,896 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:37:12,898 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:37:12,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:37:12" (1/3) ... [2022-02-20 16:37:12,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3811077c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:37:12, skipping insertion in model container [2022-02-20 16:37:12,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:12" (2/3) ... [2022-02-20 16:37:12,899 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3811077c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:37:12, skipping insertion in model container [2022-02-20 16:37:12,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:37:12" (3/3) ... [2022-02-20 16:37:12,899 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_1230.c [2022-02-20 16:37:12,902 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:37:12,915 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:37:12,967 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:37:12,972 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:37:12,972 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:37:12,989 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:37:12,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 16:37:12,994 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:37:12,994 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:37:12,995 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:37:13,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:37:13,004 INFO L85 PathProgramCache]: Analyzing trace with hash 369317884, now seen corresponding path program 1 times [2022-02-20 16:37:13,011 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:37:13,012 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [579186086] [2022-02-20 16:37:13,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:37:13,014 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:37:13,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:37:13,016 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:37:13,032 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:37:13,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:13,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:37:13,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:13,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:37:13,194 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(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {28#true} is VALID [2022-02-20 16:37:13,195 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~ret9#1, main_#t~ret10#1, main_~x~0#1, main_~y~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());main_~y~0#1 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());assume { :begin_inline_fmin_double } true;fmin_double_#in~x#1, fmin_double_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmin_double_#res#1;havoc fmin_double_#t~ret6#1, fmin_double_#t~ret7#1, fmin_double_#t~ite8#1, fmin_double_~x#1, fmin_double_~y#1;fmin_double_~x#1 := fmin_double_#in~x#1;fmin_double_~y#1 := fmin_double_#in~y#1; {28#true} is VALID [2022-02-20 16:37:13,195 INFO L272 TraceCheckUtils]: 2: Hoare triple {28#true} call fmin_double_#t~ret6#1 := __fpclassify_double(fmin_double_~x#1); {28#true} is VALID [2022-02-20 16:37:13,195 INFO L290 TraceCheckUtils]: 3: Hoare triple {28#true} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {28#true} is VALID [2022-02-20 16:37:13,196 INFO L290 TraceCheckUtils]: 4: Hoare triple {28#true} assume !true; {29#false} is VALID [2022-02-20 16:37:13,196 INFO L290 TraceCheckUtils]: 5: Hoare triple {29#false} assume (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0);#res := 2bv32; {29#false} is VALID [2022-02-20 16:37:13,196 INFO L290 TraceCheckUtils]: 6: Hoare triple {29#false} assume true; {29#false} is VALID [2022-02-20 16:37:13,197 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {29#false} {28#true} #67#return; {29#false} is VALID [2022-02-20 16:37:13,197 INFO L290 TraceCheckUtils]: 8: Hoare triple {29#false} assume 0bv32 == fmin_double_#t~ret6#1;havoc fmin_double_#t~ret6#1;fmin_double_#res#1 := fmin_double_~y#1; {29#false} is VALID [2022-02-20 16:37:13,197 INFO L290 TraceCheckUtils]: 9: Hoare triple {29#false} main_#t~ret9#1 := fmin_double_#res#1;assume { :end_inline_fmin_double } true;main_~res~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;assume { :begin_inline_isnan_double } true;isnan_double_#in~x#1 := main_~res~0#1;havoc isnan_double_#res#1;havoc isnan_double_~x#1;isnan_double_~x#1 := isnan_double_#in~x#1;isnan_double_#res#1 := (if !~fp.eq~DOUBLE(isnan_double_~x#1, isnan_double_~x#1) then 1bv32 else 0bv32); {29#false} is VALID [2022-02-20 16:37:13,197 INFO L290 TraceCheckUtils]: 10: Hoare triple {29#false} main_#t~ret10#1 := isnan_double_#res#1;assume { :end_inline_isnan_double } true; {29#false} is VALID [2022-02-20 16:37:13,197 INFO L290 TraceCheckUtils]: 11: Hoare triple {29#false} assume 0bv32 == main_#t~ret10#1;havoc main_#t~ret10#1; {29#false} is VALID [2022-02-20 16:37:13,198 INFO L290 TraceCheckUtils]: 12: Hoare triple {29#false} assume !false; {29#false} is VALID [2022-02-20 16:37:13,198 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:37:13,198 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:37:13,199 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:37:13,199 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [579186086] [2022-02-20 16:37:13,199 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [579186086] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:37:13,200 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:37:13,200 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:37:13,201 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151184808] [2022-02-20 16:37:13,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:37:13,204 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:37:13,205 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:37:13,207 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:37:13,222 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:37:13,222 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:37:13,223 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:37:13,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:37:13,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:37:13,237 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:37:13,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:13,297 INFO L93 Difference]: Finished difference Result 47 states and 68 transitions. [2022-02-20 16:37:13,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:37:13,298 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:37:13,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:37:13,299 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:37:13,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 68 transitions. [2022-02-20 16:37:13,303 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:37:13,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 68 transitions. [2022-02-20 16:37:13,305 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 68 transitions. [2022-02-20 16:37:13,393 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:37:13,399 INFO L225 Difference]: With dead ends: 47 [2022-02-20 16:37:13,399 INFO L226 Difference]: Without dead ends: 22 [2022-02-20 16:37:13,401 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:37:13,403 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:37:13,403 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:37:13,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-02-20 16:37:13,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-02-20 16:37:13,427 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:37:13,428 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:37:13,428 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:37:13,428 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:37:13,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:13,431 INFO L93 Difference]: Finished difference Result 22 states and 29 transitions. [2022-02-20 16:37:13,431 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2022-02-20 16:37:13,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:13,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:13,432 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:37:13,432 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:37:13,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:13,434 INFO L93 Difference]: Finished difference Result 22 states and 29 transitions. [2022-02-20 16:37:13,434 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2022-02-20 16:37:13,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:13,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:13,435 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:37:13,435 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:37:13,435 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:37:13,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2022-02-20 16:37:13,438 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 29 transitions. Word has length 13 [2022-02-20 16:37:13,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:37:13,438 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 29 transitions. [2022-02-20 16:37:13,438 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:37:13,438 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2022-02-20 16:37:13,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 16:37:13,439 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:37:13,439 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:37:13,451 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:37:13,647 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:37:13,648 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:37:13,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:37:13,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1711341929, now seen corresponding path program 1 times [2022-02-20 16:37:13,649 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:37:13,650 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [863890775] [2022-02-20 16:37:13,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:37:13,650 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:37:13,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:37:13,651 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:37:13,653 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:37:13,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:13,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 16:37:13,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:13,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:37:13,775 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(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {200#true} is VALID [2022-02-20 16:37:13,776 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~ret9#1, main_#t~ret10#1, main_~x~0#1, main_~y~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());main_~y~0#1 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());assume { :begin_inline_fmin_double } true;fmin_double_#in~x#1, fmin_double_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmin_double_#res#1;havoc fmin_double_#t~ret6#1, fmin_double_#t~ret7#1, fmin_double_#t~ite8#1, fmin_double_~x#1, fmin_double_~y#1;fmin_double_~x#1 := fmin_double_#in~x#1;fmin_double_~y#1 := fmin_double_#in~y#1; {200#true} is VALID [2022-02-20 16:37:13,776 INFO L272 TraceCheckUtils]: 2: Hoare triple {200#true} call fmin_double_#t~ret6#1 := __fpclassify_double(fmin_double_~x#1); {200#true} is VALID [2022-02-20 16:37:13,776 INFO L290 TraceCheckUtils]: 3: Hoare triple {200#true} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {200#true} is VALID [2022-02-20 16:37:13,776 INFO L290 TraceCheckUtils]: 4: Hoare triple {200#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32);call #t~mem4 := read~intINTTYPE4(~#ew_u~0.base, ~bvadd32(4bv32, ~#ew_u~0.offset), 4bv32);~msw~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~intINTTYPE4(~#ew_u~0.base, ~#ew_u~0.offset, 4bv32);~lsw~0 := #t~mem5;havoc #t~mem5;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {200#true} is VALID [2022-02-20 16:37:13,776 INFO L290 TraceCheckUtils]: 5: Hoare triple {200#true} goto; {200#true} is VALID [2022-02-20 16:37:13,777 INFO L290 TraceCheckUtils]: 6: Hoare triple {200#true} assume (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0);#res := 2bv32; {223#(= (_ bv2 32) |__fpclassify_double_#res|)} is VALID [2022-02-20 16:37:13,777 INFO L290 TraceCheckUtils]: 7: Hoare triple {223#(= (_ bv2 32) |__fpclassify_double_#res|)} assume true; {223#(= (_ bv2 32) |__fpclassify_double_#res|)} is VALID [2022-02-20 16:37:13,778 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {223#(= (_ bv2 32) |__fpclassify_double_#res|)} {200#true} #67#return; {230#(= |ULTIMATE.start_fmin_double_#t~ret6#1| (_ bv2 32))} is VALID [2022-02-20 16:37:13,778 INFO L290 TraceCheckUtils]: 9: Hoare triple {230#(= |ULTIMATE.start_fmin_double_#t~ret6#1| (_ bv2 32))} assume 0bv32 == fmin_double_#t~ret6#1;havoc fmin_double_#t~ret6#1;fmin_double_#res#1 := fmin_double_~y#1; {201#false} is VALID [2022-02-20 16:37:13,779 INFO L290 TraceCheckUtils]: 10: Hoare triple {201#false} main_#t~ret9#1 := fmin_double_#res#1;assume { :end_inline_fmin_double } true;main_~res~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;assume { :begin_inline_isnan_double } true;isnan_double_#in~x#1 := main_~res~0#1;havoc isnan_double_#res#1;havoc isnan_double_~x#1;isnan_double_~x#1 := isnan_double_#in~x#1;isnan_double_#res#1 := (if !~fp.eq~DOUBLE(isnan_double_~x#1, isnan_double_~x#1) then 1bv32 else 0bv32); {201#false} is VALID [2022-02-20 16:37:13,779 INFO L290 TraceCheckUtils]: 11: Hoare triple {201#false} main_#t~ret10#1 := isnan_double_#res#1;assume { :end_inline_isnan_double } true; {201#false} is VALID [2022-02-20 16:37:13,779 INFO L290 TraceCheckUtils]: 12: Hoare triple {201#false} assume 0bv32 == main_#t~ret10#1;havoc main_#t~ret10#1; {201#false} is VALID [2022-02-20 16:37:13,779 INFO L290 TraceCheckUtils]: 13: Hoare triple {201#false} assume !false; {201#false} is VALID [2022-02-20 16:37:13,779 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:37:13,779 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:37:13,780 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:37:13,780 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [863890775] [2022-02-20 16:37:13,780 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [863890775] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:37:13,780 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:37:13,780 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:37:13,781 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138286664] [2022-02-20 16:37:13,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:37:13,782 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:37:13,782 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:37:13,782 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:37:13,795 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:37:13,795 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:37:13,796 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:37:13,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:37:13,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:37:13,797 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:37:13,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:13,920 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2022-02-20 16:37:13,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:37:13,920 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:37:13,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:37:13,921 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:37:13,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-02-20 16:37:13,922 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:37:13,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-02-20 16:37:13,923 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-02-20 16:37:13,959 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:37:13,960 INFO L225 Difference]: With dead ends: 30 [2022-02-20 16:37:13,960 INFO L226 Difference]: Without dead ends: 25 [2022-02-20 16:37:13,961 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:37:13,962 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:37:13,962 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:37:13,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-02-20 16:37:13,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-02-20 16:37:13,965 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:37:13,965 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:37:13,966 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:37:13,966 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:37:13,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:13,968 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2022-02-20 16:37:13,968 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2022-02-20 16:37:13,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:13,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:13,969 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:37:13,969 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:37:13,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:13,971 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2022-02-20 16:37:13,971 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2022-02-20 16:37:13,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:13,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:13,971 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:37:13,972 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:37:13,972 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:37:13,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2022-02-20 16:37:13,973 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 14 [2022-02-20 16:37:13,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:37:13,974 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2022-02-20 16:37:13,974 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:37:13,974 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2022-02-20 16:37:13,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 16:37:13,975 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:37:13,975 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:37:13,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-02-20 16:37:14,182 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:37:14,183 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:37:14,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:37:14,184 INFO L85 PathProgramCache]: Analyzing trace with hash -2061340999, now seen corresponding path program 1 times [2022-02-20 16:37:14,184 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:37:14,184 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [81480725] [2022-02-20 16:37:14,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:37:14,185 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:37:14,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:37:14,186 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:37:14,188 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:37:14,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:14,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 16:37:14,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:14,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:37:14,295 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(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {364#true} is VALID [2022-02-20 16:37:14,296 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~ret9#1, main_#t~ret10#1, main_~x~0#1, main_~y~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());main_~y~0#1 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());assume { :begin_inline_fmin_double } true;fmin_double_#in~x#1, fmin_double_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmin_double_#res#1;havoc fmin_double_#t~ret6#1, fmin_double_#t~ret7#1, fmin_double_#t~ite8#1, fmin_double_~x#1, fmin_double_~y#1;fmin_double_~x#1 := fmin_double_#in~x#1;fmin_double_~y#1 := fmin_double_#in~y#1; {364#true} is VALID [2022-02-20 16:37:14,296 INFO L272 TraceCheckUtils]: 2: Hoare triple {364#true} call fmin_double_#t~ret6#1 := __fpclassify_double(fmin_double_~x#1); {364#true} is VALID [2022-02-20 16:37:14,296 INFO L290 TraceCheckUtils]: 3: Hoare triple {364#true} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {364#true} is VALID [2022-02-20 16:37:14,296 INFO L290 TraceCheckUtils]: 4: Hoare triple {364#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32);call #t~mem4 := read~intINTTYPE4(~#ew_u~0.base, ~bvadd32(4bv32, ~#ew_u~0.offset), 4bv32);~msw~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~intINTTYPE4(~#ew_u~0.base, ~#ew_u~0.offset, 4bv32);~lsw~0 := #t~mem5;havoc #t~mem5;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {364#true} is VALID [2022-02-20 16:37:14,296 INFO L290 TraceCheckUtils]: 5: Hoare triple {364#true} goto; {364#true} is VALID [2022-02-20 16:37:14,297 INFO L290 TraceCheckUtils]: 6: Hoare triple {364#true} assume !((0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0)); {364#true} is VALID [2022-02-20 16:37:14,297 INFO L290 TraceCheckUtils]: 7: Hoare triple {364#true} assume (~bvuge32(~msw~0, 1048576bv32) && ~bvule32(~msw~0, 2146435071bv32)) || (~bvuge32(~msw~0, 2148532224bv32) && ~bvule32(~msw~0, 4293918719bv32));#res := 4bv32; {390#(= (_ bv4 32) |__fpclassify_double_#res|)} is VALID [2022-02-20 16:37:14,298 INFO L290 TraceCheckUtils]: 8: Hoare triple {390#(= (_ bv4 32) |__fpclassify_double_#res|)} assume true; {390#(= (_ bv4 32) |__fpclassify_double_#res|)} is VALID [2022-02-20 16:37:14,298 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {390#(= (_ bv4 32) |__fpclassify_double_#res|)} {364#true} #67#return; {397#(= |ULTIMATE.start_fmin_double_#t~ret6#1| (_ bv4 32))} is VALID [2022-02-20 16:37:14,299 INFO L290 TraceCheckUtils]: 10: Hoare triple {397#(= |ULTIMATE.start_fmin_double_#t~ret6#1| (_ bv4 32))} assume 0bv32 == fmin_double_#t~ret6#1;havoc fmin_double_#t~ret6#1;fmin_double_#res#1 := fmin_double_~y#1; {365#false} is VALID [2022-02-20 16:37:14,299 INFO L290 TraceCheckUtils]: 11: Hoare triple {365#false} main_#t~ret9#1 := fmin_double_#res#1;assume { :end_inline_fmin_double } true;main_~res~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;assume { :begin_inline_isnan_double } true;isnan_double_#in~x#1 := main_~res~0#1;havoc isnan_double_#res#1;havoc isnan_double_~x#1;isnan_double_~x#1 := isnan_double_#in~x#1;isnan_double_#res#1 := (if !~fp.eq~DOUBLE(isnan_double_~x#1, isnan_double_~x#1) then 1bv32 else 0bv32); {365#false} is VALID [2022-02-20 16:37:14,299 INFO L290 TraceCheckUtils]: 12: Hoare triple {365#false} main_#t~ret10#1 := isnan_double_#res#1;assume { :end_inline_isnan_double } true; {365#false} is VALID [2022-02-20 16:37:14,299 INFO L290 TraceCheckUtils]: 13: Hoare triple {365#false} assume 0bv32 == main_#t~ret10#1;havoc main_#t~ret10#1; {365#false} is VALID [2022-02-20 16:37:14,300 INFO L290 TraceCheckUtils]: 14: Hoare triple {365#false} assume !false; {365#false} is VALID [2022-02-20 16:37:14,300 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:37:14,300 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:37:14,300 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:37:14,300 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [81480725] [2022-02-20 16:37:14,300 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [81480725] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:37:14,300 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:37:14,301 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:37:14,301 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586892377] [2022-02-20 16:37:14,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:37:14,301 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:37:14,302 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:37:14,302 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:37:14,315 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:37:14,316 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:37:14,316 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:37:14,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:37:14,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:37:14,317 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:37:14,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:14,418 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2022-02-20 16:37:14,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:37:14,418 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:37:14,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:37:14,418 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:37:14,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-02-20 16:37:14,419 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:37:14,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-02-20 16:37:14,420 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-02-20 16:37:14,454 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:37:14,455 INFO L225 Difference]: With dead ends: 33 [2022-02-20 16:37:14,455 INFO L226 Difference]: Without dead ends: 28 [2022-02-20 16:37:14,455 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:37:14,456 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:37:14,456 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:37:14,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-02-20 16:37:14,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2022-02-20 16:37:14,459 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:37:14,459 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:37:14,460 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:37:14,460 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:37:14,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:14,462 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2022-02-20 16:37:14,462 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-02-20 16:37:14,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:14,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:14,463 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:37:14,463 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:37:14,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:14,464 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2022-02-20 16:37:14,465 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-02-20 16:37:14,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:14,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:14,465 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:37:14,465 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:37:14,466 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:37:14,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2022-02-20 16:37:14,469 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 15 [2022-02-20 16:37:14,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:37:14,470 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2022-02-20 16:37:14,470 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:37:14,470 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2022-02-20 16:37:14,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 16:37:14,471 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:37:14,471 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:37:14,482 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:37:14,682 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:37:14,683 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:37:14,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:37:14,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1645103533, now seen corresponding path program 1 times [2022-02-20 16:37:14,684 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:37:14,684 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [340440816] [2022-02-20 16:37:14,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:37:14,684 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:37:14,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:37:14,686 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:37:14,687 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:37:14,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:14,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 16:37:14,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:14,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:37:14,809 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(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {540#true} is VALID [2022-02-20 16:37:14,810 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~ret9#1, main_#t~ret10#1, main_~x~0#1, main_~y~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());main_~y~0#1 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());assume { :begin_inline_fmin_double } true;fmin_double_#in~x#1, fmin_double_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmin_double_#res#1;havoc fmin_double_#t~ret6#1, fmin_double_#t~ret7#1, fmin_double_#t~ite8#1, fmin_double_~x#1, fmin_double_~y#1;fmin_double_~x#1 := fmin_double_#in~x#1;fmin_double_~y#1 := fmin_double_#in~y#1; {540#true} is VALID [2022-02-20 16:37:14,810 INFO L272 TraceCheckUtils]: 2: Hoare triple {540#true} call fmin_double_#t~ret6#1 := __fpclassify_double(fmin_double_~x#1); {540#true} is VALID [2022-02-20 16:37:14,810 INFO L290 TraceCheckUtils]: 3: Hoare triple {540#true} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {540#true} is VALID [2022-02-20 16:37:14,810 INFO L290 TraceCheckUtils]: 4: Hoare triple {540#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32);call #t~mem4 := read~intINTTYPE4(~#ew_u~0.base, ~bvadd32(4bv32, ~#ew_u~0.offset), 4bv32);~msw~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~intINTTYPE4(~#ew_u~0.base, ~#ew_u~0.offset, 4bv32);~lsw~0 := #t~mem5;havoc #t~mem5;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {540#true} is VALID [2022-02-20 16:37:14,810 INFO L290 TraceCheckUtils]: 5: Hoare triple {540#true} goto; {540#true} is VALID [2022-02-20 16:37:14,810 INFO L290 TraceCheckUtils]: 6: Hoare triple {540#true} assume !((0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0)); {540#true} is VALID [2022-02-20 16:37:14,810 INFO L290 TraceCheckUtils]: 7: Hoare triple {540#true} assume !((~bvuge32(~msw~0, 1048576bv32) && ~bvule32(~msw~0, 2146435071bv32)) || (~bvuge32(~msw~0, 2148532224bv32) && ~bvule32(~msw~0, 4293918719bv32))); {540#true} is VALID [2022-02-20 16:37:14,813 INFO L290 TraceCheckUtils]: 8: Hoare triple {540#true} assume ~bvule32(~msw~0, 1048575bv32) || (~bvuge32(~msw~0, 2147483648bv32) && ~bvule32(~msw~0, 2148532223bv32));#res := 3bv32; {569#(= (_ bv3 32) |__fpclassify_double_#res|)} is VALID [2022-02-20 16:37:14,814 INFO L290 TraceCheckUtils]: 9: Hoare triple {569#(= (_ bv3 32) |__fpclassify_double_#res|)} assume true; {569#(= (_ bv3 32) |__fpclassify_double_#res|)} is VALID [2022-02-20 16:37:14,814 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {569#(= (_ bv3 32) |__fpclassify_double_#res|)} {540#true} #67#return; {576#(= |ULTIMATE.start_fmin_double_#t~ret6#1| (_ bv3 32))} is VALID [2022-02-20 16:37:14,815 INFO L290 TraceCheckUtils]: 11: Hoare triple {576#(= |ULTIMATE.start_fmin_double_#t~ret6#1| (_ bv3 32))} assume 0bv32 == fmin_double_#t~ret6#1;havoc fmin_double_#t~ret6#1;fmin_double_#res#1 := fmin_double_~y#1; {541#false} is VALID [2022-02-20 16:37:14,815 INFO L290 TraceCheckUtils]: 12: Hoare triple {541#false} main_#t~ret9#1 := fmin_double_#res#1;assume { :end_inline_fmin_double } true;main_~res~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;assume { :begin_inline_isnan_double } true;isnan_double_#in~x#1 := main_~res~0#1;havoc isnan_double_#res#1;havoc isnan_double_~x#1;isnan_double_~x#1 := isnan_double_#in~x#1;isnan_double_#res#1 := (if !~fp.eq~DOUBLE(isnan_double_~x#1, isnan_double_~x#1) then 1bv32 else 0bv32); {541#false} is VALID [2022-02-20 16:37:14,816 INFO L290 TraceCheckUtils]: 13: Hoare triple {541#false} main_#t~ret10#1 := isnan_double_#res#1;assume { :end_inline_isnan_double } true; {541#false} is VALID [2022-02-20 16:37:14,816 INFO L290 TraceCheckUtils]: 14: Hoare triple {541#false} assume 0bv32 == main_#t~ret10#1;havoc main_#t~ret10#1; {541#false} is VALID [2022-02-20 16:37:14,816 INFO L290 TraceCheckUtils]: 15: Hoare triple {541#false} assume !false; {541#false} is VALID [2022-02-20 16:37:14,816 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:37:14,816 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:37:14,816 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:37:14,816 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [340440816] [2022-02-20 16:37:14,816 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [340440816] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:37:14,816 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:37:14,816 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:37:14,817 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495251470] [2022-02-20 16:37:14,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:37:14,817 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:37:14,817 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:37:14,817 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:37:14,831 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:37:14,832 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:37:14,832 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:37:14,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:37:14,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:37:14,832 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:37:14,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:14,957 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2022-02-20 16:37:14,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:37:14,957 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:37:14,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:37:14,957 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:37:14,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-02-20 16:37:14,958 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:37:14,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-02-20 16:37:14,959 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-02-20 16:37:15,004 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:37:15,005 INFO L225 Difference]: With dead ends: 33 [2022-02-20 16:37:15,005 INFO L226 Difference]: Without dead ends: 28 [2022-02-20 16:37:15,005 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:37:15,006 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:37:15,006 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:37:15,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-02-20 16:37:15,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2022-02-20 16:37:15,009 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:37:15,009 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:37:15,009 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:37:15,009 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:37:15,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:15,010 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2022-02-20 16:37:15,010 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-02-20 16:37:15,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:15,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:15,011 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:37:15,011 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:37:15,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:15,013 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2022-02-20 16:37:15,013 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-02-20 16:37:15,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:15,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:15,013 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:37:15,013 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:37:15,014 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:37:15,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2022-02-20 16:37:15,015 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 16 [2022-02-20 16:37:15,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:37:15,015 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2022-02-20 16:37:15,015 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:37:15,015 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2022-02-20 16:37:15,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 16:37:15,016 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:37:15,016 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:37:15,031 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:37:15,224 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:37:15,225 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:37:15,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:37:15,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1049630069, now seen corresponding path program 1 times [2022-02-20 16:37:15,225 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:37:15,226 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1253474133] [2022-02-20 16:37:15,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:37:15,226 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:37:15,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:37:15,227 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:37:15,228 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:37:15,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:15,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 16:37:15,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:15,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:37:15,349 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(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {719#true} is VALID [2022-02-20 16:37:15,349 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~ret9#1, main_#t~ret10#1, main_~x~0#1, main_~y~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());main_~y~0#1 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());assume { :begin_inline_fmin_double } true;fmin_double_#in~x#1, fmin_double_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmin_double_#res#1;havoc fmin_double_#t~ret6#1, fmin_double_#t~ret7#1, fmin_double_#t~ite8#1, fmin_double_~x#1, fmin_double_~y#1;fmin_double_~x#1 := fmin_double_#in~x#1;fmin_double_~y#1 := fmin_double_#in~y#1; {719#true} is VALID [2022-02-20 16:37:15,349 INFO L272 TraceCheckUtils]: 2: Hoare triple {719#true} call fmin_double_#t~ret6#1 := __fpclassify_double(fmin_double_~x#1); {719#true} is VALID [2022-02-20 16:37:15,350 INFO L290 TraceCheckUtils]: 3: Hoare triple {719#true} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {719#true} is VALID [2022-02-20 16:37:15,350 INFO L290 TraceCheckUtils]: 4: Hoare triple {719#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32);call #t~mem4 := read~intINTTYPE4(~#ew_u~0.base, ~bvadd32(4bv32, ~#ew_u~0.offset), 4bv32);~msw~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~intINTTYPE4(~#ew_u~0.base, ~#ew_u~0.offset, 4bv32);~lsw~0 := #t~mem5;havoc #t~mem5;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {719#true} is VALID [2022-02-20 16:37:15,350 INFO L290 TraceCheckUtils]: 5: Hoare triple {719#true} goto; {719#true} is VALID [2022-02-20 16:37:15,350 INFO L290 TraceCheckUtils]: 6: Hoare triple {719#true} assume !((0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0)); {719#true} is VALID [2022-02-20 16:37:15,350 INFO L290 TraceCheckUtils]: 7: Hoare triple {719#true} assume !((~bvuge32(~msw~0, 1048576bv32) && ~bvule32(~msw~0, 2146435071bv32)) || (~bvuge32(~msw~0, 2148532224bv32) && ~bvule32(~msw~0, 4293918719bv32))); {719#true} is VALID [2022-02-20 16:37:15,350 INFO L290 TraceCheckUtils]: 8: Hoare triple {719#true} assume !(~bvule32(~msw~0, 1048575bv32) || (~bvuge32(~msw~0, 2147483648bv32) && ~bvule32(~msw~0, 2148532223bv32))); {719#true} is VALID [2022-02-20 16:37:15,351 INFO L290 TraceCheckUtils]: 9: Hoare triple {719#true} assume (2146435072bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (4293918720bv32 == ~msw~0 && 0bv32 == ~lsw~0);#res := 1bv32; {751#(= |__fpclassify_double_#res| (_ bv1 32))} is VALID [2022-02-20 16:37:15,351 INFO L290 TraceCheckUtils]: 10: Hoare triple {751#(= |__fpclassify_double_#res| (_ bv1 32))} assume true; {751#(= |__fpclassify_double_#res| (_ bv1 32))} is VALID [2022-02-20 16:37:15,352 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {751#(= |__fpclassify_double_#res| (_ bv1 32))} {719#true} #67#return; {758#(= |ULTIMATE.start_fmin_double_#t~ret6#1| (_ bv1 32))} is VALID [2022-02-20 16:37:15,352 INFO L290 TraceCheckUtils]: 12: Hoare triple {758#(= |ULTIMATE.start_fmin_double_#t~ret6#1| (_ bv1 32))} assume 0bv32 == fmin_double_#t~ret6#1;havoc fmin_double_#t~ret6#1;fmin_double_#res#1 := fmin_double_~y#1; {720#false} is VALID [2022-02-20 16:37:15,352 INFO L290 TraceCheckUtils]: 13: Hoare triple {720#false} main_#t~ret9#1 := fmin_double_#res#1;assume { :end_inline_fmin_double } true;main_~res~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;assume { :begin_inline_isnan_double } true;isnan_double_#in~x#1 := main_~res~0#1;havoc isnan_double_#res#1;havoc isnan_double_~x#1;isnan_double_~x#1 := isnan_double_#in~x#1;isnan_double_#res#1 := (if !~fp.eq~DOUBLE(isnan_double_~x#1, isnan_double_~x#1) then 1bv32 else 0bv32); {720#false} is VALID [2022-02-20 16:37:15,352 INFO L290 TraceCheckUtils]: 14: Hoare triple {720#false} main_#t~ret10#1 := isnan_double_#res#1;assume { :end_inline_isnan_double } true; {720#false} is VALID [2022-02-20 16:37:15,352 INFO L290 TraceCheckUtils]: 15: Hoare triple {720#false} assume 0bv32 == main_#t~ret10#1;havoc main_#t~ret10#1; {720#false} is VALID [2022-02-20 16:37:15,352 INFO L290 TraceCheckUtils]: 16: Hoare triple {720#false} assume !false; {720#false} is VALID [2022-02-20 16:37:15,353 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:37:15,353 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:37:15,353 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:37:15,353 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1253474133] [2022-02-20 16:37:15,353 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1253474133] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:37:15,353 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:37:15,353 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:37:15,353 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852313627] [2022-02-20 16:37:15,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:37:15,354 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, (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:37:15,354 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:37:15,354 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, (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:37:15,370 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:37:15,370 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:37:15,370 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:37:15,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:37:15,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:37:15,371 INFO L87 Difference]: Start difference. First operand 25 states and 33 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, (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:37:15,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:15,590 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2022-02-20 16:37:15,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:37:15,590 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, (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:37:15,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:37:15,590 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, (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:37:15,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-02-20 16:37:15,591 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, (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:37:15,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-02-20 16:37:15,592 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-02-20 16:37:15,621 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:37:15,622 INFO L225 Difference]: With dead ends: 33 [2022-02-20 16:37:15,622 INFO L226 Difference]: Without dead ends: 28 [2022-02-20 16:37:15,623 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 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:37:15,628 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:37:15,628 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.1s Time] [2022-02-20 16:37:15,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-02-20 16:37:15,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2022-02-20 16:37:15,630 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:37:15,631 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:37:15,631 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:37:15,631 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:37:15,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:15,632 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2022-02-20 16:37:15,632 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-02-20 16:37:15,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:15,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:15,633 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:37:15,633 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:37:15,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:15,634 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2022-02-20 16:37:15,634 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-02-20 16:37:15,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:15,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:15,634 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:37:15,634 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:37:15,635 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:37:15,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2022-02-20 16:37:15,635 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 17 [2022-02-20 16:37:15,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:37:15,636 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2022-02-20 16:37:15,636 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, (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:37:15,636 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2022-02-20 16:37:15,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 16:37:15,636 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:37:15,636 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:37:15,657 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:37:15,836 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:37:15,837 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:37:15,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:37:15,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1502526892, now seen corresponding path program 1 times [2022-02-20 16:37:15,838 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:37:15,838 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [198561548] [2022-02-20 16:37:15,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:37:15,838 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:37:15,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:37:15,839 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:37:15,841 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:37:15,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:15,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 16:37:15,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:15,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:37:16,040 INFO L290 TraceCheckUtils]: 0: Hoare triple {901#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {901#true} is VALID [2022-02-20 16:37:16,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {901#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret9#1, main_#t~ret10#1, main_~x~0#1, main_~y~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());main_~y~0#1 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());assume { :begin_inline_fmin_double } true;fmin_double_#in~x#1, fmin_double_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmin_double_#res#1;havoc fmin_double_#t~ret6#1, fmin_double_#t~ret7#1, fmin_double_#t~ite8#1, fmin_double_~x#1, fmin_double_~y#1;fmin_double_~x#1 := fmin_double_#in~x#1;fmin_double_~y#1 := fmin_double_#in~y#1; {909#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_double_~y#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} is VALID [2022-02-20 16:37:16,042 INFO L272 TraceCheckUtils]: 2: Hoare triple {909#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_double_~y#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} call fmin_double_#t~ret6#1 := __fpclassify_double(fmin_double_~x#1); {901#true} is VALID [2022-02-20 16:37:16,042 INFO L290 TraceCheckUtils]: 3: Hoare triple {901#true} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {901#true} is VALID [2022-02-20 16:37:16,042 INFO L290 TraceCheckUtils]: 4: Hoare triple {901#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32);call #t~mem4 := read~intINTTYPE4(~#ew_u~0.base, ~bvadd32(4bv32, ~#ew_u~0.offset), 4bv32);~msw~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~intINTTYPE4(~#ew_u~0.base, ~#ew_u~0.offset, 4bv32);~lsw~0 := #t~mem5;havoc #t~mem5;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {901#true} is VALID [2022-02-20 16:37:16,042 INFO L290 TraceCheckUtils]: 5: Hoare triple {901#true} goto; {901#true} is VALID [2022-02-20 16:37:16,042 INFO L290 TraceCheckUtils]: 6: Hoare triple {901#true} assume !((0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0)); {901#true} is VALID [2022-02-20 16:37:16,042 INFO L290 TraceCheckUtils]: 7: Hoare triple {901#true} assume !((~bvuge32(~msw~0, 1048576bv32) && ~bvule32(~msw~0, 2146435071bv32)) || (~bvuge32(~msw~0, 2148532224bv32) && ~bvule32(~msw~0, 4293918719bv32))); {901#true} is VALID [2022-02-20 16:37:16,042 INFO L290 TraceCheckUtils]: 8: Hoare triple {901#true} assume !(~bvule32(~msw~0, 1048575bv32) || (~bvuge32(~msw~0, 2147483648bv32) && ~bvule32(~msw~0, 2148532223bv32))); {901#true} is VALID [2022-02-20 16:37:16,042 INFO L290 TraceCheckUtils]: 9: Hoare triple {901#true} assume !((2146435072bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (4293918720bv32 == ~msw~0 && 0bv32 == ~lsw~0));#res := 0bv32; {901#true} is VALID [2022-02-20 16:37:16,042 INFO L290 TraceCheckUtils]: 10: Hoare triple {901#true} assume true; {901#true} is VALID [2022-02-20 16:37:16,043 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {901#true} {909#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_double_~y#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} #67#return; {909#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_double_~y#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} is VALID [2022-02-20 16:37:16,045 INFO L290 TraceCheckUtils]: 12: Hoare triple {909#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_double_~y#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} assume 0bv32 == fmin_double_#t~ret6#1;havoc fmin_double_#t~ret6#1;fmin_double_#res#1 := fmin_double_~y#1; {943#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_double_#res#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} is VALID [2022-02-20 16:37:16,046 INFO L290 TraceCheckUtils]: 13: Hoare triple {943#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_double_#res#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} main_#t~ret9#1 := fmin_double_#res#1;assume { :end_inline_fmin_double } true;main_~res~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;assume { :begin_inline_isnan_double } true;isnan_double_#in~x#1 := main_~res~0#1;havoc isnan_double_#res#1;havoc isnan_double_~x#1;isnan_double_~x#1 := isnan_double_#in~x#1;isnan_double_#res#1 := (if !~fp.eq~DOUBLE(isnan_double_~x#1, isnan_double_~x#1) then 1bv32 else 0bv32); {947#(= (_ bv1 32) |ULTIMATE.start_isnan_double_#res#1|)} is VALID [2022-02-20 16:37:16,047 INFO L290 TraceCheckUtils]: 14: Hoare triple {947#(= (_ bv1 32) |ULTIMATE.start_isnan_double_#res#1|)} main_#t~ret10#1 := isnan_double_#res#1;assume { :end_inline_isnan_double } true; {951#(= |ULTIMATE.start_main_#t~ret10#1| (_ bv1 32))} is VALID [2022-02-20 16:37:16,047 INFO L290 TraceCheckUtils]: 15: Hoare triple {951#(= |ULTIMATE.start_main_#t~ret10#1| (_ bv1 32))} assume 0bv32 == main_#t~ret10#1;havoc main_#t~ret10#1; {902#false} is VALID [2022-02-20 16:37:16,047 INFO L290 TraceCheckUtils]: 16: Hoare triple {902#false} assume !false; {902#false} is VALID [2022-02-20 16:37:16,047 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:37:16,047 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:37:16,047 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:37:16,047 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [198561548] [2022-02-20 16:37:16,048 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [198561548] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:37:16,048 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:37:16,048 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 16:37:16,048 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480325637] [2022-02-20 16:37:16,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:37:16,048 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:37:16,048 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:37:16,048 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:37:16,067 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:37:16,068 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 16:37:16,068 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:37:16,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 16:37:16,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 16:37:16,068 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:37:16,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:16,270 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-02-20 16:37:16,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 16:37:16,271 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:37:16,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:37:16,271 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:37:16,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2022-02-20 16:37:16,277 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:37:16,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2022-02-20 16:37:16,278 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 37 transitions. [2022-02-20 16:37:16,326 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:37:16,327 INFO L225 Difference]: With dead ends: 35 [2022-02-20 16:37:16,327 INFO L226 Difference]: Without dead ends: 30 [2022-02-20 16:37:16,327 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:37:16,328 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 8 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 14 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:37:16,328 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 113 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 14 Unchecked, 0.0s Time] [2022-02-20 16:37:16,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-02-20 16:37:16,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 22. [2022-02-20 16:37:16,330 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:37:16,330 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:37:16,331 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:37:16,331 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:37:16,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:16,332 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-02-20 16:37:16,332 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-02-20 16:37:16,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:16,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:16,333 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:37:16,333 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:37:16,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:16,334 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-02-20 16:37:16,334 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-02-20 16:37:16,334 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:16,334 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:16,334 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:37:16,334 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:37:16,335 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:37:16,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2022-02-20 16:37:16,335 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 17 [2022-02-20 16:37:16,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:37:16,336 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2022-02-20 16:37:16,336 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:37:16,336 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-02-20 16:37:16,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 16:37:16,336 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:37:16,337 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:37:16,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-02-20 16:37:16,544 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:37:16,545 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:37:16,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:37:16,546 INFO L85 PathProgramCache]: Analyzing trace with hash -451389748, now seen corresponding path program 1 times [2022-02-20 16:37:16,546 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:37:16,546 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1867077944] [2022-02-20 16:37:16,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:37:16,546 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:37:16,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:37:16,548 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:37:16,549 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:37:16,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:16,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 16:37:16,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:16,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:37:16,673 INFO L290 TraceCheckUtils]: 0: Hoare triple {1092#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {1092#true} is VALID [2022-02-20 16:37:16,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {1092#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret9#1, main_#t~ret10#1, main_~x~0#1, main_~y~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());main_~y~0#1 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());assume { :begin_inline_fmin_double } true;fmin_double_#in~x#1, fmin_double_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmin_double_#res#1;havoc fmin_double_#t~ret6#1, fmin_double_#t~ret7#1, fmin_double_#t~ite8#1, fmin_double_~x#1, fmin_double_~y#1;fmin_double_~x#1 := fmin_double_#in~x#1;fmin_double_~y#1 := fmin_double_#in~y#1; {1092#true} is VALID [2022-02-20 16:37:16,673 INFO L272 TraceCheckUtils]: 2: Hoare triple {1092#true} call fmin_double_#t~ret6#1 := __fpclassify_double(fmin_double_~x#1); {1092#true} is VALID [2022-02-20 16:37:16,673 INFO L290 TraceCheckUtils]: 3: Hoare triple {1092#true} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {1092#true} is VALID [2022-02-20 16:37:16,674 INFO L290 TraceCheckUtils]: 4: Hoare triple {1092#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32);call #t~mem4 := read~intINTTYPE4(~#ew_u~0.base, ~bvadd32(4bv32, ~#ew_u~0.offset), 4bv32);~msw~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~intINTTYPE4(~#ew_u~0.base, ~#ew_u~0.offset, 4bv32);~lsw~0 := #t~mem5;havoc #t~mem5;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {1092#true} is VALID [2022-02-20 16:37:16,674 INFO L290 TraceCheckUtils]: 5: Hoare triple {1092#true} goto; {1092#true} is VALID [2022-02-20 16:37:16,674 INFO L290 TraceCheckUtils]: 6: Hoare triple {1092#true} assume (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0);#res := 2bv32; {1092#true} is VALID [2022-02-20 16:37:16,674 INFO L290 TraceCheckUtils]: 7: Hoare triple {1092#true} assume true; {1092#true} is VALID [2022-02-20 16:37:16,674 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1092#true} {1092#true} #67#return; {1092#true} is VALID [2022-02-20 16:37:16,674 INFO L290 TraceCheckUtils]: 9: Hoare triple {1092#true} assume !(0bv32 == fmin_double_#t~ret6#1);havoc fmin_double_#t~ret6#1; {1092#true} is VALID [2022-02-20 16:37:16,675 INFO L272 TraceCheckUtils]: 10: Hoare triple {1092#true} call fmin_double_#t~ret7#1 := __fpclassify_double(fmin_double_~y#1); {1092#true} is VALID [2022-02-20 16:37:16,675 INFO L290 TraceCheckUtils]: 11: Hoare triple {1092#true} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {1092#true} is VALID [2022-02-20 16:37:16,675 INFO L290 TraceCheckUtils]: 12: Hoare triple {1092#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32);call #t~mem4 := read~intINTTYPE4(~#ew_u~0.base, ~bvadd32(4bv32, ~#ew_u~0.offset), 4bv32);~msw~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~intINTTYPE4(~#ew_u~0.base, ~#ew_u~0.offset, 4bv32);~lsw~0 := #t~mem5;havoc #t~mem5;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {1092#true} is VALID [2022-02-20 16:37:16,675 INFO L290 TraceCheckUtils]: 13: Hoare triple {1092#true} goto; {1092#true} is VALID [2022-02-20 16:37:16,677 INFO L290 TraceCheckUtils]: 14: Hoare triple {1092#true} assume (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0);#res := 2bv32; {1139#(= (_ bv2 32) |__fpclassify_double_#res|)} is VALID [2022-02-20 16:37:16,678 INFO L290 TraceCheckUtils]: 15: Hoare triple {1139#(= (_ bv2 32) |__fpclassify_double_#res|)} assume true; {1139#(= (_ bv2 32) |__fpclassify_double_#res|)} is VALID [2022-02-20 16:37:16,678 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1139#(= (_ bv2 32) |__fpclassify_double_#res|)} {1092#true} #69#return; {1146#(= |ULTIMATE.start_fmin_double_#t~ret7#1| (_ bv2 32))} is VALID [2022-02-20 16:37:16,679 INFO L290 TraceCheckUtils]: 17: Hoare triple {1146#(= |ULTIMATE.start_fmin_double_#t~ret7#1| (_ bv2 32))} assume 0bv32 == fmin_double_#t~ret7#1;havoc fmin_double_#t~ret7#1;fmin_double_#res#1 := fmin_double_~x#1; {1093#false} is VALID [2022-02-20 16:37:16,679 INFO L290 TraceCheckUtils]: 18: Hoare triple {1093#false} main_#t~ret9#1 := fmin_double_#res#1;assume { :end_inline_fmin_double } true;main_~res~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;assume { :begin_inline_isnan_double } true;isnan_double_#in~x#1 := main_~res~0#1;havoc isnan_double_#res#1;havoc isnan_double_~x#1;isnan_double_~x#1 := isnan_double_#in~x#1;isnan_double_#res#1 := (if !~fp.eq~DOUBLE(isnan_double_~x#1, isnan_double_~x#1) then 1bv32 else 0bv32); {1093#false} is VALID [2022-02-20 16:37:16,679 INFO L290 TraceCheckUtils]: 19: Hoare triple {1093#false} main_#t~ret10#1 := isnan_double_#res#1;assume { :end_inline_isnan_double } true; {1093#false} is VALID [2022-02-20 16:37:16,679 INFO L290 TraceCheckUtils]: 20: Hoare triple {1093#false} assume 0bv32 == main_#t~ret10#1;havoc main_#t~ret10#1; {1093#false} is VALID [2022-02-20 16:37:16,679 INFO L290 TraceCheckUtils]: 21: Hoare triple {1093#false} assume !false; {1093#false} is VALID [2022-02-20 16:37:16,680 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:37:16,680 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:37:16,680 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:37:16,680 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1867077944] [2022-02-20 16:37:16,680 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1867077944] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:37:16,680 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:37:16,680 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:37:16,681 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884336135] [2022-02-20 16:37:16,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:37:16,681 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:37:16,681 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:37:16,682 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:37:16,700 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:37:16,701 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:37:16,701 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:37:16,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:37:16,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:37:16,701 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:37:16,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:16,792 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2022-02-20 16:37:16,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:37:16,792 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:37:16,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:37:16,792 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:37:16,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-02-20 16:37:16,793 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:37:16,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-02-20 16:37:16,794 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 37 transitions. [2022-02-20 16:37:16,824 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:37:16,825 INFO L225 Difference]: With dead ends: 30 [2022-02-20 16:37:16,825 INFO L226 Difference]: Without dead ends: 25 [2022-02-20 16:37:16,825 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:37:16,825 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:37:16,826 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:37:16,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-02-20 16:37:16,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-02-20 16:37:16,828 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:37:16,828 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:37:16,828 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:37:16,828 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:37:16,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:16,829 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2022-02-20 16:37:16,829 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-02-20 16:37:16,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:16,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:16,829 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:37:16,830 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:37:16,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:16,831 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2022-02-20 16:37:16,831 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-02-20 16:37:16,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:16,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:16,831 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:37:16,831 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:37:16,832 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:37:16,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2022-02-20 16:37:16,833 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 22 [2022-02-20 16:37:16,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:37:16,833 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-02-20 16:37:16,833 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:37:16,833 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-02-20 16:37:16,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 16:37:16,834 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:37:16,834 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:37:16,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-02-20 16:37:17,042 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:37:17,043 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:37:17,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:37:17,044 INFO L85 PathProgramCache]: Analyzing trace with hash 753455404, now seen corresponding path program 1 times [2022-02-20 16:37:17,044 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:37:17,044 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [173210280] [2022-02-20 16:37:17,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:37:17,044 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:37:17,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:37:17,045 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:37:17,047 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:37:17,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:17,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 16:37:17,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:17,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:37:17,202 INFO L290 TraceCheckUtils]: 0: Hoare triple {1280#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {1280#true} is VALID [2022-02-20 16:37:17,202 INFO L290 TraceCheckUtils]: 1: Hoare triple {1280#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret9#1, main_#t~ret10#1, main_~x~0#1, main_~y~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());main_~y~0#1 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());assume { :begin_inline_fmin_double } true;fmin_double_#in~x#1, fmin_double_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmin_double_#res#1;havoc fmin_double_#t~ret6#1, fmin_double_#t~ret7#1, fmin_double_#t~ite8#1, fmin_double_~x#1, fmin_double_~y#1;fmin_double_~x#1 := fmin_double_#in~x#1;fmin_double_~y#1 := fmin_double_#in~y#1; {1280#true} is VALID [2022-02-20 16:37:17,202 INFO L272 TraceCheckUtils]: 2: Hoare triple {1280#true} call fmin_double_#t~ret6#1 := __fpclassify_double(fmin_double_~x#1); {1280#true} is VALID [2022-02-20 16:37:17,202 INFO L290 TraceCheckUtils]: 3: Hoare triple {1280#true} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {1280#true} is VALID [2022-02-20 16:37:17,203 INFO L290 TraceCheckUtils]: 4: Hoare triple {1280#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32);call #t~mem4 := read~intINTTYPE4(~#ew_u~0.base, ~bvadd32(4bv32, ~#ew_u~0.offset), 4bv32);~msw~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~intINTTYPE4(~#ew_u~0.base, ~#ew_u~0.offset, 4bv32);~lsw~0 := #t~mem5;havoc #t~mem5;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {1280#true} is VALID [2022-02-20 16:37:17,203 INFO L290 TraceCheckUtils]: 5: Hoare triple {1280#true} goto; {1280#true} is VALID [2022-02-20 16:37:17,203 INFO L290 TraceCheckUtils]: 6: Hoare triple {1280#true} assume (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0);#res := 2bv32; {1280#true} is VALID [2022-02-20 16:37:17,203 INFO L290 TraceCheckUtils]: 7: Hoare triple {1280#true} assume true; {1280#true} is VALID [2022-02-20 16:37:17,203 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1280#true} {1280#true} #67#return; {1280#true} is VALID [2022-02-20 16:37:17,203 INFO L290 TraceCheckUtils]: 9: Hoare triple {1280#true} assume !(0bv32 == fmin_double_#t~ret6#1);havoc fmin_double_#t~ret6#1; {1280#true} is VALID [2022-02-20 16:37:17,203 INFO L272 TraceCheckUtils]: 10: Hoare triple {1280#true} call fmin_double_#t~ret7#1 := __fpclassify_double(fmin_double_~y#1); {1280#true} is VALID [2022-02-20 16:37:17,204 INFO L290 TraceCheckUtils]: 11: Hoare triple {1280#true} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {1280#true} is VALID [2022-02-20 16:37:17,204 INFO L290 TraceCheckUtils]: 12: Hoare triple {1280#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32);call #t~mem4 := read~intINTTYPE4(~#ew_u~0.base, ~bvadd32(4bv32, ~#ew_u~0.offset), 4bv32);~msw~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~intINTTYPE4(~#ew_u~0.base, ~#ew_u~0.offset, 4bv32);~lsw~0 := #t~mem5;havoc #t~mem5;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {1280#true} is VALID [2022-02-20 16:37:17,204 INFO L290 TraceCheckUtils]: 13: Hoare triple {1280#true} goto; {1280#true} is VALID [2022-02-20 16:37:17,204 INFO L290 TraceCheckUtils]: 14: Hoare triple {1280#true} assume !((0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0)); {1280#true} is VALID [2022-02-20 16:37:17,210 INFO L290 TraceCheckUtils]: 15: Hoare triple {1280#true} assume (~bvuge32(~msw~0, 1048576bv32) && ~bvule32(~msw~0, 2146435071bv32)) || (~bvuge32(~msw~0, 2148532224bv32) && ~bvule32(~msw~0, 4293918719bv32));#res := 4bv32; {1330#(= (_ bv4 32) |__fpclassify_double_#res|)} is VALID [2022-02-20 16:37:17,210 INFO L290 TraceCheckUtils]: 16: Hoare triple {1330#(= (_ bv4 32) |__fpclassify_double_#res|)} assume true; {1330#(= (_ bv4 32) |__fpclassify_double_#res|)} is VALID [2022-02-20 16:37:17,211 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1330#(= (_ bv4 32) |__fpclassify_double_#res|)} {1280#true} #69#return; {1337#(= |ULTIMATE.start_fmin_double_#t~ret7#1| (_ bv4 32))} is VALID [2022-02-20 16:37:17,211 INFO L290 TraceCheckUtils]: 18: Hoare triple {1337#(= |ULTIMATE.start_fmin_double_#t~ret7#1| (_ bv4 32))} assume 0bv32 == fmin_double_#t~ret7#1;havoc fmin_double_#t~ret7#1;fmin_double_#res#1 := fmin_double_~x#1; {1281#false} is VALID [2022-02-20 16:37:17,211 INFO L290 TraceCheckUtils]: 19: Hoare triple {1281#false} main_#t~ret9#1 := fmin_double_#res#1;assume { :end_inline_fmin_double } true;main_~res~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;assume { :begin_inline_isnan_double } true;isnan_double_#in~x#1 := main_~res~0#1;havoc isnan_double_#res#1;havoc isnan_double_~x#1;isnan_double_~x#1 := isnan_double_#in~x#1;isnan_double_#res#1 := (if !~fp.eq~DOUBLE(isnan_double_~x#1, isnan_double_~x#1) then 1bv32 else 0bv32); {1281#false} is VALID [2022-02-20 16:37:17,211 INFO L290 TraceCheckUtils]: 20: Hoare triple {1281#false} main_#t~ret10#1 := isnan_double_#res#1;assume { :end_inline_isnan_double } true; {1281#false} is VALID [2022-02-20 16:37:17,212 INFO L290 TraceCheckUtils]: 21: Hoare triple {1281#false} assume 0bv32 == main_#t~ret10#1;havoc main_#t~ret10#1; {1281#false} is VALID [2022-02-20 16:37:17,212 INFO L290 TraceCheckUtils]: 22: Hoare triple {1281#false} assume !false; {1281#false} is VALID [2022-02-20 16:37:17,212 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:37:17,212 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:37:17,212 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:37:17,212 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [173210280] [2022-02-20 16:37:17,212 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [173210280] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:37:17,213 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:37:17,213 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:37:17,213 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644977359] [2022-02-20 16:37:17,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:37:17,213 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:37:17,214 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:37:17,214 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:37:17,227 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:37:17,228 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:37:17,228 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:37:17,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:37:17,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:37:17,229 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:37:17,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:17,331 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2022-02-20 16:37:17,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:37:17,332 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:37:17,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:37:17,332 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:37:17,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-02-20 16:37:17,333 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:37:17,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-02-20 16:37:17,333 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 37 transitions. [2022-02-20 16:37:17,355 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:37:17,356 INFO L225 Difference]: With dead ends: 33 [2022-02-20 16:37:17,356 INFO L226 Difference]: Without dead ends: 28 [2022-02-20 16:37:17,357 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:37:17,357 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:37:17,357 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:37:17,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-02-20 16:37:17,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2022-02-20 16:37:17,359 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:37:17,360 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:37:17,360 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:37:17,360 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:37:17,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:17,361 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-02-20 16:37:17,361 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-02-20 16:37:17,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:17,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:17,362 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:37:17,365 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:37:17,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:17,367 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-02-20 16:37:17,367 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-02-20 16:37:17,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:17,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:17,372 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:37:17,373 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:37:17,373 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:37:17,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2022-02-20 16:37:17,374 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 23 [2022-02-20 16:37:17,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:37:17,374 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-02-20 16:37:17,374 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:37:17,374 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-02-20 16:37:17,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 16:37:17,375 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:37:17,375 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:37:17,386 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:37:17,575 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:37:17,576 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:37:17,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:37:17,577 INFO L85 PathProgramCache]: Analyzing trace with hash 2125223496, now seen corresponding path program 1 times [2022-02-20 16:37:17,577 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:37:17,577 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [206211892] [2022-02-20 16:37:17,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:37:17,577 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:37:17,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:37:17,578 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:37:17,580 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:37:17,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:17,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 16:37:17,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:17,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:37:17,731 INFO L290 TraceCheckUtils]: 0: Hoare triple {1480#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {1480#true} is VALID [2022-02-20 16:37:17,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {1480#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret9#1, main_#t~ret10#1, main_~x~0#1, main_~y~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());main_~y~0#1 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());assume { :begin_inline_fmin_double } true;fmin_double_#in~x#1, fmin_double_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmin_double_#res#1;havoc fmin_double_#t~ret6#1, fmin_double_#t~ret7#1, fmin_double_#t~ite8#1, fmin_double_~x#1, fmin_double_~y#1;fmin_double_~x#1 := fmin_double_#in~x#1;fmin_double_~y#1 := fmin_double_#in~y#1; {1480#true} is VALID [2022-02-20 16:37:17,731 INFO L272 TraceCheckUtils]: 2: Hoare triple {1480#true} call fmin_double_#t~ret6#1 := __fpclassify_double(fmin_double_~x#1); {1480#true} is VALID [2022-02-20 16:37:17,731 INFO L290 TraceCheckUtils]: 3: Hoare triple {1480#true} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {1480#true} is VALID [2022-02-20 16:37:17,731 INFO L290 TraceCheckUtils]: 4: Hoare triple {1480#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32);call #t~mem4 := read~intINTTYPE4(~#ew_u~0.base, ~bvadd32(4bv32, ~#ew_u~0.offset), 4bv32);~msw~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~intINTTYPE4(~#ew_u~0.base, ~#ew_u~0.offset, 4bv32);~lsw~0 := #t~mem5;havoc #t~mem5;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {1480#true} is VALID [2022-02-20 16:37:17,731 INFO L290 TraceCheckUtils]: 5: Hoare triple {1480#true} goto; {1480#true} is VALID [2022-02-20 16:37:17,731 INFO L290 TraceCheckUtils]: 6: Hoare triple {1480#true} assume (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0);#res := 2bv32; {1480#true} is VALID [2022-02-20 16:37:17,731 INFO L290 TraceCheckUtils]: 7: Hoare triple {1480#true} assume true; {1480#true} is VALID [2022-02-20 16:37:17,731 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1480#true} {1480#true} #67#return; {1480#true} is VALID [2022-02-20 16:37:17,731 INFO L290 TraceCheckUtils]: 9: Hoare triple {1480#true} assume !(0bv32 == fmin_double_#t~ret6#1);havoc fmin_double_#t~ret6#1; {1480#true} is VALID [2022-02-20 16:37:17,732 INFO L272 TraceCheckUtils]: 10: Hoare triple {1480#true} call fmin_double_#t~ret7#1 := __fpclassify_double(fmin_double_~y#1); {1480#true} is VALID [2022-02-20 16:37:17,732 INFO L290 TraceCheckUtils]: 11: Hoare triple {1480#true} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {1480#true} is VALID [2022-02-20 16:37:17,732 INFO L290 TraceCheckUtils]: 12: Hoare triple {1480#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32);call #t~mem4 := read~intINTTYPE4(~#ew_u~0.base, ~bvadd32(4bv32, ~#ew_u~0.offset), 4bv32);~msw~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~intINTTYPE4(~#ew_u~0.base, ~#ew_u~0.offset, 4bv32);~lsw~0 := #t~mem5;havoc #t~mem5;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {1480#true} is VALID [2022-02-20 16:37:17,732 INFO L290 TraceCheckUtils]: 13: Hoare triple {1480#true} goto; {1480#true} is VALID [2022-02-20 16:37:17,732 INFO L290 TraceCheckUtils]: 14: Hoare triple {1480#true} assume !((0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0)); {1480#true} is VALID [2022-02-20 16:37:17,732 INFO L290 TraceCheckUtils]: 15: Hoare triple {1480#true} assume !((~bvuge32(~msw~0, 1048576bv32) && ~bvule32(~msw~0, 2146435071bv32)) || (~bvuge32(~msw~0, 2148532224bv32) && ~bvule32(~msw~0, 4293918719bv32))); {1480#true} is VALID [2022-02-20 16:37:17,740 INFO L290 TraceCheckUtils]: 16: Hoare triple {1480#true} assume ~bvule32(~msw~0, 1048575bv32) || (~bvuge32(~msw~0, 2147483648bv32) && ~bvule32(~msw~0, 2148532223bv32));#res := 3bv32; {1533#(= (_ bv3 32) |__fpclassify_double_#res|)} is VALID [2022-02-20 16:37:17,740 INFO L290 TraceCheckUtils]: 17: Hoare triple {1533#(= (_ bv3 32) |__fpclassify_double_#res|)} assume true; {1533#(= (_ bv3 32) |__fpclassify_double_#res|)} is VALID [2022-02-20 16:37:17,741 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1533#(= (_ bv3 32) |__fpclassify_double_#res|)} {1480#true} #69#return; {1540#(= |ULTIMATE.start_fmin_double_#t~ret7#1| (_ bv3 32))} is VALID [2022-02-20 16:37:17,741 INFO L290 TraceCheckUtils]: 19: Hoare triple {1540#(= |ULTIMATE.start_fmin_double_#t~ret7#1| (_ bv3 32))} assume 0bv32 == fmin_double_#t~ret7#1;havoc fmin_double_#t~ret7#1;fmin_double_#res#1 := fmin_double_~x#1; {1481#false} is VALID [2022-02-20 16:37:17,741 INFO L290 TraceCheckUtils]: 20: Hoare triple {1481#false} main_#t~ret9#1 := fmin_double_#res#1;assume { :end_inline_fmin_double } true;main_~res~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;assume { :begin_inline_isnan_double } true;isnan_double_#in~x#1 := main_~res~0#1;havoc isnan_double_#res#1;havoc isnan_double_~x#1;isnan_double_~x#1 := isnan_double_#in~x#1;isnan_double_#res#1 := (if !~fp.eq~DOUBLE(isnan_double_~x#1, isnan_double_~x#1) then 1bv32 else 0bv32); {1481#false} is VALID [2022-02-20 16:37:17,741 INFO L290 TraceCheckUtils]: 21: Hoare triple {1481#false} main_#t~ret10#1 := isnan_double_#res#1;assume { :end_inline_isnan_double } true; {1481#false} is VALID [2022-02-20 16:37:17,741 INFO L290 TraceCheckUtils]: 22: Hoare triple {1481#false} assume 0bv32 == main_#t~ret10#1;havoc main_#t~ret10#1; {1481#false} is VALID [2022-02-20 16:37:17,741 INFO L290 TraceCheckUtils]: 23: Hoare triple {1481#false} assume !false; {1481#false} is VALID [2022-02-20 16:37:17,742 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:37:17,742 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:37:17,742 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:37:17,742 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [206211892] [2022-02-20 16:37:17,742 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [206211892] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:37:17,742 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:37:17,742 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:37:17,742 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994395071] [2022-02-20 16:37:17,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:37:17,742 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:37:17,743 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:37:17,743 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:37:17,770 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:37:17,770 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:37:17,770 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:37:17,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:37:17,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:37:17,771 INFO L87 Difference]: Start difference. First operand 25 states and 32 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:37:17,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:17,930 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2022-02-20 16:37:17,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:37:17,930 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:37:17,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:37:17,930 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:37:17,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-02-20 16:37:17,931 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:37:17,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-02-20 16:37:17,932 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 37 transitions. [2022-02-20 16:37:17,978 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:37:17,978 INFO L225 Difference]: With dead ends: 33 [2022-02-20 16:37:17,978 INFO L226 Difference]: Without dead ends: 28 [2022-02-20 16:37:17,979 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:37:17,979 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:37:17,979 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:37:17,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-02-20 16:37:17,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2022-02-20 16:37:17,981 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:37:17,981 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:37:17,981 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:37:17,982 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:37:17,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:17,983 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-02-20 16:37:17,983 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-02-20 16:37:17,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:17,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:17,983 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:37:17,984 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:37:17,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:17,984 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-02-20 16:37:17,984 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-02-20 16:37:17,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:17,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:17,985 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:37:17,985 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:37:17,985 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:37:17,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2022-02-20 16:37:17,985 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 24 [2022-02-20 16:37:17,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:37:17,986 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-02-20 16:37:17,986 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:37:17,986 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-02-20 16:37:17,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 16:37:17,986 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:37:17,986 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:37:17,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-02-20 16:37:18,199 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:37:18,200 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:37:18,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:37:18,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1662794800, now seen corresponding path program 1 times [2022-02-20 16:37:18,201 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:37:18,201 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [553299556] [2022-02-20 16:37:18,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:37:18,201 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:37:18,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:37:18,202 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:37:18,205 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:37:18,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:18,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 16:37:18,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:18,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:37:18,461 INFO L290 TraceCheckUtils]: 0: Hoare triple {1683#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {1683#true} is VALID [2022-02-20 16:37:18,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {1683#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret9#1, main_#t~ret10#1, main_~x~0#1, main_~y~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());main_~y~0#1 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());assume { :begin_inline_fmin_double } true;fmin_double_#in~x#1, fmin_double_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmin_double_#res#1;havoc fmin_double_#t~ret6#1, fmin_double_#t~ret7#1, fmin_double_#t~ite8#1, fmin_double_~x#1, fmin_double_~y#1;fmin_double_~x#1 := fmin_double_#in~x#1;fmin_double_~y#1 := fmin_double_#in~y#1; {1691#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_double_~y#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} is VALID [2022-02-20 16:37:18,464 INFO L272 TraceCheckUtils]: 2: Hoare triple {1691#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_double_~y#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} call fmin_double_#t~ret6#1 := __fpclassify_double(fmin_double_~x#1); {1683#true} is VALID [2022-02-20 16:37:18,464 INFO L290 TraceCheckUtils]: 3: Hoare triple {1683#true} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {1683#true} is VALID [2022-02-20 16:37:18,464 INFO L290 TraceCheckUtils]: 4: Hoare triple {1683#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32);call #t~mem4 := read~intINTTYPE4(~#ew_u~0.base, ~bvadd32(4bv32, ~#ew_u~0.offset), 4bv32);~msw~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~intINTTYPE4(~#ew_u~0.base, ~#ew_u~0.offset, 4bv32);~lsw~0 := #t~mem5;havoc #t~mem5;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {1683#true} is VALID [2022-02-20 16:37:18,464 INFO L290 TraceCheckUtils]: 5: Hoare triple {1683#true} goto; {1683#true} is VALID [2022-02-20 16:37:18,464 INFO L290 TraceCheckUtils]: 6: Hoare triple {1683#true} assume (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0);#res := 2bv32; {1683#true} is VALID [2022-02-20 16:37:18,464 INFO L290 TraceCheckUtils]: 7: Hoare triple {1683#true} assume true; {1683#true} is VALID [2022-02-20 16:37:18,465 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1683#true} {1691#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_double_~y#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} #67#return; {1691#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_double_~y#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} is VALID [2022-02-20 16:37:18,466 INFO L290 TraceCheckUtils]: 9: Hoare triple {1691#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_double_~y#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} assume !(0bv32 == fmin_double_#t~ret6#1);havoc fmin_double_#t~ret6#1; {1691#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_double_~y#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} is VALID [2022-02-20 16:37:18,466 INFO L272 TraceCheckUtils]: 10: Hoare triple {1691#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_double_~y#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} call fmin_double_#t~ret7#1 := __fpclassify_double(fmin_double_~y#1); {1683#true} is VALID [2022-02-20 16:37:18,466 INFO L290 TraceCheckUtils]: 11: Hoare triple {1683#true} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {1683#true} is VALID [2022-02-20 16:37:18,466 INFO L290 TraceCheckUtils]: 12: Hoare triple {1683#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32);call #t~mem4 := read~intINTTYPE4(~#ew_u~0.base, ~bvadd32(4bv32, ~#ew_u~0.offset), 4bv32);~msw~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~intINTTYPE4(~#ew_u~0.base, ~#ew_u~0.offset, 4bv32);~lsw~0 := #t~mem5;havoc #t~mem5;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {1683#true} is VALID [2022-02-20 16:37:18,466 INFO L290 TraceCheckUtils]: 13: Hoare triple {1683#true} goto; {1683#true} is VALID [2022-02-20 16:37:18,466 INFO L290 TraceCheckUtils]: 14: Hoare triple {1683#true} assume (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0);#res := 2bv32; {1683#true} is VALID [2022-02-20 16:37:18,466 INFO L290 TraceCheckUtils]: 15: Hoare triple {1683#true} assume true; {1683#true} is VALID [2022-02-20 16:37:18,467 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1683#true} {1691#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_double_~y#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} #69#return; {1691#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_double_~y#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} is VALID [2022-02-20 16:37:18,469 INFO L290 TraceCheckUtils]: 17: Hoare triple {1691#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_double_~y#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} assume !(0bv32 == fmin_double_#t~ret7#1);havoc fmin_double_#t~ret7#1; {1691#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_double_~y#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} is VALID [2022-02-20 16:37:18,469 INFO L290 TraceCheckUtils]: 18: Hoare triple {1691#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_double_~y#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} assume !~fp.lt~DOUBLE(fmin_double_~x#1, fmin_double_~y#1);fmin_double_#t~ite8#1 := fmin_double_~y#1; {1743#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start_fmin_double_#t~ite8#1|))} is VALID [2022-02-20 16:37:18,471 INFO L290 TraceCheckUtils]: 19: Hoare triple {1743#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start_fmin_double_#t~ite8#1|))} fmin_double_#res#1 := fmin_double_#t~ite8#1;havoc fmin_double_#t~ite8#1; {1747#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_double_#res#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} is VALID [2022-02-20 16:37:18,472 INFO L290 TraceCheckUtils]: 20: Hoare triple {1747#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_double_#res#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} main_#t~ret9#1 := fmin_double_#res#1;assume { :end_inline_fmin_double } true;main_~res~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;assume { :begin_inline_isnan_double } true;isnan_double_#in~x#1 := main_~res~0#1;havoc isnan_double_#res#1;havoc isnan_double_~x#1;isnan_double_~x#1 := isnan_double_#in~x#1;isnan_double_#res#1 := (if !~fp.eq~DOUBLE(isnan_double_~x#1, isnan_double_~x#1) then 1bv32 else 0bv32); {1751#(= (_ bv1 32) |ULTIMATE.start_isnan_double_#res#1|)} is VALID [2022-02-20 16:37:18,473 INFO L290 TraceCheckUtils]: 21: Hoare triple {1751#(= (_ bv1 32) |ULTIMATE.start_isnan_double_#res#1|)} main_#t~ret10#1 := isnan_double_#res#1;assume { :end_inline_isnan_double } true; {1755#(= |ULTIMATE.start_main_#t~ret10#1| (_ bv1 32))} is VALID [2022-02-20 16:37:18,473 INFO L290 TraceCheckUtils]: 22: Hoare triple {1755#(= |ULTIMATE.start_main_#t~ret10#1| (_ bv1 32))} assume 0bv32 == main_#t~ret10#1;havoc main_#t~ret10#1; {1684#false} is VALID [2022-02-20 16:37:18,473 INFO L290 TraceCheckUtils]: 23: Hoare triple {1684#false} assume !false; {1684#false} is VALID [2022-02-20 16:37:18,473 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:37:18,473 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:37:18,474 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:37:18,474 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [553299556] [2022-02-20 16:37:18,474 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [553299556] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:37:18,474 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:37:18,474 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 16:37:18,474 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741007503] [2022-02-20 16:37:18,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:37:18,475 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:37:18,475 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:37:18,475 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:37:18,499 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:37:18,499 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 16:37:18,499 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:37:18,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 16:37:18,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:37:18,500 INFO L87 Difference]: Start difference. First operand 25 states and 32 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:37:18,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:18,691 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-02-20 16:37:18,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 16:37:18,691 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:37:18,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:37:18,692 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:37:18,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2022-02-20 16:37:18,692 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:37:18,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2022-02-20 16:37:18,693 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 34 transitions. [2022-02-20 16:37:18,729 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:37:18,730 INFO L225 Difference]: With dead ends: 32 [2022-02-20 16:37:18,730 INFO L226 Difference]: Without dead ends: 26 [2022-02-20 16:37:18,730 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:37:18,731 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 2 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 10 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:37:18,731 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 127 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 10 Unchecked, 0.0s Time] [2022-02-20 16:37:18,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-02-20 16:37:18,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-02-20 16:37:18,733 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:37:18,733 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 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:37:18,733 INFO L74 IsIncluded]: Start isIncluded. First operand 26 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:37:18,733 INFO L87 Difference]: Start difference. First operand 26 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:37:18,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:18,734 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2022-02-20 16:37:18,734 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-02-20 16:37:18,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:18,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:18,735 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 26 states. [2022-02-20 16:37:18,735 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 26 states. [2022-02-20 16:37:18,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:18,735 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2022-02-20 16:37:18,735 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-02-20 16:37:18,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:18,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:18,736 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:37:18,736 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:37:18,736 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:37:18,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2022-02-20 16:37:18,736 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 24 [2022-02-20 16:37:18,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:37:18,737 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2022-02-20 16:37:18,737 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:37:18,737 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-02-20 16:37:18,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 16:37:18,737 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:37:18,738 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:37:18,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-02-20 16:37:18,946 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:37:18,946 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:37:18,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:37:18,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1605536498, now seen corresponding path program 1 times [2022-02-20 16:37:18,947 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:37:18,947 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1756677854] [2022-02-20 16:37:18,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:37:18,947 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:37:18,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:37:18,956 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:37:18,957 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:37:19,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:19,055 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 16:37:19,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:19,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:37:19,138 INFO L290 TraceCheckUtils]: 0: Hoare triple {1887#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {1887#true} is VALID [2022-02-20 16:37:19,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {1887#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret9#1, main_#t~ret10#1, main_~x~0#1, main_~y~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());main_~y~0#1 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());assume { :begin_inline_fmin_double } true;fmin_double_#in~x#1, fmin_double_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmin_double_#res#1;havoc fmin_double_#t~ret6#1, fmin_double_#t~ret7#1, fmin_double_#t~ite8#1, fmin_double_~x#1, fmin_double_~y#1;fmin_double_~x#1 := fmin_double_#in~x#1;fmin_double_~y#1 := fmin_double_#in~y#1; {1895#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_double_~x#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} is VALID [2022-02-20 16:37:19,143 INFO L272 TraceCheckUtils]: 2: Hoare triple {1895#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_double_~x#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} call fmin_double_#t~ret6#1 := __fpclassify_double(fmin_double_~x#1); {1887#true} is VALID [2022-02-20 16:37:19,143 INFO L290 TraceCheckUtils]: 3: Hoare triple {1887#true} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {1887#true} is VALID [2022-02-20 16:37:19,143 INFO L290 TraceCheckUtils]: 4: Hoare triple {1887#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32);call #t~mem4 := read~intINTTYPE4(~#ew_u~0.base, ~bvadd32(4bv32, ~#ew_u~0.offset), 4bv32);~msw~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~intINTTYPE4(~#ew_u~0.base, ~#ew_u~0.offset, 4bv32);~lsw~0 := #t~mem5;havoc #t~mem5;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {1887#true} is VALID [2022-02-20 16:37:19,143 INFO L290 TraceCheckUtils]: 5: Hoare triple {1887#true} goto; {1887#true} is VALID [2022-02-20 16:37:19,143 INFO L290 TraceCheckUtils]: 6: Hoare triple {1887#true} assume (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0);#res := 2bv32; {1887#true} is VALID [2022-02-20 16:37:19,143 INFO L290 TraceCheckUtils]: 7: Hoare triple {1887#true} assume true; {1887#true} is VALID [2022-02-20 16:37:19,144 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1887#true} {1895#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_double_~x#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} #67#return; {1895#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_double_~x#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} is VALID [2022-02-20 16:37:19,146 INFO L290 TraceCheckUtils]: 9: Hoare triple {1895#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_double_~x#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} assume !(0bv32 == fmin_double_#t~ret6#1);havoc fmin_double_#t~ret6#1; {1895#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_double_~x#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} is VALID [2022-02-20 16:37:19,146 INFO L272 TraceCheckUtils]: 10: Hoare triple {1895#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_double_~x#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} call fmin_double_#t~ret7#1 := __fpclassify_double(fmin_double_~y#1); {1887#true} is VALID [2022-02-20 16:37:19,146 INFO L290 TraceCheckUtils]: 11: Hoare triple {1887#true} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {1887#true} is VALID [2022-02-20 16:37:19,146 INFO L290 TraceCheckUtils]: 12: Hoare triple {1887#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32);call #t~mem4 := read~intINTTYPE4(~#ew_u~0.base, ~bvadd32(4bv32, ~#ew_u~0.offset), 4bv32);~msw~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~intINTTYPE4(~#ew_u~0.base, ~#ew_u~0.offset, 4bv32);~lsw~0 := #t~mem5;havoc #t~mem5;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {1887#true} is VALID [2022-02-20 16:37:19,146 INFO L290 TraceCheckUtils]: 13: Hoare triple {1887#true} goto; {1887#true} is VALID [2022-02-20 16:37:19,146 INFO L290 TraceCheckUtils]: 14: Hoare triple {1887#true} assume (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0);#res := 2bv32; {1887#true} is VALID [2022-02-20 16:37:19,146 INFO L290 TraceCheckUtils]: 15: Hoare triple {1887#true} assume true; {1887#true} is VALID [2022-02-20 16:37:19,147 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1887#true} {1895#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_double_~x#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} #69#return; {1895#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_double_~x#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} is VALID [2022-02-20 16:37:19,151 INFO L290 TraceCheckUtils]: 17: Hoare triple {1895#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_double_~x#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} assume !(0bv32 == fmin_double_#t~ret7#1);havoc fmin_double_#t~ret7#1; {1895#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_double_~x#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} is VALID [2022-02-20 16:37:19,153 INFO L290 TraceCheckUtils]: 18: Hoare triple {1895#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_double_~x#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} assume ~fp.lt~DOUBLE(fmin_double_~x#1, fmin_double_~y#1);fmin_double_#t~ite8#1 := fmin_double_~x#1; {1888#false} is VALID [2022-02-20 16:37:19,153 INFO L290 TraceCheckUtils]: 19: Hoare triple {1888#false} fmin_double_#res#1 := fmin_double_#t~ite8#1;havoc fmin_double_#t~ite8#1; {1888#false} is VALID [2022-02-20 16:37:19,153 INFO L290 TraceCheckUtils]: 20: Hoare triple {1888#false} main_#t~ret9#1 := fmin_double_#res#1;assume { :end_inline_fmin_double } true;main_~res~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;assume { :begin_inline_isnan_double } true;isnan_double_#in~x#1 := main_~res~0#1;havoc isnan_double_#res#1;havoc isnan_double_~x#1;isnan_double_~x#1 := isnan_double_#in~x#1;isnan_double_#res#1 := (if !~fp.eq~DOUBLE(isnan_double_~x#1, isnan_double_~x#1) then 1bv32 else 0bv32); {1888#false} is VALID [2022-02-20 16:37:19,154 INFO L290 TraceCheckUtils]: 21: Hoare triple {1888#false} main_#t~ret10#1 := isnan_double_#res#1;assume { :end_inline_isnan_double } true; {1888#false} is VALID [2022-02-20 16:37:19,154 INFO L290 TraceCheckUtils]: 22: Hoare triple {1888#false} assume 0bv32 == main_#t~ret10#1;havoc main_#t~ret10#1; {1888#false} is VALID [2022-02-20 16:37:19,154 INFO L290 TraceCheckUtils]: 23: Hoare triple {1888#false} assume !false; {1888#false} is VALID [2022-02-20 16:37:19,154 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:37:19,154 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:37:19,154 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:37:19,154 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1756677854] [2022-02-20 16:37:19,154 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1756677854] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:37:19,154 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:37:19,154 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:37:19,154 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836071464] [2022-02-20 16:37:19,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:37:19,155 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:37:19,155 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:37:19,155 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:37:19,178 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:37:19,178 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:37:19,178 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:37:19,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:37:19,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:37:19,178 INFO L87 Difference]: Start difference. First operand 25 states and 31 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:37:19,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:19,234 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-02-20 16:37:19,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:37:19,235 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:37:19,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:37:19,235 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:37:19,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2022-02-20 16:37:19,235 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:37:19,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2022-02-20 16:37:19,236 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 31 transitions. [2022-02-20 16:37:19,265 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:37:19,265 INFO L225 Difference]: With dead ends: 30 [2022-02-20 16:37:19,266 INFO L226 Difference]: Without dead ends: 22 [2022-02-20 16:37:19,266 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:37:19,266 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 43 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:37:19,267 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 1 Unchecked, 0.0s Time] [2022-02-20 16:37:19,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-02-20 16:37:19,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-02-20 16:37:19,269 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:37:19,269 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:37:19,269 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:37:19,269 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:37:19,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:19,270 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-02-20 16:37:19,270 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-02-20 16:37:19,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:19,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:19,270 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:37:19,271 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:37:19,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:19,271 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-02-20 16:37:19,271 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-02-20 16:37:19,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:19,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:19,272 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:37:19,272 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:37:19,272 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:37:19,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-02-20 16:37:19,273 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 24 [2022-02-20 16:37:19,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:37:19,273 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-02-20 16:37:19,273 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:37:19,273 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-02-20 16:37:19,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 16:37:19,273 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:37:19,274 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:37:19,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-02-20 16:37:19,484 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:37:19,485 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:37:19,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:37:19,485 INFO L85 PathProgramCache]: Analyzing trace with hash 81668136, now seen corresponding path program 1 times [2022-02-20 16:37:19,486 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:37:19,486 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1091069017] [2022-02-20 16:37:19,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:37:19,486 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:37:19,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:37:19,487 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:37:19,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-02-20 16:37:19,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:19,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 16:37:19,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:19,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:37:19,612 INFO L290 TraceCheckUtils]: 0: Hoare triple {2071#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {2071#true} is VALID [2022-02-20 16:37:19,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {2071#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret9#1, main_#t~ret10#1, main_~x~0#1, main_~y~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());main_~y~0#1 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());assume { :begin_inline_fmin_double } true;fmin_double_#in~x#1, fmin_double_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmin_double_#res#1;havoc fmin_double_#t~ret6#1, fmin_double_#t~ret7#1, fmin_double_#t~ite8#1, fmin_double_~x#1, fmin_double_~y#1;fmin_double_~x#1 := fmin_double_#in~x#1;fmin_double_~y#1 := fmin_double_#in~y#1; {2071#true} is VALID [2022-02-20 16:37:19,612 INFO L272 TraceCheckUtils]: 2: Hoare triple {2071#true} call fmin_double_#t~ret6#1 := __fpclassify_double(fmin_double_~x#1); {2071#true} is VALID [2022-02-20 16:37:19,612 INFO L290 TraceCheckUtils]: 3: Hoare triple {2071#true} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {2071#true} is VALID [2022-02-20 16:37:19,613 INFO L290 TraceCheckUtils]: 4: Hoare triple {2071#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32);call #t~mem4 := read~intINTTYPE4(~#ew_u~0.base, ~bvadd32(4bv32, ~#ew_u~0.offset), 4bv32);~msw~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~intINTTYPE4(~#ew_u~0.base, ~#ew_u~0.offset, 4bv32);~lsw~0 := #t~mem5;havoc #t~mem5;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {2071#true} is VALID [2022-02-20 16:37:19,613 INFO L290 TraceCheckUtils]: 5: Hoare triple {2071#true} goto; {2071#true} is VALID [2022-02-20 16:37:19,613 INFO L290 TraceCheckUtils]: 6: Hoare triple {2071#true} assume (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0);#res := 2bv32; {2071#true} is VALID [2022-02-20 16:37:19,613 INFO L290 TraceCheckUtils]: 7: Hoare triple {2071#true} assume true; {2071#true} is VALID [2022-02-20 16:37:19,613 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {2071#true} {2071#true} #67#return; {2071#true} is VALID [2022-02-20 16:37:19,613 INFO L290 TraceCheckUtils]: 9: Hoare triple {2071#true} assume !(0bv32 == fmin_double_#t~ret6#1);havoc fmin_double_#t~ret6#1; {2071#true} is VALID [2022-02-20 16:37:19,614 INFO L272 TraceCheckUtils]: 10: Hoare triple {2071#true} call fmin_double_#t~ret7#1 := __fpclassify_double(fmin_double_~y#1); {2071#true} is VALID [2022-02-20 16:37:19,614 INFO L290 TraceCheckUtils]: 11: Hoare triple {2071#true} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {2071#true} is VALID [2022-02-20 16:37:19,614 INFO L290 TraceCheckUtils]: 12: Hoare triple {2071#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32);call #t~mem4 := read~intINTTYPE4(~#ew_u~0.base, ~bvadd32(4bv32, ~#ew_u~0.offset), 4bv32);~msw~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~intINTTYPE4(~#ew_u~0.base, ~#ew_u~0.offset, 4bv32);~lsw~0 := #t~mem5;havoc #t~mem5;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {2071#true} is VALID [2022-02-20 16:37:19,614 INFO L290 TraceCheckUtils]: 13: Hoare triple {2071#true} goto; {2071#true} is VALID [2022-02-20 16:37:19,614 INFO L290 TraceCheckUtils]: 14: Hoare triple {2071#true} assume !((0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0)); {2071#true} is VALID [2022-02-20 16:37:19,614 INFO L290 TraceCheckUtils]: 15: Hoare triple {2071#true} assume !((~bvuge32(~msw~0, 1048576bv32) && ~bvule32(~msw~0, 2146435071bv32)) || (~bvuge32(~msw~0, 2148532224bv32) && ~bvule32(~msw~0, 4293918719bv32))); {2071#true} is VALID [2022-02-20 16:37:19,614 INFO L290 TraceCheckUtils]: 16: Hoare triple {2071#true} assume !(~bvule32(~msw~0, 1048575bv32) || (~bvuge32(~msw~0, 2147483648bv32) && ~bvule32(~msw~0, 2148532223bv32))); {2071#true} is VALID [2022-02-20 16:37:19,615 INFO L290 TraceCheckUtils]: 17: Hoare triple {2071#true} assume (2146435072bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (4293918720bv32 == ~msw~0 && 0bv32 == ~lsw~0);#res := 1bv32; {2127#(= |__fpclassify_double_#res| (_ bv1 32))} is VALID [2022-02-20 16:37:19,615 INFO L290 TraceCheckUtils]: 18: Hoare triple {2127#(= |__fpclassify_double_#res| (_ bv1 32))} assume true; {2127#(= |__fpclassify_double_#res| (_ bv1 32))} is VALID [2022-02-20 16:37:19,616 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {2127#(= |__fpclassify_double_#res| (_ bv1 32))} {2071#true} #69#return; {2134#(= |ULTIMATE.start_fmin_double_#t~ret7#1| (_ bv1 32))} is VALID [2022-02-20 16:37:19,616 INFO L290 TraceCheckUtils]: 20: Hoare triple {2134#(= |ULTIMATE.start_fmin_double_#t~ret7#1| (_ bv1 32))} assume 0bv32 == fmin_double_#t~ret7#1;havoc fmin_double_#t~ret7#1;fmin_double_#res#1 := fmin_double_~x#1; {2072#false} is VALID [2022-02-20 16:37:19,616 INFO L290 TraceCheckUtils]: 21: Hoare triple {2072#false} main_#t~ret9#1 := fmin_double_#res#1;assume { :end_inline_fmin_double } true;main_~res~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;assume { :begin_inline_isnan_double } true;isnan_double_#in~x#1 := main_~res~0#1;havoc isnan_double_#res#1;havoc isnan_double_~x#1;isnan_double_~x#1 := isnan_double_#in~x#1;isnan_double_#res#1 := (if !~fp.eq~DOUBLE(isnan_double_~x#1, isnan_double_~x#1) then 1bv32 else 0bv32); {2072#false} is VALID [2022-02-20 16:37:19,616 INFO L290 TraceCheckUtils]: 22: Hoare triple {2072#false} main_#t~ret10#1 := isnan_double_#res#1;assume { :end_inline_isnan_double } true; {2072#false} is VALID [2022-02-20 16:37:19,617 INFO L290 TraceCheckUtils]: 23: Hoare triple {2072#false} assume 0bv32 == main_#t~ret10#1;havoc main_#t~ret10#1; {2072#false} is VALID [2022-02-20 16:37:19,617 INFO L290 TraceCheckUtils]: 24: Hoare triple {2072#false} assume !false; {2072#false} is VALID [2022-02-20 16:37:19,617 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:37:19,617 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:37:19,617 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:37:19,617 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1091069017] [2022-02-20 16:37:19,617 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1091069017] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:37:19,618 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:37:19,618 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:37:19,618 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128418510] [2022-02-20 16:37:19,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:37:19,619 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 25 [2022-02-20 16:37:19,619 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:37:19,619 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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:37:19,634 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:37:19,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:37:19,635 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:37:19,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:37:19,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:37:19,636 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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:37:19,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:19,707 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-02-20 16:37:19,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:37:19,707 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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 25 [2022-02-20 16:37:19,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:37:19,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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:37:19,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-02-20 16:37:19,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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:37:19,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-02-20 16:37:19,717 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 32 transitions. [2022-02-20 16:37:19,742 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:37:19,743 INFO L225 Difference]: With dead ends: 30 [2022-02-20 16:37:19,743 INFO L226 Difference]: Without dead ends: 24 [2022-02-20 16:37:19,743 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 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:37:19,744 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:37:19,744 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:37:19,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-02-20 16:37:19,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2022-02-20 16:37:19,746 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:37:19,746 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:37:19,746 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:37:19,746 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:37:19,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:19,747 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-02-20 16:37:19,747 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-02-20 16:37:19,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:19,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:19,747 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:37:19,747 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:37:19,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:19,748 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-02-20 16:37:19,748 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-02-20 16:37:19,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:19,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:19,748 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:37:19,748 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:37:19,748 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:37:19,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-02-20 16:37:19,749 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 25 [2022-02-20 16:37:19,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:37:19,749 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-02-20 16:37:19,749 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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:37:19,749 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-02-20 16:37:19,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 16:37:19,749 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:37:19,750 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:37:19,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-02-20 16:37:19,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:37:19,960 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:37:19,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:37:19,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1824478471, now seen corresponding path program 1 times [2022-02-20 16:37:19,960 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:37:19,960 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1625461468] [2022-02-20 16:37:19,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:37:19,960 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:37:19,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:37:19,962 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:37:19,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-02-20 16:37:20,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:20,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 16:37:20,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:20,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:37:20,190 INFO L290 TraceCheckUtils]: 0: Hoare triple {2263#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {2263#true} is VALID [2022-02-20 16:37:20,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {2263#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret9#1, main_#t~ret10#1, main_~x~0#1, main_~y~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());main_~y~0#1 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());assume { :begin_inline_fmin_double } true;fmin_double_#in~x#1, fmin_double_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmin_double_#res#1;havoc fmin_double_#t~ret6#1, fmin_double_#t~ret7#1, fmin_double_#t~ite8#1, fmin_double_~x#1, fmin_double_~y#1;fmin_double_~x#1 := fmin_double_#in~x#1;fmin_double_~y#1 := fmin_double_#in~y#1; {2271#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_double_~x#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} is VALID [2022-02-20 16:37:20,193 INFO L272 TraceCheckUtils]: 2: Hoare triple {2271#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_double_~x#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} call fmin_double_#t~ret6#1 := __fpclassify_double(fmin_double_~x#1); {2263#true} is VALID [2022-02-20 16:37:20,193 INFO L290 TraceCheckUtils]: 3: Hoare triple {2263#true} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {2263#true} is VALID [2022-02-20 16:37:20,193 INFO L290 TraceCheckUtils]: 4: Hoare triple {2263#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32);call #t~mem4 := read~intINTTYPE4(~#ew_u~0.base, ~bvadd32(4bv32, ~#ew_u~0.offset), 4bv32);~msw~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~intINTTYPE4(~#ew_u~0.base, ~#ew_u~0.offset, 4bv32);~lsw~0 := #t~mem5;havoc #t~mem5;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {2263#true} is VALID [2022-02-20 16:37:20,193 INFO L290 TraceCheckUtils]: 5: Hoare triple {2263#true} goto; {2263#true} is VALID [2022-02-20 16:37:20,193 INFO L290 TraceCheckUtils]: 6: Hoare triple {2263#true} assume (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0);#res := 2bv32; {2263#true} is VALID [2022-02-20 16:37:20,193 INFO L290 TraceCheckUtils]: 7: Hoare triple {2263#true} assume true; {2263#true} is VALID [2022-02-20 16:37:20,194 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {2263#true} {2271#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_double_~x#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} #67#return; {2271#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_double_~x#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} is VALID [2022-02-20 16:37:20,195 INFO L290 TraceCheckUtils]: 9: Hoare triple {2271#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_double_~x#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} assume !(0bv32 == fmin_double_#t~ret6#1);havoc fmin_double_#t~ret6#1; {2271#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_double_~x#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} is VALID [2022-02-20 16:37:20,195 INFO L272 TraceCheckUtils]: 10: Hoare triple {2271#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_double_~x#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} call fmin_double_#t~ret7#1 := __fpclassify_double(fmin_double_~y#1); {2263#true} is VALID [2022-02-20 16:37:20,195 INFO L290 TraceCheckUtils]: 11: Hoare triple {2263#true} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {2263#true} is VALID [2022-02-20 16:37:20,195 INFO L290 TraceCheckUtils]: 12: Hoare triple {2263#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32);call #t~mem4 := read~intINTTYPE4(~#ew_u~0.base, ~bvadd32(4bv32, ~#ew_u~0.offset), 4bv32);~msw~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~intINTTYPE4(~#ew_u~0.base, ~#ew_u~0.offset, 4bv32);~lsw~0 := #t~mem5;havoc #t~mem5;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {2263#true} is VALID [2022-02-20 16:37:20,195 INFO L290 TraceCheckUtils]: 13: Hoare triple {2263#true} goto; {2263#true} is VALID [2022-02-20 16:37:20,196 INFO L290 TraceCheckUtils]: 14: Hoare triple {2263#true} assume !((0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0)); {2263#true} is VALID [2022-02-20 16:37:20,196 INFO L290 TraceCheckUtils]: 15: Hoare triple {2263#true} assume !((~bvuge32(~msw~0, 1048576bv32) && ~bvule32(~msw~0, 2146435071bv32)) || (~bvuge32(~msw~0, 2148532224bv32) && ~bvule32(~msw~0, 4293918719bv32))); {2263#true} is VALID [2022-02-20 16:37:20,196 INFO L290 TraceCheckUtils]: 16: Hoare triple {2263#true} assume !(~bvule32(~msw~0, 1048575bv32) || (~bvuge32(~msw~0, 2147483648bv32) && ~bvule32(~msw~0, 2148532223bv32))); {2263#true} is VALID [2022-02-20 16:37:20,196 INFO L290 TraceCheckUtils]: 17: Hoare triple {2263#true} assume !((2146435072bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (4293918720bv32 == ~msw~0 && 0bv32 == ~lsw~0));#res := 0bv32; {2263#true} is VALID [2022-02-20 16:37:20,196 INFO L290 TraceCheckUtils]: 18: Hoare triple {2263#true} assume true; {2263#true} is VALID [2022-02-20 16:37:20,201 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {2263#true} {2271#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_double_~x#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} #69#return; {2271#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_double_~x#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} is VALID [2022-02-20 16:37:20,203 INFO L290 TraceCheckUtils]: 20: Hoare triple {2271#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_double_~x#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} assume 0bv32 == fmin_double_#t~ret7#1;havoc fmin_double_#t~ret7#1;fmin_double_#res#1 := fmin_double_~x#1; {2329#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_double_#res#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} is VALID [2022-02-20 16:37:20,207 INFO L290 TraceCheckUtils]: 21: Hoare triple {2329#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_double_#res#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))} main_#t~ret9#1 := fmin_double_#res#1;assume { :end_inline_fmin_double } true;main_~res~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;assume { :begin_inline_isnan_double } true;isnan_double_#in~x#1 := main_~res~0#1;havoc isnan_double_#res#1;havoc isnan_double_~x#1;isnan_double_~x#1 := isnan_double_#in~x#1;isnan_double_#res#1 := (if !~fp.eq~DOUBLE(isnan_double_~x#1, isnan_double_~x#1) then 1bv32 else 0bv32); {2333#(= (_ bv1 32) |ULTIMATE.start_isnan_double_#res#1|)} is VALID [2022-02-20 16:37:20,208 INFO L290 TraceCheckUtils]: 22: Hoare triple {2333#(= (_ bv1 32) |ULTIMATE.start_isnan_double_#res#1|)} main_#t~ret10#1 := isnan_double_#res#1;assume { :end_inline_isnan_double } true; {2337#(= |ULTIMATE.start_main_#t~ret10#1| (_ bv1 32))} is VALID [2022-02-20 16:37:20,209 INFO L290 TraceCheckUtils]: 23: Hoare triple {2337#(= |ULTIMATE.start_main_#t~ret10#1| (_ bv1 32))} assume 0bv32 == main_#t~ret10#1;havoc main_#t~ret10#1; {2264#false} is VALID [2022-02-20 16:37:20,209 INFO L290 TraceCheckUtils]: 24: Hoare triple {2264#false} assume !false; {2264#false} is VALID [2022-02-20 16:37:20,209 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:37:20,209 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:37:20,209 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:37:20,209 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1625461468] [2022-02-20 16:37:20,209 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1625461468] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:37:20,209 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:37:20,209 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 16:37:20,210 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988666724] [2022-02-20 16:37:20,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:37:20,210 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:37:20,210 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:37:20,210 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:37:20,234 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:37:20,234 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 16:37:20,234 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:37:20,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 16:37:20,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 16:37:20,235 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:37:20,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:20,407 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-02-20 16:37:20,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 16:37:20,408 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:37:20,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:37:20,408 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:37:20,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2022-02-20 16:37:20,409 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:37:20,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2022-02-20 16:37:20,409 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 24 transitions. [2022-02-20 16:37:20,433 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:37:20,433 INFO L225 Difference]: With dead ends: 22 [2022-02-20 16:37:20,433 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 16:37:20,434 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:37:20,435 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:37:20,435 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:37:20,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 16:37:20,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 16:37:20,436 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:37:20,436 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:37:20,436 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:37:20,436 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:37:20,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:20,436 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:37:20,436 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:37:20,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:20,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:20,437 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:37:20,437 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:37:20,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:20,437 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:37:20,437 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:37:20,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:20,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:20,437 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:37:20,437 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:37:20,438 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:37:20,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 16:37:20,438 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2022-02-20 16:37:20,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:37:20,438 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 16:37:20,438 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:37:20,438 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:37:20,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:20,440 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:37:20,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Ended with exit code 0 [2022-02-20 16:37:20,649 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:37:20,651 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 16:37:20,690 INFO L858 garLoopResultBuilder]: For program point __fpclassify_doubleFINAL(lines 19 44) no Hoare annotation was computed. [2022-02-20 16:37:20,690 INFO L861 garLoopResultBuilder]: At program point __fpclassify_doubleENTRY(lines 19 44) the Hoare annotation is: true [2022-02-20 16:37:20,690 INFO L858 garLoopResultBuilder]: For program point L32(lines 32 43) no Hoare annotation was computed. [2022-02-20 16:37:20,690 INFO L858 garLoopResultBuilder]: For program point __fpclassify_doubleEXIT(lines 19 44) no Hoare annotation was computed. [2022-02-20 16:37:20,690 INFO L858 garLoopResultBuilder]: For program point L22-1(lines 22 27) no Hoare annotation was computed. [2022-02-20 16:37:20,691 INFO L861 garLoopResultBuilder]: At program point L22-2(lines 22 27) the Hoare annotation is: true [2022-02-20 16:37:20,691 INFO L858 garLoopResultBuilder]: For program point L22-3(lines 19 44) no Hoare annotation was computed. [2022-02-20 16:37:20,691 INFO L858 garLoopResultBuilder]: For program point L39(lines 39 43) no Hoare annotation was computed. [2022-02-20 16:37:20,691 INFO L858 garLoopResultBuilder]: For program point L35(lines 35 43) no Hoare annotation was computed. [2022-02-20 16:37:20,691 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 16:37:20,691 INFO L858 garLoopResultBuilder]: For program point L52(line 52) no Hoare annotation was computed. [2022-02-20 16:37:20,691 INFO L858 garLoopResultBuilder]: For program point L52-2(line 52) no Hoare annotation was computed. [2022-02-20 16:37:20,691 INFO L854 garLoopResultBuilder]: At program point L52-3(lines 46 53) the Hoare annotation is: (exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_double_#res#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)))) [2022-02-20 16:37:20,691 INFO L858 garLoopResultBuilder]: For program point L67(lines 67 70) no Hoare annotation was computed. [2022-02-20 16:37:20,692 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 16:37:20,692 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 16:37:20,692 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 16:37:20,692 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 68) no Hoare annotation was computed. [2022-02-20 16:37:20,692 INFO L854 garLoopResultBuilder]: At program point L18(line 18) the Hoare annotation is: (= (_ bv1 32) |ULTIMATE.start_isnan_double_#res#1|) [2022-02-20 16:37:20,692 INFO L854 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (and (exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_double_~y#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)))) (exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_double_~x#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))) [2022-02-20 16:37:20,692 INFO L858 garLoopResultBuilder]: For program point L49-1(lines 49 50) no Hoare annotation was computed. [2022-02-20 16:37:20,692 INFO L854 garLoopResultBuilder]: At program point L47(line 47) the Hoare annotation is: (and (exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_double_~y#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)))) (exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_fmin_double_~x#1| (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))) [2022-02-20 16:37:20,693 INFO L858 garLoopResultBuilder]: For program point L47-1(lines 47 48) no Hoare annotation was computed. [2022-02-20 16:37:20,693 INFO L861 garLoopResultBuilder]: At program point L72(lines 55 73) the Hoare annotation is: true [2022-02-20 16:37:20,693 INFO L858 garLoopResultBuilder]: For program point L68(line 68) no Hoare annotation was computed. [2022-02-20 16:37:20,696 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:37:20,697 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:37:20,700 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:37:20,701 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-02-20 16:37:20,701 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2022-02-20 16:37:20,701 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:37:20,701 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-02-20 16:37:20,701 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-02-20 16:37:20,701 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2022-02-20 16:37:20,701 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2022-02-20 16:37:20,701 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2022-02-20 16:37:20,702 WARN L170 areAnnotationChecker]: __fpclassify_doubleFINAL has no Hoare annotation [2022-02-20 16:37:20,702 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2022-02-20 16:37:20,702 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2022-02-20 16:37:20,702 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2022-02-20 16:37:20,702 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2022-02-20 16:37:20,702 WARN L170 areAnnotationChecker]: __fpclassify_doubleEXIT has no Hoare annotation [2022-02-20 16:37:20,702 WARN L170 areAnnotationChecker]: __fpclassify_doubleEXIT has no Hoare annotation [2022-02-20 16:37:20,702 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-02-20 16:37:20,702 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-02-20 16:37:20,705 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2022-02-20 16:37:20,705 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2022-02-20 16:37:20,705 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2022-02-20 16:37:20,705 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-02-20 16:37:20,705 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-02-20 16:37:20,705 WARN L170 areAnnotationChecker]: L67 has no Hoare annotation [2022-02-20 16:37:20,705 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-02-20 16:37:20,705 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2022-02-20 16:37:20,705 WARN L170 areAnnotationChecker]: L67 has no Hoare annotation [2022-02-20 16:37:20,705 WARN L170 areAnnotationChecker]: L67 has no Hoare annotation [2022-02-20 16:37:20,705 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2022-02-20 16:37:20,706 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2022-02-20 16:37:20,706 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2022-02-20 16:37:20,706 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:37:20,706 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:37:20,706 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:37:20,711 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:37:20,712 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:37:20,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:37:20 BoogieIcfgContainer [2022-02-20 16:37:20,714 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:37:20,714 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:37:20,714 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:37:20,715 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:37:20,715 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:37:12" (3/4) ... [2022-02-20 16:37:20,717 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 16:37:20,720 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __fpclassify_double [2022-02-20 16:37:20,725 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2022-02-20 16:37:20,725 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2022-02-20 16:37:20,725 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 16:37:20,725 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 16:37:20,744 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists currentRoundingMode : FloatRoundingMode :: \result == ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) [2022-02-20 16:37:20,745 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: 1bv32 == \result [2022-02-20 16:37:20,760 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 16:37:20,760 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:37:20,761 INFO L158 Benchmark]: Toolchain (without parser) took 8630.23ms. Allocated memory was 44.0MB in the beginning and 86.0MB in the end (delta: 41.9MB). Free memory was 28.6MB in the beginning and 28.6MB in the end (delta: 12.6kB). Peak memory consumption was 40.9MB. Max. memory is 16.1GB. [2022-02-20 16:37:20,761 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 44.0MB. Free memory was 25.9MB in the beginning and 25.8MB in the end (delta: 31.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:37:20,762 INFO L158 Benchmark]: CACSL2BoogieTranslator took 272.68ms. Allocated memory was 44.0MB in the beginning and 54.5MB in the end (delta: 10.5MB). Free memory was 28.4MB in the beginning and 36.4MB in the end (delta: -7.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 16:37:20,763 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.15ms. Allocated memory is still 54.5MB. Free memory was 36.2MB in the beginning and 34.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:37:20,763 INFO L158 Benchmark]: Boogie Preprocessor took 50.58ms. Allocated memory is still 54.5MB. Free memory was 34.6MB in the beginning and 32.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:37:20,763 INFO L158 Benchmark]: RCFGBuilder took 370.18ms. Allocated memory is still 54.5MB. Free memory was 32.9MB in the beginning and 34.2MB in the end (delta: -1.2MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. [2022-02-20 16:37:20,764 INFO L158 Benchmark]: TraceAbstraction took 7817.98ms. Allocated memory was 54.5MB in the beginning and 86.0MB in the end (delta: 31.5MB). Free memory was 33.6MB in the beginning and 31.3MB in the end (delta: 2.4MB). Peak memory consumption was 32.5MB. Max. memory is 16.1GB. [2022-02-20 16:37:20,764 INFO L158 Benchmark]: Witness Printer took 46.03ms. Allocated memory is still 86.0MB. Free memory was 31.3MB in the beginning and 28.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:37:20,774 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 44.0MB. Free memory was 25.9MB in the beginning and 25.8MB in the end (delta: 31.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 272.68ms. Allocated memory was 44.0MB in the beginning and 54.5MB in the end (delta: 10.5MB). Free memory was 28.4MB in the beginning and 36.4MB in the end (delta: -7.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.15ms. Allocated memory is still 54.5MB. Free memory was 36.2MB in the beginning and 34.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.58ms. Allocated memory is still 54.5MB. Free memory was 34.6MB in the beginning and 32.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 370.18ms. Allocated memory is still 54.5MB. Free memory was 32.9MB in the beginning and 34.2MB in the end (delta: -1.2MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7817.98ms. Allocated memory was 54.5MB in the beginning and 86.0MB in the end (delta: 31.5MB). Free memory was 33.6MB in the beginning and 31.3MB in the end (delta: 2.4MB). Peak memory consumption was 32.5MB. Max. memory is 16.1GB. * Witness Printer took 46.03ms. Allocated memory is still 86.0MB. Free memory was 31.3MB in the beginning and 28.6MB in the end (delta: 2.7MB). 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: 68]: 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: 7.7s, OverallIterations: 13, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11 mSDsluCounter, 1049 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 30 IncrementalHoareTripleChecker+Unchecked, 686 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 87 IncrementalHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 363 mSDtfsCounter, 87 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 249 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=0, InterpolantAutomatonStates: 56, 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, 13 MinimizatonAttempts, 26 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 11 PreInvPairs, 17 NumberOfFragments, 43 HoareAnnotationTreeSize, 11 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 259 NumberOfCodeBlocks, 259 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 246 ConstructedInterpolants, 20 QuantifiedInterpolants, 426 SizeOfPredicates, 32 NumberOfNonLiveVariables, 965 ConjunctsInSsa, 60 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 42/42 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: 18]: Loop Invariant Derived loop invariant: 1bv32 == \result - InvariantResult [Line: 46]: Loop Invariant [2022-02-20 16:37:20,780 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:37:20,780 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: (\exists currentRoundingMode : FloatRoundingMode :: \result == ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-02-20 16:37:20,815 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