./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_1251b.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/double_req_bl_1251b.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 26bba4d307ba1cab1a3fe043c826d85928a7cf56 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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/double_req_bl_1251b.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 26bba4d307ba1cab1a3fe043c826d85928a7cf56 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:43:39,291 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 17:43:39,293 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 17:43:39,313 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 17:43:39,313 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 17:43:39,316 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 17:43:39,318 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 17:43:39,330 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 17:43:39,336 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 17:43:39,339 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 17:43:39,342 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 17:43:39,344 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 17:43:39,344 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 17:43:39,347 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 17:43:39,349 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 17:43:39,350 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 17:43:39,352 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 17:43:39,353 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 17:43:39,356 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 17:43:39,360 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 17:43:39,366 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 17:43:39,370 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 17:43:39,372 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 17:43:39,373 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 17:43:39,376 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 17:43:39,377 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 17:43:39,377 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 17:43:39,379 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 17:43:39,380 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 17:43:39,381 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 17:43:39,381 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 17:43:39,382 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 17:43:39,383 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 17:43:39,384 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 17:43:39,385 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 17:43:39,386 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 17:43:39,387 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 17:43:39,387 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 17:43:39,387 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 17:43:39,388 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 17:43:39,390 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 17:43:39,391 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:43:39,421 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 17:43:39,421 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 17:43:39,423 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 17:43:39,423 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 17:43:39,423 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 17:43:39,424 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 17:43:39,424 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 17:43:39,424 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 17:43:39,424 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 17:43:39,425 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 17:43:39,425 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 17:43:39,425 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 17:43:39,426 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 17:43:39,426 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 17:43:39,426 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 17:43:39,426 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 17:43:39,427 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 17:43:39,427 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 17:43:39,427 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 17:43:39,428 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 17:43:39,428 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 17:43:39,428 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 17:43:39,429 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 17:43:39,429 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 17:43:39,429 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 17:43:39,429 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 17:43:39,430 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 17:43:39,430 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 17:43:39,430 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 17:43:39,430 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 -> 26bba4d307ba1cab1a3fe043c826d85928a7cf56 [2020-07-28 17:43:39,765 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 17:43:39,778 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 17:43:39,781 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 17:43:39,783 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 17:43:39,783 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 17:43:39,784 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1251b.c [2020-07-28 17:43:39,861 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53c1ebb16/ac61aef74ac144ca831835e4586b060f/FLAG72ea35d74 [2020-07-28 17:43:40,312 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 17:43:40,313 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1251b.c [2020-07-28 17:43:40,320 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53c1ebb16/ac61aef74ac144ca831835e4586b060f/FLAG72ea35d74 [2020-07-28 17:43:40,731 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53c1ebb16/ac61aef74ac144ca831835e4586b060f [2020-07-28 17:43:40,734 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 17:43:40,737 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 17:43:40,739 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 17:43:40,739 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 17:43:40,744 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 17:43:40,748 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:43:40" (1/1) ... [2020-07-28 17:43:40,752 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32a9cda7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:40, skipping insertion in model container [2020-07-28 17:43:40,752 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:43:40" (1/1) ... [2020-07-28 17:43:40,760 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 17:43:40,781 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 17:43:41,030 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:43:41,037 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 17:43:41,092 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:43:41,226 INFO L208 MainTranslator]: Completed translation [2020-07-28 17:43:41,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:41 WrapperNode [2020-07-28 17:43:41,227 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 17:43:41,229 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 17:43:41,229 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 17:43:41,230 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 17:43:41,240 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:43:41" (1/1) ... [2020-07-28 17:43:41,261 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:43:41" (1/1) ... [2020-07-28 17:43:41,298 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 17:43:41,299 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 17:43:41,299 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 17:43:41,299 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 17:43:41,310 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:41" (1/1) ... [2020-07-28 17:43:41,310 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:41" (1/1) ... [2020-07-28 17:43:41,313 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:41" (1/1) ... [2020-07-28 17:43:41,313 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:41" (1/1) ... [2020-07-28 17:43:41,325 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:41" (1/1) ... [2020-07-28 17:43:41,331 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:41" (1/1) ... [2020-07-28 17:43:41,333 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:41" (1/1) ... [2020-07-28 17:43:41,336 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 17:43:41,337 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 17:43:41,339 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 17:43:41,339 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 17:43:41,341 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:41" (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:43:41,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-28 17:43:41,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-07-28 17:43:41,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 17:43:41,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 17:43:41,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-28 17:43:41,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-28 17:43:41,976 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 17:43:41,976 INFO L295 CfgBuilder]: Removed 16 assume(true) statements. [2020-07-28 17:43:41,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:43:41 BoogieIcfgContainer [2020-07-28 17:43:41,981 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 17:43:41,982 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 17:43:41,982 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 17:43:41,986 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 17:43:41,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 05:43:40" (1/3) ... [2020-07-28 17:43:41,987 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c5458cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:43:41, skipping insertion in model container [2020-07-28 17:43:41,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:41" (2/3) ... [2020-07-28 17:43:41,988 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c5458cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:43:41, skipping insertion in model container [2020-07-28 17:43:41,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:43:41" (3/3) ... [2020-07-28 17:43:41,990 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1251b.c [2020-07-28 17:43:42,001 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 17:43:42,009 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 17:43:42,024 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 17:43:42,049 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 17:43:42,050 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 17:43:42,050 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 17:43:42,050 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 17:43:42,051 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 17:43:42,051 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 17:43:42,051 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 17:43:42,051 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 17:43:42,069 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2020-07-28 17:43:42,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-28 17:43:42,076 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:43:42,077 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:43:42,078 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:43:42,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:43:42,085 INFO L82 PathProgramCache]: Analyzing trace with hash -124750094, now seen corresponding path program 1 times [2020-07-28 17:43:42,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:43:42,095 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431200304] [2020-07-28 17:43:42,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:43:42,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:43:42,245 INFO L280 TraceCheckUtils]: 0: Hoare triple {33#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {33#true} is VALID [2020-07-28 17:43:42,246 INFO L280 TraceCheckUtils]: 1: Hoare triple {33#true} havoc main_#res;havoc main_#t~nondet7, main_#t~ret8, main_#t~ret9, main_~res~0, main_~x~0, main_~y~0;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~y~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0);isnan_double_#in~x := main_~x~0;havoc isnan_double_#res;havoc isnan_double_~x;isnan_double_~x := isnan_double_#in~x;isnan_double_#res := (if ~someBinaryDOUBLEComparisonOperation(isnan_double_~x, isnan_double_~x) then 1 else 0); {33#true} is VALID [2020-07-28 17:43:42,246 INFO L280 TraceCheckUtils]: 2: Hoare triple {33#true} main_#t~ret8 := isnan_double_#res;assume -2147483648 <= main_#t~ret8 && main_#t~ret8 <= 2147483647; {33#true} is VALID [2020-07-28 17:43:42,246 INFO L280 TraceCheckUtils]: 3: Hoare triple {33#true} assume 0 == main_#t~ret8;havoc main_#t~ret8;fmax_double_#in~x, fmax_double_#in~y := main_~x~0, main_~y~0;havoc fmax_double_#res;havoc fmax_double_#t~ret4, fmax_double_#t~ret5, fmax_double_#t~ite6, fmax_double_~x, fmax_double_~y;fmax_double_~x := fmax_double_#in~x;fmax_double_~y := fmax_double_#in~y;__fpclassify_double_#in~x := fmax_double_~x;havoc __fpclassify_double_#res;havoc __fpclassify_double_#t~mem0, __fpclassify_double_#t~union1, __fpclassify_double_#t~mem2, __fpclassify_double_#t~union3, __fpclassify_double_~#ew_u~0.base, __fpclassify_double_~#ew_u~0.offset, __fpclassify_double_~x, __fpclassify_double_~msw~0, __fpclassify_double_~lsw~0;__fpclassify_double_~x := __fpclassify_double_#in~x;havoc __fpclassify_double_~msw~0;havoc __fpclassify_double_~lsw~0; {33#true} is VALID [2020-07-28 17:43:42,248 INFO L280 TraceCheckUtils]: 4: Hoare triple {33#true} assume !true; {34#false} is VALID [2020-07-28 17:43:42,248 INFO L280 TraceCheckUtils]: 5: Hoare triple {34#false} assume (0 == __fpclassify_double_~msw~0 % 4294967296 && 0 == __fpclassify_double_~lsw~0 % 4294967296) || (2147483648 == __fpclassify_double_~msw~0 % 4294967296 && 0 == __fpclassify_double_~lsw~0 % 4294967296);__fpclassify_double_#res := 2; {34#false} is VALID [2020-07-28 17:43:42,249 INFO L280 TraceCheckUtils]: 6: Hoare triple {34#false} fmax_double_#t~ret4 := __fpclassify_double_#res;assume -2147483648 <= fmax_double_#t~ret4 && fmax_double_#t~ret4 <= 2147483647; {34#false} is VALID [2020-07-28 17:43:42,249 INFO L280 TraceCheckUtils]: 7: Hoare triple {34#false} assume 0 == fmax_double_#t~ret4;havoc fmax_double_#t~ret4;fmax_double_#res := fmax_double_~y; {34#false} is VALID [2020-07-28 17:43:42,249 INFO L280 TraceCheckUtils]: 8: Hoare triple {34#false} main_#t~ret9 := fmax_double_#res;main_~res~0 := main_#t~ret9;havoc main_#t~ret9; {34#false} is VALID [2020-07-28 17:43:42,250 INFO L280 TraceCheckUtils]: 9: Hoare triple {34#false} assume ~someBinaryDOUBLEComparisonOperation(main_~res~0, main_~x~0); {34#false} is VALID [2020-07-28 17:43:42,250 INFO L280 TraceCheckUtils]: 10: Hoare triple {34#false} assume !false; {34#false} is VALID [2020-07-28 17:43:42,253 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:43:42,254 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431200304] [2020-07-28 17:43:42,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:43:42,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-28 17:43:42,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347816384] [2020-07-28 17:43:42,262 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2020-07-28 17:43:42,264 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:43:42,268 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 17:43:42,297 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:43:42,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 17:43:42,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:43:42,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 17:43:42,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 17:43:42,309 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2020-07-28 17:43:42,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:43:42,398 INFO L93 Difference]: Finished difference Result 56 states and 87 transitions. [2020-07-28 17:43:42,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 17:43:42,399 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2020-07-28 17:43:42,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:43:42,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:43:42,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 87 transitions. [2020-07-28 17:43:42,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:43:42,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 87 transitions. [2020-07-28 17:43:42,414 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 87 transitions. [2020-07-28 17:43:42,607 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:43:42,622 INFO L225 Difference]: With dead ends: 56 [2020-07-28 17:43:42,623 INFO L226 Difference]: Without dead ends: 26 [2020-07-28 17:43:42,629 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:43:42,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-28 17:43:42,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-07-28 17:43:42,672 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:43:42,673 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2020-07-28 17:43:42,673 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2020-07-28 17:43:42,673 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2020-07-28 17:43:42,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:43:42,680 INFO L93 Difference]: Finished difference Result 26 states and 36 transitions. [2020-07-28 17:43:42,680 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2020-07-28 17:43:42,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:43:42,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:43:42,682 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2020-07-28 17:43:42,682 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2020-07-28 17:43:42,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:43:42,691 INFO L93 Difference]: Finished difference Result 26 states and 36 transitions. [2020-07-28 17:43:42,692 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2020-07-28 17:43:42,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:43:42,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:43:42,698 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:43:42,699 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:43:42,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-28 17:43:42,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2020-07-28 17:43:42,706 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 11 [2020-07-28 17:43:42,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:43:42,706 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2020-07-28 17:43:42,706 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 17:43:42,706 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2020-07-28 17:43:42,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-28 17:43:42,708 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:43:42,708 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:43:42,709 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 17:43:42,709 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:43:42,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:43:42,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1352831344, now seen corresponding path program 1 times [2020-07-28 17:43:42,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:43:42,711 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363918043] [2020-07-28 17:43:42,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:43:42,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:43:42,835 INFO L280 TraceCheckUtils]: 0: Hoare triple {190#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {190#true} is VALID [2020-07-28 17:43:42,835 INFO L280 TraceCheckUtils]: 1: Hoare triple {190#true} havoc main_#res;havoc main_#t~nondet7, main_#t~ret8, main_#t~ret9, main_~res~0, main_~x~0, main_~y~0;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~y~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0);isnan_double_#in~x := main_~x~0;havoc isnan_double_#res;havoc isnan_double_~x;isnan_double_~x := isnan_double_#in~x;isnan_double_#res := (if ~someBinaryDOUBLEComparisonOperation(isnan_double_~x, isnan_double_~x) then 1 else 0); {190#true} is VALID [2020-07-28 17:43:42,836 INFO L280 TraceCheckUtils]: 2: Hoare triple {190#true} main_#t~ret8 := isnan_double_#res;assume -2147483648 <= main_#t~ret8 && main_#t~ret8 <= 2147483647; {190#true} is VALID [2020-07-28 17:43:42,836 INFO L280 TraceCheckUtils]: 3: Hoare triple {190#true} assume 0 == main_#t~ret8;havoc main_#t~ret8;fmax_double_#in~x, fmax_double_#in~y := main_~x~0, main_~y~0;havoc fmax_double_#res;havoc fmax_double_#t~ret4, fmax_double_#t~ret5, fmax_double_#t~ite6, fmax_double_~x, fmax_double_~y;fmax_double_~x := fmax_double_#in~x;fmax_double_~y := fmax_double_#in~y;__fpclassify_double_#in~x := fmax_double_~x;havoc __fpclassify_double_#res;havoc __fpclassify_double_#t~mem0, __fpclassify_double_#t~union1, __fpclassify_double_#t~mem2, __fpclassify_double_#t~union3, __fpclassify_double_~#ew_u~0.base, __fpclassify_double_~#ew_u~0.offset, __fpclassify_double_~x, __fpclassify_double_~msw~0, __fpclassify_double_~lsw~0;__fpclassify_double_~x := __fpclassify_double_#in~x;havoc __fpclassify_double_~msw~0;havoc __fpclassify_double_~lsw~0; {190#true} is VALID [2020-07-28 17:43:42,836 INFO L280 TraceCheckUtils]: 4: Hoare triple {190#true} call __fpclassify_double_~#ew_u~0.base, __fpclassify_double_~#ew_u~0.offset := #Ultimate.allocOnStack(8);call write~real(__fpclassify_double_~x, __fpclassify_double_~#ew_u~0.base, __fpclassify_double_~#ew_u~0.offset, 8);call __fpclassify_double_#t~mem0 := read~int(__fpclassify_double_~#ew_u~0.base, 4 + __fpclassify_double_~#ew_u~0.offset, 4);__fpclassify_double_~msw~0 := __fpclassify_double_#t~mem0;call write~real(__fpclassify_double_#t~union1, __fpclassify_double_~#ew_u~0.base, __fpclassify_double_~#ew_u~0.offset, 8);havoc __fpclassify_double_#t~mem0;havoc __fpclassify_double_#t~union1;call __fpclassify_double_#t~mem2 := read~int(__fpclassify_double_~#ew_u~0.base, __fpclassify_double_~#ew_u~0.offset, 4);__fpclassify_double_~lsw~0 := __fpclassify_double_#t~mem2;call write~real(__fpclassify_double_#t~union3, __fpclassify_double_~#ew_u~0.base, __fpclassify_double_~#ew_u~0.offset, 8);havoc __fpclassify_double_#t~mem2;havoc __fpclassify_double_#t~union3;call ULTIMATE.dealloc(__fpclassify_double_~#ew_u~0.base, __fpclassify_double_~#ew_u~0.offset);havoc __fpclassify_double_~#ew_u~0.base, __fpclassify_double_~#ew_u~0.offset; {190#true} is VALID [2020-07-28 17:43:42,837 INFO L280 TraceCheckUtils]: 5: Hoare triple {190#true} goto; {190#true} is VALID [2020-07-28 17:43:42,838 INFO L280 TraceCheckUtils]: 6: Hoare triple {190#true} assume (0 == __fpclassify_double_~msw~0 % 4294967296 && 0 == __fpclassify_double_~lsw~0 % 4294967296) || (2147483648 == __fpclassify_double_~msw~0 % 4294967296 && 0 == __fpclassify_double_~lsw~0 % 4294967296);__fpclassify_double_#res := 2; {192#(<= 2 |ULTIMATE.start___fpclassify_double_#res|)} is VALID [2020-07-28 17:43:42,839 INFO L280 TraceCheckUtils]: 7: Hoare triple {192#(<= 2 |ULTIMATE.start___fpclassify_double_#res|)} fmax_double_#t~ret4 := __fpclassify_double_#res;assume -2147483648 <= fmax_double_#t~ret4 && fmax_double_#t~ret4 <= 2147483647; {193#(<= 2 |ULTIMATE.start_fmax_double_#t~ret4|)} is VALID [2020-07-28 17:43:42,840 INFO L280 TraceCheckUtils]: 8: Hoare triple {193#(<= 2 |ULTIMATE.start_fmax_double_#t~ret4|)} assume 0 == fmax_double_#t~ret4;havoc fmax_double_#t~ret4;fmax_double_#res := fmax_double_~y; {191#false} is VALID [2020-07-28 17:43:42,841 INFO L280 TraceCheckUtils]: 9: Hoare triple {191#false} main_#t~ret9 := fmax_double_#res;main_~res~0 := main_#t~ret9;havoc main_#t~ret9; {191#false} is VALID [2020-07-28 17:43:42,841 INFO L280 TraceCheckUtils]: 10: Hoare triple {191#false} assume ~someBinaryDOUBLEComparisonOperation(main_~res~0, main_~x~0); {191#false} is VALID [2020-07-28 17:43:42,841 INFO L280 TraceCheckUtils]: 11: Hoare triple {191#false} assume !false; {191#false} is VALID [2020-07-28 17:43:42,842 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:43:42,843 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363918043] [2020-07-28 17:43:42,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:43:42,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-28 17:43:42,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736635751] [2020-07-28 17:43:42,845 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-07-28 17:43:42,846 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:43:42,846 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 17:43:42,864 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:43:42,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 17:43:42,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:43:42,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 17:43:42,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-28 17:43:42,866 INFO L87 Difference]: Start difference. First operand 26 states and 36 transitions. Second operand 4 states. [2020-07-28 17:43:43,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:43:43,056 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2020-07-28 17:43:43,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-28 17:43:43,057 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-07-28 17:43:43,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:43:43,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 17:43:43,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2020-07-28 17:43:43,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 17:43:43,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2020-07-28 17:43:43,063 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 51 transitions. [2020-07-28 17:43:43,138 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:43:43,140 INFO L225 Difference]: With dead ends: 40 [2020-07-28 17:43:43,140 INFO L226 Difference]: Without dead ends: 36 [2020-07-28 17:43:43,142 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:43:43,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-28 17:43:43,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2020-07-28 17:43:43,150 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:43:43,151 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 28 states. [2020-07-28 17:43:43,151 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 28 states. [2020-07-28 17:43:43,151 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 28 states. [2020-07-28 17:43:43,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:43:43,155 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2020-07-28 17:43:43,155 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2020-07-28 17:43:43,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:43:43,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:43:43,157 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 36 states. [2020-07-28 17:43:43,157 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 36 states. [2020-07-28 17:43:43,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:43:43,161 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2020-07-28 17:43:43,161 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2020-07-28 17:43:43,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:43:43,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:43:43,162 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:43:43,162 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:43:43,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-28 17:43:43,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2020-07-28 17:43:43,165 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 12 [2020-07-28 17:43:43,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:43:43,166 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2020-07-28 17:43:43,166 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 17:43:43,166 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2020-07-28 17:43:43,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-28 17:43:43,167 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:43:43,168 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:43:43,168 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-28 17:43:43,168 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:43:43,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:43:43,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1045511114, now seen corresponding path program 1 times [2020-07-28 17:43:43,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:43:43,170 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238069975] [2020-07-28 17:43:43,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:43:43,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:43:43,275 INFO L280 TraceCheckUtils]: 0: Hoare triple {355#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {355#true} is VALID [2020-07-28 17:43:43,276 INFO L280 TraceCheckUtils]: 1: Hoare triple {355#true} havoc main_#res;havoc main_#t~nondet7, main_#t~ret8, main_#t~ret9, main_~res~0, main_~x~0, main_~y~0;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~y~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0);isnan_double_#in~x := main_~x~0;havoc isnan_double_#res;havoc isnan_double_~x;isnan_double_~x := isnan_double_#in~x;isnan_double_#res := (if ~someBinaryDOUBLEComparisonOperation(isnan_double_~x, isnan_double_~x) then 1 else 0); {355#true} is VALID [2020-07-28 17:43:43,276 INFO L280 TraceCheckUtils]: 2: Hoare triple {355#true} main_#t~ret8 := isnan_double_#res;assume -2147483648 <= main_#t~ret8 && main_#t~ret8 <= 2147483647; {355#true} is VALID [2020-07-28 17:43:43,277 INFO L280 TraceCheckUtils]: 3: Hoare triple {355#true} assume 0 == main_#t~ret8;havoc main_#t~ret8;fmax_double_#in~x, fmax_double_#in~y := main_~x~0, main_~y~0;havoc fmax_double_#res;havoc fmax_double_#t~ret4, fmax_double_#t~ret5, fmax_double_#t~ite6, fmax_double_~x, fmax_double_~y;fmax_double_~x := fmax_double_#in~x;fmax_double_~y := fmax_double_#in~y;__fpclassify_double_#in~x := fmax_double_~x;havoc __fpclassify_double_#res;havoc __fpclassify_double_#t~mem0, __fpclassify_double_#t~union1, __fpclassify_double_#t~mem2, __fpclassify_double_#t~union3, __fpclassify_double_~#ew_u~0.base, __fpclassify_double_~#ew_u~0.offset, __fpclassify_double_~x, __fpclassify_double_~msw~0, __fpclassify_double_~lsw~0;__fpclassify_double_~x := __fpclassify_double_#in~x;havoc __fpclassify_double_~msw~0;havoc __fpclassify_double_~lsw~0; {355#true} is VALID [2020-07-28 17:43:43,277 INFO L280 TraceCheckUtils]: 4: Hoare triple {355#true} call __fpclassify_double_~#ew_u~0.base, __fpclassify_double_~#ew_u~0.offset := #Ultimate.allocOnStack(8);call write~real(__fpclassify_double_~x, __fpclassify_double_~#ew_u~0.base, __fpclassify_double_~#ew_u~0.offset, 8);call __fpclassify_double_#t~mem0 := read~int(__fpclassify_double_~#ew_u~0.base, 4 + __fpclassify_double_~#ew_u~0.offset, 4);__fpclassify_double_~msw~0 := __fpclassify_double_#t~mem0;call write~real(__fpclassify_double_#t~union1, __fpclassify_double_~#ew_u~0.base, __fpclassify_double_~#ew_u~0.offset, 8);havoc __fpclassify_double_#t~mem0;havoc __fpclassify_double_#t~union1;call __fpclassify_double_#t~mem2 := read~int(__fpclassify_double_~#ew_u~0.base, __fpclassify_double_~#ew_u~0.offset, 4);__fpclassify_double_~lsw~0 := __fpclassify_double_#t~mem2;call write~real(__fpclassify_double_#t~union3, __fpclassify_double_~#ew_u~0.base, __fpclassify_double_~#ew_u~0.offset, 8);havoc __fpclassify_double_#t~mem2;havoc __fpclassify_double_#t~union3;call ULTIMATE.dealloc(__fpclassify_double_~#ew_u~0.base, __fpclassify_double_~#ew_u~0.offset);havoc __fpclassify_double_~#ew_u~0.base, __fpclassify_double_~#ew_u~0.offset; {355#true} is VALID [2020-07-28 17:43:43,278 INFO L280 TraceCheckUtils]: 5: Hoare triple {355#true} goto; {355#true} is VALID [2020-07-28 17:43:43,278 INFO L280 TraceCheckUtils]: 6: Hoare triple {355#true} assume !((0 == __fpclassify_double_~msw~0 % 4294967296 && 0 == __fpclassify_double_~lsw~0 % 4294967296) || (2147483648 == __fpclassify_double_~msw~0 % 4294967296 && 0 == __fpclassify_double_~lsw~0 % 4294967296)); {355#true} is VALID [2020-07-28 17:43:43,278 INFO L280 TraceCheckUtils]: 7: Hoare triple {355#true} assume !((__fpclassify_double_~msw~0 % 4294967296 >= 1048576 && __fpclassify_double_~msw~0 % 4294967296 <= 2146435071) || (__fpclassify_double_~msw~0 % 4294967296 >= 2148532224 && __fpclassify_double_~msw~0 % 4294967296 <= 4293918719)); {355#true} is VALID [2020-07-28 17:43:43,279 INFO L280 TraceCheckUtils]: 8: Hoare triple {355#true} assume !(__fpclassify_double_~msw~0 % 4294967296 <= 1048575 || (__fpclassify_double_~msw~0 % 4294967296 >= 2147483648 && __fpclassify_double_~msw~0 % 4294967296 <= 2148532223)); {355#true} is VALID [2020-07-28 17:43:43,280 INFO L280 TraceCheckUtils]: 9: Hoare triple {355#true} assume (2146435072 == __fpclassify_double_~msw~0 % 4294967296 && 0 == __fpclassify_double_~lsw~0 % 4294967296) || (4293918720 == __fpclassify_double_~msw~0 % 4294967296 && 0 == __fpclassify_double_~lsw~0 % 4294967296);__fpclassify_double_#res := 1; {357#(<= 1 |ULTIMATE.start___fpclassify_double_#res|)} is VALID [2020-07-28 17:43:43,282 INFO L280 TraceCheckUtils]: 10: Hoare triple {357#(<= 1 |ULTIMATE.start___fpclassify_double_#res|)} fmax_double_#t~ret4 := __fpclassify_double_#res;assume -2147483648 <= fmax_double_#t~ret4 && fmax_double_#t~ret4 <= 2147483647; {358#(<= 1 |ULTIMATE.start_fmax_double_#t~ret4|)} is VALID [2020-07-28 17:43:43,283 INFO L280 TraceCheckUtils]: 11: Hoare triple {358#(<= 1 |ULTIMATE.start_fmax_double_#t~ret4|)} assume 0 == fmax_double_#t~ret4;havoc fmax_double_#t~ret4;fmax_double_#res := fmax_double_~y; {356#false} is VALID [2020-07-28 17:43:43,283 INFO L280 TraceCheckUtils]: 12: Hoare triple {356#false} main_#t~ret9 := fmax_double_#res;main_~res~0 := main_#t~ret9;havoc main_#t~ret9; {356#false} is VALID [2020-07-28 17:43:43,283 INFO L280 TraceCheckUtils]: 13: Hoare triple {356#false} assume ~someBinaryDOUBLEComparisonOperation(main_~res~0, main_~x~0); {356#false} is VALID [2020-07-28 17:43:43,284 INFO L280 TraceCheckUtils]: 14: Hoare triple {356#false} assume !false; {356#false} is VALID [2020-07-28 17:43:43,285 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:43:43,285 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238069975] [2020-07-28 17:43:43,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:43:43,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-28 17:43:43,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421668737] [2020-07-28 17:43:43,287 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-07-28 17:43:43,287 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:43:43,287 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 17:43:43,310 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:43:43,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 17:43:43,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:43:43,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 17:43:43,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-28 17:43:43,311 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand 4 states. [2020-07-28 17:43:43,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:43:43,483 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2020-07-28 17:43:43,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-28 17:43:43,483 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-07-28 17:43:43,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:43:43,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 17:43:43,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2020-07-28 17:43:43,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 17:43:43,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2020-07-28 17:43:43,488 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 51 transitions. [2020-07-28 17:43:43,560 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:43:43,562 INFO L225 Difference]: With dead ends: 42 [2020-07-28 17:43:43,562 INFO L226 Difference]: Without dead ends: 38 [2020-07-28 17:43:43,563 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:43:43,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-28 17:43:43,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2020-07-28 17:43:43,571 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:43:43,571 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 28 states. [2020-07-28 17:43:43,572 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 28 states. [2020-07-28 17:43:43,572 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 28 states. [2020-07-28 17:43:43,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:43:43,575 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2020-07-28 17:43:43,575 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2020-07-28 17:43:43,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:43:43,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:43:43,576 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 38 states. [2020-07-28 17:43:43,577 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 38 states. [2020-07-28 17:43:43,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:43:43,580 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2020-07-28 17:43:43,580 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2020-07-28 17:43:43,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:43:43,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:43:43,581 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:43:43,582 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:43:43,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-28 17:43:43,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2020-07-28 17:43:43,584 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 15 [2020-07-28 17:43:43,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:43:43,585 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2020-07-28 17:43:43,585 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 17:43:43,586 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2020-07-28 17:43:43,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-28 17:43:43,586 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:43:43,587 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:43:43,587 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-28 17:43:43,587 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:43:43,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:43:43,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1102769416, now seen corresponding path program 1 times [2020-07-28 17:43:43,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:43:43,589 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805685626] [2020-07-28 17:43:43,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:43:43,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 17:43:43,749 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 17:43:43,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 17:43:43,851 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 17:43:43,877 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-28 17:43:43,878 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-28 17:43:43,878 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-28 17:43:43,911 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 17:43:43,912 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-28 17:43:43,912 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2020-07-28 17:43:43,912 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2020-07-28 17:43:43,912 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2020-07-28 17:43:43,912 WARN L170 areAnnotationChecker]: L29-2 has no Hoare annotation [2020-07-28 17:43:43,913 WARN L170 areAnnotationChecker]: L29-2 has no Hoare annotation [2020-07-28 17:43:43,913 WARN L170 areAnnotationChecker]: L72-2 has no Hoare annotation [2020-07-28 17:43:43,913 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2020-07-28 17:43:43,913 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2020-07-28 17:43:43,913 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2020-07-28 17:43:43,913 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2020-07-28 17:43:43,914 WARN L170 areAnnotationChecker]: L83 has no Hoare annotation [2020-07-28 17:43:43,914 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2020-07-28 17:43:43,914 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2020-07-28 17:43:43,914 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2020-07-28 17:43:43,914 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 17:43:43,914 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2020-07-28 17:43:43,915 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2020-07-28 17:43:43,915 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2020-07-28 17:43:43,915 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2020-07-28 17:43:43,915 WARN L170 areAnnotationChecker]: L60-3 has no Hoare annotation [2020-07-28 17:43:43,915 WARN L170 areAnnotationChecker]: L29-6 has no Hoare annotation [2020-07-28 17:43:43,915 WARN L170 areAnnotationChecker]: L29-6 has no Hoare annotation [2020-07-28 17:43:43,916 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2020-07-28 17:43:43,916 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2020-07-28 17:43:43,916 WARN L170 areAnnotationChecker]: L77 has no Hoare annotation [2020-07-28 17:43:43,916 WARN L170 areAnnotationChecker]: L77 has no Hoare annotation [2020-07-28 17:43:43,916 WARN L170 areAnnotationChecker]: L29-5 has no Hoare annotation [2020-07-28 17:43:43,916 WARN L170 areAnnotationChecker]: L29-5 has no Hoare annotation [2020-07-28 17:43:43,916 WARN L170 areAnnotationChecker]: L29-7 has no Hoare annotation [2020-07-28 17:43:43,917 WARN L170 areAnnotationChecker]: L29-7 has no Hoare annotation [2020-07-28 17:43:43,917 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2020-07-28 17:43:43,917 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2020-07-28 17:43:43,917 WARN L170 areAnnotationChecker]: L50-1 has no Hoare annotation [2020-07-28 17:43:43,917 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2020-07-28 17:43:43,918 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2020-07-28 17:43:43,918 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2020-07-28 17:43:43,918 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2020-07-28 17:43:43,918 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2020-07-28 17:43:43,918 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2020-07-28 17:43:43,918 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2020-07-28 17:43:43,919 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2020-07-28 17:43:43,919 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2020-07-28 17:43:43,919 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2020-07-28 17:43:43,919 WARN L170 areAnnotationChecker]: L60-2 has no Hoare annotation [2020-07-28 17:43:43,919 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:43:43,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 05:43:43 BoogieIcfgContainer [2020-07-28 17:43:43,922 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 17:43:43,926 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 17:43:43,926 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 17:43:43,926 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 17:43:43,927 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:43:41" (3/4) ... [2020-07-28 17:43:43,933 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-28 17:43:43,933 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 17:43:43,939 INFO L168 Benchmark]: Toolchain (without parser) took 3199.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 961.6 MB in the beginning and 939.6 MB in the end (delta: 21.9 MB). Peak memory consumption was 176.6 MB. Max. memory is 11.5 GB. [2020-07-28 17:43:43,940 INFO L168 Benchmark]: CDTParser took 0.33 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:43:43,944 INFO L168 Benchmark]: CACSL2BoogieTranslator took 489.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 961.6 MB in the beginning and 1.1 GB in the end (delta: -187.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2020-07-28 17:43:43,946 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.21 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2020-07-28 17:43:43,947 INFO L168 Benchmark]: Boogie Preprocessor took 38.30 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:43:43,948 INFO L168 Benchmark]: RCFGBuilder took 643.57 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: 39.2 MB). Peak memory consumption was 39.2 MB. Max. memory is 11.5 GB. [2020-07-28 17:43:43,951 INFO L168 Benchmark]: TraceAbstraction took 1943.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 939.6 MB in the end (delta: 163.5 MB). Peak memory consumption was 163.5 MB. Max. memory is 11.5 GB. [2020-07-28 17:43:43,953 INFO L168 Benchmark]: Witness Printer took 7.89 ms. Allocated memory is still 1.2 GB. Free memory is still 939.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 17:43:43,961 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.33 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 489.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 961.6 MB in the beginning and 1.1 GB in the end (delta: -187.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 69.21 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.30 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 643.57 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: 39.2 MB). Peak memory consumption was 39.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1943.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 939.6 MB in the end (delta: 163.5 MB). Peak memory consumption was 163.5 MB. Max. memory is 11.5 GB. * Witness Printer took 7.89 ms. Allocated memory is still 1.2 GB. Free memory is still 939.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 78]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 77, overapproximation of someBinaryArithmeticDOUBLEoperation at line 65. Possible FailurePath: [L64] double x = __VERIFIER_nondet_double(); [L65] double y = 0.0 / 0.0; [L16] return x != x; [L72] COND TRUE !isnan_double(x) [L27] __uint32_t msw, lsw; [L30] ieee_double_shape_type ew_u; [L31] ew_u.value = (x) [L32] EXPR ew_u.parts.msw [L32] (msw) = ew_u.parts.msw [L33] EXPR ew_u.parts.lsw [L33] (lsw) = ew_u.parts.lsw [L36-L37] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) [L39-L40] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) [L42-L43] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) [L46-L47] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L50] return 0; [L55] COND TRUE __fpclassify_double(x) == 0 [L56] return y; [L74] double res = fmax_double(x, y); [L77] COND TRUE res != x [L78] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 1.8s, OverallIterations: 4, TraceHistogramMax: 1, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 113 SDtfs, 20 SDslu, 112 SDs, 0 SdLazy, 30 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred 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.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 18 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 53 NumberOfCodeBlocks, 53 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 35 ConstructedInterpolants, 0 QuantifiedInterpolants, 517 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 17:43:45,912 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 17:43:45,915 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 17:43:45,935 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 17:43:45,936 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 17:43:45,938 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 17:43:45,941 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 17:43:45,953 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 17:43:45,958 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 17:43:45,960 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 17:43:45,964 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 17:43:45,966 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 17:43:45,966 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 17:43:45,969 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 17:43:45,971 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 17:43:45,972 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 17:43:45,975 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 17:43:45,976 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 17:43:45,981 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 17:43:45,983 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 17:43:45,985 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 17:43:45,986 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 17:43:45,987 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 17:43:45,988 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 17:43:45,990 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 17:43:45,991 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 17:43:45,991 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 17:43:45,992 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 17:43:45,992 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 17:43:45,993 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 17:43:45,994 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 17:43:45,995 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 17:43:45,995 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 17:43:45,996 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 17:43:45,997 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 17:43:45,997 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 17:43:45,998 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 17:43:45,998 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 17:43:45,999 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 17:43:45,999 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 17:43:46,000 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 17:43:46,001 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:43:46,016 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 17:43:46,017 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 17:43:46,018 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 17:43:46,018 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 17:43:46,019 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 17:43:46,019 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 17:43:46,019 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 17:43:46,019 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 17:43:46,019 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 17:43:46,020 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 17:43:46,020 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 17:43:46,020 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 17:43:46,020 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-07-28 17:43:46,020 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-07-28 17:43:46,021 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 17:43:46,021 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 17:43:46,021 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 17:43:46,021 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 17:43:46,024 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 17:43:46,024 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 17:43:46,024 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 17:43:46,024 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 17:43:46,024 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 17:43:46,025 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 17:43:46,025 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 17:43:46,025 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 17:43:46,025 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-07-28 17:43:46,026 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-07-28 17:43:46,026 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 17:43:46,026 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 17:43:46,026 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-28 17:43:46,027 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 -> 26bba4d307ba1cab1a3fe043c826d85928a7cf56 [2020-07-28 17:43:46,391 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 17:43:46,411 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 17:43:46,416 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 17:43:46,417 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 17:43:46,419 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 17:43:46,419 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1251b.c [2020-07-28 17:43:46,495 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30945fa1e/b46107d5dee64f8aaf95f0ed084be61c/FLAG42dcc2c23 [2020-07-28 17:43:46,874 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 17:43:46,875 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1251b.c [2020-07-28 17:43:46,881 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30945fa1e/b46107d5dee64f8aaf95f0ed084be61c/FLAG42dcc2c23 [2020-07-28 17:43:47,247 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30945fa1e/b46107d5dee64f8aaf95f0ed084be61c [2020-07-28 17:43:47,251 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 17:43:47,254 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 17:43:47,255 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 17:43:47,256 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 17:43:47,261 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 17:43:47,263 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:43:47" (1/1) ... [2020-07-28 17:43:47,266 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4374af48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:47, skipping insertion in model container [2020-07-28 17:43:47,266 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:43:47" (1/1) ... [2020-07-28 17:43:47,274 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 17:43:47,295 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 17:43:47,545 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:43:47,553 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 17:43:47,585 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:43:47,624 INFO L208 MainTranslator]: Completed translation [2020-07-28 17:43:47,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:47 WrapperNode [2020-07-28 17:43:47,625 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 17:43:47,627 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 17:43:47,627 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 17:43:47,688 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 17:43:47,702 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:43:47" (1/1) ... [2020-07-28 17:43:47,731 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:43:47" (1/1) ... [2020-07-28 17:43:47,764 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 17:43:47,765 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 17:43:47,765 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 17:43:47,766 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 17:43:47,775 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:47" (1/1) ... [2020-07-28 17:43:47,776 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:47" (1/1) ... [2020-07-28 17:43:47,780 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:47" (1/1) ... [2020-07-28 17:43:47,781 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:47" (1/1) ... [2020-07-28 17:43:47,793 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:47" (1/1) ... [2020-07-28 17:43:47,799 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:47" (1/1) ... [2020-07-28 17:43:47,802 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:47" (1/1) ... [2020-07-28 17:43:47,806 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 17:43:47,807 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 17:43:47,807 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 17:43:47,807 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 17:43:47,811 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:47" (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:43:47,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2020-07-28 17:43:47,882 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-28 17:43:47,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2020-07-28 17:43:47,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 17:43:47,883 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 17:43:47,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-28 17:43:48,486 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 17:43:48,486 INFO L295 CfgBuilder]: Removed 16 assume(true) statements. [2020-07-28 17:43:48,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:43:48 BoogieIcfgContainer [2020-07-28 17:43:48,490 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 17:43:48,491 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 17:43:48,492 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 17:43:48,495 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 17:43:48,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 05:43:47" (1/3) ... [2020-07-28 17:43:48,496 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dbef9d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:43:48, skipping insertion in model container [2020-07-28 17:43:48,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:47" (2/3) ... [2020-07-28 17:43:48,497 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dbef9d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:43:48, skipping insertion in model container [2020-07-28 17:43:48,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:43:48" (3/3) ... [2020-07-28 17:43:48,499 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1251b.c [2020-07-28 17:43:48,510 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 17:43:48,516 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 17:43:48,527 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 17:43:48,547 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 17:43:48,547 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 17:43:48,547 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 17:43:48,547 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 17:43:48,548 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 17:43:48,548 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 17:43:48,548 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 17:43:48,548 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 17:43:48,561 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2020-07-28 17:43:48,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-28 17:43:48,567 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:43:48,568 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:43:48,568 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:43:48,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:43:48,574 INFO L82 PathProgramCache]: Analyzing trace with hash -124750094, now seen corresponding path program 1 times [2020-07-28 17:43:48,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 17:43:48,584 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [251263330] [2020-07-28 17:43:48,585 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:43:48,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:43:48,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 1 conjunts are in the unsatisfiable core [2020-07-28 17:43:48,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:43:48,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 17:43:48,773 INFO L280 TraceCheckUtils]: 0: Hoare triple {33#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {33#true} is VALID [2020-07-28 17:43:48,774 INFO L280 TraceCheckUtils]: 1: Hoare triple {33#true} havoc main_#res;havoc main_#t~nondet7, main_#t~ret8, main_#t~ret9, main_~res~0, main_~x~0, main_~y~0;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~y~0 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());isnan_double_#in~x := main_~x~0;havoc isnan_double_#res;havoc isnan_double_~x;isnan_double_~x := isnan_double_#in~x;isnan_double_#res := (if !~fp.eq~DOUBLE(isnan_double_~x, isnan_double_~x) then 1bv32 else 0bv32); {33#true} is VALID [2020-07-28 17:43:48,775 INFO L280 TraceCheckUtils]: 2: Hoare triple {33#true} main_#t~ret8 := isnan_double_#res; {33#true} is VALID [2020-07-28 17:43:48,775 INFO L280 TraceCheckUtils]: 3: Hoare triple {33#true} assume 0bv32 == main_#t~ret8;havoc main_#t~ret8;fmax_double_#in~x, fmax_double_#in~y := main_~x~0, main_~y~0;havoc fmax_double_#res;havoc fmax_double_#t~ret4, fmax_double_#t~ret5, fmax_double_#t~ite6, fmax_double_~x, fmax_double_~y;fmax_double_~x := fmax_double_#in~x;fmax_double_~y := fmax_double_#in~y;__fpclassify_double_#in~x := fmax_double_~x;havoc __fpclassify_double_#res;havoc __fpclassify_double_#t~mem0, __fpclassify_double_#t~union1, __fpclassify_double_#t~mem2, __fpclassify_double_#t~union3, __fpclassify_double_~#ew_u~0.base, __fpclassify_double_~#ew_u~0.offset, __fpclassify_double_~x, __fpclassify_double_~msw~0, __fpclassify_double_~lsw~0;__fpclassify_double_~x := __fpclassify_double_#in~x;havoc __fpclassify_double_~msw~0;havoc __fpclassify_double_~lsw~0; {33#true} is VALID [2020-07-28 17:43:48,777 INFO L280 TraceCheckUtils]: 4: Hoare triple {33#true} assume !true; {34#false} is VALID [2020-07-28 17:43:48,777 INFO L280 TraceCheckUtils]: 5: Hoare triple {34#false} assume (0bv32 == __fpclassify_double_~msw~0 && 0bv32 == __fpclassify_double_~lsw~0) || (2147483648bv32 == __fpclassify_double_~msw~0 && 0bv32 == __fpclassify_double_~lsw~0);__fpclassify_double_#res := 2bv32; {34#false} is VALID [2020-07-28 17:43:48,777 INFO L280 TraceCheckUtils]: 6: Hoare triple {34#false} fmax_double_#t~ret4 := __fpclassify_double_#res; {34#false} is VALID [2020-07-28 17:43:48,778 INFO L280 TraceCheckUtils]: 7: Hoare triple {34#false} assume 0bv32 == fmax_double_#t~ret4;havoc fmax_double_#t~ret4;fmax_double_#res := fmax_double_~y; {34#false} is VALID [2020-07-28 17:43:48,778 INFO L280 TraceCheckUtils]: 8: Hoare triple {34#false} main_#t~ret9 := fmax_double_#res;main_~res~0 := main_#t~ret9;havoc main_#t~ret9; {34#false} is VALID [2020-07-28 17:43:48,779 INFO L280 TraceCheckUtils]: 9: Hoare triple {34#false} assume !~fp.eq~DOUBLE(main_~res~0, main_~x~0); {34#false} is VALID [2020-07-28 17:43:48,779 INFO L280 TraceCheckUtils]: 10: Hoare triple {34#false} assume !false; {34#false} is VALID [2020-07-28 17:43:48,782 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:43:48,783 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 17:43:48,800 INFO L280 TraceCheckUtils]: 10: Hoare triple {34#false} assume !false; {34#false} is VALID [2020-07-28 17:43:48,800 INFO L280 TraceCheckUtils]: 9: Hoare triple {34#false} assume !~fp.eq~DOUBLE(main_~res~0, main_~x~0); {34#false} is VALID [2020-07-28 17:43:48,801 INFO L280 TraceCheckUtils]: 8: Hoare triple {34#false} main_#t~ret9 := fmax_double_#res;main_~res~0 := main_#t~ret9;havoc main_#t~ret9; {34#false} is VALID [2020-07-28 17:43:48,801 INFO L280 TraceCheckUtils]: 7: Hoare triple {34#false} assume 0bv32 == fmax_double_#t~ret4;havoc fmax_double_#t~ret4;fmax_double_#res := fmax_double_~y; {34#false} is VALID [2020-07-28 17:43:48,802 INFO L280 TraceCheckUtils]: 6: Hoare triple {34#false} fmax_double_#t~ret4 := __fpclassify_double_#res; {34#false} is VALID [2020-07-28 17:43:48,802 INFO L280 TraceCheckUtils]: 5: Hoare triple {34#false} assume (0bv32 == __fpclassify_double_~msw~0 && 0bv32 == __fpclassify_double_~lsw~0) || (2147483648bv32 == __fpclassify_double_~msw~0 && 0bv32 == __fpclassify_double_~lsw~0);__fpclassify_double_#res := 2bv32; {34#false} is VALID [2020-07-28 17:43:48,803 INFO L280 TraceCheckUtils]: 4: Hoare triple {33#true} assume !true; {34#false} is VALID [2020-07-28 17:43:48,804 INFO L280 TraceCheckUtils]: 3: Hoare triple {33#true} assume 0bv32 == main_#t~ret8;havoc main_#t~ret8;fmax_double_#in~x, fmax_double_#in~y := main_~x~0, main_~y~0;havoc fmax_double_#res;havoc fmax_double_#t~ret4, fmax_double_#t~ret5, fmax_double_#t~ite6, fmax_double_~x, fmax_double_~y;fmax_double_~x := fmax_double_#in~x;fmax_double_~y := fmax_double_#in~y;__fpclassify_double_#in~x := fmax_double_~x;havoc __fpclassify_double_#res;havoc __fpclassify_double_#t~mem0, __fpclassify_double_#t~union1, __fpclassify_double_#t~mem2, __fpclassify_double_#t~union3, __fpclassify_double_~#ew_u~0.base, __fpclassify_double_~#ew_u~0.offset, __fpclassify_double_~x, __fpclassify_double_~msw~0, __fpclassify_double_~lsw~0;__fpclassify_double_~x := __fpclassify_double_#in~x;havoc __fpclassify_double_~msw~0;havoc __fpclassify_double_~lsw~0; {33#true} is VALID [2020-07-28 17:43:48,804 INFO L280 TraceCheckUtils]: 2: Hoare triple {33#true} main_#t~ret8 := isnan_double_#res; {33#true} is VALID [2020-07-28 17:43:48,805 INFO L280 TraceCheckUtils]: 1: Hoare triple {33#true} havoc main_#res;havoc main_#t~nondet7, main_#t~ret8, main_#t~ret9, main_~res~0, main_~x~0, main_~y~0;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~y~0 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());isnan_double_#in~x := main_~x~0;havoc isnan_double_#res;havoc isnan_double_~x;isnan_double_~x := isnan_double_#in~x;isnan_double_#res := (if !~fp.eq~DOUBLE(isnan_double_~x, isnan_double_~x) then 1bv32 else 0bv32); {33#true} is VALID [2020-07-28 17:43:48,805 INFO L280 TraceCheckUtils]: 0: Hoare triple {33#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {33#true} is VALID [2020-07-28 17:43:48,806 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:43:48,807 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [251263330] [2020-07-28 17:43:48,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:43:48,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-07-28 17:43:48,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560565041] [2020-07-28 17:43:48,816 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2020-07-28 17:43:48,818 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:43:48,822 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 17:43:48,849 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:43:48,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 17:43:48,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 17:43:48,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 17:43:48,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 17:43:48,862 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2020-07-28 17:43:48,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:43:48,998 INFO L93 Difference]: Finished difference Result 56 states and 87 transitions. [2020-07-28 17:43:48,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 17:43:48,999 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2020-07-28 17:43:48,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:43:49,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:43:49,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 87 transitions. [2020-07-28 17:43:49,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:43:49,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 87 transitions. [2020-07-28 17:43:49,015 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 87 transitions. [2020-07-28 17:43:49,212 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:43:49,231 INFO L225 Difference]: With dead ends: 56 [2020-07-28 17:43:49,231 INFO L226 Difference]: Without dead ends: 26 [2020-07-28 17:43:49,237 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 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:43:49,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-28 17:43:49,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-07-28 17:43:49,308 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:43:49,309 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2020-07-28 17:43:49,310 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2020-07-28 17:43:49,311 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2020-07-28 17:43:49,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:43:49,316 INFO L93 Difference]: Finished difference Result 26 states and 36 transitions. [2020-07-28 17:43:49,317 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2020-07-28 17:43:49,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:43:49,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:43:49,319 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2020-07-28 17:43:49,320 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2020-07-28 17:43:49,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:43:49,329 INFO L93 Difference]: Finished difference Result 26 states and 36 transitions. [2020-07-28 17:43:49,329 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2020-07-28 17:43:49,330 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:43:49,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:43:49,331 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:43:49,333 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:43:49,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-28 17:43:49,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2020-07-28 17:43:49,339 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 11 [2020-07-28 17:43:49,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:43:49,344 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2020-07-28 17:43:49,344 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 17:43:49,344 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2020-07-28 17:43:49,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-28 17:43:49,345 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:43:49,346 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:43:49,560 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-07-28 17:43:49,561 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:43:49,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:43:49,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1352831344, now seen corresponding path program 1 times [2020-07-28 17:43:49,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 17:43:49,564 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1013551762] [2020-07-28 17:43:49,564 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:43:49,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:43:49,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-28 17:43:49,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:43:49,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 17:43:49,708 INFO L280 TraceCheckUtils]: 0: Hoare triple {250#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {250#true} is VALID [2020-07-28 17:43:49,708 INFO L280 TraceCheckUtils]: 1: Hoare triple {250#true} havoc main_#res;havoc main_#t~nondet7, main_#t~ret8, main_#t~ret9, main_~res~0, main_~x~0, main_~y~0;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~y~0 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());isnan_double_#in~x := main_~x~0;havoc isnan_double_#res;havoc isnan_double_~x;isnan_double_~x := isnan_double_#in~x;isnan_double_#res := (if !~fp.eq~DOUBLE(isnan_double_~x, isnan_double_~x) then 1bv32 else 0bv32); {250#true} is VALID [2020-07-28 17:43:49,709 INFO L280 TraceCheckUtils]: 2: Hoare triple {250#true} main_#t~ret8 := isnan_double_#res; {250#true} is VALID [2020-07-28 17:43:49,709 INFO L280 TraceCheckUtils]: 3: Hoare triple {250#true} assume 0bv32 == main_#t~ret8;havoc main_#t~ret8;fmax_double_#in~x, fmax_double_#in~y := main_~x~0, main_~y~0;havoc fmax_double_#res;havoc fmax_double_#t~ret4, fmax_double_#t~ret5, fmax_double_#t~ite6, fmax_double_~x, fmax_double_~y;fmax_double_~x := fmax_double_#in~x;fmax_double_~y := fmax_double_#in~y;__fpclassify_double_#in~x := fmax_double_~x;havoc __fpclassify_double_#res;havoc __fpclassify_double_#t~mem0, __fpclassify_double_#t~union1, __fpclassify_double_#t~mem2, __fpclassify_double_#t~union3, __fpclassify_double_~#ew_u~0.base, __fpclassify_double_~#ew_u~0.offset, __fpclassify_double_~x, __fpclassify_double_~msw~0, __fpclassify_double_~lsw~0;__fpclassify_double_~x := __fpclassify_double_#in~x;havoc __fpclassify_double_~msw~0;havoc __fpclassify_double_~lsw~0; {250#true} is VALID [2020-07-28 17:43:49,709 INFO L280 TraceCheckUtils]: 4: Hoare triple {250#true} call __fpclassify_double_~#ew_u~0.base, __fpclassify_double_~#ew_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(__fpclassify_double_~x, __fpclassify_double_~#ew_u~0.base, __fpclassify_double_~#ew_u~0.offset, 8bv32);call __fpclassify_double_#t~mem0 := read~intINTTYPE4(__fpclassify_double_~#ew_u~0.base, ~bvadd32(4bv32, __fpclassify_double_~#ew_u~0.offset), 4bv32);__fpclassify_double_~msw~0 := __fpclassify_double_#t~mem0;call write~intFLOATTYPE8(__fpclassify_double_#t~union1, __fpclassify_double_~#ew_u~0.base, __fpclassify_double_~#ew_u~0.offset, 8bv32);havoc __fpclassify_double_#t~union1;havoc __fpclassify_double_#t~mem0;call __fpclassify_double_#t~mem2 := read~intINTTYPE4(__fpclassify_double_~#ew_u~0.base, __fpclassify_double_~#ew_u~0.offset, 4bv32);__fpclassify_double_~lsw~0 := __fpclassify_double_#t~mem2;call write~intFLOATTYPE8(__fpclassify_double_#t~union3, __fpclassify_double_~#ew_u~0.base, __fpclassify_double_~#ew_u~0.offset, 8bv32);havoc __fpclassify_double_#t~union3;havoc __fpclassify_double_#t~mem2;call ULTIMATE.dealloc(__fpclassify_double_~#ew_u~0.base, __fpclassify_double_~#ew_u~0.offset);havoc __fpclassify_double_~#ew_u~0.base, __fpclassify_double_~#ew_u~0.offset; {250#true} is VALID [2020-07-28 17:43:49,710 INFO L280 TraceCheckUtils]: 5: Hoare triple {250#true} goto; {250#true} is VALID [2020-07-28 17:43:49,711 INFO L280 TraceCheckUtils]: 6: Hoare triple {250#true} assume (0bv32 == __fpclassify_double_~msw~0 && 0bv32 == __fpclassify_double_~lsw~0) || (2147483648bv32 == __fpclassify_double_~msw~0 && 0bv32 == __fpclassify_double_~lsw~0);__fpclassify_double_#res := 2bv32; {273#(= (_ bv2 32) |ULTIMATE.start___fpclassify_double_#res|)} is VALID [2020-07-28 17:43:49,712 INFO L280 TraceCheckUtils]: 7: Hoare triple {273#(= (_ bv2 32) |ULTIMATE.start___fpclassify_double_#res|)} fmax_double_#t~ret4 := __fpclassify_double_#res; {277#(= (_ bv2 32) |ULTIMATE.start_fmax_double_#t~ret4|)} is VALID [2020-07-28 17:43:49,713 INFO L280 TraceCheckUtils]: 8: Hoare triple {277#(= (_ bv2 32) |ULTIMATE.start_fmax_double_#t~ret4|)} assume 0bv32 == fmax_double_#t~ret4;havoc fmax_double_#t~ret4;fmax_double_#res := fmax_double_~y; {251#false} is VALID [2020-07-28 17:43:49,714 INFO L280 TraceCheckUtils]: 9: Hoare triple {251#false} main_#t~ret9 := fmax_double_#res;main_~res~0 := main_#t~ret9;havoc main_#t~ret9; {251#false} is VALID [2020-07-28 17:43:49,714 INFO L280 TraceCheckUtils]: 10: Hoare triple {251#false} assume !~fp.eq~DOUBLE(main_~res~0, main_~x~0); {251#false} is VALID [2020-07-28 17:43:49,714 INFO L280 TraceCheckUtils]: 11: Hoare triple {251#false} assume !false; {251#false} is VALID [2020-07-28 17:43:49,716 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:43:49,716 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 17:43:49,761 INFO L280 TraceCheckUtils]: 11: Hoare triple {251#false} assume !false; {251#false} is VALID [2020-07-28 17:43:49,761 INFO L280 TraceCheckUtils]: 10: Hoare triple {251#false} assume !~fp.eq~DOUBLE(main_~res~0, main_~x~0); {251#false} is VALID [2020-07-28 17:43:49,762 INFO L280 TraceCheckUtils]: 9: Hoare triple {251#false} main_#t~ret9 := fmax_double_#res;main_~res~0 := main_#t~ret9;havoc main_#t~ret9; {251#false} is VALID [2020-07-28 17:43:49,764 INFO L280 TraceCheckUtils]: 8: Hoare triple {299#(not (= (_ bv0 32) |ULTIMATE.start_fmax_double_#t~ret4|))} assume 0bv32 == fmax_double_#t~ret4;havoc fmax_double_#t~ret4;fmax_double_#res := fmax_double_~y; {251#false} is VALID [2020-07-28 17:43:49,765 INFO L280 TraceCheckUtils]: 7: Hoare triple {303#(not (= (_ bv0 32) |ULTIMATE.start___fpclassify_double_#res|))} fmax_double_#t~ret4 := __fpclassify_double_#res; {299#(not (= (_ bv0 32) |ULTIMATE.start_fmax_double_#t~ret4|))} is VALID [2020-07-28 17:43:49,766 INFO L280 TraceCheckUtils]: 6: Hoare triple {250#true} assume (0bv32 == __fpclassify_double_~msw~0 && 0bv32 == __fpclassify_double_~lsw~0) || (2147483648bv32 == __fpclassify_double_~msw~0 && 0bv32 == __fpclassify_double_~lsw~0);__fpclassify_double_#res := 2bv32; {303#(not (= (_ bv0 32) |ULTIMATE.start___fpclassify_double_#res|))} is VALID [2020-07-28 17:43:49,766 INFO L280 TraceCheckUtils]: 5: Hoare triple {250#true} goto; {250#true} is VALID [2020-07-28 17:43:49,767 INFO L280 TraceCheckUtils]: 4: Hoare triple {250#true} call __fpclassify_double_~#ew_u~0.base, __fpclassify_double_~#ew_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(__fpclassify_double_~x, __fpclassify_double_~#ew_u~0.base, __fpclassify_double_~#ew_u~0.offset, 8bv32);call __fpclassify_double_#t~mem0 := read~intINTTYPE4(__fpclassify_double_~#ew_u~0.base, ~bvadd32(4bv32, __fpclassify_double_~#ew_u~0.offset), 4bv32);__fpclassify_double_~msw~0 := __fpclassify_double_#t~mem0;call write~intFLOATTYPE8(__fpclassify_double_#t~union1, __fpclassify_double_~#ew_u~0.base, __fpclassify_double_~#ew_u~0.offset, 8bv32);havoc __fpclassify_double_#t~union1;havoc __fpclassify_double_#t~mem0;call __fpclassify_double_#t~mem2 := read~intINTTYPE4(__fpclassify_double_~#ew_u~0.base, __fpclassify_double_~#ew_u~0.offset, 4bv32);__fpclassify_double_~lsw~0 := __fpclassify_double_#t~mem2;call write~intFLOATTYPE8(__fpclassify_double_#t~union3, __fpclassify_double_~#ew_u~0.base, __fpclassify_double_~#ew_u~0.offset, 8bv32);havoc __fpclassify_double_#t~union3;havoc __fpclassify_double_#t~mem2;call ULTIMATE.dealloc(__fpclassify_double_~#ew_u~0.base, __fpclassify_double_~#ew_u~0.offset);havoc __fpclassify_double_~#ew_u~0.base, __fpclassify_double_~#ew_u~0.offset; {250#true} is VALID [2020-07-28 17:43:49,767 INFO L280 TraceCheckUtils]: 3: Hoare triple {250#true} assume 0bv32 == main_#t~ret8;havoc main_#t~ret8;fmax_double_#in~x, fmax_double_#in~y := main_~x~0, main_~y~0;havoc fmax_double_#res;havoc fmax_double_#t~ret4, fmax_double_#t~ret5, fmax_double_#t~ite6, fmax_double_~x, fmax_double_~y;fmax_double_~x := fmax_double_#in~x;fmax_double_~y := fmax_double_#in~y;__fpclassify_double_#in~x := fmax_double_~x;havoc __fpclassify_double_#res;havoc __fpclassify_double_#t~mem0, __fpclassify_double_#t~union1, __fpclassify_double_#t~mem2, __fpclassify_double_#t~union3, __fpclassify_double_~#ew_u~0.base, __fpclassify_double_~#ew_u~0.offset, __fpclassify_double_~x, __fpclassify_double_~msw~0, __fpclassify_double_~lsw~0;__fpclassify_double_~x := __fpclassify_double_#in~x;havoc __fpclassify_double_~msw~0;havoc __fpclassify_double_~lsw~0; {250#true} is VALID [2020-07-28 17:43:49,767 INFO L280 TraceCheckUtils]: 2: Hoare triple {250#true} main_#t~ret8 := isnan_double_#res; {250#true} is VALID [2020-07-28 17:43:49,768 INFO L280 TraceCheckUtils]: 1: Hoare triple {250#true} havoc main_#res;havoc main_#t~nondet7, main_#t~ret8, main_#t~ret9, main_~res~0, main_~x~0, main_~y~0;main_~x~0 := main_#t~nondet7;havoc main_#t~nondet7;main_~y~0 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());isnan_double_#in~x := main_~x~0;havoc isnan_double_#res;havoc isnan_double_~x;isnan_double_~x := isnan_double_#in~x;isnan_double_#res := (if !~fp.eq~DOUBLE(isnan_double_~x, isnan_double_~x) then 1bv32 else 0bv32); {250#true} is VALID [2020-07-28 17:43:49,768 INFO L280 TraceCheckUtils]: 0: Hoare triple {250#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {250#true} is VALID [2020-07-28 17:43:49,769 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:43:49,769 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1013551762] [2020-07-28 17:43:49,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:43:49,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-07-28 17:43:49,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344625795] [2020-07-28 17:43:49,777 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2020-07-28 17:43:49,777 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:43:49,778 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-28 17:43:49,809 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:43:49,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-28 17:43:49,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 17:43:49,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-28 17:43:49,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-28 17:43:49,811 INFO L87 Difference]: Start difference. First operand 26 states and 36 transitions. Second operand 6 states. [2020-07-28 17:43:50,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:43:50,525 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2020-07-28 17:43:50,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-28 17:43:50,525 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2020-07-28 17:43:50,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:43:50,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 17:43:50,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2020-07-28 17:43:50,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 17:43:50,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2020-07-28 17:43:50,530 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 63 transitions. [2020-07-28 17:43:50,635 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:43:50,637 INFO L225 Difference]: With dead ends: 50 [2020-07-28 17:43:50,638 INFO L226 Difference]: Without dead ends: 46 [2020-07-28 17:43:50,639 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 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:43:50,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-07-28 17:43:50,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 28. [2020-07-28 17:43:50,653 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:43:50,653 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 28 states. [2020-07-28 17:43:50,653 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 28 states. [2020-07-28 17:43:50,653 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 28 states. [2020-07-28 17:43:50,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:43:50,657 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2020-07-28 17:43:50,657 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2020-07-28 17:43:50,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:43:50,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:43:50,658 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 46 states. [2020-07-28 17:43:50,659 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 46 states. [2020-07-28 17:43:50,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:43:50,662 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2020-07-28 17:43:50,663 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2020-07-28 17:43:50,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:43:50,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:43:50,664 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:43:50,664 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:43:50,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-28 17:43:50,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2020-07-28 17:43:50,666 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 12 [2020-07-28 17:43:50,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:43:50,667 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2020-07-28 17:43:50,667 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-28 17:43:50,667 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2020-07-28 17:43:50,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-28 17:43:50,668 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:43:50,668 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:43:50,886 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-07-28 17:43:50,887 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:43:50,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:43:50,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1102769416, now seen corresponding path program 1 times [2020-07-28 17:43:50,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 17:43:50,891 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1033195498] [2020-07-28 17:43:50,891 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:43:51,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 17:43:51,003 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 17:43:51,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 17:43:51,064 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 17:43:51,100 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2020-07-28 17:43:51,101 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-28 17:43:51,302 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-07-28 17:43:51,333 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 17:43:51,333 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-28 17:43:51,333 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2020-07-28 17:43:51,333 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2020-07-28 17:43:51,333 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2020-07-28 17:43:51,334 WARN L170 areAnnotationChecker]: L29-2 has no Hoare annotation [2020-07-28 17:43:51,334 WARN L170 areAnnotationChecker]: L29-2 has no Hoare annotation [2020-07-28 17:43:51,334 WARN L170 areAnnotationChecker]: L72-2 has no Hoare annotation [2020-07-28 17:43:51,334 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2020-07-28 17:43:51,334 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2020-07-28 17:43:51,334 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2020-07-28 17:43:51,334 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2020-07-28 17:43:51,335 WARN L170 areAnnotationChecker]: L83 has no Hoare annotation [2020-07-28 17:43:51,335 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2020-07-28 17:43:51,335 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2020-07-28 17:43:51,335 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2020-07-28 17:43:51,335 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 17:43:51,335 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2020-07-28 17:43:51,335 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2020-07-28 17:43:51,336 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2020-07-28 17:43:51,336 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2020-07-28 17:43:51,336 WARN L170 areAnnotationChecker]: L60-3 has no Hoare annotation [2020-07-28 17:43:51,336 WARN L170 areAnnotationChecker]: L29-6 has no Hoare annotation [2020-07-28 17:43:51,336 WARN L170 areAnnotationChecker]: L29-6 has no Hoare annotation [2020-07-28 17:43:51,336 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2020-07-28 17:43:51,336 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2020-07-28 17:43:51,337 WARN L170 areAnnotationChecker]: L77 has no Hoare annotation [2020-07-28 17:43:51,337 WARN L170 areAnnotationChecker]: L77 has no Hoare annotation [2020-07-28 17:43:51,337 WARN L170 areAnnotationChecker]: L29-5 has no Hoare annotation [2020-07-28 17:43:51,337 WARN L170 areAnnotationChecker]: L29-5 has no Hoare annotation [2020-07-28 17:43:51,337 WARN L170 areAnnotationChecker]: L29-7 has no Hoare annotation [2020-07-28 17:43:51,337 WARN L170 areAnnotationChecker]: L29-7 has no Hoare annotation [2020-07-28 17:43:51,338 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2020-07-28 17:43:51,338 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2020-07-28 17:43:51,338 WARN L170 areAnnotationChecker]: L50-1 has no Hoare annotation [2020-07-28 17:43:51,338 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2020-07-28 17:43:51,338 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2020-07-28 17:43:51,338 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2020-07-28 17:43:51,338 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2020-07-28 17:43:51,339 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2020-07-28 17:43:51,339 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2020-07-28 17:43:51,339 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2020-07-28 17:43:51,339 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2020-07-28 17:43:51,339 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2020-07-28 17:43:51,339 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2020-07-28 17:43:51,339 WARN L170 areAnnotationChecker]: L60-2 has no Hoare annotation [2020-07-28 17:43:51,340 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:43:51,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 05:43:51 BoogieIcfgContainer [2020-07-28 17:43:51,343 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 17:43:51,343 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 17:43:51,343 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 17:43:51,344 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 17:43:51,344 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:43:48" (3/4) ... [2020-07-28 17:43:51,347 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-07-28 17:43:51,406 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 17:43:51,407 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 17:43:51,413 INFO L168 Benchmark]: Toolchain (without parser) took 4159.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 957.6 MB in the beginning and 910.1 MB in the end (delta: 47.5 MB). Peak memory consumption was 174.4 MB. Max. memory is 11.5 GB. [2020-07-28 17:43:51,413 INFO L168 Benchmark]: CDTParser took 0.25 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:43:51,414 INFO L168 Benchmark]: CACSL2BoogieTranslator took 369.96 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 941.5 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2020-07-28 17:43:51,415 INFO L168 Benchmark]: Boogie Procedure Inliner took 137.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 941.5 MB in the beginning and 1.1 GB in the end (delta: -175.1 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2020-07-28 17:43:51,419 INFO L168 Benchmark]: Boogie Preprocessor took 41.09 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:43:51,420 INFO L168 Benchmark]: RCFGBuilder took 683.73 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: 37.7 MB). Peak memory consumption was 37.7 MB. Max. memory is 11.5 GB. [2020-07-28 17:43:51,421 INFO L168 Benchmark]: TraceAbstraction took 2851.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 916.7 MB in the end (delta: 162.1 MB). Peak memory consumption was 162.1 MB. Max. memory is 11.5 GB. [2020-07-28 17:43:51,422 INFO L168 Benchmark]: Witness Printer took 66.07 ms. Allocated memory is still 1.2 GB. Free memory was 916.7 MB in the beginning and 910.1 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2020-07-28 17:43:51,429 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.25 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 369.96 ms. Allocated memory is still 1.0 GB. Free memory was 957.6 MB in the beginning and 941.5 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 137.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 941.5 MB in the beginning and 1.1 GB in the end (delta: -175.1 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.09 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 683.73 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: 37.7 MB). Peak memory consumption was 37.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2851.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 916.7 MB in the end (delta: 162.1 MB). Peak memory consumption was 162.1 MB. Max. memory is 11.5 GB. * Witness Printer took 66.07 ms. Allocated memory is still 1.2 GB. Free memory was 916.7 MB in the beginning and 910.1 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 78]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L64] double x = __VERIFIER_nondet_double(); [L65] double y = 0.0 / 0.0; [L16] return x != x; [L72] COND TRUE !isnan_double(x) [L27] __uint32_t msw, lsw; [L30] ieee_double_shape_type ew_u; [L31] ew_u.value = (x) [L32] EXPR ew_u.parts.msw [L32] (msw) = ew_u.parts.msw [L33] EXPR ew_u.parts.lsw [L33] (lsw) = ew_u.parts.lsw [L36-L37] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) [L39-L40] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) [L42-L43] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) [L46-L47] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L50] return 0; [L55] COND TRUE __fpclassify_double(x) == 0 [L56] return y; [L74] double res = fmax_double(x, y); [L77] COND TRUE res != x [L78] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 2.7s, OverallIterations: 3, TraceHistogramMax: 1, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 77 SDtfs, 20 SDslu, 115 SDs, 0 SdLazy, 31 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred 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.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 18 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 38 NumberOfCodeBlocks, 38 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 42 ConstructedInterpolants, 0 QuantifiedInterpolants, 552 SizeOfPredicates, 1 NumberOfNonLiveVariables, 71 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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...