./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_1071.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_1071.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 922786d1b563f399f230d6bc6e72c1342da4d1a5 ............................................................................................................................................................................................................................................................................................................................................ 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_1071.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 922786d1b563f399f230d6bc6e72c1342da4d1a5 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 17:42:36,422 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 17:42:36,424 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 17:42:36,437 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 17:42:36,438 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 17:42:36,439 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 17:42:36,440 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 17:42:36,443 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 17:42:36,445 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 17:42:36,446 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 17:42:36,447 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 17:42:36,448 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 17:42:36,449 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 17:42:36,450 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 17:42:36,451 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 17:42:36,453 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 17:42:36,454 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 17:42:36,455 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 17:42:36,456 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 17:42:36,459 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 17:42:36,460 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 17:42:36,461 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 17:42:36,463 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 17:42:36,464 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 17:42:36,466 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 17:42:36,467 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 17:42:36,467 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 17:42:36,468 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 17:42:36,468 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 17:42:36,469 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 17:42:36,470 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 17:42:36,471 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 17:42:36,472 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 17:42:36,472 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 17:42:36,474 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 17:42:36,474 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 17:42:36,475 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 17:42:36,475 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 17:42:36,475 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 17:42:36,476 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 17:42:36,477 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 17:42:36,478 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:42:36,506 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 17:42:36,510 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 17:42:36,511 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 17:42:36,512 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 17:42:36,512 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 17:42:36,513 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 17:42:36,513 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 17:42:36,513 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 17:42:36,514 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 17:42:36,514 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 17:42:36,515 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 17:42:36,515 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 17:42:36,516 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 17:42:36,516 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 17:42:36,516 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 17:42:36,517 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 17:42:36,517 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 17:42:36,517 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 17:42:36,517 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 17:42:36,518 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 17:42:36,518 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 17:42:36,518 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 17:42:36,519 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 17:42:36,519 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 17:42:36,520 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 17:42:36,520 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 17:42:36,520 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 17:42:36,520 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 17:42:36,521 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 17:42:36,521 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 -> 922786d1b563f399f230d6bc6e72c1342da4d1a5 [2020-07-28 17:42:36,839 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 17:42:36,853 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 17:42:36,856 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 17:42:36,858 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 17:42:36,858 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 17:42:36,859 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1071.c [2020-07-28 17:42:36,925 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2c0b4e8e/ada4b738d8344089a7f16c27fca5e433/FLAG8b9697d76 [2020-07-28 17:42:37,385 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 17:42:37,386 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1071.c [2020-07-28 17:42:37,397 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2c0b4e8e/ada4b738d8344089a7f16c27fca5e433/FLAG8b9697d76 [2020-07-28 17:42:37,736 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2c0b4e8e/ada4b738d8344089a7f16c27fca5e433 [2020-07-28 17:42:37,739 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 17:42:37,743 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 17:42:37,744 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 17:42:37,745 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 17:42:37,748 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 17:42:37,750 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:42:37" (1/1) ... [2020-07-28 17:42:37,753 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26a96ca1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:37, skipping insertion in model container [2020-07-28 17:42:37,754 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:42:37" (1/1) ... [2020-07-28 17:42:37,762 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 17:42:37,788 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 17:42:38,036 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:42:38,041 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 17:42:38,075 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:42:38,166 INFO L208 MainTranslator]: Completed translation [2020-07-28 17:42:38,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:38 WrapperNode [2020-07-28 17:42:38,167 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 17:42:38,170 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 17:42:38,170 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 17:42:38,170 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 17:42:38,182 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:42:38" (1/1) ... [2020-07-28 17:42:38,201 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:42:38" (1/1) ... [2020-07-28 17:42:38,242 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 17:42:38,243 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 17:42:38,243 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 17:42:38,243 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 17:42:38,254 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:38" (1/1) ... [2020-07-28 17:42:38,254 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:38" (1/1) ... [2020-07-28 17:42:38,257 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:38" (1/1) ... [2020-07-28 17:42:38,258 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:38" (1/1) ... [2020-07-28 17:42:38,270 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:38" (1/1) ... [2020-07-28 17:42:38,275 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:38" (1/1) ... [2020-07-28 17:42:38,277 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:38" (1/1) ... [2020-07-28 17:42:38,280 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 17:42:38,280 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 17:42:38,281 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 17:42:38,281 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 17:42:38,282 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:38" (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:42:38,341 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-07-28 17:42:38,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-28 17:42:38,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-07-28 17:42:38,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 17:42:38,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 17:42:38,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-28 17:42:38,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-28 17:42:38,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-28 17:42:38,834 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 17:42:38,834 INFO L295 CfgBuilder]: Removed 16 assume(true) statements. [2020-07-28 17:42:38,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:42:38 BoogieIcfgContainer [2020-07-28 17:42:38,838 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 17:42:38,839 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 17:42:38,839 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 17:42:38,843 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 17:42:38,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 05:42:37" (1/3) ... [2020-07-28 17:42:38,844 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@709f8143 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:42:38, skipping insertion in model container [2020-07-28 17:42:38,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:38" (2/3) ... [2020-07-28 17:42:38,844 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@709f8143 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:42:38, skipping insertion in model container [2020-07-28 17:42:38,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:42:38" (3/3) ... [2020-07-28 17:42:38,849 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1071.c [2020-07-28 17:42:38,861 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 17:42:38,868 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 17:42:38,880 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 17:42:38,900 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 17:42:38,900 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 17:42:38,900 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 17:42:38,900 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 17:42:38,901 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 17:42:38,901 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 17:42:38,901 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 17:42:38,901 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 17:42:38,914 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2020-07-28 17:42:38,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-28 17:42:38,921 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:42:38,922 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:42:38,922 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:42:38,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:42:38,927 INFO L82 PathProgramCache]: Analyzing trace with hash 166132434, now seen corresponding path program 1 times [2020-07-28 17:42:38,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:42:38,935 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627496187] [2020-07-28 17:42:38,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:42:39,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:42:39,066 INFO L280 TraceCheckUtils]: 0: Hoare triple {27#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {27#true} is VALID [2020-07-28 17:42:39,067 INFO L280 TraceCheckUtils]: 1: Hoare triple {27#true} havoc main_#res;havoc main_#t~ret10, main_#t~ret11, main_~x~0, main_~res~0;main_~x~0 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0);trunc_double_#in~x := main_~x~0;havoc trunc_double_#res;havoc trunc_double_#t~mem0, trunc_double_#t~union1, trunc_double_#t~mem2, trunc_double_#t~union3, trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset, trunc_double_#t~mem4, trunc_double_#t~union5.lsw, trunc_double_#t~union5.msw, trunc_double_~#iw_u~0.base, trunc_double_~#iw_u~0.offset, trunc_double_#t~mem6, trunc_double_#t~union7.lsw, trunc_double_#t~union7.msw, trunc_double_~#iw_u~1.base, trunc_double_~#iw_u~1.offset, trunc_double_#t~mem8, trunc_double_#t~union9.lsw, trunc_double_#t~union9.msw, trunc_double_~#iw_u~2.base, trunc_double_~#iw_u~2.offset, trunc_double_~x, trunc_double_~signbit~0, trunc_double_~msw~0, trunc_double_~lsw~0, trunc_double_~exponent_less_1023~0;trunc_double_~x := trunc_double_#in~x;havoc trunc_double_~signbit~0;havoc trunc_double_~msw~0;havoc trunc_double_~lsw~0;havoc trunc_double_~exponent_less_1023~0; {27#true} is VALID [2020-07-28 17:42:39,068 INFO L280 TraceCheckUtils]: 2: Hoare triple {27#true} assume !true; {28#false} is VALID [2020-07-28 17:42:39,069 INFO L280 TraceCheckUtils]: 3: Hoare triple {28#false} trunc_double_~signbit~0 := (if ~bitwiseAnd(trunc_double_~msw~0, 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseAnd(trunc_double_~msw~0, 2147483648) % 4294967296 % 4294967296 else ~bitwiseAnd(trunc_double_~msw~0, 2147483648) % 4294967296 % 4294967296 - 4294967296);trunc_double_~exponent_less_1023~0 := ~bitwiseAnd(trunc_double_~msw~0, 2146435072) / 1048576 - 1023; {28#false} is VALID [2020-07-28 17:42:39,069 INFO L280 TraceCheckUtils]: 4: Hoare triple {28#false} assume !(trunc_double_~exponent_less_1023~0 < 20); {28#false} is VALID [2020-07-28 17:42:39,070 INFO L280 TraceCheckUtils]: 5: Hoare triple {28#false} assume trunc_double_~exponent_less_1023~0 > 51; {28#false} is VALID [2020-07-28 17:42:39,070 INFO L280 TraceCheckUtils]: 6: Hoare triple {28#false} assume 1024 == trunc_double_~exponent_less_1023~0;trunc_double_#res := ~someBinaryArithmeticDOUBLEoperation(trunc_double_~x, trunc_double_~x); {28#false} is VALID [2020-07-28 17:42:39,070 INFO L280 TraceCheckUtils]: 7: Hoare triple {28#false} main_#t~ret10 := trunc_double_#res;main_~res~0 := main_#t~ret10;havoc main_#t~ret10;isnan_double_#in~x := main_~res~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); {28#false} is VALID [2020-07-28 17:42:39,071 INFO L280 TraceCheckUtils]: 8: Hoare triple {28#false} main_#t~ret11 := isnan_double_#res;assume -2147483648 <= main_#t~ret11 && main_#t~ret11 <= 2147483647; {28#false} is VALID [2020-07-28 17:42:39,071 INFO L280 TraceCheckUtils]: 9: Hoare triple {28#false} assume 0 == main_#t~ret11;havoc main_#t~ret11; {28#false} is VALID [2020-07-28 17:42:39,071 INFO L280 TraceCheckUtils]: 10: Hoare triple {28#false} assume !false; {28#false} is VALID [2020-07-28 17:42:39,074 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:42:39,075 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627496187] [2020-07-28 17:42:39,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:42:39,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-28 17:42:39,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817351271] [2020-07-28 17:42:39,083 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2020-07-28 17:42:39,085 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:42:39,088 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 17:42:39,116 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:42:39,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 17:42:39,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:42:39,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 17:42:39,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 17:42:39,128 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 2 states. [2020-07-28 17:42:39,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:42:39,201 INFO L93 Difference]: Finished difference Result 46 states and 70 transitions. [2020-07-28 17:42:39,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 17:42:39,202 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2020-07-28 17:42:39,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:42:39,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:42:39,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 70 transitions. [2020-07-28 17:42:39,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:42:39,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 70 transitions. [2020-07-28 17:42:39,215 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 70 transitions. [2020-07-28 17:42:39,379 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:42:39,395 INFO L225 Difference]: With dead ends: 46 [2020-07-28 17:42:39,395 INFO L226 Difference]: Without dead ends: 21 [2020-07-28 17:42:39,399 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:42:39,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-28 17:42:39,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-28 17:42:39,441 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:42:39,441 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2020-07-28 17:42:39,442 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2020-07-28 17:42:39,442 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2020-07-28 17:42:39,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:42:39,447 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2020-07-28 17:42:39,447 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2020-07-28 17:42:39,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:42:39,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:42:39,448 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2020-07-28 17:42:39,449 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2020-07-28 17:42:39,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:42:39,456 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2020-07-28 17:42:39,462 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2020-07-28 17:42:39,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:42:39,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:42:39,463 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:42:39,463 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:42:39,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-28 17:42:39,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2020-07-28 17:42:39,468 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 11 [2020-07-28 17:42:39,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:42:39,469 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2020-07-28 17:42:39,469 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 17:42:39,469 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2020-07-28 17:42:39,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-28 17:42:39,471 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:42:39,471 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:42:39,472 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 17:42:39,473 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:42:39,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:42:39,474 INFO L82 PathProgramCache]: Analyzing trace with hash 786053359, now seen corresponding path program 1 times [2020-07-28 17:42:39,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:42:39,475 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097333701] [2020-07-28 17:42:39,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:42:39,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 17:42:39,566 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 17:42:39,643 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-28 17:42:39,644 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.theory.linar.TableauxRow.(TableauxRow.java:45) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.generateLinVar(LinArSolve.java:275) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.createEquality(LinArSolve.java:1974) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.createLAEquality(EqualityProxy.java:83) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.createAtom(EqualityProxy.java:165) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.getLiteral(EqualityProxy.java:186) at de.uni_freiburg.informatik.ultimate.smtinterpol.convert.EqualityProxy.createCCEquality(EqualityProxy.java:109) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.mbtc(LinArSolve.java:1891) at de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.LinArSolve.computeConflictClause(LinArSolve.java:664) at de.uni_freiburg.informatik.ultimate.smtinterpol.dpll.DPLLEngine.checkConsistency(DPLLEngine.java:1010) at de.uni_freiburg.informatik.ultimate.smtinterpol.dpll.DPLLEngine.solve(DPLLEngine.java:1157) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol$CheckType$1.check(SMTInterpol.java:117) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.checkSatAssuming(SMTInterpol.java:494) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.checkSat(SMTInterpol.java:446) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.AnnotateAndAsserter.buildAnnotatedSsaAndAssertTerms(AnnotateAndAsserter.java:130) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.checkTrace(TraceCheck.java:295) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:206) 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:42:39,654 INFO L168 Benchmark]: Toolchain (without parser) took 1912.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 960.2 MB in the beginning and 1.0 GB in the end (delta: -60.2 MB). Peak memory consumption was 63.5 MB. Max. memory is 11.5 GB. [2020-07-28 17:42:39,655 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 17:42:39,656 INFO L168 Benchmark]: CACSL2BoogieTranslator took 423.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 960.2 MB in the beginning and 1.1 GB in the end (delta: -153.0 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. [2020-07-28 17:42:39,658 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2020-07-28 17:42:39,658 INFO L168 Benchmark]: Boogie Preprocessor took 37.46 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:42:39,659 INFO L168 Benchmark]: RCFGBuilder took 557.30 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: 32.3 MB). Peak memory consumption was 32.3 MB. Max. memory is 11.5 GB. [2020-07-28 17:42:39,660 INFO L168 Benchmark]: TraceAbstraction took 810.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 53.8 MB). Peak memory consumption was 53.8 MB. Max. memory is 11.5 GB. [2020-07-28 17:42:39,665 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.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 423.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 960.2 MB in the beginning and 1.1 GB in the end (delta: -153.0 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 72.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.46 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 557.30 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: 32.3 MB). Peak memory consumption was 32.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 810.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 53.8 MB). Peak memory consumption was 53.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: null: de.uni_freiburg.informatik.ultimate.smtinterpol.theory.linar.TableauxRow.(TableauxRow.java:45) 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:42:41,671 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 17:42:41,674 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 17:42:41,686 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 17:42:41,687 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 17:42:41,688 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 17:42:41,689 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 17:42:41,691 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 17:42:41,693 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 17:42:41,694 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 17:42:41,695 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 17:42:41,700 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 17:42:41,700 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 17:42:41,701 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 17:42:41,702 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 17:42:41,706 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 17:42:41,708 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 17:42:41,708 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 17:42:41,710 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 17:42:41,712 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 17:42:41,714 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 17:42:41,715 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 17:42:41,716 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 17:42:41,717 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 17:42:41,720 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 17:42:41,720 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 17:42:41,720 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 17:42:41,721 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 17:42:41,722 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 17:42:41,723 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 17:42:41,723 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 17:42:41,724 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 17:42:41,724 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 17:42:41,725 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 17:42:41,726 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 17:42:41,727 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 17:42:41,727 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 17:42:41,728 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 17:42:41,728 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 17:42:41,729 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 17:42:41,729 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 17:42:41,730 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:42:41,746 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 17:42:41,746 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 17:42:41,747 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 17:42:41,747 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 17:42:41,748 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 17:42:41,748 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 17:42:41,748 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 17:42:41,748 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 17:42:41,749 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 17:42:41,749 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 17:42:41,749 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 17:42:41,749 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 17:42:41,749 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-07-28 17:42:41,750 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-07-28 17:42:41,750 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 17:42:41,750 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 17:42:41,750 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 17:42:41,750 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 17:42:41,751 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 17:42:41,751 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 17:42:41,751 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 17:42:41,751 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 17:42:41,752 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 17:42:41,752 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 17:42:41,752 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 17:42:41,752 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 17:42:41,753 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-07-28 17:42:41,753 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-07-28 17:42:41,753 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 17:42:41,753 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 17:42:41,753 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-28 17:42:41,754 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 -> 922786d1b563f399f230d6bc6e72c1342da4d1a5 [2020-07-28 17:42:42,067 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 17:42:42,081 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 17:42:42,084 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 17:42:42,086 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 17:42:42,087 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 17:42:42,087 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1071.c [2020-07-28 17:42:42,160 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8ac1f9da/641ad1b6cecc4dcea2e36a03948fcba3/FLAGe54a2199b [2020-07-28 17:42:42,664 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 17:42:42,664 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1071.c [2020-07-28 17:42:42,672 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8ac1f9da/641ad1b6cecc4dcea2e36a03948fcba3/FLAGe54a2199b [2020-07-28 17:42:43,098 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8ac1f9da/641ad1b6cecc4dcea2e36a03948fcba3 [2020-07-28 17:42:43,102 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 17:42:43,105 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 17:42:43,106 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 17:42:43,106 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 17:42:43,110 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 17:42:43,111 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:42:43" (1/1) ... [2020-07-28 17:42:43,114 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@548df956 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:43, skipping insertion in model container [2020-07-28 17:42:43,115 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:42:43" (1/1) ... [2020-07-28 17:42:43,122 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 17:42:43,145 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 17:42:43,405 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:42:43,413 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 17:42:43,461 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:42:43,568 INFO L208 MainTranslator]: Completed translation [2020-07-28 17:42:43,569 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:43 WrapperNode [2020-07-28 17:42:43,569 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 17:42:43,572 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 17:42:43,572 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 17:42:43,573 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 17:42:43,583 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:42:43" (1/1) ... [2020-07-28 17:42:43,596 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:42:43" (1/1) ... [2020-07-28 17:42:43,631 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 17:42:43,632 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 17:42:43,632 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 17:42:43,632 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 17:42:43,642 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:43" (1/1) ... [2020-07-28 17:42:43,642 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:43" (1/1) ... [2020-07-28 17:42:43,647 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:43" (1/1) ... [2020-07-28 17:42:43,647 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:43" (1/1) ... [2020-07-28 17:42:43,672 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:43" (1/1) ... [2020-07-28 17:42:43,689 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:43" (1/1) ... [2020-07-28 17:42:43,691 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:43" (1/1) ... [2020-07-28 17:42:43,699 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 17:42:43,699 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 17:42:43,700 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 17:42:43,700 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 17:42:43,701 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:43" (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:42:43,776 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2020-07-28 17:42:43,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2020-07-28 17:42:43,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-28 17:42:43,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2020-07-28 17:42:43,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 17:42:43,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 17:42:43,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2020-07-28 17:42:43,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-28 17:42:44,335 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 17:42:44,335 INFO L295 CfgBuilder]: Removed 16 assume(true) statements. [2020-07-28 17:42:44,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:42:44 BoogieIcfgContainer [2020-07-28 17:42:44,339 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 17:42:44,341 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 17:42:44,341 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 17:42:44,344 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 17:42:44,345 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 05:42:43" (1/3) ... [2020-07-28 17:42:44,346 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33655eae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:42:44, skipping insertion in model container [2020-07-28 17:42:44,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:43" (2/3) ... [2020-07-28 17:42:44,347 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33655eae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:42:44, skipping insertion in model container [2020-07-28 17:42:44,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:42:44" (3/3) ... [2020-07-28 17:42:44,349 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1071.c [2020-07-28 17:42:44,360 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 17:42:44,367 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 17:42:44,378 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 17:42:44,398 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 17:42:44,398 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 17:42:44,398 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 17:42:44,399 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 17:42:44,399 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 17:42:44,400 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 17:42:44,400 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 17:42:44,400 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 17:42:44,414 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2020-07-28 17:42:44,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-28 17:42:44,420 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:42:44,420 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:42:44,421 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:42:44,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:42:44,427 INFO L82 PathProgramCache]: Analyzing trace with hash 166132434, now seen corresponding path program 1 times [2020-07-28 17:42:44,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 17:42:44,441 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1090506878] [2020-07-28 17:42:44,441 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:42:44,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:42:44,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 1 conjunts are in the unsatisfiable core [2020-07-28 17:42:44,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:42:44,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 17:42:44,644 INFO L280 TraceCheckUtils]: 0: Hoare triple {27#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {27#true} is VALID [2020-07-28 17:42:44,645 INFO L280 TraceCheckUtils]: 1: Hoare triple {27#true} havoc main_#res;havoc main_#t~ret10, main_#t~ret11, main_~x~0, main_~res~0;main_~x~0 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());trunc_double_#in~x := main_~x~0;havoc trunc_double_#res;havoc trunc_double_#t~mem0, trunc_double_#t~union1, trunc_double_#t~mem2, trunc_double_#t~union3, trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset, trunc_double_#t~mem4, trunc_double_#t~union5.lsw, trunc_double_#t~union5.msw, trunc_double_~#iw_u~0.base, trunc_double_~#iw_u~0.offset, trunc_double_#t~mem6, trunc_double_#t~union7.lsw, trunc_double_#t~union7.msw, trunc_double_~#iw_u~1.base, trunc_double_~#iw_u~1.offset, trunc_double_#t~mem8, trunc_double_#t~union9.lsw, trunc_double_#t~union9.msw, trunc_double_~#iw_u~2.base, trunc_double_~#iw_u~2.offset, trunc_double_~x, trunc_double_~signbit~0, trunc_double_~msw~0, trunc_double_~lsw~0, trunc_double_~exponent_less_1023~0;trunc_double_~x := trunc_double_#in~x;havoc trunc_double_~signbit~0;havoc trunc_double_~msw~0;havoc trunc_double_~lsw~0;havoc trunc_double_~exponent_less_1023~0; {27#true} is VALID [2020-07-28 17:42:44,647 INFO L280 TraceCheckUtils]: 2: Hoare triple {27#true} assume !true; {28#false} is VALID [2020-07-28 17:42:44,648 INFO L280 TraceCheckUtils]: 3: Hoare triple {28#false} trunc_double_~signbit~0 := ~bvand32(2147483648bv32, trunc_double_~msw~0);trunc_double_~exponent_less_1023~0 := ~bvsub32(~bvashr32(~bvand32(2146435072bv32, trunc_double_~msw~0), 20bv32), 1023bv32); {28#false} is VALID [2020-07-28 17:42:44,648 INFO L280 TraceCheckUtils]: 4: Hoare triple {28#false} assume !~bvslt32(trunc_double_~exponent_less_1023~0, 20bv32); {28#false} is VALID [2020-07-28 17:42:44,649 INFO L280 TraceCheckUtils]: 5: Hoare triple {28#false} assume ~bvsgt32(trunc_double_~exponent_less_1023~0, 51bv32); {28#false} is VALID [2020-07-28 17:42:44,649 INFO L280 TraceCheckUtils]: 6: Hoare triple {28#false} assume 1024bv32 == trunc_double_~exponent_less_1023~0;trunc_double_#res := ~fp.add~DOUBLE(currentRoundingMode, trunc_double_~x, trunc_double_~x); {28#false} is VALID [2020-07-28 17:42:44,650 INFO L280 TraceCheckUtils]: 7: Hoare triple {28#false} main_#t~ret10 := trunc_double_#res;main_~res~0 := main_#t~ret10;havoc main_#t~ret10;isnan_double_#in~x := main_~res~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); {28#false} is VALID [2020-07-28 17:42:44,650 INFO L280 TraceCheckUtils]: 8: Hoare triple {28#false} main_#t~ret11 := isnan_double_#res; {28#false} is VALID [2020-07-28 17:42:44,651 INFO L280 TraceCheckUtils]: 9: Hoare triple {28#false} assume 0bv32 == main_#t~ret11;havoc main_#t~ret11; {28#false} is VALID [2020-07-28 17:42:44,651 INFO L280 TraceCheckUtils]: 10: Hoare triple {28#false} assume !false; {28#false} is VALID [2020-07-28 17:42:44,655 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:42:44,655 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 17:42:44,676 INFO L280 TraceCheckUtils]: 10: Hoare triple {28#false} assume !false; {28#false} is VALID [2020-07-28 17:42:44,677 INFO L280 TraceCheckUtils]: 9: Hoare triple {28#false} assume 0bv32 == main_#t~ret11;havoc main_#t~ret11; {28#false} is VALID [2020-07-28 17:42:44,677 INFO L280 TraceCheckUtils]: 8: Hoare triple {28#false} main_#t~ret11 := isnan_double_#res; {28#false} is VALID [2020-07-28 17:42:44,678 INFO L280 TraceCheckUtils]: 7: Hoare triple {28#false} main_#t~ret10 := trunc_double_#res;main_~res~0 := main_#t~ret10;havoc main_#t~ret10;isnan_double_#in~x := main_~res~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); {28#false} is VALID [2020-07-28 17:42:44,679 INFO L280 TraceCheckUtils]: 6: Hoare triple {28#false} assume 1024bv32 == trunc_double_~exponent_less_1023~0;trunc_double_#res := ~fp.add~DOUBLE(currentRoundingMode, trunc_double_~x, trunc_double_~x); {28#false} is VALID [2020-07-28 17:42:44,679 INFO L280 TraceCheckUtils]: 5: Hoare triple {28#false} assume ~bvsgt32(trunc_double_~exponent_less_1023~0, 51bv32); {28#false} is VALID [2020-07-28 17:42:44,680 INFO L280 TraceCheckUtils]: 4: Hoare triple {28#false} assume !~bvslt32(trunc_double_~exponent_less_1023~0, 20bv32); {28#false} is VALID [2020-07-28 17:42:44,681 INFO L280 TraceCheckUtils]: 3: Hoare triple {28#false} trunc_double_~signbit~0 := ~bvand32(2147483648bv32, trunc_double_~msw~0);trunc_double_~exponent_less_1023~0 := ~bvsub32(~bvashr32(~bvand32(2146435072bv32, trunc_double_~msw~0), 20bv32), 1023bv32); {28#false} is VALID [2020-07-28 17:42:44,682 INFO L280 TraceCheckUtils]: 2: Hoare triple {27#true} assume !true; {28#false} is VALID [2020-07-28 17:42:44,683 INFO L280 TraceCheckUtils]: 1: Hoare triple {27#true} havoc main_#res;havoc main_#t~ret10, main_#t~ret11, main_~x~0, main_~res~0;main_~x~0 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());trunc_double_#in~x := main_~x~0;havoc trunc_double_#res;havoc trunc_double_#t~mem0, trunc_double_#t~union1, trunc_double_#t~mem2, trunc_double_#t~union3, trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset, trunc_double_#t~mem4, trunc_double_#t~union5.lsw, trunc_double_#t~union5.msw, trunc_double_~#iw_u~0.base, trunc_double_~#iw_u~0.offset, trunc_double_#t~mem6, trunc_double_#t~union7.lsw, trunc_double_#t~union7.msw, trunc_double_~#iw_u~1.base, trunc_double_~#iw_u~1.offset, trunc_double_#t~mem8, trunc_double_#t~union9.lsw, trunc_double_#t~union9.msw, trunc_double_~#iw_u~2.base, trunc_double_~#iw_u~2.offset, trunc_double_~x, trunc_double_~signbit~0, trunc_double_~msw~0, trunc_double_~lsw~0, trunc_double_~exponent_less_1023~0;trunc_double_~x := trunc_double_#in~x;havoc trunc_double_~signbit~0;havoc trunc_double_~msw~0;havoc trunc_double_~lsw~0;havoc trunc_double_~exponent_less_1023~0; {27#true} is VALID [2020-07-28 17:42:44,683 INFO L280 TraceCheckUtils]: 0: Hoare triple {27#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {27#true} is VALID [2020-07-28 17:42:44,684 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:42:44,685 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1090506878] [2020-07-28 17:42:44,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:42:44,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-07-28 17:42:44,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519234538] [2020-07-28 17:42:44,700 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2020-07-28 17:42:44,704 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:42:44,709 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 17:42:44,784 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:42:44,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 17:42:44,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 17:42:44,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 17:42:44,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 17:42:44,798 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 2 states. [2020-07-28 17:42:44,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:42:44,963 INFO L93 Difference]: Finished difference Result 46 states and 70 transitions. [2020-07-28 17:42:44,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 17:42:44,964 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2020-07-28 17:42:44,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:42:44,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:42:44,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 70 transitions. [2020-07-28 17:42:44,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:42:44,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 70 transitions. [2020-07-28 17:42:44,975 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 70 transitions. [2020-07-28 17:42:45,200 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:42:45,211 INFO L225 Difference]: With dead ends: 46 [2020-07-28 17:42:45,212 INFO L226 Difference]: Without dead ends: 21 [2020-07-28 17:42:45,215 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:42:45,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-28 17:42:45,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-28 17:42:45,249 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:42:45,249 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2020-07-28 17:42:45,250 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2020-07-28 17:42:45,250 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2020-07-28 17:42:45,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:42:45,253 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2020-07-28 17:42:45,254 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2020-07-28 17:42:45,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:42:45,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:42:45,255 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2020-07-28 17:42:45,255 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2020-07-28 17:42:45,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:42:45,257 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2020-07-28 17:42:45,258 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2020-07-28 17:42:45,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:42:45,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:42:45,258 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:42:45,259 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:42:45,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-28 17:42:45,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2020-07-28 17:42:45,263 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 11 [2020-07-28 17:42:45,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:42:45,263 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2020-07-28 17:42:45,263 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 17:42:45,264 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2020-07-28 17:42:45,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-28 17:42:45,264 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:42:45,265 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:42:45,478 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-07-28 17:42:45,479 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:42:45,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:42:45,480 INFO L82 PathProgramCache]: Analyzing trace with hash 786053359, now seen corresponding path program 1 times [2020-07-28 17:42:45,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 17:42:45,481 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [838038436] [2020-07-28 17:42:45,482 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:42:45,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:42:45,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-28 17:42:45,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:42:45,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 17:42:45,786 INFO L280 TraceCheckUtils]: 0: Hoare triple {220#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {225#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2020-07-28 17:42:45,788 INFO L280 TraceCheckUtils]: 1: Hoare triple {225#(= currentRoundingMode roundNearestTiesToEven)} havoc main_#res;havoc main_#t~ret10, main_#t~ret11, main_~x~0, main_~res~0;main_~x~0 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());trunc_double_#in~x := main_~x~0;havoc trunc_double_#res;havoc trunc_double_#t~mem0, trunc_double_#t~union1, trunc_double_#t~mem2, trunc_double_#t~union3, trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset, trunc_double_#t~mem4, trunc_double_#t~union5.lsw, trunc_double_#t~union5.msw, trunc_double_~#iw_u~0.base, trunc_double_~#iw_u~0.offset, trunc_double_#t~mem6, trunc_double_#t~union7.lsw, trunc_double_#t~union7.msw, trunc_double_~#iw_u~1.base, trunc_double_~#iw_u~1.offset, trunc_double_#t~mem8, trunc_double_#t~union9.lsw, trunc_double_#t~union9.msw, trunc_double_~#iw_u~2.base, trunc_double_~#iw_u~2.offset, trunc_double_~x, trunc_double_~signbit~0, trunc_double_~msw~0, trunc_double_~lsw~0, trunc_double_~exponent_less_1023~0;trunc_double_~x := trunc_double_#in~x;havoc trunc_double_~signbit~0;havoc trunc_double_~msw~0;havoc trunc_double_~lsw~0;havoc trunc_double_~exponent_less_1023~0; {229#(and (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) ULTIMATE.start_trunc_double_~x) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2020-07-28 17:42:45,791 INFO L280 TraceCheckUtils]: 2: Hoare triple {229#(and (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) ULTIMATE.start_trunc_double_~x) (= currentRoundingMode roundNearestTiesToEven))} call trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(trunc_double_~x, trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset, 8bv32);call trunc_double_#t~mem0 := read~intINTTYPE4(trunc_double_~#ew_u~0.base, ~bvadd32(4bv32, trunc_double_~#ew_u~0.offset), 4bv32);trunc_double_~msw~0 := trunc_double_#t~mem0;call write~intFLOATTYPE8(trunc_double_#t~union1, trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset, 8bv32);havoc trunc_double_#t~union1;havoc trunc_double_#t~mem0;call trunc_double_#t~mem2 := read~intINTTYPE4(trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset, 4bv32);trunc_double_~lsw~0 := trunc_double_#t~mem2;call write~intFLOATTYPE8(trunc_double_#t~union3, trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset, 8bv32);havoc trunc_double_#t~mem2;havoc trunc_double_#t~union3;call ULTIMATE.dealloc(trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset);havoc trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset; {229#(and (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) ULTIMATE.start_trunc_double_~x) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2020-07-28 17:42:45,792 INFO L280 TraceCheckUtils]: 3: Hoare triple {229#(and (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) ULTIMATE.start_trunc_double_~x) (= currentRoundingMode roundNearestTiesToEven))} goto; {229#(and (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) ULTIMATE.start_trunc_double_~x) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2020-07-28 17:42:45,794 INFO L280 TraceCheckUtils]: 4: Hoare triple {229#(and (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) ULTIMATE.start_trunc_double_~x) (= currentRoundingMode roundNearestTiesToEven))} trunc_double_~signbit~0 := ~bvand32(2147483648bv32, trunc_double_~msw~0);trunc_double_~exponent_less_1023~0 := ~bvsub32(~bvashr32(~bvand32(2146435072bv32, trunc_double_~msw~0), 20bv32), 1023bv32); {229#(and (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) ULTIMATE.start_trunc_double_~x) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2020-07-28 17:42:45,795 INFO L280 TraceCheckUtils]: 5: Hoare triple {229#(and (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) ULTIMATE.start_trunc_double_~x) (= currentRoundingMode roundNearestTiesToEven))} assume !~bvslt32(trunc_double_~exponent_less_1023~0, 20bv32); {229#(and (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) ULTIMATE.start_trunc_double_~x) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2020-07-28 17:42:45,796 INFO L280 TraceCheckUtils]: 6: Hoare triple {229#(and (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) ULTIMATE.start_trunc_double_~x) (= currentRoundingMode roundNearestTiesToEven))} assume ~bvsgt32(trunc_double_~exponent_less_1023~0, 51bv32); {229#(and (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) ULTIMATE.start_trunc_double_~x) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2020-07-28 17:42:45,797 INFO L280 TraceCheckUtils]: 7: Hoare triple {229#(and (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) ULTIMATE.start_trunc_double_~x) (= currentRoundingMode roundNearestTiesToEven))} assume 1024bv32 == trunc_double_~exponent_less_1023~0;trunc_double_#res := ~fp.add~DOUBLE(currentRoundingMode, trunc_double_~x, trunc_double_~x); {248#(= |ULTIMATE.start_trunc_double_#res| (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)) (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53))))} is VALID [2020-07-28 17:42:45,798 INFO L280 TraceCheckUtils]: 8: Hoare triple {248#(= |ULTIMATE.start_trunc_double_#res| (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)) (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53))))} main_#t~ret10 := trunc_double_#res;main_~res~0 := main_#t~ret10;havoc main_#t~ret10;isnan_double_#in~x := main_~res~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); {252#(= (_ bv1 32) |ULTIMATE.start_isnan_double_#res|)} is VALID [2020-07-28 17:42:45,799 INFO L280 TraceCheckUtils]: 9: Hoare triple {252#(= (_ bv1 32) |ULTIMATE.start_isnan_double_#res|)} main_#t~ret11 := isnan_double_#res; {256#(= (_ bv1 32) |ULTIMATE.start_main_#t~ret11|)} is VALID [2020-07-28 17:42:45,801 INFO L280 TraceCheckUtils]: 10: Hoare triple {256#(= (_ bv1 32) |ULTIMATE.start_main_#t~ret11|)} assume 0bv32 == main_#t~ret11;havoc main_#t~ret11; {221#false} is VALID [2020-07-28 17:42:45,801 INFO L280 TraceCheckUtils]: 11: Hoare triple {221#false} assume !false; {221#false} is VALID [2020-07-28 17:42:45,807 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:42:45,807 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 17:42:46,732 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2020-07-28 17:42:46,930 INFO L280 TraceCheckUtils]: 11: Hoare triple {221#false} assume !false; {221#false} is VALID [2020-07-28 17:42:46,932 INFO L280 TraceCheckUtils]: 10: Hoare triple {266#(not (= (_ bv0 32) |ULTIMATE.start_main_#t~ret11|))} assume 0bv32 == main_#t~ret11;havoc main_#t~ret11; {221#false} is VALID [2020-07-28 17:42:46,933 INFO L280 TraceCheckUtils]: 9: Hoare triple {270#(not (= (_ bv0 32) |ULTIMATE.start_isnan_double_#res|))} main_#t~ret11 := isnan_double_#res; {266#(not (= (_ bv0 32) |ULTIMATE.start_main_#t~ret11|))} is VALID [2020-07-28 17:42:46,939 INFO L280 TraceCheckUtils]: 8: Hoare triple {248#(= |ULTIMATE.start_trunc_double_#res| (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)) (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53))))} main_#t~ret10 := trunc_double_#res;main_~res~0 := main_#t~ret10;havoc main_#t~ret10;isnan_double_#in~x := main_~res~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); {270#(not (= (_ bv0 32) |ULTIMATE.start_isnan_double_#res|))} is VALID [2020-07-28 17:42:46,940 INFO L280 TraceCheckUtils]: 7: Hoare triple {277#(= (fp.add currentRoundingMode ULTIMATE.start_trunc_double_~x ULTIMATE.start_trunc_double_~x) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)) (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53))))} assume 1024bv32 == trunc_double_~exponent_less_1023~0;trunc_double_#res := ~fp.add~DOUBLE(currentRoundingMode, trunc_double_~x, trunc_double_~x); {248#(= |ULTIMATE.start_trunc_double_#res| (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)) (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53))))} is VALID [2020-07-28 17:42:46,941 INFO L280 TraceCheckUtils]: 6: Hoare triple {277#(= (fp.add currentRoundingMode ULTIMATE.start_trunc_double_~x ULTIMATE.start_trunc_double_~x) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)) (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53))))} assume ~bvsgt32(trunc_double_~exponent_less_1023~0, 51bv32); {277#(= (fp.add currentRoundingMode ULTIMATE.start_trunc_double_~x ULTIMATE.start_trunc_double_~x) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)) (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53))))} is VALID [2020-07-28 17:42:46,942 INFO L280 TraceCheckUtils]: 5: Hoare triple {277#(= (fp.add currentRoundingMode ULTIMATE.start_trunc_double_~x ULTIMATE.start_trunc_double_~x) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)) (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53))))} assume !~bvslt32(trunc_double_~exponent_less_1023~0, 20bv32); {277#(= (fp.add currentRoundingMode ULTIMATE.start_trunc_double_~x ULTIMATE.start_trunc_double_~x) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)) (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53))))} is VALID [2020-07-28 17:42:46,943 INFO L280 TraceCheckUtils]: 4: Hoare triple {277#(= (fp.add currentRoundingMode ULTIMATE.start_trunc_double_~x ULTIMATE.start_trunc_double_~x) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)) (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53))))} trunc_double_~signbit~0 := ~bvand32(2147483648bv32, trunc_double_~msw~0);trunc_double_~exponent_less_1023~0 := ~bvsub32(~bvashr32(~bvand32(2146435072bv32, trunc_double_~msw~0), 20bv32), 1023bv32); {277#(= (fp.add currentRoundingMode ULTIMATE.start_trunc_double_~x ULTIMATE.start_trunc_double_~x) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)) (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53))))} is VALID [2020-07-28 17:42:46,944 INFO L280 TraceCheckUtils]: 3: Hoare triple {277#(= (fp.add currentRoundingMode ULTIMATE.start_trunc_double_~x ULTIMATE.start_trunc_double_~x) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)) (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53))))} goto; {277#(= (fp.add currentRoundingMode ULTIMATE.start_trunc_double_~x ULTIMATE.start_trunc_double_~x) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)) (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53))))} is VALID [2020-07-28 17:42:46,944 INFO L280 TraceCheckUtils]: 2: Hoare triple {277#(= (fp.add currentRoundingMode ULTIMATE.start_trunc_double_~x ULTIMATE.start_trunc_double_~x) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)) (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53))))} call trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(trunc_double_~x, trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset, 8bv32);call trunc_double_#t~mem0 := read~intINTTYPE4(trunc_double_~#ew_u~0.base, ~bvadd32(4bv32, trunc_double_~#ew_u~0.offset), 4bv32);trunc_double_~msw~0 := trunc_double_#t~mem0;call write~intFLOATTYPE8(trunc_double_#t~union1, trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset, 8bv32);havoc trunc_double_#t~union1;havoc trunc_double_#t~mem0;call trunc_double_#t~mem2 := read~intINTTYPE4(trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset, 4bv32);trunc_double_~lsw~0 := trunc_double_#t~mem2;call write~intFLOATTYPE8(trunc_double_#t~union3, trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset, 8bv32);havoc trunc_double_#t~mem2;havoc trunc_double_#t~union3;call ULTIMATE.dealloc(trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset);havoc trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset; {277#(= (fp.add currentRoundingMode ULTIMATE.start_trunc_double_~x ULTIMATE.start_trunc_double_~x) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)) (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53))))} is VALID [2020-07-28 17:42:46,976 INFO L280 TraceCheckUtils]: 1: Hoare triple {220#true} havoc main_#res;havoc main_#t~ret10, main_#t~ret11, main_~x~0, main_~res~0;main_~x~0 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());trunc_double_#in~x := main_~x~0;havoc trunc_double_#res;havoc trunc_double_#t~mem0, trunc_double_#t~union1, trunc_double_#t~mem2, trunc_double_#t~union3, trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset, trunc_double_#t~mem4, trunc_double_#t~union5.lsw, trunc_double_#t~union5.msw, trunc_double_~#iw_u~0.base, trunc_double_~#iw_u~0.offset, trunc_double_#t~mem6, trunc_double_#t~union7.lsw, trunc_double_#t~union7.msw, trunc_double_~#iw_u~1.base, trunc_double_~#iw_u~1.offset, trunc_double_#t~mem8, trunc_double_#t~union9.lsw, trunc_double_#t~union9.msw, trunc_double_~#iw_u~2.base, trunc_double_~#iw_u~2.offset, trunc_double_~x, trunc_double_~signbit~0, trunc_double_~msw~0, trunc_double_~lsw~0, trunc_double_~exponent_less_1023~0;trunc_double_~x := trunc_double_#in~x;havoc trunc_double_~signbit~0;havoc trunc_double_~msw~0;havoc trunc_double_~lsw~0;havoc trunc_double_~exponent_less_1023~0; {277#(= (fp.add currentRoundingMode ULTIMATE.start_trunc_double_~x ULTIMATE.start_trunc_double_~x) (fp.add roundNearestTiesToEven (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)) (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53))))} is VALID [2020-07-28 17:42:46,977 INFO L280 TraceCheckUtils]: 0: Hoare triple {220#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {220#true} is VALID [2020-07-28 17:42:46,978 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:42:46,978 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [838038436] [2020-07-28 17:42:46,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:42:46,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2020-07-28 17:42:46,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684099019] [2020-07-28 17:42:46,981 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2020-07-28 17:42:46,981 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:42:46,981 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-28 17:42:47,224 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:42:47,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-28 17:42:47,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 17:42:47,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-28 17:42:47,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-07-28 17:42:47,226 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand 10 states. [2020-07-28 17:42:49,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:42:49,155 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2020-07-28 17:42:49,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-28 17:42:49,155 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2020-07-28 17:42:49,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:42:49,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-28 17:42:49,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2020-07-28 17:42:49,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-28 17:42:49,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2020-07-28 17:42:49,158 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 29 transitions. [2020-07-28 17:42:49,248 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:42:49,250 INFO L225 Difference]: With dead ends: 27 [2020-07-28 17:42:49,250 INFO L226 Difference]: Without dead ends: 20 [2020-07-28 17:42:49,252 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2020-07-28 17:42:49,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-07-28 17:42:49,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-07-28 17:42:49,261 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:42:49,261 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2020-07-28 17:42:49,262 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2020-07-28 17:42:49,262 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2020-07-28 17:42:49,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:42:49,264 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2020-07-28 17:42:49,264 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2020-07-28 17:42:49,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:42:49,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:42:49,265 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2020-07-28 17:42:49,265 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2020-07-28 17:42:49,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:42:49,267 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2020-07-28 17:42:49,267 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2020-07-28 17:42:49,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:42:49,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:42:49,268 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:42:49,268 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:42:49,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-28 17:42:49,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2020-07-28 17:42:49,269 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 12 [2020-07-28 17:42:49,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:42:49,270 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2020-07-28 17:42:49,270 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-28 17:42:49,270 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2020-07-28 17:42:49,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-28 17:42:49,271 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:42:49,271 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:42:49,480 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-07-28 17:42:49,481 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:42:49,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:42:49,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1398618101, now seen corresponding path program 1 times [2020-07-28 17:42:49,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 17:42:49,484 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1210309847] [2020-07-28 17:42:49,484 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:42:49,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:42:49,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-28 17:42:49,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:42:49,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 17:42:49,896 INFO L280 TraceCheckUtils]: 0: Hoare triple {405#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {405#true} is VALID [2020-07-28 17:42:49,900 INFO L280 TraceCheckUtils]: 1: Hoare triple {405#true} havoc main_#res;havoc main_#t~ret10, main_#t~ret11, main_~x~0, main_~res~0;main_~x~0 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());trunc_double_#in~x := main_~x~0;havoc trunc_double_#res;havoc trunc_double_#t~mem0, trunc_double_#t~union1, trunc_double_#t~mem2, trunc_double_#t~union3, trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset, trunc_double_#t~mem4, trunc_double_#t~union5.lsw, trunc_double_#t~union5.msw, trunc_double_~#iw_u~0.base, trunc_double_~#iw_u~0.offset, trunc_double_#t~mem6, trunc_double_#t~union7.lsw, trunc_double_#t~union7.msw, trunc_double_~#iw_u~1.base, trunc_double_~#iw_u~1.offset, trunc_double_#t~mem8, trunc_double_#t~union9.lsw, trunc_double_#t~union9.msw, trunc_double_~#iw_u~2.base, trunc_double_~#iw_u~2.offset, trunc_double_~x, trunc_double_~signbit~0, trunc_double_~msw~0, trunc_double_~lsw~0, trunc_double_~exponent_less_1023~0;trunc_double_~x := trunc_double_#in~x;havoc trunc_double_~signbit~0;havoc trunc_double_~msw~0;havoc trunc_double_~lsw~0;havoc trunc_double_~exponent_less_1023~0; {413#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) ULTIMATE.start_trunc_double_~x))} is VALID [2020-07-28 17:42:49,907 INFO L280 TraceCheckUtils]: 2: Hoare triple {413#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) ULTIMATE.start_trunc_double_~x))} call trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(trunc_double_~x, trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset, 8bv32);call trunc_double_#t~mem0 := read~intINTTYPE4(trunc_double_~#ew_u~0.base, ~bvadd32(4bv32, trunc_double_~#ew_u~0.offset), 4bv32);trunc_double_~msw~0 := trunc_double_#t~mem0;call write~intFLOATTYPE8(trunc_double_#t~union1, trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset, 8bv32);havoc trunc_double_#t~union1;havoc trunc_double_#t~mem0;call trunc_double_#t~mem2 := read~intINTTYPE4(trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset, 4bv32);trunc_double_~lsw~0 := trunc_double_#t~mem2;call write~intFLOATTYPE8(trunc_double_#t~union3, trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset, 8bv32);havoc trunc_double_#t~mem2;havoc trunc_double_#t~union3;call ULTIMATE.dealloc(trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset);havoc trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset; {417#(exists ((|v_skolemized_q#valueAsBitvector_3| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= ULTIMATE.start_trunc_double_~msw~0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_3|)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_3|)) (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)))))} is VALID [2020-07-28 17:42:49,909 INFO L280 TraceCheckUtils]: 3: Hoare triple {417#(exists ((|v_skolemized_q#valueAsBitvector_3| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= ULTIMATE.start_trunc_double_~msw~0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_3|)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_3|)) (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)))))} goto; {417#(exists ((|v_skolemized_q#valueAsBitvector_3| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= ULTIMATE.start_trunc_double_~msw~0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_3|)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_3|)) (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)))))} is VALID [2020-07-28 17:42:49,920 INFO L280 TraceCheckUtils]: 4: Hoare triple {417#(exists ((|v_skolemized_q#valueAsBitvector_3| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= ULTIMATE.start_trunc_double_~msw~0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_3|)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_3|)) (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)))))} trunc_double_~signbit~0 := ~bvand32(2147483648bv32, trunc_double_~msw~0);trunc_double_~exponent_less_1023~0 := ~bvsub32(~bvashr32(~bvand32(2146435072bv32, trunc_double_~msw~0), 20bv32), 1023bv32); {424#(exists ((|v_skolemized_q#valueAsBitvector_3| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (bvadd ULTIMATE.start_trunc_double_~exponent_less_1023~0 (_ bv1023 32)) (bvashr (bvand (_ bv2146435072 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_3|)) (_ bv20 32))) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_3|)) (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)))))} is VALID [2020-07-28 17:42:49,921 INFO L280 TraceCheckUtils]: 5: Hoare triple {424#(exists ((|v_skolemized_q#valueAsBitvector_3| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (bvadd ULTIMATE.start_trunc_double_~exponent_less_1023~0 (_ bv1023 32)) (bvashr (bvand (_ bv2146435072 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_3|)) (_ bv20 32))) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_3|)) (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)))))} assume !~bvslt32(trunc_double_~exponent_less_1023~0, 20bv32); {424#(exists ((|v_skolemized_q#valueAsBitvector_3| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (bvadd ULTIMATE.start_trunc_double_~exponent_less_1023~0 (_ bv1023 32)) (bvashr (bvand (_ bv2146435072 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_3|)) (_ bv20 32))) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_3|)) (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)))))} is VALID [2020-07-28 17:42:49,927 INFO L280 TraceCheckUtils]: 6: Hoare triple {424#(exists ((|v_skolemized_q#valueAsBitvector_3| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (bvadd ULTIMATE.start_trunc_double_~exponent_less_1023~0 (_ bv1023 32)) (bvashr (bvand (_ bv2146435072 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_3|)) (_ bv20 32))) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_3|)) (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)))))} assume !~bvsgt32(trunc_double_~exponent_less_1023~0, 51bv32); {406#false} is VALID [2020-07-28 17:42:49,928 INFO L280 TraceCheckUtils]: 7: Hoare triple {406#false} call trunc_double_~#iw_u~2.base, trunc_double_~#iw_u~2.offset := #Ultimate.allocOnStack(8bv32);call write~intINTTYPE4(trunc_double_~msw~0, trunc_double_~#iw_u~2.base, ~bvadd32(4bv32, trunc_double_~#iw_u~2.offset), 4bv32);call write~intINTTYPE4(~bvand32(trunc_double_~lsw~0, ~bvnot32(~bvlshr32(4294967295bv32, ~bvsub32(trunc_double_~exponent_less_1023~0, 20bv32)))), trunc_double_~#iw_u~2.base, trunc_double_~#iw_u~2.offset, 4bv32);call trunc_double_#t~mem8 := read~intFLOATTYPE8(trunc_double_~#iw_u~2.base, trunc_double_~#iw_u~2.offset, 8bv32);trunc_double_~x := trunc_double_#t~mem8;call write~intINTTYPE4(trunc_double_#t~union9.lsw, trunc_double_~#iw_u~2.base, trunc_double_~#iw_u~2.offset, 4bv32);call write~intINTTYPE4(trunc_double_#t~union9.msw, trunc_double_~#iw_u~2.base, ~bvadd32(4bv32, trunc_double_~#iw_u~2.offset), 4bv32);havoc trunc_double_#t~mem8;havoc trunc_double_#t~union9.lsw, trunc_double_#t~union9.msw;call ULTIMATE.dealloc(trunc_double_~#iw_u~2.base, trunc_double_~#iw_u~2.offset);havoc trunc_double_~#iw_u~2.base, trunc_double_~#iw_u~2.offset; {406#false} is VALID [2020-07-28 17:42:49,928 INFO L280 TraceCheckUtils]: 8: Hoare triple {406#false} goto; {406#false} is VALID [2020-07-28 17:42:49,928 INFO L280 TraceCheckUtils]: 9: Hoare triple {406#false} trunc_double_#res := trunc_double_~x; {406#false} is VALID [2020-07-28 17:42:49,929 INFO L280 TraceCheckUtils]: 10: Hoare triple {406#false} main_#t~ret10 := trunc_double_#res;main_~res~0 := main_#t~ret10;havoc main_#t~ret10;isnan_double_#in~x := main_~res~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); {406#false} is VALID [2020-07-28 17:42:49,929 INFO L280 TraceCheckUtils]: 11: Hoare triple {406#false} main_#t~ret11 := isnan_double_#res; {406#false} is VALID [2020-07-28 17:42:49,929 INFO L280 TraceCheckUtils]: 12: Hoare triple {406#false} assume 0bv32 == main_#t~ret11;havoc main_#t~ret11; {406#false} is VALID [2020-07-28 17:42:49,929 INFO L280 TraceCheckUtils]: 13: Hoare triple {406#false} assume !false; {406#false} is VALID [2020-07-28 17:42:49,931 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:42:49,931 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 17:42:50,185 INFO L280 TraceCheckUtils]: 13: Hoare triple {406#false} assume !false; {406#false} is VALID [2020-07-28 17:42:50,186 INFO L280 TraceCheckUtils]: 12: Hoare triple {406#false} assume 0bv32 == main_#t~ret11;havoc main_#t~ret11; {406#false} is VALID [2020-07-28 17:42:50,186 INFO L280 TraceCheckUtils]: 11: Hoare triple {406#false} main_#t~ret11 := isnan_double_#res; {406#false} is VALID [2020-07-28 17:42:50,187 INFO L280 TraceCheckUtils]: 10: Hoare triple {406#false} main_#t~ret10 := trunc_double_#res;main_~res~0 := main_#t~ret10;havoc main_#t~ret10;isnan_double_#in~x := main_~res~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); {406#false} is VALID [2020-07-28 17:42:50,187 INFO L280 TraceCheckUtils]: 9: Hoare triple {406#false} trunc_double_#res := trunc_double_~x; {406#false} is VALID [2020-07-28 17:42:50,187 INFO L280 TraceCheckUtils]: 8: Hoare triple {406#false} goto; {406#false} is VALID [2020-07-28 17:42:50,188 INFO L280 TraceCheckUtils]: 7: Hoare triple {406#false} call trunc_double_~#iw_u~2.base, trunc_double_~#iw_u~2.offset := #Ultimate.allocOnStack(8bv32);call write~intINTTYPE4(trunc_double_~msw~0, trunc_double_~#iw_u~2.base, ~bvadd32(4bv32, trunc_double_~#iw_u~2.offset), 4bv32);call write~intINTTYPE4(~bvand32(trunc_double_~lsw~0, ~bvnot32(~bvlshr32(4294967295bv32, ~bvsub32(trunc_double_~exponent_less_1023~0, 20bv32)))), trunc_double_~#iw_u~2.base, trunc_double_~#iw_u~2.offset, 4bv32);call trunc_double_#t~mem8 := read~intFLOATTYPE8(trunc_double_~#iw_u~2.base, trunc_double_~#iw_u~2.offset, 8bv32);trunc_double_~x := trunc_double_#t~mem8;call write~intINTTYPE4(trunc_double_#t~union9.lsw, trunc_double_~#iw_u~2.base, trunc_double_~#iw_u~2.offset, 4bv32);call write~intINTTYPE4(trunc_double_#t~union9.msw, trunc_double_~#iw_u~2.base, ~bvadd32(4bv32, trunc_double_~#iw_u~2.offset), 4bv32);havoc trunc_double_#t~mem8;havoc trunc_double_#t~union9.lsw, trunc_double_#t~union9.msw;call ULTIMATE.dealloc(trunc_double_~#iw_u~2.base, trunc_double_~#iw_u~2.offset);havoc trunc_double_~#iw_u~2.base, trunc_double_~#iw_u~2.offset; {406#false} is VALID [2020-07-28 17:42:50,189 INFO L280 TraceCheckUtils]: 6: Hoare triple {473#(bvsgt ULTIMATE.start_trunc_double_~exponent_less_1023~0 (_ bv51 32))} assume !~bvsgt32(trunc_double_~exponent_less_1023~0, 51bv32); {406#false} is VALID [2020-07-28 17:42:50,189 INFO L280 TraceCheckUtils]: 5: Hoare triple {477#(or (bvsgt ULTIMATE.start_trunc_double_~exponent_less_1023~0 (_ bv51 32)) (bvslt ULTIMATE.start_trunc_double_~exponent_less_1023~0 (_ bv20 32)))} assume !~bvslt32(trunc_double_~exponent_less_1023~0, 20bv32); {473#(bvsgt ULTIMATE.start_trunc_double_~exponent_less_1023~0 (_ bv51 32))} is VALID [2020-07-28 17:42:50,190 INFO L280 TraceCheckUtils]: 4: Hoare triple {481#(or (bvslt (bvadd (bvashr (bvand (_ bv2146435072 32) ULTIMATE.start_trunc_double_~msw~0) (_ bv20 32)) (_ bv4294966273 32)) (_ bv20 32)) (bvsgt (bvadd (bvashr (bvand (_ bv2146435072 32) ULTIMATE.start_trunc_double_~msw~0) (_ bv20 32)) (_ bv4294966273 32)) (_ bv51 32)))} trunc_double_~signbit~0 := ~bvand32(2147483648bv32, trunc_double_~msw~0);trunc_double_~exponent_less_1023~0 := ~bvsub32(~bvashr32(~bvand32(2146435072bv32, trunc_double_~msw~0), 20bv32), 1023bv32); {477#(or (bvsgt ULTIMATE.start_trunc_double_~exponent_less_1023~0 (_ bv51 32)) (bvslt ULTIMATE.start_trunc_double_~exponent_less_1023~0 (_ bv20 32)))} is VALID [2020-07-28 17:42:50,191 INFO L280 TraceCheckUtils]: 3: Hoare triple {481#(or (bvslt (bvadd (bvashr (bvand (_ bv2146435072 32) ULTIMATE.start_trunc_double_~msw~0) (_ bv20 32)) (_ bv4294966273 32)) (_ bv20 32)) (bvsgt (bvadd (bvashr (bvand (_ bv2146435072 32) ULTIMATE.start_trunc_double_~msw~0) (_ bv20 32)) (_ bv4294966273 32)) (_ bv51 32)))} goto; {481#(or (bvslt (bvadd (bvashr (bvand (_ bv2146435072 32) ULTIMATE.start_trunc_double_~msw~0) (_ bv20 32)) (_ bv4294966273 32)) (_ bv20 32)) (bvsgt (bvadd (bvashr (bvand (_ bv2146435072 32) ULTIMATE.start_trunc_double_~msw~0) (_ bv20 32)) (_ bv4294966273 32)) (_ bv51 32)))} is VALID [2020-07-28 17:42:50,202 INFO L280 TraceCheckUtils]: 2: Hoare triple {488#(forall ((|v_skolemized_q#valueAsBitvector_3| (_ BitVec 64))) (or (bvsgt (bvadd (bvashr (bvand (_ bv2146435072 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_3|)) (_ bv20 32)) (_ bv4294966273 32)) (_ bv51 32)) (bvslt (bvadd (bvashr (bvand (_ bv2146435072 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_3|)) (_ bv20 32)) (_ bv4294966273 32)) (_ bv20 32)) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_3|)) ULTIMATE.start_trunc_double_~x))))} call trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(trunc_double_~x, trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset, 8bv32);call trunc_double_#t~mem0 := read~intINTTYPE4(trunc_double_~#ew_u~0.base, ~bvadd32(4bv32, trunc_double_~#ew_u~0.offset), 4bv32);trunc_double_~msw~0 := trunc_double_#t~mem0;call write~intFLOATTYPE8(trunc_double_#t~union1, trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset, 8bv32);havoc trunc_double_#t~union1;havoc trunc_double_#t~mem0;call trunc_double_#t~mem2 := read~intINTTYPE4(trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset, 4bv32);trunc_double_~lsw~0 := trunc_double_#t~mem2;call write~intFLOATTYPE8(trunc_double_#t~union3, trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset, 8bv32);havoc trunc_double_#t~mem2;havoc trunc_double_#t~union3;call ULTIMATE.dealloc(trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset);havoc trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset; {481#(or (bvslt (bvadd (bvashr (bvand (_ bv2146435072 32) ULTIMATE.start_trunc_double_~msw~0) (_ bv20 32)) (_ bv4294966273 32)) (_ bv20 32)) (bvsgt (bvadd (bvashr (bvand (_ bv2146435072 32) ULTIMATE.start_trunc_double_~msw~0) (_ bv20 32)) (_ bv4294966273 32)) (_ bv51 32)))} is VALID [2020-07-28 17:42:50,212 INFO L280 TraceCheckUtils]: 1: Hoare triple {405#true} havoc main_#res;havoc main_#t~ret10, main_#t~ret11, main_~x~0, main_~res~0;main_~x~0 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());trunc_double_#in~x := main_~x~0;havoc trunc_double_#res;havoc trunc_double_#t~mem0, trunc_double_#t~union1, trunc_double_#t~mem2, trunc_double_#t~union3, trunc_double_~#ew_u~0.base, trunc_double_~#ew_u~0.offset, trunc_double_#t~mem4, trunc_double_#t~union5.lsw, trunc_double_#t~union5.msw, trunc_double_~#iw_u~0.base, trunc_double_~#iw_u~0.offset, trunc_double_#t~mem6, trunc_double_#t~union7.lsw, trunc_double_#t~union7.msw, trunc_double_~#iw_u~1.base, trunc_double_~#iw_u~1.offset, trunc_double_#t~mem8, trunc_double_#t~union9.lsw, trunc_double_#t~union9.msw, trunc_double_~#iw_u~2.base, trunc_double_~#iw_u~2.offset, trunc_double_~x, trunc_double_~signbit~0, trunc_double_~msw~0, trunc_double_~lsw~0, trunc_double_~exponent_less_1023~0;trunc_double_~x := trunc_double_#in~x;havoc trunc_double_~signbit~0;havoc trunc_double_~msw~0;havoc trunc_double_~lsw~0;havoc trunc_double_~exponent_less_1023~0; {488#(forall ((|v_skolemized_q#valueAsBitvector_3| (_ BitVec 64))) (or (bvsgt (bvadd (bvashr (bvand (_ bv2146435072 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_3|)) (_ bv20 32)) (_ bv4294966273 32)) (_ bv51 32)) (bvslt (bvadd (bvashr (bvand (_ bv2146435072 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_3|)) (_ bv20 32)) (_ bv4294966273 32)) (_ bv20 32)) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_3|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_3|)) ULTIMATE.start_trunc_double_~x))))} is VALID [2020-07-28 17:42:50,213 INFO L280 TraceCheckUtils]: 0: Hoare triple {405#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {405#true} is VALID [2020-07-28 17:42:50,214 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:42:50,214 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1210309847] [2020-07-28 17:42:50,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:42:50,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 6] imperfect sequences [] total 9 [2020-07-28 17:42:50,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700046401] [2020-07-28 17:42:50,215 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2020-07-28 17:42:50,216 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:42:50,216 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-28 17:42:50,295 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:42:50,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-28 17:42:50,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 17:42:50,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-28 17:42:50,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-07-28 17:42:50,297 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 9 states. [2020-07-28 17:42:50,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:42:50,875 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2020-07-28 17:42:50,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-28 17:42:50,875 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2020-07-28 17:42:50,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:42:50,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-28 17:42:50,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2020-07-28 17:42:50,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-28 17:42:50,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2020-07-28 17:42:50,879 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 21 transitions. [2020-07-28 17:42:50,953 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:42:50,953 INFO L225 Difference]: With dead ends: 20 [2020-07-28 17:42:50,953 INFO L226 Difference]: Without dead ends: 0 [2020-07-28 17:42:50,954 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2020-07-28 17:42:50,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-28 17:42:50,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-28 17:42:50,954 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:42:50,954 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-28 17:42:50,955 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 17:42:50,955 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 17:42:50,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:42:50,955 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 17:42:50,955 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 17:42:50,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:42:50,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:42:50,955 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 17:42:50,956 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 17:42:50,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:42:50,956 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 17:42:50,956 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 17:42:50,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:42:50,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:42:50,956 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:42:50,957 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:42:50,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-28 17:42:50,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-28 17:42:50,957 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2020-07-28 17:42:50,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:42:50,957 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-28 17:42:50,957 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-28 17:42:50,957 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 17:42:50,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:42:51,161 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-07-28 17:42:51,165 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-28 17:42:51,332 INFO L268 CegarLoopResult]: For program point L31(lines 31 46) no Hoare annotation was computed. [2020-07-28 17:42:51,332 INFO L268 CegarLoopResult]: For program point L52-1(lines 52 57) no Hoare annotation was computed. [2020-07-28 17:42:51,332 INFO L264 CegarLoopResult]: At program point L52-2(lines 52 57) the Hoare annotation is: false [2020-07-28 17:42:51,333 INFO L268 CegarLoopResult]: For program point L52-3(lines 30 58) no Hoare annotation was computed. [2020-07-28 17:42:51,333 INFO L268 CegarLoopResult]: For program point L48(lines 48 50) no Hoare annotation was computed. [2020-07-28 17:42:51,333 INFO L264 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: (and (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) ULTIMATE.start_trunc_double_~x) (= |ULTIMATE.start_trunc_double_#res| (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) (fp.add roundNearestTiesToEven .cse0 .cse0))) (= currentRoundingMode roundNearestTiesToEven) (= (_ bv1 32) |ULTIMATE.start_isnan_double_#res|)) [2020-07-28 17:42:51,333 INFO L268 CegarLoopResult]: For program point L73(lines 73 76) no Hoare annotation was computed. [2020-07-28 17:42:51,333 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-28 17:42:51,333 INFO L268 CegarLoopResult]: For program point L32-1(lines 32 37) no Hoare annotation was computed. [2020-07-28 17:42:51,333 INFO L264 CegarLoopResult]: At program point L32-2(lines 32 37) the Hoare annotation is: false [2020-07-28 17:42:51,334 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-28 17:42:51,334 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-28 17:42:51,334 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 74) no Hoare annotation was computed. [2020-07-28 17:42:51,334 INFO L271 CegarLoopResult]: At program point L78(lines 62 79) the Hoare annotation is: true [2020-07-28 17:42:51,334 INFO L268 CegarLoopResult]: For program point L74(line 74) no Hoare annotation was computed. [2020-07-28 17:42:51,334 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-28 17:42:51,334 INFO L268 CegarLoopResult]: For program point L30(lines 30 58) no Hoare annotation was computed. [2020-07-28 17:42:51,335 INFO L264 CegarLoopResult]: At program point L59(lines 17 60) the Hoare annotation is: (and (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) ULTIMATE.start_trunc_double_~x) (= |ULTIMATE.start_trunc_double_#res| (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) (fp.add roundNearestTiesToEven .cse0 .cse0))) (= currentRoundingMode roundNearestTiesToEven)) [2020-07-28 17:42:51,335 INFO L268 CegarLoopResult]: For program point L22-1(lines 22 27) no Hoare annotation was computed. [2020-07-28 17:42:51,335 INFO L264 CegarLoopResult]: At program point L22-2(lines 22 27) the Hoare annotation is: (and (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) ULTIMATE.start_trunc_double_~x)) (= currentRoundingMode roundNearestTiesToEven)) [2020-07-28 17:42:51,335 INFO L268 CegarLoopResult]: For program point L22-3(lines 22 27) no Hoare annotation was computed. [2020-07-28 17:42:51,335 INFO L268 CegarLoopResult]: For program point L47(lines 47 58) no Hoare annotation was computed. [2020-07-28 17:42:51,335 INFO L268 CegarLoopResult]: For program point L39-1(lines 39 45) no Hoare annotation was computed. [2020-07-28 17:42:51,335 INFO L264 CegarLoopResult]: At program point L39-2(lines 39 45) the Hoare annotation is: false [2020-07-28 17:42:51,339 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 17:42:51,339 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-28 17:42:51,339 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2020-07-28 17:42:51,340 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2020-07-28 17:42:51,340 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2020-07-28 17:42:51,340 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2020-07-28 17:42:51,340 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2020-07-28 17:42:51,340 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-28 17:42:51,340 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-28 17:42:51,340 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-28 17:42:51,340 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-28 17:42:51,341 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2020-07-28 17:42:51,341 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2020-07-28 17:42:51,341 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2020-07-28 17:42:51,341 WARN L170 areAnnotationChecker]: L52-3 has no Hoare annotation [2020-07-28 17:42:51,341 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2020-07-28 17:42:51,341 WARN L170 areAnnotationChecker]: L52-3 has no Hoare annotation [2020-07-28 17:42:51,341 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2020-07-28 17:42:51,341 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2020-07-28 17:42:51,342 WARN L170 areAnnotationChecker]: L52-1 has no Hoare annotation [2020-07-28 17:42:51,342 WARN L170 areAnnotationChecker]: L52-3 has no Hoare annotation [2020-07-28 17:42:51,342 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2020-07-28 17:42:51,342 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2020-07-28 17:42:51,342 WARN L170 areAnnotationChecker]: L52-3 has no Hoare annotation [2020-07-28 17:42:51,342 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2020-07-28 17:42:51,342 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2020-07-28 17:42:51,347 WARN L170 areAnnotationChecker]: L52-1 has no Hoare annotation [2020-07-28 17:42:51,348 WARN L170 areAnnotationChecker]: L52-1 has no Hoare annotation [2020-07-28 17:42:51,348 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2020-07-28 17:42:51,348 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2020-07-28 17:42:51,348 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2020-07-28 17:42:51,348 WARN L170 areAnnotationChecker]: L74 has no Hoare annotation [2020-07-28 17:42:51,348 WARN L170 areAnnotationChecker]: L74 has no Hoare annotation [2020-07-28 17:42:51,348 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 17:42:51,349 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 17:42:51,349 INFO L163 areAnnotationChecker]: CFG has 1 edges. 1 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-28 17:42:51,353 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-07-28 17:42:51,353 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-07-28 17:42:51,354 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-07-28 17:42:51,354 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-07-28 17:42:51,356 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2020-07-28 17:42:51,356 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2020-07-28 17:42:51,359 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-07-28 17:42:51,359 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-07-28 17:42:51,359 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-07-28 17:42:51,360 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-07-28 17:42:51,360 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2020-07-28 17:42:51,360 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2020-07-28 17:42:51,362 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-07-28 17:42:51,362 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-07-28 17:42:51,362 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-07-28 17:42:51,363 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-07-28 17:42:51,363 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2020-07-28 17:42:51,363 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2020-07-28 17:42:51,364 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-07-28 17:42:51,364 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-07-28 17:42:51,364 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-07-28 17:42:51,365 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-07-28 17:42:51,365 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2020-07-28 17:42:51,365 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2020-07-28 17:42:51,367 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-07-28 17:42:51,367 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-07-28 17:42:51,367 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2020-07-28 17:42:51,368 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-07-28 17:42:51,368 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-07-28 17:42:51,368 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2020-07-28 17:42:51,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 05:42:51 BoogieIcfgContainer [2020-07-28 17:42:51,382 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 17:42:51,383 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 17:42:51,383 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 17:42:51,383 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 17:42:51,384 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:42:44" (3/4) ... [2020-07-28 17:42:51,390 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-07-28 17:42:51,406 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2020-07-28 17:42:51,407 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2020-07-28 17:42:51,407 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-07-28 17:42:51,451 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == x) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven [2020-07-28 17:42:51,452 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (~fp.div~DOUBLE(unknown-currentRoundingMode-unknown, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == x && \result == ~fp.add~DOUBLE(~roundNearestTiesToEven, ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()), ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()))) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven [2020-07-28 17:42:51,454 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((~fp.div~DOUBLE(unknown-currentRoundingMode-unknown, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == x && \result == ~fp.add~DOUBLE(~roundNearestTiesToEven, ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()), ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()))) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && 1bv32 == \result [2020-07-28 17:42:51,496 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 17:42:51,497 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 17:42:51,498 INFO L168 Benchmark]: Toolchain (without parser) took 8395.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 961.6 MB in the beginning and 830.6 MB in the end (delta: 131.0 MB). Peak memory consumption was 270.5 MB. Max. memory is 11.5 GB. [2020-07-28 17:42:51,499 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 17:42:51,500 INFO L168 Benchmark]: CACSL2BoogieTranslator took 463.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 961.6 MB in the beginning and 1.1 GB in the end (delta: -174.0 MB). Peak memory consumption was 22.2 MB. Max. memory is 11.5 GB. [2020-07-28 17:42:51,500 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-07-28 17:42:51,501 INFO L168 Benchmark]: Boogie Preprocessor took 67.51 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: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 11.5 GB. [2020-07-28 17:42:51,501 INFO L168 Benchmark]: RCFGBuilder took 640.22 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: 31.0 MB). Peak memory consumption was 31.0 MB. Max. memory is 11.5 GB. [2020-07-28 17:42:51,502 INFO L168 Benchmark]: TraceAbstraction took 7041.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 837.2 MB in the end (delta: 259.2 MB). Peak memory consumption was 259.2 MB. Max. memory is 11.5 GB. [2020-07-28 17:42:51,502 INFO L168 Benchmark]: Witness Printer took 113.96 ms. Allocated memory is still 1.2 GB. Free memory was 837.2 MB in the beginning and 830.6 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-07-28 17:42:51,505 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 463.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 961.6 MB in the beginning and 1.1 GB in the end (delta: -174.0 MB). Peak memory consumption was 22.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 59.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 67.51 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: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 640.22 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: 31.0 MB). Peak memory consumption was 31.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7041.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 837.2 MB in the end (delta: 259.2 MB). Peak memory consumption was 259.2 MB. Max. memory is 11.5 GB. * Witness Printer took 113.96 ms. Allocated memory is still 1.2 GB. Free memory was 837.2 MB in the beginning and 830.6 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable currentRoundingMode - GenericResult: Unfinished Backtranslation unknown boogie variable currentRoundingMode - GenericResult: Unfinished Backtranslation unknown boogie variable currentRoundingMode - GenericResult: Unfinished Backtranslation unknown boogie variable currentRoundingMode - GenericResult: Unfinished Backtranslation unknown boogie variable currentRoundingMode - GenericResult: Unfinished Backtranslation unknown boogie variable currentRoundingMode - GenericResult: Unfinished Backtranslation unknown boogie variable currentRoundingMode - GenericResult: Unfinished Backtranslation unknown boogie variable currentRoundingMode - GenericResult: Unfinished Backtranslation unknown boogie variable currentRoundingMode - GenericResult: Unfinished Backtranslation unknown boogie variable currentRoundingMode * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 74]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 15]: Loop Invariant [2020-07-28 17:42:51,517 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-07-28 17:42:51,517 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-07-28 17:42:51,518 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-07-28 17:42:51,518 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-07-28 17:42:51,519 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2020-07-28 17:42:51,519 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2020-07-28 17:42:51,519 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-07-28 17:42:51,520 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-07-28 17:42:51,520 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-07-28 17:42:51,520 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-07-28 17:42:51,521 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2020-07-28 17:42:51,521 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode Derived loop invariant: ((~fp.div~DOUBLE(unknown-currentRoundingMode-unknown, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == x && \result == ~fp.add~DOUBLE(~roundNearestTiesToEven, ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()), ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()))) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && 1bv32 == \result - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 17]: Loop Invariant [2020-07-28 17:42:51,522 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-07-28 17:42:51,522 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-07-28 17:42:51,522 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-07-28 17:42:51,523 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-07-28 17:42:51,523 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2020-07-28 17:42:51,523 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2020-07-28 17:42:51,524 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-07-28 17:42:51,524 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-07-28 17:42:51,524 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-07-28 17:42:51,524 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-07-28 17:42:51,525 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2020-07-28 17:42:51,525 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode Derived loop invariant: (~fp.div~DOUBLE(unknown-currentRoundingMode-unknown, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == x && \result == ~fp.add~DOUBLE(~roundNearestTiesToEven, ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()), ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()))) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven - InvariantResult [Line: 52]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 62]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 22]: Loop Invariant [2020-07-28 17:42:51,527 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-07-28 17:42:51,527 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-07-28 17:42:51,527 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode [2020-07-28 17:42:51,528 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-07-28 17:42:51,528 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2020-07-28 17:42:51,528 WARN L1295 BoogieBacktranslator]: unknown boogie variable currentRoundingMode Derived loop invariant: (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == x) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 6.7s, OverallIterations: 3, TraceHistogramMax: 1, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 48 SDtfs, 49 SDslu, 112 SDs, 0 SdLazy, 57 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred 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, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 11 NumberOfFragments, 62 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 6 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 37 NumberOfCodeBlocks, 37 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 68 ConstructedInterpolants, 6 QuantifiedInterpolants, 4765 SizeOfPredicates, 17 NumberOfNonLiveVariables, 105 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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 correct! Received shutdown request...