./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_1231b.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_1231b.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 c714d208cb0b1f96f572e8a6108248eb76c73a94 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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_1231b.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 c714d208cb0b1f96f572e8a6108248eb76c73a94 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:24,501 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 17:43:24,504 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 17:43:24,522 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 17:43:24,523 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 17:43:24,525 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 17:43:24,527 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 17:43:24,539 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 17:43:24,544 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 17:43:24,547 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 17:43:24,549 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 17:43:24,551 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 17:43:24,551 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 17:43:24,554 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 17:43:24,555 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 17:43:24,556 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 17:43:24,558 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 17:43:24,558 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 17:43:24,561 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 17:43:24,565 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 17:43:24,570 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 17:43:24,574 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 17:43:24,576 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 17:43:24,577 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 17:43:24,579 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 17:43:24,580 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 17:43:24,580 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 17:43:24,582 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 17:43:24,582 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 17:43:24,583 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 17:43:24,584 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 17:43:24,585 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 17:43:24,586 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 17:43:24,588 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 17:43:24,589 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 17:43:24,589 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 17:43:24,590 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 17:43:24,591 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 17:43:24,591 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 17:43:24,592 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 17:43:24,593 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 17:43:24,594 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:24,630 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 17:43:24,634 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 17:43:24,636 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 17:43:24,637 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 17:43:24,637 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 17:43:24,638 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 17:43:24,639 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 17:43:24,639 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 17:43:24,640 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 17:43:24,640 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 17:43:24,641 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 17:43:24,641 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 17:43:24,641 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 17:43:24,643 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 17:43:24,643 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 17:43:24,643 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 17:43:24,644 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 17:43:24,644 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 17:43:24,644 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 17:43:24,645 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 17:43:24,645 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 17:43:24,645 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 17:43:24,646 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 17:43:24,646 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 17:43:24,646 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 17:43:24,647 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 17:43:24,647 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 17:43:24,647 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 17:43:24,647 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 17:43:24,648 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 -> c714d208cb0b1f96f572e8a6108248eb76c73a94 [2020-07-28 17:43:24,956 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 17:43:24,977 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 17:43:24,981 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 17:43:24,982 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 17:43:24,983 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 17:43:24,984 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1231b.c [2020-07-28 17:43:25,051 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbc833c73/0b9df9c1e51e45b9b8b5b05b7df46fa0/FLAG1f8261d54 [2020-07-28 17:43:25,551 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 17:43:25,552 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1231b.c [2020-07-28 17:43:25,558 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbc833c73/0b9df9c1e51e45b9b8b5b05b7df46fa0/FLAG1f8261d54 [2020-07-28 17:43:25,882 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dbc833c73/0b9df9c1e51e45b9b8b5b05b7df46fa0 [2020-07-28 17:43:25,887 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 17:43:25,891 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 17:43:25,894 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 17:43:25,895 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 17:43:25,898 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 17:43:25,902 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:43:25" (1/1) ... [2020-07-28 17:43:25,905 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fe8dc9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:25, skipping insertion in model container [2020-07-28 17:43:25,905 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:43:25" (1/1) ... [2020-07-28 17:43:25,913 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 17:43:25,938 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 17:43:26,142 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:43:26,148 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 17:43:26,181 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:43:26,208 INFO L208 MainTranslator]: Completed translation [2020-07-28 17:43:26,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:26 WrapperNode [2020-07-28 17:43:26,209 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 17:43:26,210 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 17:43:26,210 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 17:43:26,210 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 17:43:26,284 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:26" (1/1) ... [2020-07-28 17:43:26,305 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:26" (1/1) ... [2020-07-28 17:43:26,362 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 17:43:26,363 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 17:43:26,363 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 17:43:26,363 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 17:43:26,374 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:26" (1/1) ... [2020-07-28 17:43:26,374 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:26" (1/1) ... [2020-07-28 17:43:26,381 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:26" (1/1) ... [2020-07-28 17:43:26,382 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:26" (1/1) ... [2020-07-28 17:43:26,406 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:26" (1/1) ... [2020-07-28 17:43:26,416 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:26" (1/1) ... [2020-07-28 17:43:26,424 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:26" (1/1) ... [2020-07-28 17:43:26,431 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 17:43:26,432 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 17:43:26,433 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 17:43:26,433 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 17:43:26,434 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:26" (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:26,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-28 17:43:26,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-07-28 17:43:26,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 17:43:26,504 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 17:43:26,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-28 17:43:26,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-28 17:43:27,035 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 17:43:27,036 INFO L295 CfgBuilder]: Removed 16 assume(true) statements. [2020-07-28 17:43:27,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:43:27 BoogieIcfgContainer [2020-07-28 17:43:27,040 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 17:43:27,041 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 17:43:27,041 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 17:43:27,044 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 17:43:27,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 05:43:25" (1/3) ... [2020-07-28 17:43:27,046 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bc3aacc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:43:27, skipping insertion in model container [2020-07-28 17:43:27,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:26" (2/3) ... [2020-07-28 17:43:27,047 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bc3aacc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:43:27, skipping insertion in model container [2020-07-28 17:43:27,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:43:27" (3/3) ... [2020-07-28 17:43:27,049 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1231b.c [2020-07-28 17:43:27,059 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 17:43:27,067 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 17:43:27,081 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 17:43:27,107 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 17:43:27,108 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 17:43:27,108 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 17:43:27,108 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 17:43:27,110 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 17:43:27,110 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 17:43:27,111 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 17:43:27,111 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 17:43:27,128 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2020-07-28 17:43:27,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-28 17:43:27,135 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:43:27,136 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:43:27,137 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:43:27,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:43:27,144 INFO L82 PathProgramCache]: Analyzing trace with hash -124750094, now seen corresponding path program 1 times [2020-07-28 17:43:27,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:43:27,156 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395514588] [2020-07-28 17:43:27,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:43:27,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:43:27,303 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:27,304 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:27,304 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:27,305 INFO L280 TraceCheckUtils]: 3: Hoare triple {33#true} assume 0 == main_#t~ret8;havoc main_#t~ret8;fmin_double_#in~x, fmin_double_#in~y := main_~x~0, main_~y~0;havoc fmin_double_#res;havoc fmin_double_#t~ret4, fmin_double_#t~ret5, fmin_double_#t~ite6, fmin_double_~x, fmin_double_~y;fmin_double_~x := fmin_double_#in~x;fmin_double_~y := fmin_double_#in~y;__fpclassify_double_#in~x := fmin_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:27,310 INFO L280 TraceCheckUtils]: 4: Hoare triple {33#true} assume !true; {34#false} is VALID [2020-07-28 17:43:27,311 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:27,311 INFO L280 TraceCheckUtils]: 6: Hoare triple {34#false} fmin_double_#t~ret4 := __fpclassify_double_#res;assume -2147483648 <= fmin_double_#t~ret4 && fmin_double_#t~ret4 <= 2147483647; {34#false} is VALID [2020-07-28 17:43:27,312 INFO L280 TraceCheckUtils]: 7: Hoare triple {34#false} assume 0 == fmin_double_#t~ret4;havoc fmin_double_#t~ret4;fmin_double_#res := fmin_double_~y; {34#false} is VALID [2020-07-28 17:43:27,312 INFO L280 TraceCheckUtils]: 8: Hoare triple {34#false} main_#t~ret9 := fmin_double_#res;main_~res~0 := main_#t~ret9;havoc main_#t~ret9; {34#false} is VALID [2020-07-28 17:43:27,312 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:27,313 INFO L280 TraceCheckUtils]: 10: Hoare triple {34#false} assume !false; {34#false} is VALID [2020-07-28 17:43:27,315 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:27,316 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395514588] [2020-07-28 17:43:27,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:43:27,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-28 17:43:27,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092776587] [2020-07-28 17:43:27,324 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2020-07-28 17:43:27,326 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:43:27,329 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 17:43:27,390 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:27,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 17:43:27,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:43:27,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 17:43:27,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 17:43:27,404 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2020-07-28 17:43:27,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:43:27,532 INFO L93 Difference]: Finished difference Result 56 states and 87 transitions. [2020-07-28 17:43:27,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 17:43:27,532 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2020-07-28 17:43:27,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:43:27,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:43:27,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 87 transitions. [2020-07-28 17:43:27,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:43:27,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 87 transitions. [2020-07-28 17:43:27,549 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 87 transitions. [2020-07-28 17:43:27,696 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:27,708 INFO L225 Difference]: With dead ends: 56 [2020-07-28 17:43:27,709 INFO L226 Difference]: Without dead ends: 26 [2020-07-28 17:43:27,713 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:27,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-28 17:43:27,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-07-28 17:43:27,750 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:43:27,751 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2020-07-28 17:43:27,752 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2020-07-28 17:43:27,752 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2020-07-28 17:43:27,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:43:27,756 INFO L93 Difference]: Finished difference Result 26 states and 36 transitions. [2020-07-28 17:43:27,757 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2020-07-28 17:43:27,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:43:27,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:43:27,758 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2020-07-28 17:43:27,758 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2020-07-28 17:43:27,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:43:27,762 INFO L93 Difference]: Finished difference Result 26 states and 36 transitions. [2020-07-28 17:43:27,762 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2020-07-28 17:43:27,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:43:27,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:43:27,763 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:43:27,764 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:43:27,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-28 17:43:27,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2020-07-28 17:43:27,769 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 11 [2020-07-28 17:43:27,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:43:27,769 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2020-07-28 17:43:27,769 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 17:43:27,770 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2020-07-28 17:43:27,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-28 17:43:27,771 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:43:27,771 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:43:27,771 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 17:43:27,772 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:43:27,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:43:27,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1352831344, now seen corresponding path program 1 times [2020-07-28 17:43:27,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:43:27,773 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801234450] [2020-07-28 17:43:27,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:43:27,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:43:27,884 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:27,885 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:27,885 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:27,886 INFO L280 TraceCheckUtils]: 3: Hoare triple {190#true} assume 0 == main_#t~ret8;havoc main_#t~ret8;fmin_double_#in~x, fmin_double_#in~y := main_~x~0, main_~y~0;havoc fmin_double_#res;havoc fmin_double_#t~ret4, fmin_double_#t~ret5, fmin_double_#t~ite6, fmin_double_~x, fmin_double_~y;fmin_double_~x := fmin_double_#in~x;fmin_double_~y := fmin_double_#in~y;__fpclassify_double_#in~x := fmin_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:27,886 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~union1;havoc __fpclassify_double_#t~mem0;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~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; {190#true} is VALID [2020-07-28 17:43:27,887 INFO L280 TraceCheckUtils]: 5: Hoare triple {190#true} goto; {190#true} is VALID [2020-07-28 17:43:27,888 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:27,890 INFO L280 TraceCheckUtils]: 7: Hoare triple {192#(<= 2 |ULTIMATE.start___fpclassify_double_#res|)} fmin_double_#t~ret4 := __fpclassify_double_#res;assume -2147483648 <= fmin_double_#t~ret4 && fmin_double_#t~ret4 <= 2147483647; {193#(<= 2 |ULTIMATE.start_fmin_double_#t~ret4|)} is VALID [2020-07-28 17:43:27,891 INFO L280 TraceCheckUtils]: 8: Hoare triple {193#(<= 2 |ULTIMATE.start_fmin_double_#t~ret4|)} assume 0 == fmin_double_#t~ret4;havoc fmin_double_#t~ret4;fmin_double_#res := fmin_double_~y; {191#false} is VALID [2020-07-28 17:43:27,891 INFO L280 TraceCheckUtils]: 9: Hoare triple {191#false} main_#t~ret9 := fmin_double_#res;main_~res~0 := main_#t~ret9;havoc main_#t~ret9; {191#false} is VALID [2020-07-28 17:43:27,892 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:27,892 INFO L280 TraceCheckUtils]: 11: Hoare triple {191#false} assume !false; {191#false} is VALID [2020-07-28 17:43:27,893 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:27,894 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801234450] [2020-07-28 17:43:27,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:43:27,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-28 17:43:27,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058597056] [2020-07-28 17:43:27,897 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-07-28 17:43:27,897 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:43:27,898 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 17:43:27,917 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:27,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 17:43:27,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:43:27,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 17:43:27,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-28 17:43:27,919 INFO L87 Difference]: Start difference. First operand 26 states and 36 transitions. Second operand 4 states. [2020-07-28 17:43:28,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:43:28,128 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2020-07-28 17:43:28,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-28 17:43:28,128 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-07-28 17:43:28,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:43:28,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 17:43:28,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2020-07-28 17:43:28,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 17:43:28,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2020-07-28 17:43:28,133 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 51 transitions. [2020-07-28 17:43:28,207 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:28,210 INFO L225 Difference]: With dead ends: 40 [2020-07-28 17:43:28,210 INFO L226 Difference]: Without dead ends: 36 [2020-07-28 17:43:28,212 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:28,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-28 17:43:28,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2020-07-28 17:43:28,221 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:43:28,221 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 28 states. [2020-07-28 17:43:28,222 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 28 states. [2020-07-28 17:43:28,222 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 28 states. [2020-07-28 17:43:28,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:43:28,226 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2020-07-28 17:43:28,226 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2020-07-28 17:43:28,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:43:28,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:43:28,227 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 36 states. [2020-07-28 17:43:28,228 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 36 states. [2020-07-28 17:43:28,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:43:28,231 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2020-07-28 17:43:28,231 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2020-07-28 17:43:28,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:43:28,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:43:28,233 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:43:28,233 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:43:28,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-28 17:43:28,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2020-07-28 17:43:28,236 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 12 [2020-07-28 17:43:28,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:43:28,236 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2020-07-28 17:43:28,236 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 17:43:28,237 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2020-07-28 17:43:28,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-28 17:43:28,238 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:43:28,238 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:28,238 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-28 17:43:28,238 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:43:28,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:43:28,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1045511114, now seen corresponding path program 1 times [2020-07-28 17:43:28,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:43:28,240 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168345252] [2020-07-28 17:43:28,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:43:28,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:43:28,380 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:28,381 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:28,381 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:28,382 INFO L280 TraceCheckUtils]: 3: Hoare triple {355#true} assume 0 == main_#t~ret8;havoc main_#t~ret8;fmin_double_#in~x, fmin_double_#in~y := main_~x~0, main_~y~0;havoc fmin_double_#res;havoc fmin_double_#t~ret4, fmin_double_#t~ret5, fmin_double_#t~ite6, fmin_double_~x, fmin_double_~y;fmin_double_~x := fmin_double_#in~x;fmin_double_~y := fmin_double_#in~y;__fpclassify_double_#in~x := fmin_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:28,382 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~union1;havoc __fpclassify_double_#t~mem0;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~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; {355#true} is VALID [2020-07-28 17:43:28,383 INFO L280 TraceCheckUtils]: 5: Hoare triple {355#true} goto; {355#true} is VALID [2020-07-28 17:43:28,383 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:28,383 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:28,384 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:28,386 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:28,388 INFO L280 TraceCheckUtils]: 10: Hoare triple {357#(<= 1 |ULTIMATE.start___fpclassify_double_#res|)} fmin_double_#t~ret4 := __fpclassify_double_#res;assume -2147483648 <= fmin_double_#t~ret4 && fmin_double_#t~ret4 <= 2147483647; {358#(<= 1 |ULTIMATE.start_fmin_double_#t~ret4|)} is VALID [2020-07-28 17:43:28,389 INFO L280 TraceCheckUtils]: 11: Hoare triple {358#(<= 1 |ULTIMATE.start_fmin_double_#t~ret4|)} assume 0 == fmin_double_#t~ret4;havoc fmin_double_#t~ret4;fmin_double_#res := fmin_double_~y; {356#false} is VALID [2020-07-28 17:43:28,389 INFO L280 TraceCheckUtils]: 12: Hoare triple {356#false} main_#t~ret9 := fmin_double_#res;main_~res~0 := main_#t~ret9;havoc main_#t~ret9; {356#false} is VALID [2020-07-28 17:43:28,389 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:28,389 INFO L280 TraceCheckUtils]: 14: Hoare triple {356#false} assume !false; {356#false} is VALID [2020-07-28 17:43:28,391 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:28,391 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168345252] [2020-07-28 17:43:28,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:43:28,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-28 17:43:28,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83643497] [2020-07-28 17:43:28,392 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-07-28 17:43:28,393 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:43:28,393 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 17:43:28,414 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:28,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 17:43:28,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:43:28,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 17:43:28,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-28 17:43:28,415 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand 4 states. [2020-07-28 17:43:28,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:43:28,588 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2020-07-28 17:43:28,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-28 17:43:28,589 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-07-28 17:43:28,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:43:28,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 17:43:28,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2020-07-28 17:43:28,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 17:43:28,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 51 transitions. [2020-07-28 17:43:28,594 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 51 transitions. [2020-07-28 17:43:28,661 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:28,663 INFO L225 Difference]: With dead ends: 42 [2020-07-28 17:43:28,663 INFO L226 Difference]: Without dead ends: 38 [2020-07-28 17:43:28,664 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:28,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-28 17:43:28,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2020-07-28 17:43:28,673 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:43:28,673 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 28 states. [2020-07-28 17:43:28,674 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 28 states. [2020-07-28 17:43:28,674 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 28 states. [2020-07-28 17:43:28,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:43:28,678 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2020-07-28 17:43:28,678 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2020-07-28 17:43:28,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:43:28,679 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:43:28,679 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 38 states. [2020-07-28 17:43:28,680 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 38 states. [2020-07-28 17:43:28,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:43:28,683 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2020-07-28 17:43:28,683 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2020-07-28 17:43:28,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:43:28,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:43:28,685 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:43:28,685 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:43:28,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-28 17:43:28,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2020-07-28 17:43:28,688 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 15 [2020-07-28 17:43:28,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:43:28,688 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2020-07-28 17:43:28,689 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 17:43:28,689 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2020-07-28 17:43:28,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-28 17:43:28,690 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:43:28,690 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:28,691 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-28 17:43:28,691 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:43:28,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:43:28,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1102769416, now seen corresponding path program 1 times [2020-07-28 17:43:28,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:43:28,692 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643535704] [2020-07-28 17:43:28,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:43:28,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 17:43:28,870 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 17:43:28,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 17:43:28,939 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 17:43:28,953 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-28 17:43:28,954 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.smtinterpol.model.Model.map(Model.java:227) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.ModelBuilder.add(ModelBuilder.java:123) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.ModelBuilder.fillInFunctions(ModelBuilder.java:109) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.ModelBuilder.(ModelBuilder.java:49) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.cclosure.CClosure.fillInModel(CClosure.java:1312) at de.uni_freiburg.informatik.ultimate.smtinterpol.model.Model.(Model.java:120) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.buildModel(SMTInterpol.java:1139) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getValue(SMTInterpol.java:1004) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getValue(WrapperScript.java:193) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getValue(WrapperScript.java:193) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.getValues(SmtUtils.java:2112) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.getValue(TraceCheck.java:401) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.lambda$0(TraceCheck.java:375) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecution(TraceCheck.java:384) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:343) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:223) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:337) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:223) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:89) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-28 17:43:28,963 INFO L168 Benchmark]: Toolchain (without parser) took 3073.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 956.2 MB in the beginning and 927.8 MB in the end (delta: 28.4 MB). Peak memory consumption was 161.6 MB. Max. memory is 11.5 GB. [2020-07-28 17:43:28,967 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 17:43:28,968 INFO L168 Benchmark]: CACSL2BoogieTranslator took 314.98 ms. Allocated memory is still 1.0 GB. Free memory was 956.2 MB in the beginning and 945.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-28 17:43:28,969 INFO L168 Benchmark]: Boogie Procedure Inliner took 152.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 945.5 MB in the beginning and 1.1 GB in the end (delta: -177.3 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-28 17:43:28,970 INFO L168 Benchmark]: Boogie Preprocessor took 69.22 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:28,970 INFO L168 Benchmark]: RCFGBuilder took 607.72 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.7 MB). Peak memory consumption was 39.7 MB. Max. memory is 11.5 GB. [2020-07-28 17:43:28,973 INFO L168 Benchmark]: TraceAbstraction took 1918.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 927.8 MB in the end (delta: 155.4 MB). Peak memory consumption was 155.4 MB. Max. memory is 11.5 GB. [2020-07-28 17:43:28,978 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.35 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 314.98 ms. Allocated memory is still 1.0 GB. Free memory was 956.2 MB in the beginning and 945.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 152.79 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 945.5 MB in the beginning and 1.1 GB in the end (delta: -177.3 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 69.22 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 607.72 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.7 MB). Peak memory consumption was 39.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1918.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 927.8 MB in the end (delta: 155.4 MB). Peak memory consumption was 155.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: null: de.uni_freiburg.informatik.ultimate.smtinterpol.model.Model.map(Model.java:227) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 17:43:30,925 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 17:43:30,927 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 17:43:30,941 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 17:43:30,942 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 17:43:30,943 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 17:43:30,945 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 17:43:30,947 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 17:43:30,949 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 17:43:30,951 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 17:43:30,952 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 17:43:30,953 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 17:43:30,954 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 17:43:30,955 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 17:43:30,956 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 17:43:30,957 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 17:43:30,958 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 17:43:30,960 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 17:43:30,962 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 17:43:30,964 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 17:43:30,966 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 17:43:30,968 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 17:43:30,969 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 17:43:30,971 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 17:43:30,974 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 17:43:30,974 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 17:43:30,975 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 17:43:30,976 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 17:43:30,977 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 17:43:30,978 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 17:43:30,978 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 17:43:30,979 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 17:43:30,980 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 17:43:30,981 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 17:43:30,983 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 17:43:30,983 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 17:43:30,984 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 17:43:30,984 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 17:43:30,984 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 17:43:30,986 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 17:43:30,986 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 17:43:30,987 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:31,004 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 17:43:31,004 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 17:43:31,006 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 17:43:31,006 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 17:43:31,007 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 17:43:31,007 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 17:43:31,007 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 17:43:31,007 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 17:43:31,008 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 17:43:31,008 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 17:43:31,008 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 17:43:31,009 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 17:43:31,009 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-07-28 17:43:31,009 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-07-28 17:43:31,010 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 17:43:31,010 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 17:43:31,010 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 17:43:31,010 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 17:43:31,011 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 17:43:31,011 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 17:43:31,011 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 17:43:31,012 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 17:43:31,012 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 17:43:31,012 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 17:43:31,013 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 17:43:31,013 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 17:43:31,013 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-07-28 17:43:31,013 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-07-28 17:43:31,014 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 17:43:31,014 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 17:43:31,014 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-28 17:43:31,015 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 -> c714d208cb0b1f96f572e8a6108248eb76c73a94 [2020-07-28 17:43:31,327 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 17:43:31,341 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 17:43:31,345 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 17:43:31,346 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 17:43:31,347 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 17:43:31,348 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1231b.c [2020-07-28 17:43:31,419 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c2dc20b1/dc04108e49b1487bac34bacb325c31ce/FLAG29623d282 [2020-07-28 17:43:31,952 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 17:43:31,954 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1231b.c [2020-07-28 17:43:31,966 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c2dc20b1/dc04108e49b1487bac34bacb325c31ce/FLAG29623d282 [2020-07-28 17:43:32,226 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c2dc20b1/dc04108e49b1487bac34bacb325c31ce [2020-07-28 17:43:32,230 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 17:43:32,234 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 17:43:32,235 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 17:43:32,235 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 17:43:32,240 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 17:43:32,242 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:43:32" (1/1) ... [2020-07-28 17:43:32,245 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f0f731d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:32, skipping insertion in model container [2020-07-28 17:43:32,246 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:43:32" (1/1) ... [2020-07-28 17:43:32,255 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 17:43:32,276 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 17:43:32,488 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:43:32,497 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 17:43:32,530 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:43:32,563 INFO L208 MainTranslator]: Completed translation [2020-07-28 17:43:32,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:32 WrapperNode [2020-07-28 17:43:32,564 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 17:43:32,565 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 17:43:32,566 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 17:43:32,566 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 17:43:32,646 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:32" (1/1) ... [2020-07-28 17:43:32,676 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:32" (1/1) ... [2020-07-28 17:43:32,722 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 17:43:32,723 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 17:43:32,723 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 17:43:32,723 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 17:43:32,732 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:32" (1/1) ... [2020-07-28 17:43:32,732 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:32" (1/1) ... [2020-07-28 17:43:32,737 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:32" (1/1) ... [2020-07-28 17:43:32,738 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:32" (1/1) ... [2020-07-28 17:43:32,749 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:32" (1/1) ... [2020-07-28 17:43:32,756 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:32" (1/1) ... [2020-07-28 17:43:32,759 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:32" (1/1) ... [2020-07-28 17:43:32,763 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 17:43:32,764 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 17:43:32,765 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 17:43:32,765 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 17:43:32,766 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:32" (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:32,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2020-07-28 17:43:32,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-28 17:43:32,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2020-07-28 17:43:32,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 17:43:32,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 17:43:32,834 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-28 17:43:33,470 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 17:43:33,471 INFO L295 CfgBuilder]: Removed 16 assume(true) statements. [2020-07-28 17:43:33,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:43:33 BoogieIcfgContainer [2020-07-28 17:43:33,475 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 17:43:33,477 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 17:43:33,477 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 17:43:33,481 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 17:43:33,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 05:43:32" (1/3) ... [2020-07-28 17:43:33,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@466d6be9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:43:33, skipping insertion in model container [2020-07-28 17:43:33,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:43:32" (2/3) ... [2020-07-28 17:43:33,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@466d6be9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:43:33, skipping insertion in model container [2020-07-28 17:43:33,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:43:33" (3/3) ... [2020-07-28 17:43:33,485 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1231b.c [2020-07-28 17:43:33,497 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 17:43:33,506 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 17:43:33,521 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 17:43:33,547 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 17:43:33,547 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 17:43:33,547 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 17:43:33,547 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 17:43:33,547 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 17:43:33,548 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 17:43:33,548 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 17:43:33,548 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 17:43:33,565 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2020-07-28 17:43:33,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-28 17:43:33,572 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:43:33,573 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:43:33,574 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:43:33,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:43:33,579 INFO L82 PathProgramCache]: Analyzing trace with hash -124750094, now seen corresponding path program 1 times [2020-07-28 17:43:33,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 17:43:33,591 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [751101017] [2020-07-28 17:43:33,592 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:33,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:43:33,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 1 conjunts are in the unsatisfiable core [2020-07-28 17:43:33,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:43:33,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 17:43:33,841 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:33,842 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:33,843 INFO L280 TraceCheckUtils]: 2: Hoare triple {33#true} main_#t~ret8 := isnan_double_#res; {33#true} is VALID [2020-07-28 17:43:33,843 INFO L280 TraceCheckUtils]: 3: Hoare triple {33#true} assume 0bv32 == main_#t~ret8;havoc main_#t~ret8;fmin_double_#in~x, fmin_double_#in~y := main_~x~0, main_~y~0;havoc fmin_double_#res;havoc fmin_double_#t~ret4, fmin_double_#t~ret5, fmin_double_#t~ite6, fmin_double_~x, fmin_double_~y;fmin_double_~x := fmin_double_#in~x;fmin_double_~y := fmin_double_#in~y;__fpclassify_double_#in~x := fmin_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:33,844 INFO L280 TraceCheckUtils]: 4: Hoare triple {33#true} assume !true; {34#false} is VALID [2020-07-28 17:43:33,845 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:33,845 INFO L280 TraceCheckUtils]: 6: Hoare triple {34#false} fmin_double_#t~ret4 := __fpclassify_double_#res; {34#false} is VALID [2020-07-28 17:43:33,845 INFO L280 TraceCheckUtils]: 7: Hoare triple {34#false} assume 0bv32 == fmin_double_#t~ret4;havoc fmin_double_#t~ret4;fmin_double_#res := fmin_double_~y; {34#false} is VALID [2020-07-28 17:43:33,846 INFO L280 TraceCheckUtils]: 8: Hoare triple {34#false} main_#t~ret9 := fmin_double_#res;main_~res~0 := main_#t~ret9;havoc main_#t~ret9; {34#false} is VALID [2020-07-28 17:43:33,846 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:33,846 INFO L280 TraceCheckUtils]: 10: Hoare triple {34#false} assume !false; {34#false} is VALID [2020-07-28 17:43:33,849 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:33,849 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 17:43:33,864 INFO L280 TraceCheckUtils]: 10: Hoare triple {34#false} assume !false; {34#false} is VALID [2020-07-28 17:43:33,864 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:33,865 INFO L280 TraceCheckUtils]: 8: Hoare triple {34#false} main_#t~ret9 := fmin_double_#res;main_~res~0 := main_#t~ret9;havoc main_#t~ret9; {34#false} is VALID [2020-07-28 17:43:33,865 INFO L280 TraceCheckUtils]: 7: Hoare triple {34#false} assume 0bv32 == fmin_double_#t~ret4;havoc fmin_double_#t~ret4;fmin_double_#res := fmin_double_~y; {34#false} is VALID [2020-07-28 17:43:33,865 INFO L280 TraceCheckUtils]: 6: Hoare triple {34#false} fmin_double_#t~ret4 := __fpclassify_double_#res; {34#false} is VALID [2020-07-28 17:43:33,866 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:33,867 INFO L280 TraceCheckUtils]: 4: Hoare triple {33#true} assume !true; {34#false} is VALID [2020-07-28 17:43:33,868 INFO L280 TraceCheckUtils]: 3: Hoare triple {33#true} assume 0bv32 == main_#t~ret8;havoc main_#t~ret8;fmin_double_#in~x, fmin_double_#in~y := main_~x~0, main_~y~0;havoc fmin_double_#res;havoc fmin_double_#t~ret4, fmin_double_#t~ret5, fmin_double_#t~ite6, fmin_double_~x, fmin_double_~y;fmin_double_~x := fmin_double_#in~x;fmin_double_~y := fmin_double_#in~y;__fpclassify_double_#in~x := fmin_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:33,868 INFO L280 TraceCheckUtils]: 2: Hoare triple {33#true} main_#t~ret8 := isnan_double_#res; {33#true} is VALID [2020-07-28 17:43:33,868 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:33,869 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:33,870 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:33,871 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [751101017] [2020-07-28 17:43:33,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:43:33,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-07-28 17:43:33,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272676417] [2020-07-28 17:43:33,880 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2020-07-28 17:43:33,882 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:43:33,886 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 17:43:33,918 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:33,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 17:43:33,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 17:43:33,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 17:43:33,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 17:43:33,932 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2020-07-28 17:43:34,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:43:34,071 INFO L93 Difference]: Finished difference Result 56 states and 87 transitions. [2020-07-28 17:43:34,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 17:43:34,071 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2020-07-28 17:43:34,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:43:34,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:43:34,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 87 transitions. [2020-07-28 17:43:34,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:43:34,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 87 transitions. [2020-07-28 17:43:34,085 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 87 transitions. [2020-07-28 17:43:34,269 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:34,282 INFO L225 Difference]: With dead ends: 56 [2020-07-28 17:43:34,282 INFO L226 Difference]: Without dead ends: 26 [2020-07-28 17:43:34,286 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:34,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-28 17:43:34,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-07-28 17:43:34,328 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:43:34,329 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2020-07-28 17:43:34,329 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2020-07-28 17:43:34,330 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2020-07-28 17:43:34,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:43:34,334 INFO L93 Difference]: Finished difference Result 26 states and 36 transitions. [2020-07-28 17:43:34,335 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2020-07-28 17:43:34,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:43:34,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:43:34,336 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2020-07-28 17:43:34,336 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2020-07-28 17:43:34,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:43:34,340 INFO L93 Difference]: Finished difference Result 26 states and 36 transitions. [2020-07-28 17:43:34,340 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2020-07-28 17:43:34,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:43:34,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:43:34,341 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:43:34,342 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:43:34,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-28 17:43:34,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2020-07-28 17:43:34,346 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 11 [2020-07-28 17:43:34,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:43:34,347 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2020-07-28 17:43:34,348 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 17:43:34,348 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2020-07-28 17:43:34,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-28 17:43:34,349 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:43:34,349 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:43:34,563 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-07-28 17:43:34,564 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:43:34,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:43:34,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1352831344, now seen corresponding path program 1 times [2020-07-28 17:43:34,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 17:43:34,567 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [820770695] [2020-07-28 17:43:34,567 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:34,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:43:34,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-28 17:43:34,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:43:34,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 17:43:34,744 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:34,745 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:34,745 INFO L280 TraceCheckUtils]: 2: Hoare triple {250#true} main_#t~ret8 := isnan_double_#res; {250#true} is VALID [2020-07-28 17:43:34,745 INFO L280 TraceCheckUtils]: 3: Hoare triple {250#true} assume 0bv32 == main_#t~ret8;havoc main_#t~ret8;fmin_double_#in~x, fmin_double_#in~y := main_~x~0, main_~y~0;havoc fmin_double_#res;havoc fmin_double_#t~ret4, fmin_double_#t~ret5, fmin_double_#t~ite6, fmin_double_~x, fmin_double_~y;fmin_double_~x := fmin_double_#in~x;fmin_double_~y := fmin_double_#in~y;__fpclassify_double_#in~x := fmin_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:34,746 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~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; {250#true} is VALID [2020-07-28 17:43:34,746 INFO L280 TraceCheckUtils]: 5: Hoare triple {250#true} goto; {250#true} is VALID [2020-07-28 17:43:34,748 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:34,749 INFO L280 TraceCheckUtils]: 7: Hoare triple {273#(= (_ bv2 32) |ULTIMATE.start___fpclassify_double_#res|)} fmin_double_#t~ret4 := __fpclassify_double_#res; {277#(= (bvadd |ULTIMATE.start_fmin_double_#t~ret4| (_ bv4294967294 32)) (_ bv0 32))} is VALID [2020-07-28 17:43:34,750 INFO L280 TraceCheckUtils]: 8: Hoare triple {277#(= (bvadd |ULTIMATE.start_fmin_double_#t~ret4| (_ bv4294967294 32)) (_ bv0 32))} assume 0bv32 == fmin_double_#t~ret4;havoc fmin_double_#t~ret4;fmin_double_#res := fmin_double_~y; {251#false} is VALID [2020-07-28 17:43:34,750 INFO L280 TraceCheckUtils]: 9: Hoare triple {251#false} main_#t~ret9 := fmin_double_#res;main_~res~0 := main_#t~ret9;havoc main_#t~ret9; {251#false} is VALID [2020-07-28 17:43:34,750 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:34,751 INFO L280 TraceCheckUtils]: 11: Hoare triple {251#false} assume !false; {251#false} is VALID [2020-07-28 17:43:34,752 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:34,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 17:43:34,787 INFO L280 TraceCheckUtils]: 11: Hoare triple {251#false} assume !false; {251#false} is VALID [2020-07-28 17:43:34,787 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:34,788 INFO L280 TraceCheckUtils]: 9: Hoare triple {251#false} main_#t~ret9 := fmin_double_#res;main_~res~0 := main_#t~ret9;havoc main_#t~ret9; {251#false} is VALID [2020-07-28 17:43:34,789 INFO L280 TraceCheckUtils]: 8: Hoare triple {299#(not (= |ULTIMATE.start_fmin_double_#t~ret4| (_ bv0 32)))} assume 0bv32 == fmin_double_#t~ret4;havoc fmin_double_#t~ret4;fmin_double_#res := fmin_double_~y; {251#false} is VALID [2020-07-28 17:43:34,790 INFO L280 TraceCheckUtils]: 7: Hoare triple {303#(not (= (_ bv0 32) |ULTIMATE.start___fpclassify_double_#res|))} fmin_double_#t~ret4 := __fpclassify_double_#res; {299#(not (= |ULTIMATE.start_fmin_double_#t~ret4| (_ bv0 32)))} is VALID [2020-07-28 17:43:34,792 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:34,792 INFO L280 TraceCheckUtils]: 5: Hoare triple {250#true} goto; {250#true} is VALID [2020-07-28 17:43:34,793 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~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; {250#true} is VALID [2020-07-28 17:43:34,793 INFO L280 TraceCheckUtils]: 3: Hoare triple {250#true} assume 0bv32 == main_#t~ret8;havoc main_#t~ret8;fmin_double_#in~x, fmin_double_#in~y := main_~x~0, main_~y~0;havoc fmin_double_#res;havoc fmin_double_#t~ret4, fmin_double_#t~ret5, fmin_double_#t~ite6, fmin_double_~x, fmin_double_~y;fmin_double_~x := fmin_double_#in~x;fmin_double_~y := fmin_double_#in~y;__fpclassify_double_#in~x := fmin_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:34,793 INFO L280 TraceCheckUtils]: 2: Hoare triple {250#true} main_#t~ret8 := isnan_double_#res; {250#true} is VALID [2020-07-28 17:43:34,794 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:34,794 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:34,795 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:34,796 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [820770695] [2020-07-28 17:43:34,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:43:34,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-07-28 17:43:34,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586394183] [2020-07-28 17:43:34,799 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2020-07-28 17:43:34,799 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:43:34,800 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-28 17:43:34,828 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:34,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-28 17:43:34,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 17:43:34,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-28 17:43:34,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-28 17:43:34,830 INFO L87 Difference]: Start difference. First operand 26 states and 36 transitions. Second operand 6 states. [2020-07-28 17:43:35,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:43:35,527 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2020-07-28 17:43:35,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-28 17:43:35,528 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2020-07-28 17:43:35,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:43:35,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 17:43:35,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2020-07-28 17:43:35,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 17:43:35,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2020-07-28 17:43:35,534 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 63 transitions. [2020-07-28 17:43:35,668 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:35,671 INFO L225 Difference]: With dead ends: 50 [2020-07-28 17:43:35,671 INFO L226 Difference]: Without dead ends: 46 [2020-07-28 17:43:35,672 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:35,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-07-28 17:43:35,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 28. [2020-07-28 17:43:35,685 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:43:35,685 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 28 states. [2020-07-28 17:43:35,685 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 28 states. [2020-07-28 17:43:35,685 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 28 states. [2020-07-28 17:43:35,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:43:35,690 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2020-07-28 17:43:35,690 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2020-07-28 17:43:35,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:43:35,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:43:35,692 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 46 states. [2020-07-28 17:43:35,692 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 46 states. [2020-07-28 17:43:35,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:43:35,696 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2020-07-28 17:43:35,697 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2020-07-28 17:43:35,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:43:35,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:43:35,698 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:43:35,698 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:43:35,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-28 17:43:35,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2020-07-28 17:43:35,701 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 12 [2020-07-28 17:43:35,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:43:35,702 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2020-07-28 17:43:35,702 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-28 17:43:35,702 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2020-07-28 17:43:35,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-28 17:43:35,703 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:43:35,703 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:35,917 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-07-28 17:43:35,918 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:43:35,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:43:35,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1102769416, now seen corresponding path program 1 times [2020-07-28 17:43:35,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 17:43:35,919 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [588120031] [2020-07-28 17:43:35,920 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:36,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 17:43:36,024 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 17:43:36,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 17:43:36,087 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 17:43:36,121 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2020-07-28 17:43:36,121 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-28 17:43:36,322 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-07-28 17:43:36,356 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 17:43:36,356 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-28 17:43:36,357 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2020-07-28 17:43:36,357 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2020-07-28 17:43:36,358 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2020-07-28 17:43:36,358 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2020-07-28 17:43:36,358 WARN L170 areAnnotationChecker]: L20-2 has no Hoare annotation [2020-07-28 17:43:36,361 WARN L170 areAnnotationChecker]: L62-2 has no Hoare annotation [2020-07-28 17:43:36,362 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2020-07-28 17:43:36,362 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2020-07-28 17:43:36,363 WARN L170 areAnnotationChecker]: L20-3 has no Hoare annotation [2020-07-28 17:43:36,366 WARN L170 areAnnotationChecker]: L20-3 has no Hoare annotation [2020-07-28 17:43:36,366 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2020-07-28 17:43:36,366 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-28 17:43:36,366 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-28 17:43:36,367 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-28 17:43:36,367 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 17:43:36,368 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2020-07-28 17:43:36,368 WARN L170 areAnnotationChecker]: L45 has no Hoare annotation [2020-07-28 17:43:36,368 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-28 17:43:36,368 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-28 17:43:36,369 WARN L170 areAnnotationChecker]: L50-3 has no Hoare annotation [2020-07-28 17:43:36,370 WARN L170 areAnnotationChecker]: L20-6 has no Hoare annotation [2020-07-28 17:43:36,370 WARN L170 areAnnotationChecker]: L20-6 has no Hoare annotation [2020-07-28 17:43:36,370 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-28 17:43:36,370 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-28 17:43:36,371 WARN L170 areAnnotationChecker]: L67 has no Hoare annotation [2020-07-28 17:43:36,371 WARN L170 areAnnotationChecker]: L67 has no Hoare annotation [2020-07-28 17:43:36,375 WARN L170 areAnnotationChecker]: L20-5 has no Hoare annotation [2020-07-28 17:43:36,376 WARN L170 areAnnotationChecker]: L20-5 has no Hoare annotation [2020-07-28 17:43:36,376 WARN L170 areAnnotationChecker]: L20-7 has no Hoare annotation [2020-07-28 17:43:36,376 WARN L170 areAnnotationChecker]: L20-7 has no Hoare annotation [2020-07-28 17:43:36,376 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2020-07-28 17:43:36,377 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2020-07-28 17:43:36,377 WARN L170 areAnnotationChecker]: L41-1 has no Hoare annotation [2020-07-28 17:43:36,377 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2020-07-28 17:43:36,377 WARN L170 areAnnotationChecker]: L30-1 has no Hoare annotation [2020-07-28 17:43:36,377 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2020-07-28 17:43:36,378 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2020-07-28 17:43:36,378 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2020-07-28 17:43:36,378 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2020-07-28 17:43:36,378 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2020-07-28 17:43:36,378 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2020-07-28 17:43:36,380 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2020-07-28 17:43:36,380 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2020-07-28 17:43:36,381 WARN L170 areAnnotationChecker]: L50-2 has no Hoare annotation [2020-07-28 17:43:36,381 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:36,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 05:43:36 BoogieIcfgContainer [2020-07-28 17:43:36,387 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 17:43:36,387 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 17:43:36,388 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 17:43:36,389 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 17:43:36,389 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:33" (3/4) ... [2020-07-28 17:43:36,392 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-07-28 17:43:36,476 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 17:43:36,476 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 17:43:36,480 INFO L168 Benchmark]: Toolchain (without parser) took 4246.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 950.8 MB in the beginning and 910.9 MB in the end (delta: 39.9 MB). Peak memory consumption was 168.9 MB. Max. memory is 11.5 GB. [2020-07-28 17:43:36,480 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 17:43:36,481 INFO L168 Benchmark]: CACSL2BoogieTranslator took 329.78 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 934.7 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:36,481 INFO L168 Benchmark]: Boogie Procedure Inliner took 156.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 934.7 MB in the beginning and 1.1 GB in the end (delta: -183.7 MB). Peak memory consumption was 9.9 MB. Max. memory is 11.5 GB. [2020-07-28 17:43:36,482 INFO L168 Benchmark]: Boogie Preprocessor took 41.23 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:36,483 INFO L168 Benchmark]: RCFGBuilder took 711.38 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.9 MB). Peak memory consumption was 37.9 MB. Max. memory is 11.5 GB. [2020-07-28 17:43:36,483 INFO L168 Benchmark]: TraceAbstraction took 2910.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 917.6 MB in the end (delta: 162.9 MB). Peak memory consumption was 162.9 MB. Max. memory is 11.5 GB. [2020-07-28 17:43:36,484 INFO L168 Benchmark]: Witness Printer took 89.07 ms. Allocated memory is still 1.2 GB. Free memory was 917.6 MB in the beginning and 910.9 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:36,488 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 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 329.78 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 934.7 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 156.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 934.7 MB in the beginning and 1.1 GB in the end (delta: -183.7 MB). Peak memory consumption was 9.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.23 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 711.38 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.9 MB). Peak memory consumption was 37.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2910.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 917.6 MB in the end (delta: 162.9 MB). Peak memory consumption was 162.9 MB. Max. memory is 11.5 GB. * Witness Printer took 89.07 ms. Allocated memory is still 1.2 GB. Free memory was 917.6 MB in the beginning and 910.9 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: 68]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L60] double x = __VERIFIER_nondet_double(); [L61] double y = 0.0 / 0.0; [L16] return x != x; [L62] COND TRUE !isnan_double(x) [L18] __uint32_t msw, lsw; [L21] ieee_double_shape_type ew_u; [L22] ew_u.value = (x) [L23] EXPR ew_u.parts.msw [L23] (msw) = ew_u.parts.msw [L24] EXPR ew_u.parts.lsw [L24] (lsw) = ew_u.parts.lsw [L27-L28] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) [L30-L31] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) [L33-L34] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) [L37-L38] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L41] return 0; [L45] COND TRUE __fpclassify_double(x) == 0 [L46] return y; [L64] double res = fmin_double(x, y); [L67] COND TRUE res != x [L68] __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.0s 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, 574 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...