./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_1232b.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/float_req_bl_1232b.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(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 36a0a55241cede481b157c1ab9f348d708a5b166 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/float_req_bl_1232b.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(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 36a0a55241cede481b157c1ab9f348d708a5b166 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 17:54:22,986 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 17:54:22,989 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 17:54:23,001 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 17:54:23,002 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 17:54:23,003 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 17:54:23,005 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 17:54:23,007 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 17:54:23,009 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 17:54:23,010 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 17:54:23,011 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 17:54:23,012 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 17:54:23,013 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 17:54:23,014 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 17:54:23,015 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 17:54:23,016 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 17:54:23,017 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 17:54:23,018 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 17:54:23,020 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 17:54:23,022 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 17:54:23,023 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 17:54:23,024 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 17:54:23,026 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 17:54:23,026 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 17:54:23,029 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 17:54:23,029 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 17:54:23,030 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 17:54:23,031 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 17:54:23,031 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 17:54:23,032 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 17:54:23,032 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 17:54:23,033 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 17:54:23,034 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 17:54:23,035 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 17:54:23,036 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 17:54:23,036 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 17:54:23,037 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 17:54:23,037 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 17:54:23,037 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 17:54:23,038 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 17:54:23,039 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 17:54:23,040 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-28 17:54:23,055 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 17:54:23,055 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 17:54:23,056 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 17:54:23,057 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 17:54:23,057 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 17:54:23,057 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 17:54:23,058 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 17:54:23,058 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 17:54:23,058 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 17:54:23,059 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 17:54:23,059 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 17:54:23,059 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 17:54:23,059 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 17:54:23,060 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 17:54:23,060 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 17:54:23,060 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 17:54:23,061 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 17:54:23,061 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 17:54:23,061 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 17:54:23,062 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 17:54:23,062 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 17:54:23,062 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 17:54:23,063 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 17:54:23,063 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 17:54:23,063 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 17:54:23,064 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 17:54:23,064 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 17:54:23,064 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 17:54:23,065 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 17:54:23,065 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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(__VERIFIER_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 -> 36a0a55241cede481b157c1ab9f348d708a5b166 [2020-07-28 17:54:23,419 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 17:54:23,432 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 17:54:23,435 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 17:54:23,437 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 17:54:23,438 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 17:54:23,438 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1232b.c [2020-07-28 17:54:23,497 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32915ac69/c40c2137d8a64edf83bbd64564e681b7/FLAG29523fde5 [2020-07-28 17:54:23,943 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 17:54:23,944 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1232b.c [2020-07-28 17:54:23,950 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32915ac69/c40c2137d8a64edf83bbd64564e681b7/FLAG29523fde5 [2020-07-28 17:54:24,321 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32915ac69/c40c2137d8a64edf83bbd64564e681b7 [2020-07-28 17:54:24,324 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 17:54:24,327 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 17:54:24,328 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 17:54:24,328 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 17:54:24,331 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 17:54:24,333 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:54:24" (1/1) ... [2020-07-28 17:54:24,335 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d085cfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:24, skipping insertion in model container [2020-07-28 17:54:24,336 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:54:24" (1/1) ... [2020-07-28 17:54:24,343 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 17:54:24,364 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 17:54:24,558 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:54:24,563 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 17:54:24,593 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:54:24,680 INFO L208 MainTranslator]: Completed translation [2020-07-28 17:54:24,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:24 WrapperNode [2020-07-28 17:54:24,681 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 17:54:24,682 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 17:54:24,683 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 17:54:24,683 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 17:54:24,692 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:24" (1/1) ... [2020-07-28 17:54:24,704 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:24" (1/1) ... [2020-07-28 17:54:24,740 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 17:54:24,740 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 17:54:24,741 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 17:54:24,741 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 17:54:24,751 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:24" (1/1) ... [2020-07-28 17:54:24,751 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:24" (1/1) ... [2020-07-28 17:54:24,754 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:24" (1/1) ... [2020-07-28 17:54:24,755 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:24" (1/1) ... [2020-07-28 17:54:24,765 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:24" (1/1) ... [2020-07-28 17:54:24,771 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:24" (1/1) ... [2020-07-28 17:54:24,775 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:24" (1/1) ... [2020-07-28 17:54:24,778 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 17:54:24,778 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 17:54:24,779 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 17:54:24,779 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 17:54:24,780 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 17:54:24,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-28 17:54:24,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-07-28 17:54:24,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 17:54:24,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 17:54:24,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-28 17:54:24,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-28 17:54:25,417 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 17:54:25,418 INFO L295 CfgBuilder]: Removed 18 assume(true) statements. [2020-07-28 17:54:25,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:54:25 BoogieIcfgContainer [2020-07-28 17:54:25,422 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 17:54:25,425 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 17:54:25,425 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 17:54:25,429 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 17:54:25,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 05:54:24" (1/3) ... [2020-07-28 17:54:25,431 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15bda252 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:54:25, skipping insertion in model container [2020-07-28 17:54:25,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:24" (2/3) ... [2020-07-28 17:54:25,431 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15bda252 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:54:25, skipping insertion in model container [2020-07-28 17:54:25,431 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:54:25" (3/3) ... [2020-07-28 17:54:25,434 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1232b.c [2020-07-28 17:54:25,444 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 17:54:25,453 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 17:54:25,469 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 17:54:25,497 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 17:54:25,497 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 17:54:25,497 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 17:54:25,497 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 17:54:25,498 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 17:54:25,498 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 17:54:25,498 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 17:54:25,498 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 17:54:25,514 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2020-07-28 17:54:25,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-28 17:54:25,520 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:54:25,521 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:54:25,522 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:54:25,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:54:25,527 INFO L82 PathProgramCache]: Analyzing trace with hash -958075201, now seen corresponding path program 1 times [2020-07-28 17:54:25,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:54:25,535 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066409795] [2020-07-28 17:54:25,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:54:25,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:54:25,661 INFO L280 TraceCheckUtils]: 0: Hoare triple {35#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {35#true} is VALID [2020-07-28 17:54:25,662 INFO L280 TraceCheckUtils]: 1: Hoare triple {35#true} havoc main_#res;havoc main_#t~ret7, main_#t~ret8, main_#t~short9, main_~x~0, main_~y~0, main_~res~0;main_~x~0 := ~someUnaryFLOAToperation(0.0);main_~y~0 := 0.0;fmin_float_#in~x, fmin_float_#in~y := main_~x~0, main_~y~0;havoc fmin_float_#res;havoc fmin_float_#t~ret2, fmin_float_#t~ret3, fmin_float_#t~ite4, fmin_float_~x, fmin_float_~y;fmin_float_~x := fmin_float_#in~x;fmin_float_~y := fmin_float_#in~y;__fpclassify_float_#in~x := fmin_float_~x;havoc __fpclassify_float_#res;havoc __fpclassify_float_#t~mem0, __fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, __fpclassify_float_~x, __fpclassify_float_~w~0;__fpclassify_float_~x := __fpclassify_float_#in~x;havoc __fpclassify_float_~w~0; {35#true} is VALID [2020-07-28 17:54:25,663 INFO L280 TraceCheckUtils]: 2: Hoare triple {35#true} assume !true; {36#false} is VALID [2020-07-28 17:54:25,663 INFO L280 TraceCheckUtils]: 3: Hoare triple {36#false} assume 0 == __fpclassify_float_~w~0 % 4294967296 || 2147483648 == __fpclassify_float_~w~0 % 4294967296;__fpclassify_float_#res := 2; {36#false} is VALID [2020-07-28 17:54:25,664 INFO L280 TraceCheckUtils]: 4: Hoare triple {36#false} fmin_float_#t~ret2 := __fpclassify_float_#res;assume -2147483648 <= fmin_float_#t~ret2 && fmin_float_#t~ret2 <= 2147483647; {36#false} is VALID [2020-07-28 17:54:25,664 INFO L280 TraceCheckUtils]: 5: Hoare triple {36#false} assume 0 == fmin_float_#t~ret2;havoc fmin_float_#t~ret2;fmin_float_#res := fmin_float_~y; {36#false} is VALID [2020-07-28 17:54:25,664 INFO L280 TraceCheckUtils]: 6: Hoare triple {36#false} main_#t~ret7 := fmin_float_#res;main_~res~0 := main_#t~ret7;havoc main_#t~ret7;main_#t~short9 := ~someBinaryFLOATComparisonOperation(main_~res~0, ~someUnaryFLOAToperation(0.0)); {36#false} is VALID [2020-07-28 17:54:25,665 INFO L280 TraceCheckUtils]: 7: Hoare triple {36#false} assume !main_#t~short9; {36#false} is VALID [2020-07-28 17:54:25,665 INFO L280 TraceCheckUtils]: 8: Hoare triple {36#false} assume !main_#t~short9;havoc main_#t~ret8;havoc main_#t~short9; {36#false} is VALID [2020-07-28 17:54:25,666 INFO L280 TraceCheckUtils]: 9: Hoare triple {36#false} assume !false; {36#false} is VALID [2020-07-28 17:54:25,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:54:25,669 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066409795] [2020-07-28 17:54:25,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:54:25,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-28 17:54:25,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072211056] [2020-07-28 17:54:25,677 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-07-28 17:54:25,679 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:54:25,683 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 17:54:25,704 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:54:25,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 17:54:25,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:54:25,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 17:54:25,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 17:54:25,716 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2020-07-28 17:54:25,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:54:25,803 INFO L93 Difference]: Finished difference Result 62 states and 98 transitions. [2020-07-28 17:54:25,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 17:54:25,804 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-07-28 17:54:25,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:54:25,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:54:25,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 98 transitions. [2020-07-28 17:54:25,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:54:25,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 98 transitions. [2020-07-28 17:54:25,819 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 98 transitions. [2020-07-28 17:54:25,963 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:54:25,976 INFO L225 Difference]: With dead ends: 62 [2020-07-28 17:54:25,976 INFO L226 Difference]: Without dead ends: 29 [2020-07-28 17:54:25,980 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 17:54:25,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-28 17:54:26,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-07-28 17:54:26,018 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:54:26,019 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2020-07-28 17:54:26,019 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2020-07-28 17:54:26,020 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2020-07-28 17:54:26,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:54:26,024 INFO L93 Difference]: Finished difference Result 29 states and 40 transitions. [2020-07-28 17:54:26,024 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2020-07-28 17:54:26,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:54:26,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:54:26,026 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2020-07-28 17:54:26,026 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2020-07-28 17:54:26,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:54:26,029 INFO L93 Difference]: Finished difference Result 29 states and 40 transitions. [2020-07-28 17:54:26,030 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2020-07-28 17:54:26,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:54:26,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:54:26,031 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:54:26,031 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:54:26,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-28 17:54:26,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2020-07-28 17:54:26,036 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 10 [2020-07-28 17:54:26,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:54:26,037 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2020-07-28 17:54:26,037 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 17:54:26,037 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2020-07-28 17:54:26,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-28 17:54:26,038 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:54:26,038 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:54:26,039 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 17:54:26,039 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:54:26,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:54:26,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1001584898, now seen corresponding path program 1 times [2020-07-28 17:54:26,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:54:26,041 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651936927] [2020-07-28 17:54:26,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:54:26,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:54:26,140 INFO L280 TraceCheckUtils]: 0: Hoare triple {211#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {211#true} is VALID [2020-07-28 17:54:26,140 INFO L280 TraceCheckUtils]: 1: Hoare triple {211#true} havoc main_#res;havoc main_#t~ret7, main_#t~ret8, main_#t~short9, main_~x~0, main_~y~0, main_~res~0;main_~x~0 := ~someUnaryFLOAToperation(0.0);main_~y~0 := 0.0;fmin_float_#in~x, fmin_float_#in~y := main_~x~0, main_~y~0;havoc fmin_float_#res;havoc fmin_float_#t~ret2, fmin_float_#t~ret3, fmin_float_#t~ite4, fmin_float_~x, fmin_float_~y;fmin_float_~x := fmin_float_#in~x;fmin_float_~y := fmin_float_#in~y;__fpclassify_float_#in~x := fmin_float_~x;havoc __fpclassify_float_#res;havoc __fpclassify_float_#t~mem0, __fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, __fpclassify_float_~x, __fpclassify_float_~w~0;__fpclassify_float_~x := __fpclassify_float_#in~x;havoc __fpclassify_float_~w~0; {211#true} is VALID [2020-07-28 17:54:26,141 INFO L280 TraceCheckUtils]: 2: Hoare triple {211#true} call __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset := #Ultimate.allocOnStack(4);call write~real(__fpclassify_float_~x, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4);call __fpclassify_float_#t~mem0 := read~int(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4);__fpclassify_float_~w~0 := __fpclassify_float_#t~mem0;call write~real(__fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4);havoc __fpclassify_float_#t~mem0;havoc __fpclassify_float_#t~union1;call ULTIMATE.dealloc(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset);havoc __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset; {211#true} is VALID [2020-07-28 17:54:26,141 INFO L280 TraceCheckUtils]: 3: Hoare triple {211#true} goto; {211#true} is VALID [2020-07-28 17:54:26,142 INFO L280 TraceCheckUtils]: 4: Hoare triple {211#true} assume 0 == __fpclassify_float_~w~0 % 4294967296 || 2147483648 == __fpclassify_float_~w~0 % 4294967296;__fpclassify_float_#res := 2; {213#(<= 2 |ULTIMATE.start___fpclassify_float_#res|)} is VALID [2020-07-28 17:54:26,143 INFO L280 TraceCheckUtils]: 5: Hoare triple {213#(<= 2 |ULTIMATE.start___fpclassify_float_#res|)} fmin_float_#t~ret2 := __fpclassify_float_#res;assume -2147483648 <= fmin_float_#t~ret2 && fmin_float_#t~ret2 <= 2147483647; {214#(<= 2 |ULTIMATE.start_fmin_float_#t~ret2|)} is VALID [2020-07-28 17:54:26,144 INFO L280 TraceCheckUtils]: 6: Hoare triple {214#(<= 2 |ULTIMATE.start_fmin_float_#t~ret2|)} assume 0 == fmin_float_#t~ret2;havoc fmin_float_#t~ret2;fmin_float_#res := fmin_float_~y; {212#false} is VALID [2020-07-28 17:54:26,145 INFO L280 TraceCheckUtils]: 7: Hoare triple {212#false} main_#t~ret7 := fmin_float_#res;main_~res~0 := main_#t~ret7;havoc main_#t~ret7;main_#t~short9 := ~someBinaryFLOATComparisonOperation(main_~res~0, ~someUnaryFLOAToperation(0.0)); {212#false} is VALID [2020-07-28 17:54:26,145 INFO L280 TraceCheckUtils]: 8: Hoare triple {212#false} assume !main_#t~short9; {212#false} is VALID [2020-07-28 17:54:26,145 INFO L280 TraceCheckUtils]: 9: Hoare triple {212#false} assume !main_#t~short9;havoc main_#t~ret8;havoc main_#t~short9; {212#false} is VALID [2020-07-28 17:54:26,146 INFO L280 TraceCheckUtils]: 10: Hoare triple {212#false} assume !false; {212#false} is VALID [2020-07-28 17:54:26,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:54:26,147 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651936927] [2020-07-28 17:54:26,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:54:26,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-28 17:54:26,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598219866] [2020-07-28 17:54:26,150 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-07-28 17:54:26,150 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:54:26,151 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 17:54:26,174 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:54:26,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 17:54:26,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:54:26,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 17:54:26,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-28 17:54:26,175 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand 4 states. [2020-07-28 17:54:26,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:54:26,374 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2020-07-28 17:54:26,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-28 17:54:26,374 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-07-28 17:54:26,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:54:26,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 17:54:26,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2020-07-28 17:54:26,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 17:54:26,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2020-07-28 17:54:26,379 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 67 transitions. [2020-07-28 17:54:26,475 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:54:26,477 INFO L225 Difference]: With dead ends: 53 [2020-07-28 17:54:26,477 INFO L226 Difference]: Without dead ends: 44 [2020-07-28 17:54:26,479 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-28 17:54:26,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-07-28 17:54:26,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 31. [2020-07-28 17:54:26,489 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:54:26,489 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 31 states. [2020-07-28 17:54:26,489 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 31 states. [2020-07-28 17:54:26,489 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 31 states. [2020-07-28 17:54:26,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:54:26,493 INFO L93 Difference]: Finished difference Result 44 states and 57 transitions. [2020-07-28 17:54:26,494 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 57 transitions. [2020-07-28 17:54:26,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:54:26,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:54:26,495 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 44 states. [2020-07-28 17:54:26,495 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 44 states. [2020-07-28 17:54:26,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:54:26,499 INFO L93 Difference]: Finished difference Result 44 states and 57 transitions. [2020-07-28 17:54:26,499 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 57 transitions. [2020-07-28 17:54:26,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:54:26,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:54:26,501 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:54:26,501 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:54:26,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-28 17:54:26,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2020-07-28 17:54:26,504 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 11 [2020-07-28 17:54:26,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:54:26,504 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2020-07-28 17:54:26,505 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 17:54:26,505 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2020-07-28 17:54:26,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-28 17:54:26,506 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:54:26,506 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:54:26,506 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-28 17:54:26,507 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:54:26,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:54:26,508 INFO L82 PathProgramCache]: Analyzing trace with hash -555760345, now seen corresponding path program 1 times [2020-07-28 17:54:26,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:54:26,508 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126515081] [2020-07-28 17:54:26,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:54:26,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:54:26,589 INFO L280 TraceCheckUtils]: 0: Hoare triple {414#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {414#true} is VALID [2020-07-28 17:54:26,589 INFO L280 TraceCheckUtils]: 1: Hoare triple {414#true} havoc main_#res;havoc main_#t~ret7, main_#t~ret8, main_#t~short9, main_~x~0, main_~y~0, main_~res~0;main_~x~0 := ~someUnaryFLOAToperation(0.0);main_~y~0 := 0.0;fmin_float_#in~x, fmin_float_#in~y := main_~x~0, main_~y~0;havoc fmin_float_#res;havoc fmin_float_#t~ret2, fmin_float_#t~ret3, fmin_float_#t~ite4, fmin_float_~x, fmin_float_~y;fmin_float_~x := fmin_float_#in~x;fmin_float_~y := fmin_float_#in~y;__fpclassify_float_#in~x := fmin_float_~x;havoc __fpclassify_float_#res;havoc __fpclassify_float_#t~mem0, __fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, __fpclassify_float_~x, __fpclassify_float_~w~0;__fpclassify_float_~x := __fpclassify_float_#in~x;havoc __fpclassify_float_~w~0; {414#true} is VALID [2020-07-28 17:54:26,590 INFO L280 TraceCheckUtils]: 2: Hoare triple {414#true} call __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset := #Ultimate.allocOnStack(4);call write~real(__fpclassify_float_~x, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4);call __fpclassify_float_#t~mem0 := read~int(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4);__fpclassify_float_~w~0 := __fpclassify_float_#t~mem0;call write~real(__fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4);havoc __fpclassify_float_#t~mem0;havoc __fpclassify_float_#t~union1;call ULTIMATE.dealloc(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset);havoc __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset; {414#true} is VALID [2020-07-28 17:54:26,590 INFO L280 TraceCheckUtils]: 3: Hoare triple {414#true} goto; {414#true} is VALID [2020-07-28 17:54:26,591 INFO L280 TraceCheckUtils]: 4: Hoare triple {414#true} assume !(0 == __fpclassify_float_~w~0 % 4294967296 || 2147483648 == __fpclassify_float_~w~0 % 4294967296); {414#true} is VALID [2020-07-28 17:54:26,591 INFO L280 TraceCheckUtils]: 5: Hoare triple {414#true} assume !((__fpclassify_float_~w~0 % 4294967296 >= 8388608 && __fpclassify_float_~w~0 % 4294967296 <= 2139095039) || (__fpclassify_float_~w~0 % 4294967296 >= 2155872256 && __fpclassify_float_~w~0 % 4294967296 <= 4286578687)); {414#true} is VALID [2020-07-28 17:54:26,591 INFO L280 TraceCheckUtils]: 6: Hoare triple {414#true} assume !((__fpclassify_float_~w~0 % 4294967296 >= 1 && __fpclassify_float_~w~0 % 4294967296 <= 8388607) || (__fpclassify_float_~w~0 % 4294967296 >= 2147483649 && __fpclassify_float_~w~0 % 4294967296 <= 2155872255)); {414#true} is VALID [2020-07-28 17:54:26,593 INFO L280 TraceCheckUtils]: 7: Hoare triple {414#true} assume 2139095040 == __fpclassify_float_~w~0 % 4294967296 || 4286578688 == __fpclassify_float_~w~0 % 4294967296;__fpclassify_float_#res := 1; {416#(<= 1 |ULTIMATE.start___fpclassify_float_#res|)} is VALID [2020-07-28 17:54:26,594 INFO L280 TraceCheckUtils]: 8: Hoare triple {416#(<= 1 |ULTIMATE.start___fpclassify_float_#res|)} fmin_float_#t~ret2 := __fpclassify_float_#res;assume -2147483648 <= fmin_float_#t~ret2 && fmin_float_#t~ret2 <= 2147483647; {417#(<= 1 |ULTIMATE.start_fmin_float_#t~ret2|)} is VALID [2020-07-28 17:54:26,595 INFO L280 TraceCheckUtils]: 9: Hoare triple {417#(<= 1 |ULTIMATE.start_fmin_float_#t~ret2|)} assume 0 == fmin_float_#t~ret2;havoc fmin_float_#t~ret2;fmin_float_#res := fmin_float_~y; {415#false} is VALID [2020-07-28 17:54:26,595 INFO L280 TraceCheckUtils]: 10: Hoare triple {415#false} main_#t~ret7 := fmin_float_#res;main_~res~0 := main_#t~ret7;havoc main_#t~ret7;main_#t~short9 := ~someBinaryFLOATComparisonOperation(main_~res~0, ~someUnaryFLOAToperation(0.0)); {415#false} is VALID [2020-07-28 17:54:26,595 INFO L280 TraceCheckUtils]: 11: Hoare triple {415#false} assume !main_#t~short9; {415#false} is VALID [2020-07-28 17:54:26,596 INFO L280 TraceCheckUtils]: 12: Hoare triple {415#false} assume !main_#t~short9;havoc main_#t~ret8;havoc main_#t~short9; {415#false} is VALID [2020-07-28 17:54:26,596 INFO L280 TraceCheckUtils]: 13: Hoare triple {415#false} assume !false; {415#false} is VALID [2020-07-28 17:54:26,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:54:26,598 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126515081] [2020-07-28 17:54:26,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:54:26,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-28 17:54:26,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478270826] [2020-07-28 17:54:26,599 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-07-28 17:54:26,599 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:54:26,600 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 17:54:26,618 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:54:26,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 17:54:26,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:54:26,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 17:54:26,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-28 17:54:26,620 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand 4 states. [2020-07-28 17:54:26,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:54:26,804 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2020-07-28 17:54:26,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-28 17:54:26,804 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-07-28 17:54:26,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:54:26,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 17:54:26,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2020-07-28 17:54:26,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 17:54:26,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2020-07-28 17:54:26,810 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 67 transitions. [2020-07-28 17:54:26,901 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:54:26,903 INFO L225 Difference]: With dead ends: 55 [2020-07-28 17:54:26,904 INFO L226 Difference]: Without dead ends: 46 [2020-07-28 17:54:26,904 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-28 17:54:26,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-07-28 17:54:26,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 31. [2020-07-28 17:54:26,915 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:54:26,915 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 31 states. [2020-07-28 17:54:26,915 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 31 states. [2020-07-28 17:54:26,916 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 31 states. [2020-07-28 17:54:26,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:54:26,919 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2020-07-28 17:54:26,919 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 59 transitions. [2020-07-28 17:54:26,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:54:26,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:54:26,920 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 46 states. [2020-07-28 17:54:26,921 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 46 states. [2020-07-28 17:54:26,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:54:26,924 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2020-07-28 17:54:26,924 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 59 transitions. [2020-07-28 17:54:26,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:54:26,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:54:26,926 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:54:26,926 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:54:26,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-28 17:54:26,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2020-07-28 17:54:26,928 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 14 [2020-07-28 17:54:26,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:54:26,929 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2020-07-28 17:54:26,929 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 17:54:26,929 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2020-07-28 17:54:26,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-28 17:54:26,930 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:54:26,931 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:54:26,931 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-28 17:54:26,931 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:54:26,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:54:26,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1219247017, now seen corresponding path program 1 times [2020-07-28 17:54:26,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:54:26,933 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661506846] [2020-07-28 17:54:26,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:54:27,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 17:54:27,071 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 17:54:27,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 17:54:27,119 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 17:54:27,132 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-28 17:54:27,133 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.smtinterpol.model.Model.map(Model.java:227) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.ModelBuilder.add(ModelBuilder.java:123) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.ModelBuilder.fillInFunctions(ModelBuilder.java:109) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.ModelBuilder.(ModelBuilder.java:49) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.CClosure.fillInModel(CClosure.java:1312) at de.uni_freiburg.informatik.ultimate.smtinterpol.model.Model.(Model.java:120) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.buildModel(SMTInterpol.java:1139) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getValue(SMTInterpol.java:1004) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getValue(WrapperScript.java:193) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getValue(WrapperScript.java:193) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.getValues(SmtUtils.java:2112) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.getValue(TraceCheck.java:401) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.lambda$0(TraceCheck.java:375) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecution(TraceCheck.java:384) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:343) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:223) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:337) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:223) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:89) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) 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:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-28 17:54:27,141 INFO L168 Benchmark]: Toolchain (without parser) took 2814.29 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 75.5 MB). Free memory was 957.5 MB in the beginning and 852.8 MB in the end (delta: 104.7 MB). Peak memory consumption was 180.2 MB. Max. memory is 11.5 GB. [2020-07-28 17:54:27,142 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 17:54:27,143 INFO L168 Benchmark]: CACSL2BoogieTranslator took 353.66 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 75.5 MB). Free memory was 957.5 MB in the beginning and 1.1 GB in the end (delta: -113.3 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2020-07-28 17:54:27,143 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.64 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2020-07-28 17:54:27,144 INFO L168 Benchmark]: Boogie Preprocessor took 37.80 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 17:54:27,145 INFO L168 Benchmark]: RCFGBuilder took 643.82 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.1 MB). Peak memory consumption was 47.1 MB. Max. memory is 11.5 GB. [2020-07-28 17:54:27,146 INFO L168 Benchmark]: TraceAbstraction took 1712.71 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 852.8 MB in the end (delta: 163.8 MB). Peak memory consumption was 163.8 MB. Max. memory is 11.5 GB. [2020-07-28 17:54:27,150 INFO L336 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.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 353.66 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 75.5 MB). Free memory was 957.5 MB in the beginning and 1.1 GB in the end (delta: -113.3 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 57.64 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.80 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 643.82 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.1 MB). Peak memory consumption was 47.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1712.71 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 852.8 MB in the end (delta: 163.8 MB). Peak memory consumption was 163.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: null: de.uni_freiburg.informatik.ultimate.smtinterpol.model.Model.map(Model.java:227) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 17:54:29,087 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 17:54:29,089 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 17:54:29,103 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 17:54:29,103 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 17:54:29,104 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 17:54:29,105 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 17:54:29,109 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 17:54:29,110 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 17:54:29,111 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 17:54:29,112 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 17:54:29,113 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 17:54:29,119 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 17:54:29,121 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 17:54:29,123 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 17:54:29,124 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 17:54:29,127 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 17:54:29,129 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 17:54:29,131 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 17:54:29,135 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 17:54:29,137 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 17:54:29,141 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 17:54:29,142 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 17:54:29,142 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 17:54:29,149 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 17:54:29,150 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 17:54:29,150 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 17:54:29,151 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 17:54:29,151 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 17:54:29,152 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 17:54:29,152 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 17:54:29,153 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 17:54:29,154 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 17:54:29,155 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 17:54:29,156 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 17:54:29,156 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 17:54:29,157 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 17:54:29,157 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 17:54:29,157 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 17:54:29,158 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 17:54:29,159 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 17:54:29,160 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-07-28 17:54:29,175 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 17:54:29,175 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 17:54:29,176 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 17:54:29,176 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 17:54:29,177 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 17:54:29,177 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 17:54:29,177 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 17:54:29,177 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 17:54:29,177 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 17:54:29,178 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 17:54:29,178 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 17:54:29,178 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 17:54:29,178 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-07-28 17:54:29,179 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-07-28 17:54:29,179 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 17:54:29,179 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 17:54:29,179 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 17:54:29,180 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 17:54:29,180 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 17:54:29,180 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 17:54:29,180 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 17:54:29,180 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 17:54:29,181 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 17:54:29,181 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 17:54:29,181 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 17:54:29,181 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 17:54:29,182 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-07-28 17:54:29,182 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-07-28 17:54:29,182 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 17:54:29,182 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 17:54:29,182 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-28 17:54:29,183 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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(__VERIFIER_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 -> 36a0a55241cede481b157c1ab9f348d708a5b166 [2020-07-28 17:54:29,470 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 17:54:29,488 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 17:54:29,491 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 17:54:29,493 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 17:54:29,494 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 17:54:29,495 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1232b.c [2020-07-28 17:54:29,558 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad576e34a/cfa34536fadd4376bf627ff65f83d003/FLAG6e8c7c428 [2020-07-28 17:54:29,981 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 17:54:29,982 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1232b.c [2020-07-28 17:54:29,993 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad576e34a/cfa34536fadd4376bf627ff65f83d003/FLAG6e8c7c428 [2020-07-28 17:54:30,344 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad576e34a/cfa34536fadd4376bf627ff65f83d003 [2020-07-28 17:54:30,347 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 17:54:30,350 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 17:54:30,352 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 17:54:30,352 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 17:54:30,355 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 17:54:30,356 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:54:30" (1/1) ... [2020-07-28 17:54:30,360 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2038bf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:30, skipping insertion in model container [2020-07-28 17:54:30,360 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:54:30" (1/1) ... [2020-07-28 17:54:30,369 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 17:54:30,392 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 17:54:30,621 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:54:30,628 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 17:54:30,663 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:54:30,745 INFO L208 MainTranslator]: Completed translation [2020-07-28 17:54:30,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:30 WrapperNode [2020-07-28 17:54:30,746 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 17:54:30,747 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 17:54:30,747 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 17:54:30,748 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 17:54:30,756 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:30" (1/1) ... [2020-07-28 17:54:30,768 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:30" (1/1) ... [2020-07-28 17:54:30,803 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 17:54:30,804 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 17:54:30,804 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 17:54:30,804 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 17:54:30,811 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:30" (1/1) ... [2020-07-28 17:54:30,811 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:30" (1/1) ... [2020-07-28 17:54:30,816 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:30" (1/1) ... [2020-07-28 17:54:30,816 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:30" (1/1) ... [2020-07-28 17:54:30,828 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:30" (1/1) ... [2020-07-28 17:54:30,834 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:30" (1/1) ... [2020-07-28 17:54:30,837 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:30" (1/1) ... [2020-07-28 17:54:30,840 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 17:54:30,841 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 17:54:30,841 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 17:54:30,841 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 17:54:30,842 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 17:54:30,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-28 17:54:30,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2020-07-28 17:54:30,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 17:54:30,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 17:54:30,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2020-07-28 17:54:30,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-28 17:54:31,440 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 17:54:31,440 INFO L295 CfgBuilder]: Removed 18 assume(true) statements. [2020-07-28 17:54:31,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:54:31 BoogieIcfgContainer [2020-07-28 17:54:31,444 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 17:54:31,445 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 17:54:31,445 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 17:54:31,448 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 17:54:31,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 05:54:30" (1/3) ... [2020-07-28 17:54:31,449 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e06965e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:54:31, skipping insertion in model container [2020-07-28 17:54:31,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:54:30" (2/3) ... [2020-07-28 17:54:31,450 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e06965e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:54:31, skipping insertion in model container [2020-07-28 17:54:31,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:54:31" (3/3) ... [2020-07-28 17:54:31,452 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1232b.c [2020-07-28 17:54:31,461 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 17:54:31,469 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 17:54:31,479 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 17:54:31,498 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 17:54:31,498 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 17:54:31,498 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 17:54:31,498 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 17:54:31,498 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 17:54:31,499 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 17:54:31,499 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 17:54:31,499 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 17:54:31,513 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2020-07-28 17:54:31,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-28 17:54:31,518 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:54:31,519 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:54:31,519 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:54:31,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:54:31,524 INFO L82 PathProgramCache]: Analyzing trace with hash -958075201, now seen corresponding path program 1 times [2020-07-28 17:54:31,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 17:54:31,535 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [396372618] [2020-07-28 17:54:31,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-07-28 17:54:31,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:54:31,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 1 conjunts are in the unsatisfiable core [2020-07-28 17:54:31,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:54:31,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 17:54:31,687 INFO L280 TraceCheckUtils]: 0: Hoare triple {35#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {35#true} is VALID [2020-07-28 17:54:31,688 INFO L280 TraceCheckUtils]: 1: Hoare triple {35#true} havoc main_#res;havoc main_#t~ret7, main_#t~ret8, main_#t~short9, main_~x~0, main_~y~0, main_~res~0;main_~x~0 := ~fp.neg~FLOAT(~Pluszero~FLOAT());main_~y~0 := ~Pluszero~FLOAT();fmin_float_#in~x, fmin_float_#in~y := main_~x~0, main_~y~0;havoc fmin_float_#res;havoc fmin_float_#t~ret2, fmin_float_#t~ret3, fmin_float_#t~ite4, fmin_float_~x, fmin_float_~y;fmin_float_~x := fmin_float_#in~x;fmin_float_~y := fmin_float_#in~y;__fpclassify_float_#in~x := fmin_float_~x;havoc __fpclassify_float_#res;havoc __fpclassify_float_#t~mem0, __fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, __fpclassify_float_~x, __fpclassify_float_~w~0;__fpclassify_float_~x := __fpclassify_float_#in~x;havoc __fpclassify_float_~w~0; {35#true} is VALID [2020-07-28 17:54:31,689 INFO L280 TraceCheckUtils]: 2: Hoare triple {35#true} assume !true; {36#false} is VALID [2020-07-28 17:54:31,689 INFO L280 TraceCheckUtils]: 3: Hoare triple {36#false} assume 0bv32 == __fpclassify_float_~w~0 || 2147483648bv32 == __fpclassify_float_~w~0;__fpclassify_float_#res := 2bv32; {36#false} is VALID [2020-07-28 17:54:31,690 INFO L280 TraceCheckUtils]: 4: Hoare triple {36#false} fmin_float_#t~ret2 := __fpclassify_float_#res; {36#false} is VALID [2020-07-28 17:54:31,690 INFO L280 TraceCheckUtils]: 5: Hoare triple {36#false} assume 0bv32 == fmin_float_#t~ret2;havoc fmin_float_#t~ret2;fmin_float_#res := fmin_float_~y; {36#false} is VALID [2020-07-28 17:54:31,691 INFO L280 TraceCheckUtils]: 6: Hoare triple {36#false} main_#t~ret7 := fmin_float_#res;main_~res~0 := main_#t~ret7;havoc main_#t~ret7;main_#t~short9 := ~fp.eq~FLOAT(main_~res~0, ~fp.neg~FLOAT(~Pluszero~FLOAT())); {36#false} is VALID [2020-07-28 17:54:31,691 INFO L280 TraceCheckUtils]: 7: Hoare triple {36#false} assume !main_#t~short9; {36#false} is VALID [2020-07-28 17:54:31,691 INFO L280 TraceCheckUtils]: 8: Hoare triple {36#false} assume !main_#t~short9;havoc main_#t~short9;havoc main_#t~ret8; {36#false} is VALID [2020-07-28 17:54:31,692 INFO L280 TraceCheckUtils]: 9: Hoare triple {36#false} assume !false; {36#false} is VALID [2020-07-28 17:54:31,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:54:31,695 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 17:54:31,721 INFO L280 TraceCheckUtils]: 9: Hoare triple {36#false} assume !false; {36#false} is VALID [2020-07-28 17:54:31,722 INFO L280 TraceCheckUtils]: 8: Hoare triple {36#false} assume !main_#t~short9;havoc main_#t~short9;havoc main_#t~ret8; {36#false} is VALID [2020-07-28 17:54:31,723 INFO L280 TraceCheckUtils]: 7: Hoare triple {36#false} assume !main_#t~short9; {36#false} is VALID [2020-07-28 17:54:31,723 INFO L280 TraceCheckUtils]: 6: Hoare triple {36#false} main_#t~ret7 := fmin_float_#res;main_~res~0 := main_#t~ret7;havoc main_#t~ret7;main_#t~short9 := ~fp.eq~FLOAT(main_~res~0, ~fp.neg~FLOAT(~Pluszero~FLOAT())); {36#false} is VALID [2020-07-28 17:54:31,724 INFO L280 TraceCheckUtils]: 5: Hoare triple {36#false} assume 0bv32 == fmin_float_#t~ret2;havoc fmin_float_#t~ret2;fmin_float_#res := fmin_float_~y; {36#false} is VALID [2020-07-28 17:54:31,724 INFO L280 TraceCheckUtils]: 4: Hoare triple {36#false} fmin_float_#t~ret2 := __fpclassify_float_#res; {36#false} is VALID [2020-07-28 17:54:31,727 INFO L280 TraceCheckUtils]: 3: Hoare triple {36#false} assume 0bv32 == __fpclassify_float_~w~0 || 2147483648bv32 == __fpclassify_float_~w~0;__fpclassify_float_#res := 2bv32; {36#false} is VALID [2020-07-28 17:54:31,729 INFO L280 TraceCheckUtils]: 2: Hoare triple {35#true} assume !true; {36#false} is VALID [2020-07-28 17:54:31,729 INFO L280 TraceCheckUtils]: 1: Hoare triple {35#true} havoc main_#res;havoc main_#t~ret7, main_#t~ret8, main_#t~short9, main_~x~0, main_~y~0, main_~res~0;main_~x~0 := ~fp.neg~FLOAT(~Pluszero~FLOAT());main_~y~0 := ~Pluszero~FLOAT();fmin_float_#in~x, fmin_float_#in~y := main_~x~0, main_~y~0;havoc fmin_float_#res;havoc fmin_float_#t~ret2, fmin_float_#t~ret3, fmin_float_#t~ite4, fmin_float_~x, fmin_float_~y;fmin_float_~x := fmin_float_#in~x;fmin_float_~y := fmin_float_#in~y;__fpclassify_float_#in~x := fmin_float_~x;havoc __fpclassify_float_#res;havoc __fpclassify_float_#t~mem0, __fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, __fpclassify_float_~x, __fpclassify_float_~w~0;__fpclassify_float_~x := __fpclassify_float_#in~x;havoc __fpclassify_float_~w~0; {35#true} is VALID [2020-07-28 17:54:31,730 INFO L280 TraceCheckUtils]: 0: Hoare triple {35#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {35#true} is VALID [2020-07-28 17:54:31,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:54:31,731 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [396372618] [2020-07-28 17:54:31,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:54:31,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-07-28 17:54:31,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893995830] [2020-07-28 17:54:31,741 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-07-28 17:54:31,743 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:54:31,747 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 17:54:31,774 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:54:31,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 17:54:31,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 17:54:31,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 17:54:31,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 17:54:31,787 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2020-07-28 17:54:31,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:54:31,902 INFO L93 Difference]: Finished difference Result 62 states and 98 transitions. [2020-07-28 17:54:31,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 17:54:31,902 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-07-28 17:54:31,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:54:31,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:54:31,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 98 transitions. [2020-07-28 17:54:31,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:54:31,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 98 transitions. [2020-07-28 17:54:31,916 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 98 transitions. [2020-07-28 17:54:32,129 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:54:32,150 INFO L225 Difference]: With dead ends: 62 [2020-07-28 17:54:32,150 INFO L226 Difference]: Without dead ends: 29 [2020-07-28 17:54:32,156 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 17:54:32,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-07-28 17:54:32,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-07-28 17:54:32,191 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:54:32,192 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2020-07-28 17:54:32,193 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2020-07-28 17:54:32,193 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2020-07-28 17:54:32,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:54:32,197 INFO L93 Difference]: Finished difference Result 29 states and 40 transitions. [2020-07-28 17:54:32,197 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2020-07-28 17:54:32,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:54:32,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:54:32,198 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2020-07-28 17:54:32,199 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2020-07-28 17:54:32,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:54:32,202 INFO L93 Difference]: Finished difference Result 29 states and 40 transitions. [2020-07-28 17:54:32,202 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2020-07-28 17:54:32,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:54:32,203 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:54:32,203 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:54:32,204 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:54:32,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-28 17:54:32,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2020-07-28 17:54:32,208 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 10 [2020-07-28 17:54:32,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:54:32,209 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2020-07-28 17:54:32,209 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 17:54:32,209 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2020-07-28 17:54:32,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-28 17:54:32,210 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:54:32,210 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:54:32,428 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-07-28 17:54:32,429 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:54:32,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:54:32,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1001584898, now seen corresponding path program 1 times [2020-07-28 17:54:32,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 17:54:32,432 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1034295499] [2020-07-28 17:54:32,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-07-28 17:54:32,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:54:32,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-28 17:54:32,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:54:32,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 17:54:32,539 INFO L280 TraceCheckUtils]: 0: Hoare triple {265#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {265#true} is VALID [2020-07-28 17:54:32,540 INFO L280 TraceCheckUtils]: 1: Hoare triple {265#true} havoc main_#res;havoc main_#t~ret7, main_#t~ret8, main_#t~short9, main_~x~0, main_~y~0, main_~res~0;main_~x~0 := ~fp.neg~FLOAT(~Pluszero~FLOAT());main_~y~0 := ~Pluszero~FLOAT();fmin_float_#in~x, fmin_float_#in~y := main_~x~0, main_~y~0;havoc fmin_float_#res;havoc fmin_float_#t~ret2, fmin_float_#t~ret3, fmin_float_#t~ite4, fmin_float_~x, fmin_float_~y;fmin_float_~x := fmin_float_#in~x;fmin_float_~y := fmin_float_#in~y;__fpclassify_float_#in~x := fmin_float_~x;havoc __fpclassify_float_#res;havoc __fpclassify_float_#t~mem0, __fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, __fpclassify_float_~x, __fpclassify_float_~w~0;__fpclassify_float_~x := __fpclassify_float_#in~x;havoc __fpclassify_float_~w~0; {265#true} is VALID [2020-07-28 17:54:32,541 INFO L280 TraceCheckUtils]: 2: Hoare triple {265#true} call __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__fpclassify_float_~x, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);call __fpclassify_float_#t~mem0 := read~intINTTYPE4(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);__fpclassify_float_~w~0 := __fpclassify_float_#t~mem0;call write~intFLOATTYPE4(__fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);havoc __fpclassify_float_#t~mem0;havoc __fpclassify_float_#t~union1;call ULTIMATE.dealloc(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset);havoc __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset; {265#true} is VALID [2020-07-28 17:54:32,541 INFO L280 TraceCheckUtils]: 3: Hoare triple {265#true} goto; {265#true} is VALID [2020-07-28 17:54:32,542 INFO L280 TraceCheckUtils]: 4: Hoare triple {265#true} assume 0bv32 == __fpclassify_float_~w~0 || 2147483648bv32 == __fpclassify_float_~w~0;__fpclassify_float_#res := 2bv32; {282#(= (_ bv2 32) |ULTIMATE.start___fpclassify_float_#res|)} is VALID [2020-07-28 17:54:32,543 INFO L280 TraceCheckUtils]: 5: Hoare triple {282#(= (_ bv2 32) |ULTIMATE.start___fpclassify_float_#res|)} fmin_float_#t~ret2 := __fpclassify_float_#res; {286#(= (bvadd |ULTIMATE.start_fmin_float_#t~ret2| (_ bv4294967294 32)) (_ bv0 32))} is VALID [2020-07-28 17:54:32,544 INFO L280 TraceCheckUtils]: 6: Hoare triple {286#(= (bvadd |ULTIMATE.start_fmin_float_#t~ret2| (_ bv4294967294 32)) (_ bv0 32))} assume 0bv32 == fmin_float_#t~ret2;havoc fmin_float_#t~ret2;fmin_float_#res := fmin_float_~y; {266#false} is VALID [2020-07-28 17:54:32,545 INFO L280 TraceCheckUtils]: 7: Hoare triple {266#false} main_#t~ret7 := fmin_float_#res;main_~res~0 := main_#t~ret7;havoc main_#t~ret7;main_#t~short9 := ~fp.eq~FLOAT(main_~res~0, ~fp.neg~FLOAT(~Pluszero~FLOAT())); {266#false} is VALID [2020-07-28 17:54:32,545 INFO L280 TraceCheckUtils]: 8: Hoare triple {266#false} assume !main_#t~short9; {266#false} is VALID [2020-07-28 17:54:32,546 INFO L280 TraceCheckUtils]: 9: Hoare triple {266#false} assume !main_#t~short9;havoc main_#t~short9;havoc main_#t~ret8; {266#false} is VALID [2020-07-28 17:54:32,546 INFO L280 TraceCheckUtils]: 10: Hoare triple {266#false} assume !false; {266#false} is VALID [2020-07-28 17:54:32,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:54:32,547 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 17:54:32,580 INFO L280 TraceCheckUtils]: 10: Hoare triple {266#false} assume !false; {266#false} is VALID [2020-07-28 17:54:32,581 INFO L280 TraceCheckUtils]: 9: Hoare triple {266#false} assume !main_#t~short9;havoc main_#t~short9;havoc main_#t~ret8; {266#false} is VALID [2020-07-28 17:54:32,582 INFO L280 TraceCheckUtils]: 8: Hoare triple {266#false} assume !main_#t~short9; {266#false} is VALID [2020-07-28 17:54:32,582 INFO L280 TraceCheckUtils]: 7: Hoare triple {266#false} main_#t~ret7 := fmin_float_#res;main_~res~0 := main_#t~ret7;havoc main_#t~ret7;main_#t~short9 := ~fp.eq~FLOAT(main_~res~0, ~fp.neg~FLOAT(~Pluszero~FLOAT())); {266#false} is VALID [2020-07-28 17:54:32,583 INFO L280 TraceCheckUtils]: 6: Hoare triple {314#(not (= |ULTIMATE.start_fmin_float_#t~ret2| (_ bv0 32)))} assume 0bv32 == fmin_float_#t~ret2;havoc fmin_float_#t~ret2;fmin_float_#res := fmin_float_~y; {266#false} is VALID [2020-07-28 17:54:32,584 INFO L280 TraceCheckUtils]: 5: Hoare triple {318#(not (= (_ bv0 32) |ULTIMATE.start___fpclassify_float_#res|))} fmin_float_#t~ret2 := __fpclassify_float_#res; {314#(not (= |ULTIMATE.start_fmin_float_#t~ret2| (_ bv0 32)))} is VALID [2020-07-28 17:54:32,585 INFO L280 TraceCheckUtils]: 4: Hoare triple {265#true} assume 0bv32 == __fpclassify_float_~w~0 || 2147483648bv32 == __fpclassify_float_~w~0;__fpclassify_float_#res := 2bv32; {318#(not (= (_ bv0 32) |ULTIMATE.start___fpclassify_float_#res|))} is VALID [2020-07-28 17:54:32,586 INFO L280 TraceCheckUtils]: 3: Hoare triple {265#true} goto; {265#true} is VALID [2020-07-28 17:54:32,586 INFO L280 TraceCheckUtils]: 2: Hoare triple {265#true} call __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__fpclassify_float_~x, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);call __fpclassify_float_#t~mem0 := read~intINTTYPE4(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);__fpclassify_float_~w~0 := __fpclassify_float_#t~mem0;call write~intFLOATTYPE4(__fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);havoc __fpclassify_float_#t~mem0;havoc __fpclassify_float_#t~union1;call ULTIMATE.dealloc(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset);havoc __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset; {265#true} is VALID [2020-07-28 17:54:32,586 INFO L280 TraceCheckUtils]: 1: Hoare triple {265#true} havoc main_#res;havoc main_#t~ret7, main_#t~ret8, main_#t~short9, main_~x~0, main_~y~0, main_~res~0;main_~x~0 := ~fp.neg~FLOAT(~Pluszero~FLOAT());main_~y~0 := ~Pluszero~FLOAT();fmin_float_#in~x, fmin_float_#in~y := main_~x~0, main_~y~0;havoc fmin_float_#res;havoc fmin_float_#t~ret2, fmin_float_#t~ret3, fmin_float_#t~ite4, fmin_float_~x, fmin_float_~y;fmin_float_~x := fmin_float_#in~x;fmin_float_~y := fmin_float_#in~y;__fpclassify_float_#in~x := fmin_float_~x;havoc __fpclassify_float_#res;havoc __fpclassify_float_#t~mem0, __fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, __fpclassify_float_~x, __fpclassify_float_~w~0;__fpclassify_float_~x := __fpclassify_float_#in~x;havoc __fpclassify_float_~w~0; {265#true} is VALID [2020-07-28 17:54:32,587 INFO L280 TraceCheckUtils]: 0: Hoare triple {265#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {265#true} is VALID [2020-07-28 17:54:32,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:54:32,588 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1034295499] [2020-07-28 17:54:32,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:54:32,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-07-28 17:54:32,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686296861] [2020-07-28 17:54:32,591 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-07-28 17:54:32,591 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:54:32,592 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-28 17:54:32,612 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:54:32,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-28 17:54:32,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 17:54:32,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-28 17:54:32,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-28 17:54:32,614 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand 6 states. [2020-07-28 17:54:33,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:54:33,038 INFO L93 Difference]: Finished difference Result 68 states and 85 transitions. [2020-07-28 17:54:33,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-28 17:54:33,039 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-07-28 17:54:33,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:54:33,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 17:54:33,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 85 transitions. [2020-07-28 17:54:33,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 17:54:33,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 85 transitions. [2020-07-28 17:54:33,046 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 85 transitions. [2020-07-28 17:54:33,172 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:54:33,175 INFO L225 Difference]: With dead ends: 68 [2020-07-28 17:54:33,176 INFO L226 Difference]: Without dead ends: 59 [2020-07-28 17:54:33,177 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-07-28 17:54:33,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-07-28 17:54:33,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 31. [2020-07-28 17:54:33,187 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:54:33,187 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 31 states. [2020-07-28 17:54:33,188 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 31 states. [2020-07-28 17:54:33,188 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 31 states. [2020-07-28 17:54:33,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:54:33,192 INFO L93 Difference]: Finished difference Result 59 states and 74 transitions. [2020-07-28 17:54:33,193 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 74 transitions. [2020-07-28 17:54:33,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:54:33,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:54:33,194 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 59 states. [2020-07-28 17:54:33,194 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 59 states. [2020-07-28 17:54:33,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:54:33,199 INFO L93 Difference]: Finished difference Result 59 states and 74 transitions. [2020-07-28 17:54:33,199 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 74 transitions. [2020-07-28 17:54:33,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:54:33,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:54:33,201 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:54:33,201 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:54:33,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-28 17:54:33,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2020-07-28 17:54:33,204 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 11 [2020-07-28 17:54:33,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:54:33,204 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2020-07-28 17:54:33,205 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-28 17:54:33,205 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2020-07-28 17:54:33,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-28 17:54:33,206 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:54:33,206 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:54:33,421 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-07-28 17:54:33,421 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:54:33,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:54:33,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1219247017, now seen corresponding path program 1 times [2020-07-28 17:54:33,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 17:54:33,424 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1482435149] [2020-07-28 17:54:33,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-07-28 17:54:33,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:54:33,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-28 17:54:33,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:54:33,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 17:54:33,548 INFO L280 TraceCheckUtils]: 0: Hoare triple {582#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {582#true} is VALID [2020-07-28 17:54:33,550 INFO L280 TraceCheckUtils]: 1: Hoare triple {582#true} havoc main_#res;havoc main_#t~ret7, main_#t~ret8, main_#t~short9, main_~x~0, main_~y~0, main_~res~0;main_~x~0 := ~fp.neg~FLOAT(~Pluszero~FLOAT());main_~y~0 := ~Pluszero~FLOAT();fmin_float_#in~x, fmin_float_#in~y := main_~x~0, main_~y~0;havoc fmin_float_#res;havoc fmin_float_#t~ret2, fmin_float_#t~ret3, fmin_float_#t~ite4, fmin_float_~x, fmin_float_~y;fmin_float_~x := fmin_float_#in~x;fmin_float_~y := fmin_float_#in~y;__fpclassify_float_#in~x := fmin_float_~x;havoc __fpclassify_float_#res;havoc __fpclassify_float_#t~mem0, __fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, __fpclassify_float_~x, __fpclassify_float_~w~0;__fpclassify_float_~x := __fpclassify_float_#in~x;havoc __fpclassify_float_~w~0; {590#(= (fp.neg (_ +zero 8 24)) ULTIMATE.start___fpclassify_float_~x)} is VALID [2020-07-28 17:54:33,553 INFO L280 TraceCheckUtils]: 2: Hoare triple {590#(= (fp.neg (_ +zero 8 24)) ULTIMATE.start___fpclassify_float_~x)} call __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__fpclassify_float_~x, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);call __fpclassify_float_#t~mem0 := read~intINTTYPE4(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);__fpclassify_float_~w~0 := __fpclassify_float_#t~mem0;call write~intFLOATTYPE4(__fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);havoc __fpclassify_float_#t~mem0;havoc __fpclassify_float_#t~union1;call ULTIMATE.dealloc(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset);havoc __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset; {594#(= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))} is VALID [2020-07-28 17:54:33,554 INFO L280 TraceCheckUtils]: 3: Hoare triple {594#(= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))} goto; {594#(= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))} is VALID [2020-07-28 17:54:33,555 INFO L280 TraceCheckUtils]: 4: Hoare triple {594#(= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))} assume !(0bv32 == __fpclassify_float_~w~0 || 2147483648bv32 == __fpclassify_float_~w~0); {583#false} is VALID [2020-07-28 17:54:33,555 INFO L280 TraceCheckUtils]: 5: Hoare triple {583#false} assume !((~bvuge32(__fpclassify_float_~w~0, 8388608bv32) && ~bvule32(__fpclassify_float_~w~0, 2139095039bv32)) || (~bvuge32(__fpclassify_float_~w~0, 2155872256bv32) && ~bvule32(__fpclassify_float_~w~0, 4286578687bv32))); {583#false} is VALID [2020-07-28 17:54:33,556 INFO L280 TraceCheckUtils]: 6: Hoare triple {583#false} assume !((~bvuge32(__fpclassify_float_~w~0, 1bv32) && ~bvule32(__fpclassify_float_~w~0, 8388607bv32)) || (~bvuge32(__fpclassify_float_~w~0, 2147483649bv32) && ~bvule32(__fpclassify_float_~w~0, 2155872255bv32))); {583#false} is VALID [2020-07-28 17:54:33,556 INFO L280 TraceCheckUtils]: 7: Hoare triple {583#false} assume !(2139095040bv32 == __fpclassify_float_~w~0 || 4286578688bv32 == __fpclassify_float_~w~0);__fpclassify_float_#res := 0bv32; {583#false} is VALID [2020-07-28 17:54:33,556 INFO L280 TraceCheckUtils]: 8: Hoare triple {583#false} fmin_float_#t~ret2 := __fpclassify_float_#res; {583#false} is VALID [2020-07-28 17:54:33,557 INFO L280 TraceCheckUtils]: 9: Hoare triple {583#false} assume 0bv32 == fmin_float_#t~ret2;havoc fmin_float_#t~ret2;fmin_float_#res := fmin_float_~y; {583#false} is VALID [2020-07-28 17:54:33,557 INFO L280 TraceCheckUtils]: 10: Hoare triple {583#false} main_#t~ret7 := fmin_float_#res;main_~res~0 := main_#t~ret7;havoc main_#t~ret7;main_#t~short9 := ~fp.eq~FLOAT(main_~res~0, ~fp.neg~FLOAT(~Pluszero~FLOAT())); {583#false} is VALID [2020-07-28 17:54:33,558 INFO L280 TraceCheckUtils]: 11: Hoare triple {583#false} assume !main_#t~short9; {583#false} is VALID [2020-07-28 17:54:33,558 INFO L280 TraceCheckUtils]: 12: Hoare triple {583#false} assume !main_#t~short9;havoc main_#t~short9;havoc main_#t~ret8; {583#false} is VALID [2020-07-28 17:54:33,558 INFO L280 TraceCheckUtils]: 13: Hoare triple {583#false} assume !false; {583#false} is VALID [2020-07-28 17:54:33,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:54:33,560 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 17:54:33,627 INFO L280 TraceCheckUtils]: 13: Hoare triple {583#false} assume !false; {583#false} is VALID [2020-07-28 17:54:33,628 INFO L280 TraceCheckUtils]: 12: Hoare triple {583#false} assume !main_#t~short9;havoc main_#t~short9;havoc main_#t~ret8; {583#false} is VALID [2020-07-28 17:54:33,628 INFO L280 TraceCheckUtils]: 11: Hoare triple {583#false} assume !main_#t~short9; {583#false} is VALID [2020-07-28 17:54:33,628 INFO L280 TraceCheckUtils]: 10: Hoare triple {583#false} main_#t~ret7 := fmin_float_#res;main_~res~0 := main_#t~ret7;havoc main_#t~ret7;main_#t~short9 := ~fp.eq~FLOAT(main_~res~0, ~fp.neg~FLOAT(~Pluszero~FLOAT())); {583#false} is VALID [2020-07-28 17:54:33,628 INFO L280 TraceCheckUtils]: 9: Hoare triple {583#false} assume 0bv32 == fmin_float_#t~ret2;havoc fmin_float_#t~ret2;fmin_float_#res := fmin_float_~y; {583#false} is VALID [2020-07-28 17:54:33,629 INFO L280 TraceCheckUtils]: 8: Hoare triple {583#false} fmin_float_#t~ret2 := __fpclassify_float_#res; {583#false} is VALID [2020-07-28 17:54:33,629 INFO L280 TraceCheckUtils]: 7: Hoare triple {583#false} assume !(2139095040bv32 == __fpclassify_float_~w~0 || 4286578688bv32 == __fpclassify_float_~w~0);__fpclassify_float_#res := 0bv32; {583#false} is VALID [2020-07-28 17:54:33,629 INFO L280 TraceCheckUtils]: 6: Hoare triple {583#false} assume !((~bvuge32(__fpclassify_float_~w~0, 1bv32) && ~bvule32(__fpclassify_float_~w~0, 8388607bv32)) || (~bvuge32(__fpclassify_float_~w~0, 2147483649bv32) && ~bvule32(__fpclassify_float_~w~0, 2155872255bv32))); {583#false} is VALID [2020-07-28 17:54:33,630 INFO L280 TraceCheckUtils]: 5: Hoare triple {583#false} assume !((~bvuge32(__fpclassify_float_~w~0, 8388608bv32) && ~bvule32(__fpclassify_float_~w~0, 2139095039bv32)) || (~bvuge32(__fpclassify_float_~w~0, 2155872256bv32) && ~bvule32(__fpclassify_float_~w~0, 4286578687bv32))); {583#false} is VALID [2020-07-28 17:54:33,632 INFO L280 TraceCheckUtils]: 4: Hoare triple {594#(= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))} assume !(0bv32 == __fpclassify_float_~w~0 || 2147483648bv32 == __fpclassify_float_~w~0); {583#false} is VALID [2020-07-28 17:54:33,632 INFO L280 TraceCheckUtils]: 3: Hoare triple {594#(= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))} goto; {594#(= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))} is VALID [2020-07-28 17:54:33,635 INFO L280 TraceCheckUtils]: 2: Hoare triple {590#(= (fp.neg (_ +zero 8 24)) ULTIMATE.start___fpclassify_float_~x)} call __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__fpclassify_float_~x, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);call __fpclassify_float_#t~mem0 := read~intINTTYPE4(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);__fpclassify_float_~w~0 := __fpclassify_float_#t~mem0;call write~intFLOATTYPE4(__fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);havoc __fpclassify_float_#t~mem0;havoc __fpclassify_float_#t~union1;call ULTIMATE.dealloc(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset);havoc __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset; {594#(= (fp.neg (_ +zero 8 24)) (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))} is VALID [2020-07-28 17:54:33,636 INFO L280 TraceCheckUtils]: 1: Hoare triple {582#true} havoc main_#res;havoc main_#t~ret7, main_#t~ret8, main_#t~short9, main_~x~0, main_~y~0, main_~res~0;main_~x~0 := ~fp.neg~FLOAT(~Pluszero~FLOAT());main_~y~0 := ~Pluszero~FLOAT();fmin_float_#in~x, fmin_float_#in~y := main_~x~0, main_~y~0;havoc fmin_float_#res;havoc fmin_float_#t~ret2, fmin_float_#t~ret3, fmin_float_#t~ite4, fmin_float_~x, fmin_float_~y;fmin_float_~x := fmin_float_#in~x;fmin_float_~y := fmin_float_#in~y;__fpclassify_float_#in~x := fmin_float_~x;havoc __fpclassify_float_#res;havoc __fpclassify_float_#t~mem0, __fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, __fpclassify_float_~x, __fpclassify_float_~w~0;__fpclassify_float_~x := __fpclassify_float_#in~x;havoc __fpclassify_float_~w~0; {590#(= (fp.neg (_ +zero 8 24)) ULTIMATE.start___fpclassify_float_~x)} is VALID [2020-07-28 17:54:33,637 INFO L280 TraceCheckUtils]: 0: Hoare triple {582#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {582#true} is VALID [2020-07-28 17:54:33,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:54:33,638 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1482435149] [2020-07-28 17:54:33,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:54:33,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2020-07-28 17:54:33,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599202899] [2020-07-28 17:54:33,639 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-07-28 17:54:33,640 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:54:33,640 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 17:54:33,662 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:54:33,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 17:54:33,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 17:54:33,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 17:54:33,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-28 17:54:33,664 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand 4 states. [2020-07-28 17:54:33,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:54:33,902 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2020-07-28 17:54:33,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-28 17:54:33,903 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-07-28 17:54:33,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:54:33,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 17:54:33,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2020-07-28 17:54:33,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 17:54:33,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2020-07-28 17:54:33,910 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 67 transitions. [2020-07-28 17:54:34,029 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:54:34,030 INFO L225 Difference]: With dead ends: 52 [2020-07-28 17:54:34,031 INFO L226 Difference]: Without dead ends: 26 [2020-07-28 17:54:34,032 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-28 17:54:34,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-28 17:54:34,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-07-28 17:54:34,045 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:54:34,045 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2020-07-28 17:54:34,045 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2020-07-28 17:54:34,045 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2020-07-28 17:54:34,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:54:34,047 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2020-07-28 17:54:34,047 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2020-07-28 17:54:34,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:54:34,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:54:34,048 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2020-07-28 17:54:34,048 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2020-07-28 17:54:34,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:54:34,052 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2020-07-28 17:54:34,052 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2020-07-28 17:54:34,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:54:34,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:54:34,053 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:54:34,053 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:54:34,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-28 17:54:34,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2020-07-28 17:54:34,055 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 14 [2020-07-28 17:54:34,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:54:34,055 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2020-07-28 17:54:34,055 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 17:54:34,055 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2020-07-28 17:54:34,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-28 17:54:34,057 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:54:34,057 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:54:34,258 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-07-28 17:54:34,258 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:54:34,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:54:34,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1012446717, now seen corresponding path program 1 times [2020-07-28 17:54:34,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 17:54:34,259 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1814194762] [2020-07-28 17:54:34,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-07-28 17:54:34,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:54:34,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-28 17:54:34,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:54:34,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 17:54:34,355 INFO L280 TraceCheckUtils]: 0: Hoare triple {819#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {819#true} is VALID [2020-07-28 17:54:34,356 INFO L280 TraceCheckUtils]: 1: Hoare triple {819#true} havoc main_#res;havoc main_#t~ret7, main_#t~ret8, main_#t~short9, main_~x~0, main_~y~0, main_~res~0;main_~x~0 := ~fp.neg~FLOAT(~Pluszero~FLOAT());main_~y~0 := ~Pluszero~FLOAT();fmin_float_#in~x, fmin_float_#in~y := main_~x~0, main_~y~0;havoc fmin_float_#res;havoc fmin_float_#t~ret2, fmin_float_#t~ret3, fmin_float_#t~ite4, fmin_float_~x, fmin_float_~y;fmin_float_~x := fmin_float_#in~x;fmin_float_~y := fmin_float_#in~y;__fpclassify_float_#in~x := fmin_float_~x;havoc __fpclassify_float_#res;havoc __fpclassify_float_#t~mem0, __fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, __fpclassify_float_~x, __fpclassify_float_~w~0;__fpclassify_float_~x := __fpclassify_float_#in~x;havoc __fpclassify_float_~w~0; {819#true} is VALID [2020-07-28 17:54:34,356 INFO L280 TraceCheckUtils]: 2: Hoare triple {819#true} call __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__fpclassify_float_~x, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);call __fpclassify_float_#t~mem0 := read~intINTTYPE4(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);__fpclassify_float_~w~0 := __fpclassify_float_#t~mem0;call write~intFLOATTYPE4(__fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);havoc __fpclassify_float_#t~mem0;havoc __fpclassify_float_#t~union1;call ULTIMATE.dealloc(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset);havoc __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset; {819#true} is VALID [2020-07-28 17:54:34,356 INFO L280 TraceCheckUtils]: 3: Hoare triple {819#true} goto; {819#true} is VALID [2020-07-28 17:54:34,357 INFO L280 TraceCheckUtils]: 4: Hoare triple {819#true} assume 0bv32 == __fpclassify_float_~w~0 || 2147483648bv32 == __fpclassify_float_~w~0;__fpclassify_float_#res := 2bv32; {819#true} is VALID [2020-07-28 17:54:34,357 INFO L280 TraceCheckUtils]: 5: Hoare triple {819#true} fmin_float_#t~ret2 := __fpclassify_float_#res; {819#true} is VALID [2020-07-28 17:54:34,357 INFO L280 TraceCheckUtils]: 6: Hoare triple {819#true} assume !(0bv32 == fmin_float_#t~ret2);havoc fmin_float_#t~ret2;__fpclassify_float_#in~x := fmin_float_~y;havoc __fpclassify_float_#res;havoc __fpclassify_float_#t~mem0, __fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, __fpclassify_float_~x, __fpclassify_float_~w~0;__fpclassify_float_~x := __fpclassify_float_#in~x;havoc __fpclassify_float_~w~0; {819#true} is VALID [2020-07-28 17:54:34,358 INFO L280 TraceCheckUtils]: 7: Hoare triple {819#true} call __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__fpclassify_float_~x, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);call __fpclassify_float_#t~mem0 := read~intINTTYPE4(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);__fpclassify_float_~w~0 := __fpclassify_float_#t~mem0;call write~intFLOATTYPE4(__fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);havoc __fpclassify_float_#t~mem0;havoc __fpclassify_float_#t~union1;call ULTIMATE.dealloc(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset);havoc __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset; {819#true} is VALID [2020-07-28 17:54:34,358 INFO L280 TraceCheckUtils]: 8: Hoare triple {819#true} goto; {819#true} is VALID [2020-07-28 17:54:34,360 INFO L280 TraceCheckUtils]: 9: Hoare triple {819#true} assume 0bv32 == __fpclassify_float_~w~0 || 2147483648bv32 == __fpclassify_float_~w~0;__fpclassify_float_#res := 2bv32; {851#(= (_ bv2 32) |ULTIMATE.start___fpclassify_float_#res|)} is VALID [2020-07-28 17:54:34,361 INFO L280 TraceCheckUtils]: 10: Hoare triple {851#(= (_ bv2 32) |ULTIMATE.start___fpclassify_float_#res|)} fmin_float_#t~ret3 := __fpclassify_float_#res; {855#(= (bvadd |ULTIMATE.start_fmin_float_#t~ret3| (_ bv4294967294 32)) (_ bv0 32))} is VALID [2020-07-28 17:54:34,362 INFO L280 TraceCheckUtils]: 11: Hoare triple {855#(= (bvadd |ULTIMATE.start_fmin_float_#t~ret3| (_ bv4294967294 32)) (_ bv0 32))} assume 0bv32 == fmin_float_#t~ret3;havoc fmin_float_#t~ret3;fmin_float_#res := fmin_float_~x; {820#false} is VALID [2020-07-28 17:54:34,362 INFO L280 TraceCheckUtils]: 12: Hoare triple {820#false} main_#t~ret7 := fmin_float_#res;main_~res~0 := main_#t~ret7;havoc main_#t~ret7;main_#t~short9 := ~fp.eq~FLOAT(main_~res~0, ~fp.neg~FLOAT(~Pluszero~FLOAT())); {820#false} is VALID [2020-07-28 17:54:34,362 INFO L280 TraceCheckUtils]: 13: Hoare triple {820#false} assume !main_#t~short9; {820#false} is VALID [2020-07-28 17:54:34,362 INFO L280 TraceCheckUtils]: 14: Hoare triple {820#false} assume !main_#t~short9;havoc main_#t~short9;havoc main_#t~ret8; {820#false} is VALID [2020-07-28 17:54:34,363 INFO L280 TraceCheckUtils]: 15: Hoare triple {820#false} assume !false; {820#false} is VALID [2020-07-28 17:54:34,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:54:34,364 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 17:54:34,403 INFO L280 TraceCheckUtils]: 15: Hoare triple {820#false} assume !false; {820#false} is VALID [2020-07-28 17:54:34,404 INFO L280 TraceCheckUtils]: 14: Hoare triple {820#false} assume !main_#t~short9;havoc main_#t~short9;havoc main_#t~ret8; {820#false} is VALID [2020-07-28 17:54:34,404 INFO L280 TraceCheckUtils]: 13: Hoare triple {820#false} assume !main_#t~short9; {820#false} is VALID [2020-07-28 17:54:34,404 INFO L280 TraceCheckUtils]: 12: Hoare triple {820#false} main_#t~ret7 := fmin_float_#res;main_~res~0 := main_#t~ret7;havoc main_#t~ret7;main_#t~short9 := ~fp.eq~FLOAT(main_~res~0, ~fp.neg~FLOAT(~Pluszero~FLOAT())); {820#false} is VALID [2020-07-28 17:54:34,405 INFO L280 TraceCheckUtils]: 11: Hoare triple {883#(not (= |ULTIMATE.start_fmin_float_#t~ret3| (_ bv0 32)))} assume 0bv32 == fmin_float_#t~ret3;havoc fmin_float_#t~ret3;fmin_float_#res := fmin_float_~x; {820#false} is VALID [2020-07-28 17:54:34,406 INFO L280 TraceCheckUtils]: 10: Hoare triple {887#(not (= (_ bv0 32) |ULTIMATE.start___fpclassify_float_#res|))} fmin_float_#t~ret3 := __fpclassify_float_#res; {883#(not (= |ULTIMATE.start_fmin_float_#t~ret3| (_ bv0 32)))} is VALID [2020-07-28 17:54:34,407 INFO L280 TraceCheckUtils]: 9: Hoare triple {819#true} assume 0bv32 == __fpclassify_float_~w~0 || 2147483648bv32 == __fpclassify_float_~w~0;__fpclassify_float_#res := 2bv32; {887#(not (= (_ bv0 32) |ULTIMATE.start___fpclassify_float_#res|))} is VALID [2020-07-28 17:54:34,407 INFO L280 TraceCheckUtils]: 8: Hoare triple {819#true} goto; {819#true} is VALID [2020-07-28 17:54:34,408 INFO L280 TraceCheckUtils]: 7: Hoare triple {819#true} call __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__fpclassify_float_~x, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);call __fpclassify_float_#t~mem0 := read~intINTTYPE4(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);__fpclassify_float_~w~0 := __fpclassify_float_#t~mem0;call write~intFLOATTYPE4(__fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);havoc __fpclassify_float_#t~mem0;havoc __fpclassify_float_#t~union1;call ULTIMATE.dealloc(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset);havoc __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset; {819#true} is VALID [2020-07-28 17:54:34,409 INFO L280 TraceCheckUtils]: 6: Hoare triple {819#true} assume !(0bv32 == fmin_float_#t~ret2);havoc fmin_float_#t~ret2;__fpclassify_float_#in~x := fmin_float_~y;havoc __fpclassify_float_#res;havoc __fpclassify_float_#t~mem0, __fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, __fpclassify_float_~x, __fpclassify_float_~w~0;__fpclassify_float_~x := __fpclassify_float_#in~x;havoc __fpclassify_float_~w~0; {819#true} is VALID [2020-07-28 17:54:34,409 INFO L280 TraceCheckUtils]: 5: Hoare triple {819#true} fmin_float_#t~ret2 := __fpclassify_float_#res; {819#true} is VALID [2020-07-28 17:54:34,409 INFO L280 TraceCheckUtils]: 4: Hoare triple {819#true} assume 0bv32 == __fpclassify_float_~w~0 || 2147483648bv32 == __fpclassify_float_~w~0;__fpclassify_float_#res := 2bv32; {819#true} is VALID [2020-07-28 17:54:34,409 INFO L280 TraceCheckUtils]: 3: Hoare triple {819#true} goto; {819#true} is VALID [2020-07-28 17:54:34,410 INFO L280 TraceCheckUtils]: 2: Hoare triple {819#true} call __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__fpclassify_float_~x, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);call __fpclassify_float_#t~mem0 := read~intINTTYPE4(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);__fpclassify_float_~w~0 := __fpclassify_float_#t~mem0;call write~intFLOATTYPE4(__fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);havoc __fpclassify_float_#t~mem0;havoc __fpclassify_float_#t~union1;call ULTIMATE.dealloc(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset);havoc __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset; {819#true} is VALID [2020-07-28 17:54:34,410 INFO L280 TraceCheckUtils]: 1: Hoare triple {819#true} havoc main_#res;havoc main_#t~ret7, main_#t~ret8, main_#t~short9, main_~x~0, main_~y~0, main_~res~0;main_~x~0 := ~fp.neg~FLOAT(~Pluszero~FLOAT());main_~y~0 := ~Pluszero~FLOAT();fmin_float_#in~x, fmin_float_#in~y := main_~x~0, main_~y~0;havoc fmin_float_#res;havoc fmin_float_#t~ret2, fmin_float_#t~ret3, fmin_float_#t~ite4, fmin_float_~x, fmin_float_~y;fmin_float_~x := fmin_float_#in~x;fmin_float_~y := fmin_float_#in~y;__fpclassify_float_#in~x := fmin_float_~x;havoc __fpclassify_float_#res;havoc __fpclassify_float_#t~mem0, __fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, __fpclassify_float_~x, __fpclassify_float_~w~0;__fpclassify_float_~x := __fpclassify_float_#in~x;havoc __fpclassify_float_~w~0; {819#true} is VALID [2020-07-28 17:54:34,410 INFO L280 TraceCheckUtils]: 0: Hoare triple {819#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {819#true} is VALID [2020-07-28 17:54:34,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:54:34,411 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1814194762] [2020-07-28 17:54:34,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:54:34,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-07-28 17:54:34,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040380645] [2020-07-28 17:54:34,412 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-07-28 17:54:34,412 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:54:34,413 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-28 17:54:34,442 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:54:34,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-28 17:54:34,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 17:54:34,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-28 17:54:34,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-28 17:54:34,444 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand 6 states. [2020-07-28 17:54:34,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:54:34,737 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2020-07-28 17:54:34,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-28 17:54:34,738 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-07-28 17:54:34,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:54:34,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 17:54:34,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2020-07-28 17:54:34,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 17:54:34,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2020-07-28 17:54:34,742 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 71 transitions. [2020-07-28 17:54:34,836 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:54:34,837 INFO L225 Difference]: With dead ends: 61 [2020-07-28 17:54:34,837 INFO L226 Difference]: Without dead ends: 52 [2020-07-28 17:54:34,838 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-07-28 17:54:34,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-07-28 17:54:34,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 28. [2020-07-28 17:54:34,856 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:54:34,856 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 28 states. [2020-07-28 17:54:34,858 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 28 states. [2020-07-28 17:54:34,858 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 28 states. [2020-07-28 17:54:34,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:54:34,861 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2020-07-28 17:54:34,861 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2020-07-28 17:54:34,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:54:34,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:54:34,862 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 52 states. [2020-07-28 17:54:34,862 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 52 states. [2020-07-28 17:54:34,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:54:34,866 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2020-07-28 17:54:34,866 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2020-07-28 17:54:34,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:54:34,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:54:34,867 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:54:34,867 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:54:34,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-28 17:54:34,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2020-07-28 17:54:34,874 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 16 [2020-07-28 17:54:34,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:54:34,874 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2020-07-28 17:54:34,874 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-28 17:54:34,874 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2020-07-28 17:54:34,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-28 17:54:34,875 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:54:34,875 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:54:35,087 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-07-28 17:54:35,088 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:54:35,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:54:35,089 INFO L82 PathProgramCache]: Analyzing trace with hash -414082333, now seen corresponding path program 1 times [2020-07-28 17:54:35,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 17:54:35,090 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1849121597] [2020-07-28 17:54:35,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-07-28 17:54:35,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:54:35,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-28 17:54:35,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:54:35,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 17:54:35,188 INFO L280 TraceCheckUtils]: 0: Hoare triple {1140#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {1140#true} is VALID [2020-07-28 17:54:35,189 INFO L280 TraceCheckUtils]: 1: Hoare triple {1140#true} havoc main_#res;havoc main_#t~ret7, main_#t~ret8, main_#t~short9, main_~x~0, main_~y~0, main_~res~0;main_~x~0 := ~fp.neg~FLOAT(~Pluszero~FLOAT());main_~y~0 := ~Pluszero~FLOAT();fmin_float_#in~x, fmin_float_#in~y := main_~x~0, main_~y~0;havoc fmin_float_#res;havoc fmin_float_#t~ret2, fmin_float_#t~ret3, fmin_float_#t~ite4, fmin_float_~x, fmin_float_~y;fmin_float_~x := fmin_float_#in~x;fmin_float_~y := fmin_float_#in~y;__fpclassify_float_#in~x := fmin_float_~x;havoc __fpclassify_float_#res;havoc __fpclassify_float_#t~mem0, __fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, __fpclassify_float_~x, __fpclassify_float_~w~0;__fpclassify_float_~x := __fpclassify_float_#in~x;havoc __fpclassify_float_~w~0; {1148#(and (= ULTIMATE.start_fmin_float_~x (fp.neg (_ +zero 8 24))) (= ULTIMATE.start_fmin_float_~y (_ +zero 8 24)))} is VALID [2020-07-28 17:54:35,190 INFO L280 TraceCheckUtils]: 2: Hoare triple {1148#(and (= ULTIMATE.start_fmin_float_~x (fp.neg (_ +zero 8 24))) (= ULTIMATE.start_fmin_float_~y (_ +zero 8 24)))} call __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__fpclassify_float_~x, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);call __fpclassify_float_#t~mem0 := read~intINTTYPE4(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);__fpclassify_float_~w~0 := __fpclassify_float_#t~mem0;call write~intFLOATTYPE4(__fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);havoc __fpclassify_float_#t~mem0;havoc __fpclassify_float_#t~union1;call ULTIMATE.dealloc(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset);havoc __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset; {1148#(and (= ULTIMATE.start_fmin_float_~x (fp.neg (_ +zero 8 24))) (= ULTIMATE.start_fmin_float_~y (_ +zero 8 24)))} is VALID [2020-07-28 17:54:35,191 INFO L280 TraceCheckUtils]: 3: Hoare triple {1148#(and (= ULTIMATE.start_fmin_float_~x (fp.neg (_ +zero 8 24))) (= ULTIMATE.start_fmin_float_~y (_ +zero 8 24)))} goto; {1148#(and (= ULTIMATE.start_fmin_float_~x (fp.neg (_ +zero 8 24))) (= ULTIMATE.start_fmin_float_~y (_ +zero 8 24)))} is VALID [2020-07-28 17:54:35,192 INFO L280 TraceCheckUtils]: 4: Hoare triple {1148#(and (= ULTIMATE.start_fmin_float_~x (fp.neg (_ +zero 8 24))) (= ULTIMATE.start_fmin_float_~y (_ +zero 8 24)))} assume 0bv32 == __fpclassify_float_~w~0 || 2147483648bv32 == __fpclassify_float_~w~0;__fpclassify_float_#res := 2bv32; {1148#(and (= ULTIMATE.start_fmin_float_~x (fp.neg (_ +zero 8 24))) (= ULTIMATE.start_fmin_float_~y (_ +zero 8 24)))} is VALID [2020-07-28 17:54:35,193 INFO L280 TraceCheckUtils]: 5: Hoare triple {1148#(and (= ULTIMATE.start_fmin_float_~x (fp.neg (_ +zero 8 24))) (= ULTIMATE.start_fmin_float_~y (_ +zero 8 24)))} fmin_float_#t~ret2 := __fpclassify_float_#res; {1148#(and (= ULTIMATE.start_fmin_float_~x (fp.neg (_ +zero 8 24))) (= ULTIMATE.start_fmin_float_~y (_ +zero 8 24)))} is VALID [2020-07-28 17:54:35,193 INFO L280 TraceCheckUtils]: 6: Hoare triple {1148#(and (= ULTIMATE.start_fmin_float_~x (fp.neg (_ +zero 8 24))) (= ULTIMATE.start_fmin_float_~y (_ +zero 8 24)))} assume !(0bv32 == fmin_float_#t~ret2);havoc fmin_float_#t~ret2;__fpclassify_float_#in~x := fmin_float_~y;havoc __fpclassify_float_#res;havoc __fpclassify_float_#t~mem0, __fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, __fpclassify_float_~x, __fpclassify_float_~w~0;__fpclassify_float_~x := __fpclassify_float_#in~x;havoc __fpclassify_float_~w~0; {1148#(and (= ULTIMATE.start_fmin_float_~x (fp.neg (_ +zero 8 24))) (= ULTIMATE.start_fmin_float_~y (_ +zero 8 24)))} is VALID [2020-07-28 17:54:35,195 INFO L280 TraceCheckUtils]: 7: Hoare triple {1148#(and (= ULTIMATE.start_fmin_float_~x (fp.neg (_ +zero 8 24))) (= ULTIMATE.start_fmin_float_~y (_ +zero 8 24)))} call __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__fpclassify_float_~x, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);call __fpclassify_float_#t~mem0 := read~intINTTYPE4(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);__fpclassify_float_~w~0 := __fpclassify_float_#t~mem0;call write~intFLOATTYPE4(__fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);havoc __fpclassify_float_#t~mem0;havoc __fpclassify_float_#t~union1;call ULTIMATE.dealloc(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset);havoc __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset; {1148#(and (= ULTIMATE.start_fmin_float_~x (fp.neg (_ +zero 8 24))) (= ULTIMATE.start_fmin_float_~y (_ +zero 8 24)))} is VALID [2020-07-28 17:54:35,195 INFO L280 TraceCheckUtils]: 8: Hoare triple {1148#(and (= ULTIMATE.start_fmin_float_~x (fp.neg (_ +zero 8 24))) (= ULTIMATE.start_fmin_float_~y (_ +zero 8 24)))} goto; {1148#(and (= ULTIMATE.start_fmin_float_~x (fp.neg (_ +zero 8 24))) (= ULTIMATE.start_fmin_float_~y (_ +zero 8 24)))} is VALID [2020-07-28 17:54:35,196 INFO L280 TraceCheckUtils]: 9: Hoare triple {1148#(and (= ULTIMATE.start_fmin_float_~x (fp.neg (_ +zero 8 24))) (= ULTIMATE.start_fmin_float_~y (_ +zero 8 24)))} assume 0bv32 == __fpclassify_float_~w~0 || 2147483648bv32 == __fpclassify_float_~w~0;__fpclassify_float_#res := 2bv32; {1148#(and (= ULTIMATE.start_fmin_float_~x (fp.neg (_ +zero 8 24))) (= ULTIMATE.start_fmin_float_~y (_ +zero 8 24)))} is VALID [2020-07-28 17:54:35,197 INFO L280 TraceCheckUtils]: 10: Hoare triple {1148#(and (= ULTIMATE.start_fmin_float_~x (fp.neg (_ +zero 8 24))) (= ULTIMATE.start_fmin_float_~y (_ +zero 8 24)))} fmin_float_#t~ret3 := __fpclassify_float_#res; {1148#(and (= ULTIMATE.start_fmin_float_~x (fp.neg (_ +zero 8 24))) (= ULTIMATE.start_fmin_float_~y (_ +zero 8 24)))} is VALID [2020-07-28 17:54:35,198 INFO L280 TraceCheckUtils]: 11: Hoare triple {1148#(and (= ULTIMATE.start_fmin_float_~x (fp.neg (_ +zero 8 24))) (= ULTIMATE.start_fmin_float_~y (_ +zero 8 24)))} assume !(0bv32 == fmin_float_#t~ret3);havoc fmin_float_#t~ret3; {1148#(and (= ULTIMATE.start_fmin_float_~x (fp.neg (_ +zero 8 24))) (= ULTIMATE.start_fmin_float_~y (_ +zero 8 24)))} is VALID [2020-07-28 17:54:35,199 INFO L280 TraceCheckUtils]: 12: Hoare triple {1148#(and (= ULTIMATE.start_fmin_float_~x (fp.neg (_ +zero 8 24))) (= ULTIMATE.start_fmin_float_~y (_ +zero 8 24)))} assume ~fp.lt~FLOAT(fmin_float_~x, fmin_float_~y);fmin_float_#t~ite4 := fmin_float_~x; {1141#false} is VALID [2020-07-28 17:54:35,199 INFO L280 TraceCheckUtils]: 13: Hoare triple {1141#false} fmin_float_#res := fmin_float_#t~ite4;havoc fmin_float_#t~ite4; {1141#false} is VALID [2020-07-28 17:54:35,199 INFO L280 TraceCheckUtils]: 14: Hoare triple {1141#false} main_#t~ret7 := fmin_float_#res;main_~res~0 := main_#t~ret7;havoc main_#t~ret7;main_#t~short9 := ~fp.eq~FLOAT(main_~res~0, ~fp.neg~FLOAT(~Pluszero~FLOAT())); {1141#false} is VALID [2020-07-28 17:54:35,199 INFO L280 TraceCheckUtils]: 15: Hoare triple {1141#false} assume !main_#t~short9; {1141#false} is VALID [2020-07-28 17:54:35,200 INFO L280 TraceCheckUtils]: 16: Hoare triple {1141#false} assume !main_#t~short9;havoc main_#t~short9;havoc main_#t~ret8; {1141#false} is VALID [2020-07-28 17:54:35,200 INFO L280 TraceCheckUtils]: 17: Hoare triple {1141#false} assume !false; {1141#false} is VALID [2020-07-28 17:54:35,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:54:35,201 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 17:54:35,261 INFO L280 TraceCheckUtils]: 17: Hoare triple {1141#false} assume !false; {1141#false} is VALID [2020-07-28 17:54:35,262 INFO L280 TraceCheckUtils]: 16: Hoare triple {1141#false} assume !main_#t~short9;havoc main_#t~short9;havoc main_#t~ret8; {1141#false} is VALID [2020-07-28 17:54:35,262 INFO L280 TraceCheckUtils]: 15: Hoare triple {1141#false} assume !main_#t~short9; {1141#false} is VALID [2020-07-28 17:54:35,262 INFO L280 TraceCheckUtils]: 14: Hoare triple {1141#false} main_#t~ret7 := fmin_float_#res;main_~res~0 := main_#t~ret7;havoc main_#t~ret7;main_#t~short9 := ~fp.eq~FLOAT(main_~res~0, ~fp.neg~FLOAT(~Pluszero~FLOAT())); {1141#false} is VALID [2020-07-28 17:54:35,262 INFO L280 TraceCheckUtils]: 13: Hoare triple {1141#false} fmin_float_#res := fmin_float_#t~ite4;havoc fmin_float_#t~ite4; {1141#false} is VALID [2020-07-28 17:54:35,264 INFO L280 TraceCheckUtils]: 12: Hoare triple {1212#(not (fp.lt ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~y))} assume ~fp.lt~FLOAT(fmin_float_~x, fmin_float_~y);fmin_float_#t~ite4 := fmin_float_~x; {1141#false} is VALID [2020-07-28 17:54:35,265 INFO L280 TraceCheckUtils]: 11: Hoare triple {1212#(not (fp.lt ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~y))} assume !(0bv32 == fmin_float_#t~ret3);havoc fmin_float_#t~ret3; {1212#(not (fp.lt ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~y))} is VALID [2020-07-28 17:54:35,265 INFO L280 TraceCheckUtils]: 10: Hoare triple {1212#(not (fp.lt ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~y))} fmin_float_#t~ret3 := __fpclassify_float_#res; {1212#(not (fp.lt ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~y))} is VALID [2020-07-28 17:54:35,269 INFO L280 TraceCheckUtils]: 9: Hoare triple {1212#(not (fp.lt ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~y))} assume 0bv32 == __fpclassify_float_~w~0 || 2147483648bv32 == __fpclassify_float_~w~0;__fpclassify_float_#res := 2bv32; {1212#(not (fp.lt ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~y))} is VALID [2020-07-28 17:54:35,269 INFO L280 TraceCheckUtils]: 8: Hoare triple {1212#(not (fp.lt ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~y))} goto; {1212#(not (fp.lt ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~y))} is VALID [2020-07-28 17:54:35,270 INFO L280 TraceCheckUtils]: 7: Hoare triple {1212#(not (fp.lt ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~y))} call __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__fpclassify_float_~x, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);call __fpclassify_float_#t~mem0 := read~intINTTYPE4(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);__fpclassify_float_~w~0 := __fpclassify_float_#t~mem0;call write~intFLOATTYPE4(__fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);havoc __fpclassify_float_#t~mem0;havoc __fpclassify_float_#t~union1;call ULTIMATE.dealloc(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset);havoc __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset; {1212#(not (fp.lt ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~y))} is VALID [2020-07-28 17:54:35,274 INFO L280 TraceCheckUtils]: 6: Hoare triple {1212#(not (fp.lt ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~y))} assume !(0bv32 == fmin_float_#t~ret2);havoc fmin_float_#t~ret2;__fpclassify_float_#in~x := fmin_float_~y;havoc __fpclassify_float_#res;havoc __fpclassify_float_#t~mem0, __fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, __fpclassify_float_~x, __fpclassify_float_~w~0;__fpclassify_float_~x := __fpclassify_float_#in~x;havoc __fpclassify_float_~w~0; {1212#(not (fp.lt ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~y))} is VALID [2020-07-28 17:54:35,277 INFO L280 TraceCheckUtils]: 5: Hoare triple {1212#(not (fp.lt ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~y))} fmin_float_#t~ret2 := __fpclassify_float_#res; {1212#(not (fp.lt ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~y))} is VALID [2020-07-28 17:54:35,277 INFO L280 TraceCheckUtils]: 4: Hoare triple {1212#(not (fp.lt ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~y))} assume 0bv32 == __fpclassify_float_~w~0 || 2147483648bv32 == __fpclassify_float_~w~0;__fpclassify_float_#res := 2bv32; {1212#(not (fp.lt ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~y))} is VALID [2020-07-28 17:54:35,278 INFO L280 TraceCheckUtils]: 3: Hoare triple {1212#(not (fp.lt ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~y))} goto; {1212#(not (fp.lt ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~y))} is VALID [2020-07-28 17:54:35,278 INFO L280 TraceCheckUtils]: 2: Hoare triple {1212#(not (fp.lt ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~y))} call __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__fpclassify_float_~x, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);call __fpclassify_float_#t~mem0 := read~intINTTYPE4(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);__fpclassify_float_~w~0 := __fpclassify_float_#t~mem0;call write~intFLOATTYPE4(__fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);havoc __fpclassify_float_#t~mem0;havoc __fpclassify_float_#t~union1;call ULTIMATE.dealloc(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset);havoc __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset; {1212#(not (fp.lt ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~y))} is VALID [2020-07-28 17:54:35,279 INFO L280 TraceCheckUtils]: 1: Hoare triple {1140#true} havoc main_#res;havoc main_#t~ret7, main_#t~ret8, main_#t~short9, main_~x~0, main_~y~0, main_~res~0;main_~x~0 := ~fp.neg~FLOAT(~Pluszero~FLOAT());main_~y~0 := ~Pluszero~FLOAT();fmin_float_#in~x, fmin_float_#in~y := main_~x~0, main_~y~0;havoc fmin_float_#res;havoc fmin_float_#t~ret2, fmin_float_#t~ret3, fmin_float_#t~ite4, fmin_float_~x, fmin_float_~y;fmin_float_~x := fmin_float_#in~x;fmin_float_~y := fmin_float_#in~y;__fpclassify_float_#in~x := fmin_float_~x;havoc __fpclassify_float_#res;havoc __fpclassify_float_#t~mem0, __fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, __fpclassify_float_~x, __fpclassify_float_~w~0;__fpclassify_float_~x := __fpclassify_float_#in~x;havoc __fpclassify_float_~w~0; {1212#(not (fp.lt ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~y))} is VALID [2020-07-28 17:54:35,279 INFO L280 TraceCheckUtils]: 0: Hoare triple {1140#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {1140#true} is VALID [2020-07-28 17:54:35,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:54:35,280 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1849121597] [2020-07-28 17:54:35,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:54:35,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2020-07-28 17:54:35,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523841323] [2020-07-28 17:54:35,281 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-07-28 17:54:35,281 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:54:35,281 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 17:54:35,336 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:54:35,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 17:54:35,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 17:54:35,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 17:54:35,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-28 17:54:35,337 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand 4 states. [2020-07-28 17:54:35,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:54:35,441 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2020-07-28 17:54:35,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-28 17:54:35,442 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-07-28 17:54:35,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:54:35,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 17:54:35,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2020-07-28 17:54:35,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 17:54:35,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2020-07-28 17:54:35,444 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 42 transitions. [2020-07-28 17:54:35,517 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:54:35,518 INFO L225 Difference]: With dead ends: 38 [2020-07-28 17:54:35,518 INFO L226 Difference]: Without dead ends: 28 [2020-07-28 17:54:35,518 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-28 17:54:35,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-28 17:54:35,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-28 17:54:35,533 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:54:35,534 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2020-07-28 17:54:35,534 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-28 17:54:35,534 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-28 17:54:35,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:54:35,535 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2020-07-28 17:54:35,536 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2020-07-28 17:54:35,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:54:35,536 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:54:35,536 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-28 17:54:35,536 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-28 17:54:35,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:54:35,538 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2020-07-28 17:54:35,538 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2020-07-28 17:54:35,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:54:35,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:54:35,541 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:54:35,541 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:54:35,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-28 17:54:35,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2020-07-28 17:54:35,545 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 18 [2020-07-28 17:54:35,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:54:35,548 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2020-07-28 17:54:35,548 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 17:54:35,549 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2020-07-28 17:54:35,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-28 17:54:35,549 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:54:35,550 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:54:35,762 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-07-28 17:54:35,764 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:54:35,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:54:35,765 INFO L82 PathProgramCache]: Analyzing trace with hash -356824031, now seen corresponding path program 1 times [2020-07-28 17:54:35,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 17:54:35,766 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1731948618] [2020-07-28 17:54:35,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2020-07-28 17:54:35,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:54:35,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-28 17:54:35,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:54:35,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 17:54:35,903 INFO L280 TraceCheckUtils]: 0: Hoare triple {1389#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {1389#true} is VALID [2020-07-28 17:54:35,904 INFO L280 TraceCheckUtils]: 1: Hoare triple {1389#true} havoc main_#res;havoc main_#t~ret7, main_#t~ret8, main_#t~short9, main_~x~0, main_~y~0, main_~res~0;main_~x~0 := ~fp.neg~FLOAT(~Pluszero~FLOAT());main_~y~0 := ~Pluszero~FLOAT();fmin_float_#in~x, fmin_float_#in~y := main_~x~0, main_~y~0;havoc fmin_float_#res;havoc fmin_float_#t~ret2, fmin_float_#t~ret3, fmin_float_#t~ite4, fmin_float_~x, fmin_float_~y;fmin_float_~x := fmin_float_#in~x;fmin_float_~y := fmin_float_#in~y;__fpclassify_float_#in~x := fmin_float_~x;havoc __fpclassify_float_#res;havoc __fpclassify_float_#t~mem0, __fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, __fpclassify_float_~x, __fpclassify_float_~w~0;__fpclassify_float_~x := __fpclassify_float_#in~x;havoc __fpclassify_float_~w~0; {1397#(= ULTIMATE.start_fmin_float_~y (_ +zero 8 24))} is VALID [2020-07-28 17:54:35,905 INFO L280 TraceCheckUtils]: 2: Hoare triple {1397#(= ULTIMATE.start_fmin_float_~y (_ +zero 8 24))} call __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__fpclassify_float_~x, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);call __fpclassify_float_#t~mem0 := read~intINTTYPE4(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);__fpclassify_float_~w~0 := __fpclassify_float_#t~mem0;call write~intFLOATTYPE4(__fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);havoc __fpclassify_float_#t~mem0;havoc __fpclassify_float_#t~union1;call ULTIMATE.dealloc(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset);havoc __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset; {1397#(= ULTIMATE.start_fmin_float_~y (_ +zero 8 24))} is VALID [2020-07-28 17:54:35,906 INFO L280 TraceCheckUtils]: 3: Hoare triple {1397#(= ULTIMATE.start_fmin_float_~y (_ +zero 8 24))} goto; {1397#(= ULTIMATE.start_fmin_float_~y (_ +zero 8 24))} is VALID [2020-07-28 17:54:35,907 INFO L280 TraceCheckUtils]: 4: Hoare triple {1397#(= ULTIMATE.start_fmin_float_~y (_ +zero 8 24))} assume 0bv32 == __fpclassify_float_~w~0 || 2147483648bv32 == __fpclassify_float_~w~0;__fpclassify_float_#res := 2bv32; {1397#(= ULTIMATE.start_fmin_float_~y (_ +zero 8 24))} is VALID [2020-07-28 17:54:35,908 INFO L280 TraceCheckUtils]: 5: Hoare triple {1397#(= ULTIMATE.start_fmin_float_~y (_ +zero 8 24))} fmin_float_#t~ret2 := __fpclassify_float_#res; {1397#(= ULTIMATE.start_fmin_float_~y (_ +zero 8 24))} is VALID [2020-07-28 17:54:35,908 INFO L280 TraceCheckUtils]: 6: Hoare triple {1397#(= ULTIMATE.start_fmin_float_~y (_ +zero 8 24))} assume !(0bv32 == fmin_float_#t~ret2);havoc fmin_float_#t~ret2;__fpclassify_float_#in~x := fmin_float_~y;havoc __fpclassify_float_#res;havoc __fpclassify_float_#t~mem0, __fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, __fpclassify_float_~x, __fpclassify_float_~w~0;__fpclassify_float_~x := __fpclassify_float_#in~x;havoc __fpclassify_float_~w~0; {1397#(= ULTIMATE.start_fmin_float_~y (_ +zero 8 24))} is VALID [2020-07-28 17:54:35,909 INFO L280 TraceCheckUtils]: 7: Hoare triple {1397#(= ULTIMATE.start_fmin_float_~y (_ +zero 8 24))} call __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__fpclassify_float_~x, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);call __fpclassify_float_#t~mem0 := read~intINTTYPE4(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);__fpclassify_float_~w~0 := __fpclassify_float_#t~mem0;call write~intFLOATTYPE4(__fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);havoc __fpclassify_float_#t~mem0;havoc __fpclassify_float_#t~union1;call ULTIMATE.dealloc(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset);havoc __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset; {1397#(= ULTIMATE.start_fmin_float_~y (_ +zero 8 24))} is VALID [2020-07-28 17:54:35,910 INFO L280 TraceCheckUtils]: 8: Hoare triple {1397#(= ULTIMATE.start_fmin_float_~y (_ +zero 8 24))} goto; {1397#(= ULTIMATE.start_fmin_float_~y (_ +zero 8 24))} is VALID [2020-07-28 17:54:35,911 INFO L280 TraceCheckUtils]: 9: Hoare triple {1397#(= ULTIMATE.start_fmin_float_~y (_ +zero 8 24))} assume 0bv32 == __fpclassify_float_~w~0 || 2147483648bv32 == __fpclassify_float_~w~0;__fpclassify_float_#res := 2bv32; {1397#(= ULTIMATE.start_fmin_float_~y (_ +zero 8 24))} is VALID [2020-07-28 17:54:35,911 INFO L280 TraceCheckUtils]: 10: Hoare triple {1397#(= ULTIMATE.start_fmin_float_~y (_ +zero 8 24))} fmin_float_#t~ret3 := __fpclassify_float_#res; {1397#(= ULTIMATE.start_fmin_float_~y (_ +zero 8 24))} is VALID [2020-07-28 17:54:35,912 INFO L280 TraceCheckUtils]: 11: Hoare triple {1397#(= ULTIMATE.start_fmin_float_~y (_ +zero 8 24))} assume !(0bv32 == fmin_float_#t~ret3);havoc fmin_float_#t~ret3; {1397#(= ULTIMATE.start_fmin_float_~y (_ +zero 8 24))} is VALID [2020-07-28 17:54:35,913 INFO L280 TraceCheckUtils]: 12: Hoare triple {1397#(= ULTIMATE.start_fmin_float_~y (_ +zero 8 24))} assume !~fp.lt~FLOAT(fmin_float_~x, fmin_float_~y);fmin_float_#t~ite4 := fmin_float_~y; {1431#(= (_ +zero 8 24) |ULTIMATE.start_fmin_float_#t~ite4|)} is VALID [2020-07-28 17:54:35,914 INFO L280 TraceCheckUtils]: 13: Hoare triple {1431#(= (_ +zero 8 24) |ULTIMATE.start_fmin_float_#t~ite4|)} fmin_float_#res := fmin_float_#t~ite4;havoc fmin_float_#t~ite4; {1435#(= (_ +zero 8 24) |ULTIMATE.start_fmin_float_#res|)} is VALID [2020-07-28 17:54:35,915 INFO L280 TraceCheckUtils]: 14: Hoare triple {1435#(= (_ +zero 8 24) |ULTIMATE.start_fmin_float_#res|)} main_#t~ret7 := fmin_float_#res;main_~res~0 := main_#t~ret7;havoc main_#t~ret7;main_#t~short9 := ~fp.eq~FLOAT(main_~res~0, ~fp.neg~FLOAT(~Pluszero~FLOAT())); {1439#|ULTIMATE.start_main_#t~short9|} is VALID [2020-07-28 17:54:35,915 INFO L280 TraceCheckUtils]: 15: Hoare triple {1439#|ULTIMATE.start_main_#t~short9|} assume !main_#t~short9; {1390#false} is VALID [2020-07-28 17:54:35,916 INFO L280 TraceCheckUtils]: 16: Hoare triple {1390#false} assume !main_#t~short9;havoc main_#t~short9;havoc main_#t~ret8; {1390#false} is VALID [2020-07-28 17:54:35,916 INFO L280 TraceCheckUtils]: 17: Hoare triple {1390#false} assume !false; {1390#false} is VALID [2020-07-28 17:54:35,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:54:35,917 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 17:54:36,003 INFO L280 TraceCheckUtils]: 17: Hoare triple {1390#false} assume !false; {1390#false} is VALID [2020-07-28 17:54:36,003 INFO L280 TraceCheckUtils]: 16: Hoare triple {1390#false} assume !main_#t~short9;havoc main_#t~short9;havoc main_#t~ret8; {1390#false} is VALID [2020-07-28 17:54:36,004 INFO L280 TraceCheckUtils]: 15: Hoare triple {1439#|ULTIMATE.start_main_#t~short9|} assume !main_#t~short9; {1390#false} is VALID [2020-07-28 17:54:36,005 INFO L280 TraceCheckUtils]: 14: Hoare triple {1458#(fp.eq |ULTIMATE.start_fmin_float_#res| (fp.neg (_ +zero 8 24)))} main_#t~ret7 := fmin_float_#res;main_~res~0 := main_#t~ret7;havoc main_#t~ret7;main_#t~short9 := ~fp.eq~FLOAT(main_~res~0, ~fp.neg~FLOAT(~Pluszero~FLOAT())); {1439#|ULTIMATE.start_main_#t~short9|} is VALID [2020-07-28 17:54:36,006 INFO L280 TraceCheckUtils]: 13: Hoare triple {1462#(fp.eq |ULTIMATE.start_fmin_float_#t~ite4| (fp.neg (_ +zero 8 24)))} fmin_float_#res := fmin_float_#t~ite4;havoc fmin_float_#t~ite4; {1458#(fp.eq |ULTIMATE.start_fmin_float_#res| (fp.neg (_ +zero 8 24)))} is VALID [2020-07-28 17:54:36,007 INFO L280 TraceCheckUtils]: 12: Hoare triple {1466#(fp.eq ULTIMATE.start_fmin_float_~y (fp.neg (_ +zero 8 24)))} assume !~fp.lt~FLOAT(fmin_float_~x, fmin_float_~y);fmin_float_#t~ite4 := fmin_float_~y; {1462#(fp.eq |ULTIMATE.start_fmin_float_#t~ite4| (fp.neg (_ +zero 8 24)))} is VALID [2020-07-28 17:54:36,007 INFO L280 TraceCheckUtils]: 11: Hoare triple {1466#(fp.eq ULTIMATE.start_fmin_float_~y (fp.neg (_ +zero 8 24)))} assume !(0bv32 == fmin_float_#t~ret3);havoc fmin_float_#t~ret3; {1466#(fp.eq ULTIMATE.start_fmin_float_~y (fp.neg (_ +zero 8 24)))} is VALID [2020-07-28 17:54:36,008 INFO L280 TraceCheckUtils]: 10: Hoare triple {1466#(fp.eq ULTIMATE.start_fmin_float_~y (fp.neg (_ +zero 8 24)))} fmin_float_#t~ret3 := __fpclassify_float_#res; {1466#(fp.eq ULTIMATE.start_fmin_float_~y (fp.neg (_ +zero 8 24)))} is VALID [2020-07-28 17:54:36,009 INFO L280 TraceCheckUtils]: 9: Hoare triple {1466#(fp.eq ULTIMATE.start_fmin_float_~y (fp.neg (_ +zero 8 24)))} assume 0bv32 == __fpclassify_float_~w~0 || 2147483648bv32 == __fpclassify_float_~w~0;__fpclassify_float_#res := 2bv32; {1466#(fp.eq ULTIMATE.start_fmin_float_~y (fp.neg (_ +zero 8 24)))} is VALID [2020-07-28 17:54:36,009 INFO L280 TraceCheckUtils]: 8: Hoare triple {1466#(fp.eq ULTIMATE.start_fmin_float_~y (fp.neg (_ +zero 8 24)))} goto; {1466#(fp.eq ULTIMATE.start_fmin_float_~y (fp.neg (_ +zero 8 24)))} is VALID [2020-07-28 17:54:36,010 INFO L280 TraceCheckUtils]: 7: Hoare triple {1466#(fp.eq ULTIMATE.start_fmin_float_~y (fp.neg (_ +zero 8 24)))} call __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__fpclassify_float_~x, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);call __fpclassify_float_#t~mem0 := read~intINTTYPE4(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);__fpclassify_float_~w~0 := __fpclassify_float_#t~mem0;call write~intFLOATTYPE4(__fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);havoc __fpclassify_float_#t~mem0;havoc __fpclassify_float_#t~union1;call ULTIMATE.dealloc(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset);havoc __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset; {1466#(fp.eq ULTIMATE.start_fmin_float_~y (fp.neg (_ +zero 8 24)))} is VALID [2020-07-28 17:54:36,011 INFO L280 TraceCheckUtils]: 6: Hoare triple {1466#(fp.eq ULTIMATE.start_fmin_float_~y (fp.neg (_ +zero 8 24)))} assume !(0bv32 == fmin_float_#t~ret2);havoc fmin_float_#t~ret2;__fpclassify_float_#in~x := fmin_float_~y;havoc __fpclassify_float_#res;havoc __fpclassify_float_#t~mem0, __fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, __fpclassify_float_~x, __fpclassify_float_~w~0;__fpclassify_float_~x := __fpclassify_float_#in~x;havoc __fpclassify_float_~w~0; {1466#(fp.eq ULTIMATE.start_fmin_float_~y (fp.neg (_ +zero 8 24)))} is VALID [2020-07-28 17:54:36,012 INFO L280 TraceCheckUtils]: 5: Hoare triple {1466#(fp.eq ULTIMATE.start_fmin_float_~y (fp.neg (_ +zero 8 24)))} fmin_float_#t~ret2 := __fpclassify_float_#res; {1466#(fp.eq ULTIMATE.start_fmin_float_~y (fp.neg (_ +zero 8 24)))} is VALID [2020-07-28 17:54:36,012 INFO L280 TraceCheckUtils]: 4: Hoare triple {1466#(fp.eq ULTIMATE.start_fmin_float_~y (fp.neg (_ +zero 8 24)))} assume 0bv32 == __fpclassify_float_~w~0 || 2147483648bv32 == __fpclassify_float_~w~0;__fpclassify_float_#res := 2bv32; {1466#(fp.eq ULTIMATE.start_fmin_float_~y (fp.neg (_ +zero 8 24)))} is VALID [2020-07-28 17:54:36,013 INFO L280 TraceCheckUtils]: 3: Hoare triple {1466#(fp.eq ULTIMATE.start_fmin_float_~y (fp.neg (_ +zero 8 24)))} goto; {1466#(fp.eq ULTIMATE.start_fmin_float_~y (fp.neg (_ +zero 8 24)))} is VALID [2020-07-28 17:54:36,014 INFO L280 TraceCheckUtils]: 2: Hoare triple {1466#(fp.eq ULTIMATE.start_fmin_float_~y (fp.neg (_ +zero 8 24)))} call __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__fpclassify_float_~x, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);call __fpclassify_float_#t~mem0 := read~intINTTYPE4(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);__fpclassify_float_~w~0 := __fpclassify_float_#t~mem0;call write~intFLOATTYPE4(__fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);havoc __fpclassify_float_#t~mem0;havoc __fpclassify_float_#t~union1;call ULTIMATE.dealloc(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset);havoc __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset; {1466#(fp.eq ULTIMATE.start_fmin_float_~y (fp.neg (_ +zero 8 24)))} is VALID [2020-07-28 17:54:36,015 INFO L280 TraceCheckUtils]: 1: Hoare triple {1389#true} havoc main_#res;havoc main_#t~ret7, main_#t~ret8, main_#t~short9, main_~x~0, main_~y~0, main_~res~0;main_~x~0 := ~fp.neg~FLOAT(~Pluszero~FLOAT());main_~y~0 := ~Pluszero~FLOAT();fmin_float_#in~x, fmin_float_#in~y := main_~x~0, main_~y~0;havoc fmin_float_#res;havoc fmin_float_#t~ret2, fmin_float_#t~ret3, fmin_float_#t~ite4, fmin_float_~x, fmin_float_~y;fmin_float_~x := fmin_float_#in~x;fmin_float_~y := fmin_float_#in~y;__fpclassify_float_#in~x := fmin_float_~x;havoc __fpclassify_float_#res;havoc __fpclassify_float_#t~mem0, __fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, __fpclassify_float_~x, __fpclassify_float_~w~0;__fpclassify_float_~x := __fpclassify_float_#in~x;havoc __fpclassify_float_~w~0; {1466#(fp.eq ULTIMATE.start_fmin_float_~y (fp.neg (_ +zero 8 24)))} is VALID [2020-07-28 17:54:36,015 INFO L280 TraceCheckUtils]: 0: Hoare triple {1389#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {1389#true} is VALID [2020-07-28 17:54:36,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:54:36,016 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1731948618] [2020-07-28 17:54:36,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:54:36,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 9 [2020-07-28 17:54:36,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868830386] [2020-07-28 17:54:36,018 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2020-07-28 17:54:36,018 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:54:36,018 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-28 17:54:36,065 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:54:36,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-28 17:54:36,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 17:54:36,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-28 17:54:36,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-07-28 17:54:36,066 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 9 states. [2020-07-28 17:54:36,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:54:36,426 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2020-07-28 17:54:36,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-28 17:54:36,426 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2020-07-28 17:54:36,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:54:36,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-28 17:54:36,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2020-07-28 17:54:36,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-28 17:54:36,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 42 transitions. [2020-07-28 17:54:36,430 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 42 transitions. [2020-07-28 17:54:36,509 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:54:36,510 INFO L225 Difference]: With dead ends: 40 [2020-07-28 17:54:36,510 INFO L226 Difference]: Without dead ends: 37 [2020-07-28 17:54:36,511 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2020-07-28 17:54:36,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-28 17:54:36,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2020-07-28 17:54:36,522 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:54:36,522 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 30 states. [2020-07-28 17:54:36,522 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 30 states. [2020-07-28 17:54:36,523 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 30 states. [2020-07-28 17:54:36,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:54:36,524 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2020-07-28 17:54:36,524 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2020-07-28 17:54:36,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:54:36,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:54:36,525 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 37 states. [2020-07-28 17:54:36,525 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 37 states. [2020-07-28 17:54:36,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:54:36,527 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2020-07-28 17:54:36,527 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2020-07-28 17:54:36,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:54:36,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:54:36,527 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:54:36,528 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:54:36,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-28 17:54:36,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2020-07-28 17:54:36,529 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 18 [2020-07-28 17:54:36,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:54:36,529 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2020-07-28 17:54:36,529 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-28 17:54:36,530 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2020-07-28 17:54:36,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-28 17:54:36,530 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:54:36,530 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:54:36,739 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-07-28 17:54:36,740 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:54:36,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:54:36,741 INFO L82 PathProgramCache]: Analyzing trace with hash -208358251, now seen corresponding path program 1 times [2020-07-28 17:54:36,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 17:54:36,742 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1442749258] [2020-07-28 17:54:36,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2020-07-28 17:54:36,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:54:36,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-28 17:54:36,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:54:36,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 17:54:36,838 INFO L280 TraceCheckUtils]: 0: Hoare triple {1674#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {1674#true} is VALID [2020-07-28 17:54:36,839 INFO L280 TraceCheckUtils]: 1: Hoare triple {1674#true} havoc main_#res;havoc main_#t~ret7, main_#t~ret8, main_#t~short9, main_~x~0, main_~y~0, main_~res~0;main_~x~0 := ~fp.neg~FLOAT(~Pluszero~FLOAT());main_~y~0 := ~Pluszero~FLOAT();fmin_float_#in~x, fmin_float_#in~y := main_~x~0, main_~y~0;havoc fmin_float_#res;havoc fmin_float_#t~ret2, fmin_float_#t~ret3, fmin_float_#t~ite4, fmin_float_~x, fmin_float_~y;fmin_float_~x := fmin_float_#in~x;fmin_float_~y := fmin_float_#in~y;__fpclassify_float_#in~x := fmin_float_~x;havoc __fpclassify_float_#res;havoc __fpclassify_float_#t~mem0, __fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, __fpclassify_float_~x, __fpclassify_float_~w~0;__fpclassify_float_~x := __fpclassify_float_#in~x;havoc __fpclassify_float_~w~0; {1682#(= ULTIMATE.start_fmin_float_~y (_ +zero 8 24))} is VALID [2020-07-28 17:54:36,840 INFO L280 TraceCheckUtils]: 2: Hoare triple {1682#(= ULTIMATE.start_fmin_float_~y (_ +zero 8 24))} call __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__fpclassify_float_~x, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);call __fpclassify_float_#t~mem0 := read~intINTTYPE4(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);__fpclassify_float_~w~0 := __fpclassify_float_#t~mem0;call write~intFLOATTYPE4(__fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);havoc __fpclassify_float_#t~mem0;havoc __fpclassify_float_#t~union1;call ULTIMATE.dealloc(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset);havoc __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset; {1682#(= ULTIMATE.start_fmin_float_~y (_ +zero 8 24))} is VALID [2020-07-28 17:54:36,841 INFO L280 TraceCheckUtils]: 3: Hoare triple {1682#(= ULTIMATE.start_fmin_float_~y (_ +zero 8 24))} goto; {1682#(= ULTIMATE.start_fmin_float_~y (_ +zero 8 24))} is VALID [2020-07-28 17:54:36,841 INFO L280 TraceCheckUtils]: 4: Hoare triple {1682#(= ULTIMATE.start_fmin_float_~y (_ +zero 8 24))} assume 0bv32 == __fpclassify_float_~w~0 || 2147483648bv32 == __fpclassify_float_~w~0;__fpclassify_float_#res := 2bv32; {1682#(= ULTIMATE.start_fmin_float_~y (_ +zero 8 24))} is VALID [2020-07-28 17:54:36,842 INFO L280 TraceCheckUtils]: 5: Hoare triple {1682#(= ULTIMATE.start_fmin_float_~y (_ +zero 8 24))} fmin_float_#t~ret2 := __fpclassify_float_#res; {1682#(= ULTIMATE.start_fmin_float_~y (_ +zero 8 24))} is VALID [2020-07-28 17:54:36,842 INFO L280 TraceCheckUtils]: 6: Hoare triple {1682#(= ULTIMATE.start_fmin_float_~y (_ +zero 8 24))} assume !(0bv32 == fmin_float_#t~ret2);havoc fmin_float_#t~ret2;__fpclassify_float_#in~x := fmin_float_~y;havoc __fpclassify_float_#res;havoc __fpclassify_float_#t~mem0, __fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, __fpclassify_float_~x, __fpclassify_float_~w~0;__fpclassify_float_~x := __fpclassify_float_#in~x;havoc __fpclassify_float_~w~0; {1698#(= (_ +zero 8 24) ULTIMATE.start___fpclassify_float_~x)} is VALID [2020-07-28 17:54:36,844 INFO L280 TraceCheckUtils]: 7: Hoare triple {1698#(= (_ +zero 8 24) ULTIMATE.start___fpclassify_float_~x)} call __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__fpclassify_float_~x, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);call __fpclassify_float_#t~mem0 := read~intINTTYPE4(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);__fpclassify_float_~w~0 := __fpclassify_float_#t~mem0;call write~intFLOATTYPE4(__fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);havoc __fpclassify_float_#t~mem0;havoc __fpclassify_float_#t~union1;call ULTIMATE.dealloc(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset);havoc __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset; {1702#(= (_ +zero 8 24) (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))} is VALID [2020-07-28 17:54:36,844 INFO L280 TraceCheckUtils]: 8: Hoare triple {1702#(= (_ +zero 8 24) (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))} goto; {1702#(= (_ +zero 8 24) (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))} is VALID [2020-07-28 17:54:36,845 INFO L280 TraceCheckUtils]: 9: Hoare triple {1702#(= (_ +zero 8 24) (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))} assume !(0bv32 == __fpclassify_float_~w~0 || 2147483648bv32 == __fpclassify_float_~w~0); {1675#false} is VALID [2020-07-28 17:54:36,845 INFO L280 TraceCheckUtils]: 10: Hoare triple {1675#false} assume !((~bvuge32(__fpclassify_float_~w~0, 8388608bv32) && ~bvule32(__fpclassify_float_~w~0, 2139095039bv32)) || (~bvuge32(__fpclassify_float_~w~0, 2155872256bv32) && ~bvule32(__fpclassify_float_~w~0, 4286578687bv32))); {1675#false} is VALID [2020-07-28 17:54:36,846 INFO L280 TraceCheckUtils]: 11: Hoare triple {1675#false} assume !((~bvuge32(__fpclassify_float_~w~0, 1bv32) && ~bvule32(__fpclassify_float_~w~0, 8388607bv32)) || (~bvuge32(__fpclassify_float_~w~0, 2147483649bv32) && ~bvule32(__fpclassify_float_~w~0, 2155872255bv32))); {1675#false} is VALID [2020-07-28 17:54:36,846 INFO L280 TraceCheckUtils]: 12: Hoare triple {1675#false} assume !(2139095040bv32 == __fpclassify_float_~w~0 || 4286578688bv32 == __fpclassify_float_~w~0);__fpclassify_float_#res := 0bv32; {1675#false} is VALID [2020-07-28 17:54:36,846 INFO L280 TraceCheckUtils]: 13: Hoare triple {1675#false} fmin_float_#t~ret3 := __fpclassify_float_#res; {1675#false} is VALID [2020-07-28 17:54:36,846 INFO L280 TraceCheckUtils]: 14: Hoare triple {1675#false} assume 0bv32 == fmin_float_#t~ret3;havoc fmin_float_#t~ret3;fmin_float_#res := fmin_float_~x; {1675#false} is VALID [2020-07-28 17:54:36,846 INFO L280 TraceCheckUtils]: 15: Hoare triple {1675#false} main_#t~ret7 := fmin_float_#res;main_~res~0 := main_#t~ret7;havoc main_#t~ret7;main_#t~short9 := ~fp.eq~FLOAT(main_~res~0, ~fp.neg~FLOAT(~Pluszero~FLOAT())); {1675#false} is VALID [2020-07-28 17:54:36,847 INFO L280 TraceCheckUtils]: 16: Hoare triple {1675#false} assume !main_#t~short9; {1675#false} is VALID [2020-07-28 17:54:36,847 INFO L280 TraceCheckUtils]: 17: Hoare triple {1675#false} assume !main_#t~short9;havoc main_#t~short9;havoc main_#t~ret8; {1675#false} is VALID [2020-07-28 17:54:36,847 INFO L280 TraceCheckUtils]: 18: Hoare triple {1675#false} assume !false; {1675#false} is VALID [2020-07-28 17:54:36,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:54:36,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 17:54:36,915 INFO L280 TraceCheckUtils]: 18: Hoare triple {1675#false} assume !false; {1675#false} is VALID [2020-07-28 17:54:36,915 INFO L280 TraceCheckUtils]: 17: Hoare triple {1675#false} assume !main_#t~short9;havoc main_#t~short9;havoc main_#t~ret8; {1675#false} is VALID [2020-07-28 17:54:36,915 INFO L280 TraceCheckUtils]: 16: Hoare triple {1675#false} assume !main_#t~short9; {1675#false} is VALID [2020-07-28 17:54:36,916 INFO L280 TraceCheckUtils]: 15: Hoare triple {1675#false} main_#t~ret7 := fmin_float_#res;main_~res~0 := main_#t~ret7;havoc main_#t~ret7;main_#t~short9 := ~fp.eq~FLOAT(main_~res~0, ~fp.neg~FLOAT(~Pluszero~FLOAT())); {1675#false} is VALID [2020-07-28 17:54:36,916 INFO L280 TraceCheckUtils]: 14: Hoare triple {1675#false} assume 0bv32 == fmin_float_#t~ret3;havoc fmin_float_#t~ret3;fmin_float_#res := fmin_float_~x; {1675#false} is VALID [2020-07-28 17:54:36,916 INFO L280 TraceCheckUtils]: 13: Hoare triple {1675#false} fmin_float_#t~ret3 := __fpclassify_float_#res; {1675#false} is VALID [2020-07-28 17:54:36,916 INFO L280 TraceCheckUtils]: 12: Hoare triple {1675#false} assume !(2139095040bv32 == __fpclassify_float_~w~0 || 4286578688bv32 == __fpclassify_float_~w~0);__fpclassify_float_#res := 0bv32; {1675#false} is VALID [2020-07-28 17:54:36,917 INFO L280 TraceCheckUtils]: 11: Hoare triple {1675#false} assume !((~bvuge32(__fpclassify_float_~w~0, 1bv32) && ~bvule32(__fpclassify_float_~w~0, 8388607bv32)) || (~bvuge32(__fpclassify_float_~w~0, 2147483649bv32) && ~bvule32(__fpclassify_float_~w~0, 2155872255bv32))); {1675#false} is VALID [2020-07-28 17:54:36,917 INFO L280 TraceCheckUtils]: 10: Hoare triple {1675#false} assume !((~bvuge32(__fpclassify_float_~w~0, 8388608bv32) && ~bvule32(__fpclassify_float_~w~0, 2139095039bv32)) || (~bvuge32(__fpclassify_float_~w~0, 2155872256bv32) && ~bvule32(__fpclassify_float_~w~0, 4286578687bv32))); {1675#false} is VALID [2020-07-28 17:54:36,918 INFO L280 TraceCheckUtils]: 9: Hoare triple {1702#(= (_ +zero 8 24) (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))} assume !(0bv32 == __fpclassify_float_~w~0 || 2147483648bv32 == __fpclassify_float_~w~0); {1675#false} is VALID [2020-07-28 17:54:36,918 INFO L280 TraceCheckUtils]: 8: Hoare triple {1702#(= (_ +zero 8 24) (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))} goto; {1702#(= (_ +zero 8 24) (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))} is VALID [2020-07-28 17:54:36,920 INFO L280 TraceCheckUtils]: 7: Hoare triple {1698#(= (_ +zero 8 24) ULTIMATE.start___fpclassify_float_~x)} call __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__fpclassify_float_~x, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);call __fpclassify_float_#t~mem0 := read~intINTTYPE4(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);__fpclassify_float_~w~0 := __fpclassify_float_#t~mem0;call write~intFLOATTYPE4(__fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);havoc __fpclassify_float_#t~mem0;havoc __fpclassify_float_#t~union1;call ULTIMATE.dealloc(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset);havoc __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset; {1702#(= (_ +zero 8 24) (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))} is VALID [2020-07-28 17:54:36,925 INFO L280 TraceCheckUtils]: 6: Hoare triple {1682#(= ULTIMATE.start_fmin_float_~y (_ +zero 8 24))} assume !(0bv32 == fmin_float_#t~ret2);havoc fmin_float_#t~ret2;__fpclassify_float_#in~x := fmin_float_~y;havoc __fpclassify_float_#res;havoc __fpclassify_float_#t~mem0, __fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, __fpclassify_float_~x, __fpclassify_float_~w~0;__fpclassify_float_~x := __fpclassify_float_#in~x;havoc __fpclassify_float_~w~0; {1698#(= (_ +zero 8 24) ULTIMATE.start___fpclassify_float_~x)} is VALID [2020-07-28 17:54:36,926 INFO L280 TraceCheckUtils]: 5: Hoare triple {1682#(= ULTIMATE.start_fmin_float_~y (_ +zero 8 24))} fmin_float_#t~ret2 := __fpclassify_float_#res; {1682#(= ULTIMATE.start_fmin_float_~y (_ +zero 8 24))} is VALID [2020-07-28 17:54:36,927 INFO L280 TraceCheckUtils]: 4: Hoare triple {1682#(= ULTIMATE.start_fmin_float_~y (_ +zero 8 24))} assume 0bv32 == __fpclassify_float_~w~0 || 2147483648bv32 == __fpclassify_float_~w~0;__fpclassify_float_#res := 2bv32; {1682#(= ULTIMATE.start_fmin_float_~y (_ +zero 8 24))} is VALID [2020-07-28 17:54:36,927 INFO L280 TraceCheckUtils]: 3: Hoare triple {1682#(= ULTIMATE.start_fmin_float_~y (_ +zero 8 24))} goto; {1682#(= ULTIMATE.start_fmin_float_~y (_ +zero 8 24))} is VALID [2020-07-28 17:54:36,928 INFO L280 TraceCheckUtils]: 2: Hoare triple {1682#(= ULTIMATE.start_fmin_float_~y (_ +zero 8 24))} call __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(__fpclassify_float_~x, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);call __fpclassify_float_#t~mem0 := read~intINTTYPE4(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);__fpclassify_float_~w~0 := __fpclassify_float_#t~mem0;call write~intFLOATTYPE4(__fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, 4bv32);havoc __fpclassify_float_#t~mem0;havoc __fpclassify_float_#t~union1;call ULTIMATE.dealloc(__fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset);havoc __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset; {1682#(= ULTIMATE.start_fmin_float_~y (_ +zero 8 24))} is VALID [2020-07-28 17:54:36,928 INFO L280 TraceCheckUtils]: 1: Hoare triple {1674#true} havoc main_#res;havoc main_#t~ret7, main_#t~ret8, main_#t~short9, main_~x~0, main_~y~0, main_~res~0;main_~x~0 := ~fp.neg~FLOAT(~Pluszero~FLOAT());main_~y~0 := ~Pluszero~FLOAT();fmin_float_#in~x, fmin_float_#in~y := main_~x~0, main_~y~0;havoc fmin_float_#res;havoc fmin_float_#t~ret2, fmin_float_#t~ret3, fmin_float_#t~ite4, fmin_float_~x, fmin_float_~y;fmin_float_~x := fmin_float_#in~x;fmin_float_~y := fmin_float_#in~y;__fpclassify_float_#in~x := fmin_float_~x;havoc __fpclassify_float_#res;havoc __fpclassify_float_#t~mem0, __fpclassify_float_#t~union1, __fpclassify_float_~#gf_u~0.base, __fpclassify_float_~#gf_u~0.offset, __fpclassify_float_~x, __fpclassify_float_~w~0;__fpclassify_float_~x := __fpclassify_float_#in~x;havoc __fpclassify_float_~w~0; {1682#(= ULTIMATE.start_fmin_float_~y (_ +zero 8 24))} is VALID [2020-07-28 17:54:36,928 INFO L280 TraceCheckUtils]: 0: Hoare triple {1674#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {1674#true} is VALID [2020-07-28 17:54:36,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:54:36,930 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1442749258] [2020-07-28 17:54:36,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:54:36,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2020-07-28 17:54:36,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994954422] [2020-07-28 17:54:36,931 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-07-28 17:54:36,931 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:54:36,931 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-28 17:54:36,965 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:54:36,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-28 17:54:36,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 17:54:36,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-28 17:54:36,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-28 17:54:36,966 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 5 states. [2020-07-28 17:54:37,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:54:37,089 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2020-07-28 17:54:37,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-28 17:54:37,089 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-07-28 17:54:37,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:54:37,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 17:54:37,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2020-07-28 17:54:37,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 17:54:37,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2020-07-28 17:54:37,092 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 43 transitions. [2020-07-28 17:54:37,163 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:54:37,163 INFO L225 Difference]: With dead ends: 43 [2020-07-28 17:54:37,163 INFO L226 Difference]: Without dead ends: 23 [2020-07-28 17:54:37,164 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-28 17:54:37,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-28 17:54:37,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-07-28 17:54:37,193 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:54:37,193 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 23 states. [2020-07-28 17:54:37,193 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2020-07-28 17:54:37,193 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2020-07-28 17:54:37,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:54:37,195 INFO L93 Difference]: Finished difference Result 23 states and 22 transitions. [2020-07-28 17:54:37,195 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 22 transitions. [2020-07-28 17:54:37,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:54:37,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:54:37,195 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2020-07-28 17:54:37,196 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2020-07-28 17:54:37,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:54:37,197 INFO L93 Difference]: Finished difference Result 23 states and 22 transitions. [2020-07-28 17:54:37,197 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 22 transitions. [2020-07-28 17:54:37,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:54:37,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:54:37,198 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:54:37,198 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:54:37,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-28 17:54:37,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 22 transitions. [2020-07-28 17:54:37,200 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 22 transitions. Word has length 19 [2020-07-28 17:54:37,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:54:37,200 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 22 transitions. [2020-07-28 17:54:37,201 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-28 17:54:37,201 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 22 transitions. [2020-07-28 17:54:37,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-28 17:54:37,201 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:54:37,202 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:54:37,411 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-07-28 17:54:37,412 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:54:37,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:54:37,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1524231306, now seen corresponding path program 1 times [2020-07-28 17:54:37,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 17:54:37,414 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [147282262] [2020-07-28 17:54:37,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2020-07-28 17:54:37,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 17:54:37,495 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 17:54:37,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 17:54:37,551 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 17:54:37,590 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2020-07-28 17:54:37,590 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-28 17:54:37,791 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2020-07-28 17:54:37,825 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 17:54:37,825 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-28 17:54:37,825 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2020-07-28 17:54:37,826 WARN L170 areAnnotationChecker]: L15-2 has no Hoare annotation [2020-07-28 17:54:37,826 WARN L170 areAnnotationChecker]: L15-1 has no Hoare annotation [2020-07-28 17:54:37,826 WARN L170 areAnnotationChecker]: L15-1 has no Hoare annotation [2020-07-28 17:54:37,826 WARN L170 areAnnotationChecker]: L15-3 has no Hoare annotation [2020-07-28 17:54:37,826 WARN L170 areAnnotationChecker]: L15-3 has no Hoare annotation [2020-07-28 17:54:37,826 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-28 17:54:37,826 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-28 17:54:37,826 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-28 17:54:37,826 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2020-07-28 17:54:37,826 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2020-07-28 17:54:37,827 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-28 17:54:37,827 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-28 17:54:37,827 WARN L170 areAnnotationChecker]: L41-3 has no Hoare annotation [2020-07-28 17:54:37,827 WARN L170 areAnnotationChecker]: L15-6 has no Hoare annotation [2020-07-28 17:54:37,827 WARN L170 areAnnotationChecker]: L15-6 has no Hoare annotation [2020-07-28 17:54:37,827 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-28 17:54:37,827 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2020-07-28 17:54:37,827 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2020-07-28 17:54:37,827 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2020-07-28 17:54:37,827 WARN L170 areAnnotationChecker]: L15-5 has no Hoare annotation [2020-07-28 17:54:37,828 WARN L170 areAnnotationChecker]: L15-5 has no Hoare annotation [2020-07-28 17:54:37,828 WARN L170 areAnnotationChecker]: L15-7 has no Hoare annotation [2020-07-28 17:54:37,828 WARN L170 areAnnotationChecker]: L15-7 has no Hoare annotation [2020-07-28 17:54:37,828 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2020-07-28 17:54:37,828 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2020-07-28 17:54:37,828 WARN L170 areAnnotationChecker]: L69-2 has no Hoare annotation [2020-07-28 17:54:37,828 WARN L170 areAnnotationChecker]: L69-2 has no Hoare annotation [2020-07-28 17:54:37,828 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2020-07-28 17:54:37,828 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-28 17:54:37,828 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-28 17:54:37,829 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2020-07-28 17:54:37,829 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2020-07-28 17:54:37,829 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2020-07-28 17:54:37,829 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2020-07-28 17:54:37,829 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2020-07-28 17:54:37,829 WARN L170 areAnnotationChecker]: L74 has no Hoare annotation [2020-07-28 17:54:37,829 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-28 17:54:37,829 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-28 17:54:37,829 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2020-07-28 17:54:37,830 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2020-07-28 17:54:37,830 WARN L170 areAnnotationChecker]: L53 has no Hoare annotation [2020-07-28 17:54:37,830 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 17:54:37,830 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-28 17:54:37,830 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-28 17:54:37,830 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2020-07-28 17:54:37,830 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2020-07-28 17:54:37,830 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2020-07-28 17:54:37,830 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-28 17:54:37,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 05:54:37 BoogieIcfgContainer [2020-07-28 17:54:37,833 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 17:54:37,833 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 17:54:37,833 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 17:54:37,833 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 17:54:37,834 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:54:31" (3/4) ... [2020-07-28 17:54:37,836 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-07-28 17:54:37,912 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 17:54:37,912 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 17:54:37,915 INFO L168 Benchmark]: Toolchain (without parser) took 7565.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 203.9 MB). Free memory was 957.5 MB in the beginning and 931.3 MB in the end (delta: 26.2 MB). Peak memory consumption was 230.2 MB. Max. memory is 11.5 GB. [2020-07-28 17:54:37,915 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 17:54:37,915 INFO L168 Benchmark]: CACSL2BoogieTranslator took 395.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 957.5 MB in the beginning and 1.1 GB in the end (delta: -178.6 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2020-07-28 17:54:37,916 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-07-28 17:54:37,916 INFO L168 Benchmark]: Boogie Preprocessor took 36.79 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 17:54:37,917 INFO L168 Benchmark]: RCFGBuilder took 603.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.3 MB). Peak memory consumption was 33.3 MB. Max. memory is 11.5 GB. [2020-07-28 17:54:37,917 INFO L168 Benchmark]: TraceAbstraction took 6387.43 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 64.0 MB). Free memory was 1.1 GB in the beginning and 931.3 MB in the end (delta: 164.9 MB). Peak memory consumption was 228.9 MB. Max. memory is 11.5 GB. [2020-07-28 17:54:37,918 INFO L168 Benchmark]: Witness Printer took 79.19 ms. Allocated memory is still 1.2 GB. Free memory was 931.3 MB in the beginning and 931.3 MB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2020-07-28 17:54:37,920 INFO L336 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.27 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 395.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 140.0 MB). Free memory was 957.5 MB in the beginning and 1.1 GB in the end (delta: -178.6 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 56.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.79 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 603.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.3 MB). Peak memory consumption was 33.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6387.43 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 64.0 MB). Free memory was 1.1 GB in the beginning and 931.3 MB in the end (delta: 164.9 MB). Peak memory consumption was 228.9 MB. Max. memory is 11.5 GB. * Witness Printer took 79.19 ms. Allocated memory is still 1.2 GB. Free memory was 931.3 MB in the beginning and 931.3 MB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 70]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L64] float x = -0.0f; [L65] float y = 0.0f; [L13] __uint32_t w; [L16] ieee_float_shape_type gf_u; [L17] gf_u.value = (x) [L18] EXPR gf_u.word [L18] (w) = gf_u.word [L21] COND TRUE w == 0x00000000 || w == 0x80000000 [L22] return 2; [L36] COND FALSE !(__fpclassify_float(x) == 0) [L13] __uint32_t w; [L16] ieee_float_shape_type gf_u; [L17] gf_u.value = (x) [L18] EXPR gf_u.word [L18] (w) = gf_u.word [L21] COND TRUE w == 0x00000000 || w == 0x80000000 [L22] return 2; [L38] COND FALSE !(__fpclassify_float(y) == 0) [L41] EXPR x < y ? x : y [L41] return x < y ? x : y; [L66] float res = fmin_float(x, y); [L69] EXPR res == -0.0f && __signbit_float(res) == 1 [L45] __uint32_t w; [L48] ieee_float_shape_type gf_u; [L49] gf_u.value = (x) [L50] EXPR gf_u.word [L50] (w) = gf_u.word [L53] return (w & 0x80000000) != 0; [L69] EXPR res == -0.0f && __signbit_float(res) == 1 [L69] COND TRUE !(res == -0.0f && __signbit_float(res) == 1) [L70] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 6.2s, OverallIterations: 8, TraceHistogramMax: 1, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 222 SDtfs, 175 SDslu, 301 SDs, 0 SdLazy, 100 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 209 GetRequests, 169 SyntacticMatches, 7 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 59 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 128 NumberOfCodeBlocks, 128 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 198 ConstructedInterpolants, 0 QuantifiedInterpolants, 7783 SizeOfPredicates, 27 NumberOfNonLiveVariables, 328 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...