./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_1072b.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_1072b.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 e202c391e3bb616d6f4a88904e6d2705a4dd90a9 ........................................................................................................................................................................................................................................................................................................................................ 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_1072b.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 e202c391e3bb616d6f4a88904e6d2705a4dd90a9 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:38,162 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 17:42:38,165 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 17:42:38,177 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 17:42:38,178 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 17:42:38,179 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 17:42:38,181 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 17:42:38,183 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 17:42:38,185 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 17:42:38,186 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 17:42:38,187 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 17:42:38,188 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 17:42:38,188 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 17:42:38,189 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 17:42:38,191 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 17:42:38,192 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 17:42:38,193 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 17:42:38,194 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 17:42:38,196 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 17:42:38,198 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 17:42:38,200 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 17:42:38,201 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 17:42:38,205 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 17:42:38,206 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 17:42:38,212 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 17:42:38,213 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 17:42:38,213 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 17:42:38,217 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 17:42:38,217 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 17:42:38,218 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 17:42:38,219 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 17:42:38,220 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 17:42:38,221 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 17:42:38,223 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 17:42:38,224 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 17:42:38,224 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 17:42:38,229 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 17:42:38,230 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 17:42:38,230 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 17:42:38,231 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 17:42:38,232 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 17:42:38,233 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:38,262 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 17:42:38,262 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 17:42:38,264 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 17:42:38,264 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 17:42:38,264 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 17:42:38,265 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 17:42:38,265 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 17:42:38,265 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 17:42:38,265 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 17:42:38,265 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 17:42:38,266 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 17:42:38,267 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 17:42:38,267 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 17:42:38,267 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 17:42:38,268 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 17:42:38,268 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 17:42:38,268 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 17:42:38,268 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 17:42:38,268 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 17:42:38,269 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 17:42:38,269 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 17:42:38,269 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 17:42:38,270 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 17:42:38,270 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 17:42:38,270 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 17:42:38,270 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 17:42:38,270 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 17:42:38,271 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 17:42:38,271 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 17:42:38,271 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 -> e202c391e3bb616d6f4a88904e6d2705a4dd90a9 [2020-07-28 17:42:38,588 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 17:42:38,606 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 17:42:38,610 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 17:42:38,612 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 17:42:38,612 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 17:42:38,613 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1072b.c [2020-07-28 17:42:38,711 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2add5f6f/8f3a940cb497488c90f9aca49132a85e/FLAG8724b36ad [2020-07-28 17:42:39,242 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 17:42:39,244 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1072b.c [2020-07-28 17:42:39,256 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2add5f6f/8f3a940cb497488c90f9aca49132a85e/FLAG8724b36ad [2020-07-28 17:42:39,574 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2add5f6f/8f3a940cb497488c90f9aca49132a85e [2020-07-28 17:42:39,578 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 17:42:39,581 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 17:42:39,582 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 17:42:39,582 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 17:42:39,586 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 17:42:39,588 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:42:39" (1/1) ... [2020-07-28 17:42:39,591 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e5a678 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:39, skipping insertion in model container [2020-07-28 17:42:39,591 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:42:39" (1/1) ... [2020-07-28 17:42:39,599 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 17:42:39,621 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 17:42:39,823 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:42:39,828 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 17:42:39,866 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:42:39,956 INFO L208 MainTranslator]: Completed translation [2020-07-28 17:42:39,956 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:39 WrapperNode [2020-07-28 17:42:39,956 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 17:42:39,957 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 17:42:39,957 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 17:42:39,957 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 17:42:39,964 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:39" (1/1) ... [2020-07-28 17:42:39,975 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:39" (1/1) ... [2020-07-28 17:42:40,015 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 17:42:40,016 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 17:42:40,016 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 17:42:40,016 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 17:42:40,027 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:39" (1/1) ... [2020-07-28 17:42:40,027 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:39" (1/1) ... [2020-07-28 17:42:40,030 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:39" (1/1) ... [2020-07-28 17:42:40,031 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:39" (1/1) ... [2020-07-28 17:42:40,047 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:39" (1/1) ... [2020-07-28 17:42:40,053 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:39" (1/1) ... [2020-07-28 17:42:40,055 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:39" (1/1) ... [2020-07-28 17:42:40,061 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 17:42:40,062 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 17:42:40,065 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 17:42:40,065 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 17:42:40,067 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:39" (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:40,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-28 17:42:40,165 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-07-28 17:42:40,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-28 17:42:40,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-07-28 17:42:40,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 17:42:40,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 17:42:40,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-28 17:42:40,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-28 17:42:40,723 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 17:42:40,724 INFO L295 CfgBuilder]: Removed 18 assume(true) statements. [2020-07-28 17:42:40,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:42:40 BoogieIcfgContainer [2020-07-28 17:42:40,729 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 17:42:40,731 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 17:42:40,732 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 17:42:40,735 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 17:42:40,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 05:42:39" (1/3) ... [2020-07-28 17:42:40,737 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67b6af77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:42:40, skipping insertion in model container [2020-07-28 17:42:40,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:39" (2/3) ... [2020-07-28 17:42:40,737 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67b6af77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:42:40, skipping insertion in model container [2020-07-28 17:42:40,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:42:40" (3/3) ... [2020-07-28 17:42:40,739 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1072b.c [2020-07-28 17:42:40,748 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 17:42:40,755 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 17:42:40,768 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 17:42:40,789 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 17:42:40,789 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 17:42:40,789 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 17:42:40,790 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 17:42:40,790 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 17:42:40,790 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 17:42:40,790 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 17:42:40,790 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 17:42:40,806 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2020-07-28 17:42:40,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-28 17:42:40,812 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:42:40,813 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:42:40,814 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:42:40,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:42:40,820 INFO L82 PathProgramCache]: Analyzing trace with hash 166150340, now seen corresponding path program 1 times [2020-07-28 17:42:40,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:42:40,828 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129055273] [2020-07-28 17:42:40,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:42:40,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:42:40,963 INFO L280 TraceCheckUtils]: 0: Hoare triple {31#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {31#true} is VALID [2020-07-28 17:42:40,963 INFO L280 TraceCheckUtils]: 1: Hoare triple {31#true} havoc main_#res;havoc main_#t~ret12, main_#t~ret13, main_#t~short14, main_~x~0, main_~res~0;main_~x~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; {31#true} is VALID [2020-07-28 17:42:40,965 INFO L280 TraceCheckUtils]: 2: Hoare triple {31#true} assume !true; {32#false} is VALID [2020-07-28 17:42:40,965 INFO L280 TraceCheckUtils]: 3: Hoare triple {32#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; {32#false} is VALID [2020-07-28 17:42:40,966 INFO L280 TraceCheckUtils]: 4: Hoare triple {32#false} assume !(trunc_double_~exponent_less_1023~0 < 20); {32#false} is VALID [2020-07-28 17:42:40,967 INFO L280 TraceCheckUtils]: 5: Hoare triple {32#false} assume trunc_double_~exponent_less_1023~0 > 51; {32#false} is VALID [2020-07-28 17:42:40,967 INFO L280 TraceCheckUtils]: 6: Hoare triple {32#false} assume 1024 == trunc_double_~exponent_less_1023~0;trunc_double_#res := ~someBinaryArithmeticDOUBLEoperation(trunc_double_~x, trunc_double_~x); {32#false} is VALID [2020-07-28 17:42:40,967 INFO L280 TraceCheckUtils]: 7: Hoare triple {32#false} main_#t~ret12 := trunc_double_#res;main_~res~0 := main_#t~ret12;havoc main_#t~ret12;main_#t~short14 := ~someBinaryDOUBLEComparisonOperation(main_~res~0, 0.0); {32#false} is VALID [2020-07-28 17:42:40,968 INFO L280 TraceCheckUtils]: 8: Hoare triple {32#false} assume !main_#t~short14; {32#false} is VALID [2020-07-28 17:42:40,968 INFO L280 TraceCheckUtils]: 9: Hoare triple {32#false} assume !main_#t~short14;havoc main_#t~ret13;havoc main_#t~short14; {32#false} is VALID [2020-07-28 17:42:40,968 INFO L280 TraceCheckUtils]: 10: Hoare triple {32#false} assume !false; {32#false} is VALID [2020-07-28 17:42:40,971 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:40,971 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129055273] [2020-07-28 17:42:40,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:42:40,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-28 17:42:40,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41267816] [2020-07-28 17:42:40,980 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2020-07-28 17:42:40,981 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:42:40,984 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 17:42:41,047 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:41,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 17:42:41,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:42:41,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 17:42:41,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 17:42:41,061 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2020-07-28 17:42:41,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:42:41,152 INFO L93 Difference]: Finished difference Result 54 states and 84 transitions. [2020-07-28 17:42:41,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 17:42:41,152 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2020-07-28 17:42:41,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:42:41,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:42:41,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 84 transitions. [2020-07-28 17:42:41,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:42:41,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 84 transitions. [2020-07-28 17:42:41,167 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 84 transitions. [2020-07-28 17:42:41,307 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:42:41,320 INFO L225 Difference]: With dead ends: 54 [2020-07-28 17:42:41,321 INFO L226 Difference]: Without dead ends: 25 [2020-07-28 17:42:41,324 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:41,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-28 17:42:41,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-07-28 17:42:41,359 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:42:41,359 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2020-07-28 17:42:41,360 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2020-07-28 17:42:41,361 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2020-07-28 17:42:41,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:42:41,364 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2020-07-28 17:42:41,365 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2020-07-28 17:42:41,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:42:41,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:42:41,366 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2020-07-28 17:42:41,366 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2020-07-28 17:42:41,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:42:41,369 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2020-07-28 17:42:41,370 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2020-07-28 17:42:41,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:42:41,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:42:41,371 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:42:41,371 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:42:41,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-28 17:42:41,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2020-07-28 17:42:41,376 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 11 [2020-07-28 17:42:41,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:42:41,377 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2020-07-28 17:42:41,377 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 17:42:41,377 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2020-07-28 17:42:41,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-28 17:42:41,378 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:42:41,378 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:42:41,379 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 17:42:41,379 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:42:41,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:42:41,379 INFO L82 PathProgramCache]: Analyzing trace with hash 786071265, now seen corresponding path program 1 times [2020-07-28 17:42:41,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:42:41,380 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420643590] [2020-07-28 17:42:41,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:42:41,457 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-28 17:42:41,458 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.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:41,464 INFO L168 Benchmark]: Toolchain (without parser) took 1883.76 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 960.2 MB in the beginning and 1.0 GB in the end (delta: -55.5 MB). Peak memory consumption was 63.5 MB. Max. memory is 11.5 GB. [2020-07-28 17:42:41,465 INFO L168 Benchmark]: CDTParser took 0.89 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:41,466 INFO L168 Benchmark]: CACSL2BoogieTranslator took 374.84 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 960.2 MB in the beginning and 1.1 GB in the end (delta: -155.0 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2020-07-28 17:42:41,466 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.35 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2020-07-28 17:42:41,467 INFO L168 Benchmark]: Boogie Preprocessor took 45.83 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 17:42:41,468 INFO L168 Benchmark]: RCFGBuilder took 667.86 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.8 MB). Peak memory consumption was 45.8 MB. Max. memory is 11.5 GB. [2020-07-28 17:42:41,469 INFO L168 Benchmark]: TraceAbstraction took 729.79 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 11.5 GB. [2020-07-28 17:42:41,473 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.89 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 374.84 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.0 MB). Free memory was 960.2 MB in the beginning and 1.1 GB in the end (delta: -155.0 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 58.35 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.83 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 667.86 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 45.8 MB). Peak memory consumption was 45.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 729.79 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 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:43,535 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 17:42:43,538 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 17:42:43,557 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 17:42:43,557 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 17:42:43,560 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 17:42:43,562 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 17:42:43,575 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 17:42:43,577 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 17:42:43,579 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 17:42:43,580 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 17:42:43,583 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 17:42:43,583 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 17:42:43,587 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 17:42:43,588 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 17:42:43,591 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 17:42:43,592 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 17:42:43,593 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 17:42:43,594 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 17:42:43,596 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 17:42:43,598 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 17:42:43,599 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 17:42:43,600 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 17:42:43,601 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 17:42:43,603 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 17:42:43,604 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 17:42:43,604 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 17:42:43,605 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 17:42:43,605 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 17:42:43,606 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 17:42:43,607 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 17:42:43,607 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 17:42:43,608 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 17:42:43,609 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 17:42:43,610 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 17:42:43,610 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 17:42:43,611 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 17:42:43,611 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 17:42:43,611 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 17:42:43,612 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 17:42:43,613 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 17:42:43,614 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:43,629 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 17:42:43,629 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 17:42:43,631 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 17:42:43,631 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 17:42:43,631 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 17:42:43,631 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 17:42:43,632 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 17:42:43,632 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 17:42:43,632 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 17:42:43,632 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 17:42:43,632 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 17:42:43,633 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 17:42:43,633 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-07-28 17:42:43,633 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-07-28 17:42:43,633 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 17:42:43,634 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 17:42:43,634 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 17:42:43,634 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 17:42:43,634 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 17:42:43,634 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 17:42:43,635 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 17:42:43,635 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 17:42:43,635 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 17:42:43,635 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 17:42:43,636 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 17:42:43,636 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 17:42:43,636 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-07-28 17:42:43,636 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-07-28 17:42:43,637 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 17:42:43,637 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 17:42:43,637 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-28 17:42:43,637 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 -> e202c391e3bb616d6f4a88904e6d2705a4dd90a9 [2020-07-28 17:42:43,943 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 17:42:43,958 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 17:42:43,962 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 17:42:43,964 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 17:42:43,964 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 17:42:43,965 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1072b.c [2020-07-28 17:42:44,048 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d9bc763b/c657697149c646639310e2ecb8e1ba2a/FLAG074fdc419 [2020-07-28 17:42:44,559 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 17:42:44,560 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1072b.c [2020-07-28 17:42:44,567 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d9bc763b/c657697149c646639310e2ecb8e1ba2a/FLAG074fdc419 [2020-07-28 17:42:44,928 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d9bc763b/c657697149c646639310e2ecb8e1ba2a [2020-07-28 17:42:44,931 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 17:42:44,935 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 17:42:44,936 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 17:42:44,937 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 17:42:44,940 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 17:42:44,942 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:42:44" (1/1) ... [2020-07-28 17:42:44,945 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66dbad37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:44, skipping insertion in model container [2020-07-28 17:42:44,945 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:42:44" (1/1) ... [2020-07-28 17:42:44,954 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 17:42:44,983 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 17:42:45,283 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:42:45,293 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 17:42:45,467 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:42:45,516 INFO L208 MainTranslator]: Completed translation [2020-07-28 17:42:45,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:45 WrapperNode [2020-07-28 17:42:45,517 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 17:42:45,519 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 17:42:45,519 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 17:42:45,521 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 17:42:45,531 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:45" (1/1) ... [2020-07-28 17:42:45,543 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:45" (1/1) ... [2020-07-28 17:42:45,580 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 17:42:45,581 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 17:42:45,581 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 17:42:45,581 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 17:42:45,592 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:45" (1/1) ... [2020-07-28 17:42:45,592 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:45" (1/1) ... [2020-07-28 17:42:45,597 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:45" (1/1) ... [2020-07-28 17:42:45,597 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:45" (1/1) ... [2020-07-28 17:42:45,613 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:45" (1/1) ... [2020-07-28 17:42:45,620 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:45" (1/1) ... [2020-07-28 17:42:45,622 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:45" (1/1) ... [2020-07-28 17:42:45,626 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 17:42:45,627 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 17:42:45,627 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 17:42:45,627 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 17:42:45,629 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:45" (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:45,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2020-07-28 17:42:45,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2020-07-28 17:42:45,694 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-28 17:42:45,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2020-07-28 17:42:45,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 17:42:45,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 17:42:45,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2020-07-28 17:42:45,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-28 17:42:46,340 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 17:42:46,340 INFO L295 CfgBuilder]: Removed 18 assume(true) statements. [2020-07-28 17:42:46,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:42:46 BoogieIcfgContainer [2020-07-28 17:42:46,344 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 17:42:46,346 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 17:42:46,346 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 17:42:46,349 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 17:42:46,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 05:42:44" (1/3) ... [2020-07-28 17:42:46,351 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fd577b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:42:46, skipping insertion in model container [2020-07-28 17:42:46,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:42:45" (2/3) ... [2020-07-28 17:42:46,352 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fd577b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:42:46, skipping insertion in model container [2020-07-28 17:42:46,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:42:46" (3/3) ... [2020-07-28 17:42:46,354 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1072b.c [2020-07-28 17:42:46,365 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 17:42:46,373 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 17:42:46,388 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 17:42:46,416 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 17:42:46,417 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 17:42:46,417 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 17:42:46,417 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 17:42:46,418 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 17:42:46,418 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 17:42:46,418 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 17:42:46,419 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 17:42:46,434 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2020-07-28 17:42:46,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-28 17:42:46,441 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:42:46,442 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:42:46,443 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:42:46,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:42:46,450 INFO L82 PathProgramCache]: Analyzing trace with hash 166150340, now seen corresponding path program 1 times [2020-07-28 17:42:46,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 17:42:46,465 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [277651546] [2020-07-28 17:42:46,466 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:46,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:42:46,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 1 conjunts are in the unsatisfiable core [2020-07-28 17:42:46,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:42:46,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 17:42:46,632 INFO L280 TraceCheckUtils]: 0: Hoare triple {31#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {31#true} is VALID [2020-07-28 17:42:46,633 INFO L280 TraceCheckUtils]: 1: Hoare triple {31#true} havoc main_#res;havoc main_#t~ret12, main_#t~ret13, main_#t~short14, main_~x~0, main_~res~0;main_~x~0 := ~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; {31#true} is VALID [2020-07-28 17:42:46,634 INFO L280 TraceCheckUtils]: 2: Hoare triple {31#true} assume !true; {32#false} is VALID [2020-07-28 17:42:46,635 INFO L280 TraceCheckUtils]: 3: Hoare triple {32#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); {32#false} is VALID [2020-07-28 17:42:46,635 INFO L280 TraceCheckUtils]: 4: Hoare triple {32#false} assume !~bvslt32(trunc_double_~exponent_less_1023~0, 20bv32); {32#false} is VALID [2020-07-28 17:42:46,635 INFO L280 TraceCheckUtils]: 5: Hoare triple {32#false} assume ~bvsgt32(trunc_double_~exponent_less_1023~0, 51bv32); {32#false} is VALID [2020-07-28 17:42:46,636 INFO L280 TraceCheckUtils]: 6: Hoare triple {32#false} assume 1024bv32 == trunc_double_~exponent_less_1023~0;trunc_double_#res := ~fp.add~DOUBLE(currentRoundingMode, trunc_double_~x, trunc_double_~x); {32#false} is VALID [2020-07-28 17:42:46,636 INFO L280 TraceCheckUtils]: 7: Hoare triple {32#false} main_#t~ret12 := trunc_double_#res;main_~res~0 := main_#t~ret12;havoc main_#t~ret12;main_#t~short14 := ~fp.eq~DOUBLE(main_~res~0, ~Pluszero~DOUBLE()); {32#false} is VALID [2020-07-28 17:42:46,637 INFO L280 TraceCheckUtils]: 8: Hoare triple {32#false} assume !main_#t~short14; {32#false} is VALID [2020-07-28 17:42:46,637 INFO L280 TraceCheckUtils]: 9: Hoare triple {32#false} assume !main_#t~short14;havoc main_#t~short14;havoc main_#t~ret13; {32#false} is VALID [2020-07-28 17:42:46,637 INFO L280 TraceCheckUtils]: 10: Hoare triple {32#false} assume !false; {32#false} is VALID [2020-07-28 17:42:46,641 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,641 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 17:42:46,668 INFO L280 TraceCheckUtils]: 10: Hoare triple {32#false} assume !false; {32#false} is VALID [2020-07-28 17:42:46,669 INFO L280 TraceCheckUtils]: 9: Hoare triple {32#false} assume !main_#t~short14;havoc main_#t~short14;havoc main_#t~ret13; {32#false} is VALID [2020-07-28 17:42:46,669 INFO L280 TraceCheckUtils]: 8: Hoare triple {32#false} assume !main_#t~short14; {32#false} is VALID [2020-07-28 17:42:46,669 INFO L280 TraceCheckUtils]: 7: Hoare triple {32#false} main_#t~ret12 := trunc_double_#res;main_~res~0 := main_#t~ret12;havoc main_#t~ret12;main_#t~short14 := ~fp.eq~DOUBLE(main_~res~0, ~Pluszero~DOUBLE()); {32#false} is VALID [2020-07-28 17:42:46,670 INFO L280 TraceCheckUtils]: 6: Hoare triple {32#false} assume 1024bv32 == trunc_double_~exponent_less_1023~0;trunc_double_#res := ~fp.add~DOUBLE(currentRoundingMode, trunc_double_~x, trunc_double_~x); {32#false} is VALID [2020-07-28 17:42:46,671 INFO L280 TraceCheckUtils]: 5: Hoare triple {32#false} assume ~bvsgt32(trunc_double_~exponent_less_1023~0, 51bv32); {32#false} is VALID [2020-07-28 17:42:46,671 INFO L280 TraceCheckUtils]: 4: Hoare triple {32#false} assume !~bvslt32(trunc_double_~exponent_less_1023~0, 20bv32); {32#false} is VALID [2020-07-28 17:42:46,671 INFO L280 TraceCheckUtils]: 3: Hoare triple {32#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); {32#false} is VALID [2020-07-28 17:42:46,673 INFO L280 TraceCheckUtils]: 2: Hoare triple {31#true} assume !true; {32#false} is VALID [2020-07-28 17:42:46,673 INFO L280 TraceCheckUtils]: 1: Hoare triple {31#true} havoc main_#res;havoc main_#t~ret12, main_#t~ret13, main_#t~short14, main_~x~0, main_~res~0;main_~x~0 := ~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; {31#true} is VALID [2020-07-28 17:42:46,673 INFO L280 TraceCheckUtils]: 0: Hoare triple {31#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {31#true} is VALID [2020-07-28 17:42:46,674 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,676 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [277651546] [2020-07-28 17:42:46,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:42:46,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-07-28 17:42:46,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932063459] [2020-07-28 17:42:46,684 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2020-07-28 17:42:46,686 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:42:46,690 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 17:42:46,745 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:46,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 17:42:46,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 17:42:46,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 17:42:46,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 17:42:46,759 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2020-07-28 17:42:46,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:42:46,944 INFO L93 Difference]: Finished difference Result 54 states and 84 transitions. [2020-07-28 17:42:46,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 17:42:46,944 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2020-07-28 17:42:46,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:42:46,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:42:46,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 84 transitions. [2020-07-28 17:42:46,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:42:46,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 84 transitions. [2020-07-28 17:42:46,958 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 84 transitions. [2020-07-28 17:42:47,194 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:42:47,205 INFO L225 Difference]: With dead ends: 54 [2020-07-28 17:42:47,206 INFO L226 Difference]: Without dead ends: 25 [2020-07-28 17:42:47,210 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:47,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-28 17:42:47,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-07-28 17:42:47,253 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:42:47,254 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2020-07-28 17:42:47,255 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2020-07-28 17:42:47,255 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2020-07-28 17:42:47,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:42:47,260 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2020-07-28 17:42:47,260 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2020-07-28 17:42:47,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:42:47,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:42:47,261 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2020-07-28 17:42:47,262 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2020-07-28 17:42:47,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:42:47,265 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2020-07-28 17:42:47,266 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2020-07-28 17:42:47,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:42:47,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:42:47,267 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:42:47,267 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:42:47,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-28 17:42:47,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2020-07-28 17:42:47,272 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 11 [2020-07-28 17:42:47,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:42:47,273 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2020-07-28 17:42:47,273 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 17:42:47,273 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2020-07-28 17:42:47,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-28 17:42:47,274 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:42:47,274 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:42:47,488 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-07-28 17:42:47,491 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:42:47,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:42:47,492 INFO L82 PathProgramCache]: Analyzing trace with hash 786071265, now seen corresponding path program 1 times [2020-07-28 17:42:47,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 17:42:47,495 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [299643033] [2020-07-28 17:42:47,495 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:47,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:42:47,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-28 17:42:47,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:42:47,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 17:42:47,801 INFO L280 TraceCheckUtils]: 0: Hoare triple {247#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {247#true} is VALID [2020-07-28 17:42:47,803 INFO L280 TraceCheckUtils]: 1: Hoare triple {247#true} havoc main_#res;havoc main_#t~ret12, main_#t~ret13, main_#t~short14, main_~x~0, main_~res~0;main_~x~0 := ~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; {255#(= (_ +zero 11 53) ULTIMATE.start_trunc_double_~x)} is VALID [2020-07-28 17:42:47,807 INFO L280 TraceCheckUtils]: 2: Hoare triple {255#(= (_ +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~union3;havoc trunc_double_#t~mem2;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; {259#(exists ((|v_skolemized_q#valueAsBitvector_5| (_ BitVec 64))) (and (= ULTIMATE.start_trunc_double_~msw~0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_5|)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_5|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_5|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_5|)) (_ +zero 11 53))))} is VALID [2020-07-28 17:42:47,809 INFO L280 TraceCheckUtils]: 3: Hoare triple {259#(exists ((|v_skolemized_q#valueAsBitvector_5| (_ BitVec 64))) (and (= ULTIMATE.start_trunc_double_~msw~0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_5|)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_5|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_5|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_5|)) (_ +zero 11 53))))} goto; {259#(exists ((|v_skolemized_q#valueAsBitvector_5| (_ BitVec 64))) (and (= ULTIMATE.start_trunc_double_~msw~0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_5|)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_5|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_5|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_5|)) (_ +zero 11 53))))} is VALID [2020-07-28 17:42:47,812 INFO L280 TraceCheckUtils]: 4: Hoare triple {259#(exists ((|v_skolemized_q#valueAsBitvector_5| (_ BitVec 64))) (and (= ULTIMATE.start_trunc_double_~msw~0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_5|)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_5|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_5|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_5|)) (_ +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); {266#(exists ((|v_skolemized_q#valueAsBitvector_5| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_5|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_5|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_5|)) (_ +zero 11 53)) (= (bvadd (bvashr (bvand (_ bv2146435072 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_5|)) (_ bv20 32)) (_ bv4294966273 32)) ULTIMATE.start_trunc_double_~exponent_less_1023~0)))} is VALID [2020-07-28 17:42:47,815 INFO L280 TraceCheckUtils]: 5: Hoare triple {266#(exists ((|v_skolemized_q#valueAsBitvector_5| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_5|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_5|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_5|)) (_ +zero 11 53)) (= (bvadd (bvashr (bvand (_ bv2146435072 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_5|)) (_ bv20 32)) (_ bv4294966273 32)) ULTIMATE.start_trunc_double_~exponent_less_1023~0)))} assume !~bvslt32(trunc_double_~exponent_less_1023~0, 20bv32); {248#false} is VALID [2020-07-28 17:42:47,816 INFO L280 TraceCheckUtils]: 6: Hoare triple {248#false} assume ~bvsgt32(trunc_double_~exponent_less_1023~0, 51bv32); {248#false} is VALID [2020-07-28 17:42:47,816 INFO L280 TraceCheckUtils]: 7: Hoare triple {248#false} assume 1024bv32 == trunc_double_~exponent_less_1023~0;trunc_double_#res := ~fp.add~DOUBLE(currentRoundingMode, trunc_double_~x, trunc_double_~x); {248#false} is VALID [2020-07-28 17:42:47,817 INFO L280 TraceCheckUtils]: 8: Hoare triple {248#false} main_#t~ret12 := trunc_double_#res;main_~res~0 := main_#t~ret12;havoc main_#t~ret12;main_#t~short14 := ~fp.eq~DOUBLE(main_~res~0, ~Pluszero~DOUBLE()); {248#false} is VALID [2020-07-28 17:42:47,817 INFO L280 TraceCheckUtils]: 9: Hoare triple {248#false} assume !main_#t~short14; {248#false} is VALID [2020-07-28 17:42:47,818 INFO L280 TraceCheckUtils]: 10: Hoare triple {248#false} assume !main_#t~short14;havoc main_#t~short14;havoc main_#t~ret13; {248#false} is VALID [2020-07-28 17:42:47,818 INFO L280 TraceCheckUtils]: 11: Hoare triple {248#false} assume !false; {248#false} is VALID [2020-07-28 17:42:47,820 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:47,821 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 17:42:47,975 INFO L280 TraceCheckUtils]: 11: Hoare triple {248#false} assume !false; {248#false} is VALID [2020-07-28 17:42:47,975 INFO L280 TraceCheckUtils]: 10: Hoare triple {248#false} assume !main_#t~short14;havoc main_#t~short14;havoc main_#t~ret13; {248#false} is VALID [2020-07-28 17:42:47,976 INFO L280 TraceCheckUtils]: 9: Hoare triple {248#false} assume !main_#t~short14; {248#false} is VALID [2020-07-28 17:42:47,976 INFO L280 TraceCheckUtils]: 8: Hoare triple {248#false} main_#t~ret12 := trunc_double_#res;main_~res~0 := main_#t~ret12;havoc main_#t~ret12;main_#t~short14 := ~fp.eq~DOUBLE(main_~res~0, ~Pluszero~DOUBLE()); {248#false} is VALID [2020-07-28 17:42:47,977 INFO L280 TraceCheckUtils]: 7: Hoare triple {248#false} assume 1024bv32 == trunc_double_~exponent_less_1023~0;trunc_double_#res := ~fp.add~DOUBLE(currentRoundingMode, trunc_double_~x, trunc_double_~x); {248#false} is VALID [2020-07-28 17:42:47,977 INFO L280 TraceCheckUtils]: 6: Hoare triple {248#false} assume ~bvsgt32(trunc_double_~exponent_less_1023~0, 51bv32); {248#false} is VALID [2020-07-28 17:42:47,978 INFO L280 TraceCheckUtils]: 5: Hoare triple {306#(bvslt ULTIMATE.start_trunc_double_~exponent_less_1023~0 (_ bv20 32))} assume !~bvslt32(trunc_double_~exponent_less_1023~0, 20bv32); {248#false} is VALID [2020-07-28 17:42:47,980 INFO L280 TraceCheckUtils]: 4: Hoare triple {310#(bvslt (bvadd (bvashr (bvand (_ bv2146435072 32) ULTIMATE.start_trunc_double_~msw~0) (_ bv20 32)) (_ bv4294966273 32)) (_ bv20 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); {306#(bvslt ULTIMATE.start_trunc_double_~exponent_less_1023~0 (_ bv20 32))} is VALID [2020-07-28 17:42:47,981 INFO L280 TraceCheckUtils]: 3: Hoare triple {310#(bvslt (bvadd (bvashr (bvand (_ bv2146435072 32) ULTIMATE.start_trunc_double_~msw~0) (_ bv20 32)) (_ bv4294966273 32)) (_ bv20 32))} goto; {310#(bvslt (bvadd (bvashr (bvand (_ bv2146435072 32) ULTIMATE.start_trunc_double_~msw~0) (_ bv20 32)) (_ bv4294966273 32)) (_ bv20 32))} is VALID [2020-07-28 17:42:47,991 INFO L280 TraceCheckUtils]: 2: Hoare triple {317#(forall ((|v_skolemized_q#valueAsBitvector_5| (_ BitVec 64))) (or (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_5|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_5|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_5|)) ULTIMATE.start_trunc_double_~x)) (bvslt (bvadd (bvashr (bvand (_ bv2146435072 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_5|)) (_ bv20 32)) (_ bv4294966273 32)) (_ bv20 32))))} 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~union3;havoc trunc_double_#t~mem2;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; {310#(bvslt (bvadd (bvashr (bvand (_ bv2146435072 32) ULTIMATE.start_trunc_double_~msw~0) (_ bv20 32)) (_ bv4294966273 32)) (_ bv20 32))} is VALID [2020-07-28 17:42:47,994 INFO L280 TraceCheckUtils]: 1: Hoare triple {247#true} havoc main_#res;havoc main_#t~ret12, main_#t~ret13, main_#t~short14, main_~x~0, main_~res~0;main_~x~0 := ~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; {317#(forall ((|v_skolemized_q#valueAsBitvector_5| (_ BitVec 64))) (or (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_5|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_5|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_5|)) ULTIMATE.start_trunc_double_~x)) (bvslt (bvadd (bvashr (bvand (_ bv2146435072 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_5|)) (_ bv20 32)) (_ bv4294966273 32)) (_ bv20 32))))} is VALID [2020-07-28 17:42:47,995 INFO L280 TraceCheckUtils]: 0: Hoare triple {247#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {247#true} is VALID [2020-07-28 17:42:47,996 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:47,997 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [299643033] [2020-07-28 17:42:47,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:42:47,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2020-07-28 17:42:47,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467404787] [2020-07-28 17:42:47,999 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2020-07-28 17:42:48,000 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:42:48,000 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-28 17:42:48,067 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:42:48,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-28 17:42:48,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 17:42:48,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-28 17:42:48,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-07-28 17:42:48,069 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 8 states. [2020-07-28 17:42:48,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:42:48,534 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2020-07-28 17:42:48,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-28 17:42:48,535 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2020-07-28 17:42:48,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:42:48,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-28 17:42:48,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2020-07-28 17:42:48,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-28 17:42:48,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2020-07-28 17:42:48,540 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 39 transitions. [2020-07-28 17:42:48,689 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:42:48,690 INFO L225 Difference]: With dead ends: 35 [2020-07-28 17:42:48,690 INFO L226 Difference]: Without dead ends: 19 [2020-07-28 17:42:48,692 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-07-28 17:42:48,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-07-28 17:42:48,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-07-28 17:42:48,721 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:42:48,721 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2020-07-28 17:42:48,721 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2020-07-28 17:42:48,721 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2020-07-28 17:42:48,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:42:48,723 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2020-07-28 17:42:48,724 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2020-07-28 17:42:48,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:42:48,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:42:48,725 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2020-07-28 17:42:48,725 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2020-07-28 17:42:48,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:42:48,727 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2020-07-28 17:42:48,727 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2020-07-28 17:42:48,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:42:48,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:42:48,728 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:42:48,729 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:42:48,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-28 17:42:48,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2020-07-28 17:42:48,731 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 12 [2020-07-28 17:42:48,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:42:48,731 INFO L479 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2020-07-28 17:42:48,732 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-28 17:42:48,732 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2020-07-28 17:42:48,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-28 17:42:48,733 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:42:48,733 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:42:48,950 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-07-28 17:42:48,951 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:42:48,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:42:48,951 INFO L82 PathProgramCache]: Analyzing trace with hash -660443026, now seen corresponding path program 1 times [2020-07-28 17:42:48,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 17:42:48,953 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [434710014] [2020-07-28 17:42:48,954 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,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:42:49,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-28 17:42:49,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:42:49,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 17:42:49,130 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2020-07-28 17:42:49,137 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-28 17:42:49,144 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 17:42:49,145 INFO L544 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-28 17:42:49,166 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 17:42:49,167 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-28 17:42:49,167 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:51, output treesize:21 [2020-07-28 17:42:49,238 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-28 17:42:49,263 INFO L280 TraceCheckUtils]: 0: Hoare triple {436#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {436#true} is VALID [2020-07-28 17:42:49,264 INFO L280 TraceCheckUtils]: 1: Hoare triple {436#true} havoc main_#res;havoc main_#t~ret12, main_#t~ret13, main_#t~short14, main_~x~0, main_~res~0;main_~x~0 := ~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; {436#true} is VALID [2020-07-28 17:42:49,264 INFO L280 TraceCheckUtils]: 2: Hoare triple {436#true} 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~union3;havoc trunc_double_#t~mem2;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; {436#true} is VALID [2020-07-28 17:42:49,264 INFO L280 TraceCheckUtils]: 3: Hoare triple {436#true} goto; {436#true} is VALID [2020-07-28 17:42:49,266 INFO L280 TraceCheckUtils]: 4: Hoare triple {436#true} 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); {453#(exists ((ULTIMATE.start_trunc_double_~msw~0 (_ BitVec 32))) (= (bvand (_ bv2147483648 32) ULTIMATE.start_trunc_double_~msw~0) ULTIMATE.start_trunc_double_~signbit~0))} is VALID [2020-07-28 17:42:49,267 INFO L280 TraceCheckUtils]: 5: Hoare triple {453#(exists ((ULTIMATE.start_trunc_double_~msw~0 (_ BitVec 32))) (= (bvand (_ bv2147483648 32) ULTIMATE.start_trunc_double_~msw~0) ULTIMATE.start_trunc_double_~signbit~0))} assume ~bvslt32(trunc_double_~exponent_less_1023~0, 20bv32); {453#(exists ((ULTIMATE.start_trunc_double_~msw~0 (_ BitVec 32))) (= (bvand (_ bv2147483648 32) ULTIMATE.start_trunc_double_~msw~0) ULTIMATE.start_trunc_double_~signbit~0))} is VALID [2020-07-28 17:42:49,270 INFO L280 TraceCheckUtils]: 6: Hoare triple {453#(exists ((ULTIMATE.start_trunc_double_~msw~0 (_ BitVec 32))) (= (bvand (_ bv2147483648 32) ULTIMATE.start_trunc_double_~msw~0) ULTIMATE.start_trunc_double_~signbit~0))} assume ~bvslt32(trunc_double_~exponent_less_1023~0, 0bv32); {453#(exists ((ULTIMATE.start_trunc_double_~msw~0 (_ BitVec 32))) (= (bvand (_ bv2147483648 32) ULTIMATE.start_trunc_double_~msw~0) ULTIMATE.start_trunc_double_~signbit~0))} is VALID [2020-07-28 17:42:49,273 INFO L280 TraceCheckUtils]: 7: Hoare triple {453#(exists ((ULTIMATE.start_trunc_double_~msw~0 (_ BitVec 32))) (= (bvand (_ bv2147483648 32) ULTIMATE.start_trunc_double_~msw~0) ULTIMATE.start_trunc_double_~signbit~0))} call trunc_double_~#iw_u~0.base, trunc_double_~#iw_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intINTTYPE4(trunc_double_~signbit~0, trunc_double_~#iw_u~0.base, ~bvadd32(4bv32, trunc_double_~#iw_u~0.offset), 4bv32);call write~intINTTYPE4(0bv32, trunc_double_~#iw_u~0.base, trunc_double_~#iw_u~0.offset, 4bv32);call trunc_double_#t~mem4 := read~intFLOATTYPE8(trunc_double_~#iw_u~0.base, trunc_double_~#iw_u~0.offset, 8bv32);trunc_double_~x := trunc_double_#t~mem4;call write~intINTTYPE4(trunc_double_#t~union5.lsw, trunc_double_~#iw_u~0.base, trunc_double_~#iw_u~0.offset, 4bv32);call write~intINTTYPE4(trunc_double_#t~union5.msw, trunc_double_~#iw_u~0.base, ~bvadd32(4bv32, trunc_double_~#iw_u~0.offset), 4bv32);havoc trunc_double_#t~mem4;havoc trunc_double_#t~union5.lsw, trunc_double_#t~union5.msw;call ULTIMATE.dealloc(trunc_double_~#iw_u~0.base, trunc_double_~#iw_u~0.offset);havoc trunc_double_~#iw_u~0.base, trunc_double_~#iw_u~0.offset; {463#(exists ((ULTIMATE.start_trunc_double_~msw~0 (_ BitVec 32))) (= (fp ((_ extract 63 63) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_trunc_double_~msw~0) (_ bv0 32))) ((_ extract 62 52) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_trunc_double_~msw~0) (_ bv0 32))) ((_ extract 51 0) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_trunc_double_~msw~0) (_ bv0 32)))) ULTIMATE.start_trunc_double_~x))} is VALID [2020-07-28 17:42:49,274 INFO L280 TraceCheckUtils]: 8: Hoare triple {463#(exists ((ULTIMATE.start_trunc_double_~msw~0 (_ BitVec 32))) (= (fp ((_ extract 63 63) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_trunc_double_~msw~0) (_ bv0 32))) ((_ extract 62 52) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_trunc_double_~msw~0) (_ bv0 32))) ((_ extract 51 0) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_trunc_double_~msw~0) (_ bv0 32)))) ULTIMATE.start_trunc_double_~x))} goto; {463#(exists ((ULTIMATE.start_trunc_double_~msw~0 (_ BitVec 32))) (= (fp ((_ extract 63 63) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_trunc_double_~msw~0) (_ bv0 32))) ((_ extract 62 52) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_trunc_double_~msw~0) (_ bv0 32))) ((_ extract 51 0) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_trunc_double_~msw~0) (_ bv0 32)))) ULTIMATE.start_trunc_double_~x))} is VALID [2020-07-28 17:42:49,276 INFO L280 TraceCheckUtils]: 9: Hoare triple {463#(exists ((ULTIMATE.start_trunc_double_~msw~0 (_ BitVec 32))) (= (fp ((_ extract 63 63) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_trunc_double_~msw~0) (_ bv0 32))) ((_ extract 62 52) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_trunc_double_~msw~0) (_ bv0 32))) ((_ extract 51 0) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_trunc_double_~msw~0) (_ bv0 32)))) ULTIMATE.start_trunc_double_~x))} trunc_double_#res := trunc_double_~x; {470#(exists ((ULTIMATE.start_trunc_double_~msw~0 (_ BitVec 32))) (= |ULTIMATE.start_trunc_double_#res| (fp ((_ extract 63 63) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_trunc_double_~msw~0) (_ bv0 32))) ((_ extract 62 52) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_trunc_double_~msw~0) (_ bv0 32))) ((_ extract 51 0) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_trunc_double_~msw~0) (_ bv0 32))))))} is VALID [2020-07-28 17:42:49,277 INFO L280 TraceCheckUtils]: 10: Hoare triple {470#(exists ((ULTIMATE.start_trunc_double_~msw~0 (_ BitVec 32))) (= |ULTIMATE.start_trunc_double_#res| (fp ((_ extract 63 63) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_trunc_double_~msw~0) (_ bv0 32))) ((_ extract 62 52) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_trunc_double_~msw~0) (_ bv0 32))) ((_ extract 51 0) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_trunc_double_~msw~0) (_ bv0 32))))))} main_#t~ret12 := trunc_double_#res;main_~res~0 := main_#t~ret12;havoc main_#t~ret12;main_#t~short14 := ~fp.eq~DOUBLE(main_~res~0, ~Pluszero~DOUBLE()); {474#|ULTIMATE.start_main_#t~short14|} is VALID [2020-07-28 17:42:49,278 INFO L280 TraceCheckUtils]: 11: Hoare triple {474#|ULTIMATE.start_main_#t~short14|} assume !main_#t~short14; {474#|ULTIMATE.start_main_#t~short14|} is VALID [2020-07-28 17:42:49,279 INFO L280 TraceCheckUtils]: 12: Hoare triple {474#|ULTIMATE.start_main_#t~short14|} assume !main_#t~short14;havoc main_#t~short14;havoc main_#t~ret13; {437#false} is VALID [2020-07-28 17:42:49,279 INFO L280 TraceCheckUtils]: 13: Hoare triple {437#false} assume !false; {437#false} is VALID [2020-07-28 17:42:49,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:42:49,280 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 17:42:49,362 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2020-07-28 17:42:49,368 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-28 17:42:49,372 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 17:42:49,373 INFO L544 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-28 17:42:49,377 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 17:42:49,377 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-28 17:42:49,377 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:15 [2020-07-28 17:42:49,426 INFO L280 TraceCheckUtils]: 13: Hoare triple {437#false} assume !false; {437#false} is VALID [2020-07-28 17:42:49,429 INFO L280 TraceCheckUtils]: 12: Hoare triple {474#|ULTIMATE.start_main_#t~short14|} assume !main_#t~short14;havoc main_#t~short14;havoc main_#t~ret13; {437#false} is VALID [2020-07-28 17:42:49,430 INFO L280 TraceCheckUtils]: 11: Hoare triple {474#|ULTIMATE.start_main_#t~short14|} assume !main_#t~short14; {474#|ULTIMATE.start_main_#t~short14|} is VALID [2020-07-28 17:42:49,431 INFO L280 TraceCheckUtils]: 10: Hoare triple {493#(fp.eq |ULTIMATE.start_trunc_double_#res| (_ +zero 11 53))} main_#t~ret12 := trunc_double_#res;main_~res~0 := main_#t~ret12;havoc main_#t~ret12;main_#t~short14 := ~fp.eq~DOUBLE(main_~res~0, ~Pluszero~DOUBLE()); {474#|ULTIMATE.start_main_#t~short14|} is VALID [2020-07-28 17:42:49,432 INFO L280 TraceCheckUtils]: 9: Hoare triple {497#(fp.eq ULTIMATE.start_trunc_double_~x (_ +zero 11 53))} trunc_double_#res := trunc_double_~x; {493#(fp.eq |ULTIMATE.start_trunc_double_#res| (_ +zero 11 53))} is VALID [2020-07-28 17:42:49,432 INFO L280 TraceCheckUtils]: 8: Hoare triple {497#(fp.eq ULTIMATE.start_trunc_double_~x (_ +zero 11 53))} goto; {497#(fp.eq ULTIMATE.start_trunc_double_~x (_ +zero 11 53))} is VALID [2020-07-28 17:42:49,433 INFO L280 TraceCheckUtils]: 7: Hoare triple {504#(fp.eq (fp ((_ extract 63 63) (concat ULTIMATE.start_trunc_double_~signbit~0 (_ bv0 32))) ((_ extract 62 52) (concat ULTIMATE.start_trunc_double_~signbit~0 (_ bv0 32))) ((_ extract 51 0) (concat ULTIMATE.start_trunc_double_~signbit~0 (_ bv0 32)))) (_ +zero 11 53))} call trunc_double_~#iw_u~0.base, trunc_double_~#iw_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intINTTYPE4(trunc_double_~signbit~0, trunc_double_~#iw_u~0.base, ~bvadd32(4bv32, trunc_double_~#iw_u~0.offset), 4bv32);call write~intINTTYPE4(0bv32, trunc_double_~#iw_u~0.base, trunc_double_~#iw_u~0.offset, 4bv32);call trunc_double_#t~mem4 := read~intFLOATTYPE8(trunc_double_~#iw_u~0.base, trunc_double_~#iw_u~0.offset, 8bv32);trunc_double_~x := trunc_double_#t~mem4;call write~intINTTYPE4(trunc_double_#t~union5.lsw, trunc_double_~#iw_u~0.base, trunc_double_~#iw_u~0.offset, 4bv32);call write~intINTTYPE4(trunc_double_#t~union5.msw, trunc_double_~#iw_u~0.base, ~bvadd32(4bv32, trunc_double_~#iw_u~0.offset), 4bv32);havoc trunc_double_#t~mem4;havoc trunc_double_#t~union5.lsw, trunc_double_#t~union5.msw;call ULTIMATE.dealloc(trunc_double_~#iw_u~0.base, trunc_double_~#iw_u~0.offset);havoc trunc_double_~#iw_u~0.base, trunc_double_~#iw_u~0.offset; {497#(fp.eq ULTIMATE.start_trunc_double_~x (_ +zero 11 53))} is VALID [2020-07-28 17:42:49,434 INFO L280 TraceCheckUtils]: 6: Hoare triple {504#(fp.eq (fp ((_ extract 63 63) (concat ULTIMATE.start_trunc_double_~signbit~0 (_ bv0 32))) ((_ extract 62 52) (concat ULTIMATE.start_trunc_double_~signbit~0 (_ bv0 32))) ((_ extract 51 0) (concat ULTIMATE.start_trunc_double_~signbit~0 (_ bv0 32)))) (_ +zero 11 53))} assume ~bvslt32(trunc_double_~exponent_less_1023~0, 0bv32); {504#(fp.eq (fp ((_ extract 63 63) (concat ULTIMATE.start_trunc_double_~signbit~0 (_ bv0 32))) ((_ extract 62 52) (concat ULTIMATE.start_trunc_double_~signbit~0 (_ bv0 32))) ((_ extract 51 0) (concat ULTIMATE.start_trunc_double_~signbit~0 (_ bv0 32)))) (_ +zero 11 53))} is VALID [2020-07-28 17:42:49,435 INFO L280 TraceCheckUtils]: 5: Hoare triple {504#(fp.eq (fp ((_ extract 63 63) (concat ULTIMATE.start_trunc_double_~signbit~0 (_ bv0 32))) ((_ extract 62 52) (concat ULTIMATE.start_trunc_double_~signbit~0 (_ bv0 32))) ((_ extract 51 0) (concat ULTIMATE.start_trunc_double_~signbit~0 (_ bv0 32)))) (_ +zero 11 53))} assume ~bvslt32(trunc_double_~exponent_less_1023~0, 20bv32); {504#(fp.eq (fp ((_ extract 63 63) (concat ULTIMATE.start_trunc_double_~signbit~0 (_ bv0 32))) ((_ extract 62 52) (concat ULTIMATE.start_trunc_double_~signbit~0 (_ bv0 32))) ((_ extract 51 0) (concat ULTIMATE.start_trunc_double_~signbit~0 (_ bv0 32)))) (_ +zero 11 53))} is VALID [2020-07-28 17:42:49,436 INFO L280 TraceCheckUtils]: 4: Hoare triple {436#true} 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); {504#(fp.eq (fp ((_ extract 63 63) (concat ULTIMATE.start_trunc_double_~signbit~0 (_ bv0 32))) ((_ extract 62 52) (concat ULTIMATE.start_trunc_double_~signbit~0 (_ bv0 32))) ((_ extract 51 0) (concat ULTIMATE.start_trunc_double_~signbit~0 (_ bv0 32)))) (_ +zero 11 53))} is VALID [2020-07-28 17:42:49,437 INFO L280 TraceCheckUtils]: 3: Hoare triple {436#true} goto; {436#true} is VALID [2020-07-28 17:42:49,437 INFO L280 TraceCheckUtils]: 2: Hoare triple {436#true} 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~union3;havoc trunc_double_#t~mem2;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; {436#true} is VALID [2020-07-28 17:42:49,437 INFO L280 TraceCheckUtils]: 1: Hoare triple {436#true} havoc main_#res;havoc main_#t~ret12, main_#t~ret13, main_#t~short14, main_~x~0, main_~res~0;main_~x~0 := ~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; {436#true} is VALID [2020-07-28 17:42:49,437 INFO L280 TraceCheckUtils]: 0: Hoare triple {436#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {436#true} is VALID [2020-07-28 17:42:49,438 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,438 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [434710014] [2020-07-28 17:42:49,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:42:49,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 9 [2020-07-28 17:42:49,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260709626] [2020-07-28 17:42:49,440 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2020-07-28 17:42:49,440 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:42:49,441 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-28 17:42:49,491 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:49,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-28 17:42:49,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 17:42:49,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-28 17:42:49,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-07-28 17:42:49,493 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 9 states. [2020-07-28 17:42:50,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:42:50,064 INFO L93 Difference]: Finished difference Result 22 states and 21 transitions. [2020-07-28 17:42:50,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-28 17:42:50,065 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2020-07-28 17:42:50,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:42:50,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-28 17:42:50,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2020-07-28 17:42:50,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-28 17:42:50,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2020-07-28 17:42:50,072 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 21 transitions. [2020-07-28 17:42:50,144 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,145 INFO L225 Difference]: With dead ends: 22 [2020-07-28 17:42:50,146 INFO L226 Difference]: Without dead ends: 19 [2020-07-28 17:42:50,146 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-07-28 17:42:50,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-07-28 17:42:50,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-07-28 17:42:50,171 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:42:50,171 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2020-07-28 17:42:50,171 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2020-07-28 17:42:50,172 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2020-07-28 17:42:50,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:42:50,175 INFO L93 Difference]: Finished difference Result 19 states and 18 transitions. [2020-07-28 17:42:50,175 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 18 transitions. [2020-07-28 17:42:50,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:42:50,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:42:50,175 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2020-07-28 17:42:50,176 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2020-07-28 17:42:50,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:42:50,177 INFO L93 Difference]: Finished difference Result 19 states and 18 transitions. [2020-07-28 17:42:50,177 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 18 transitions. [2020-07-28 17:42:50,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:42:50,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:42:50,178 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:42:50,178 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:42:50,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-28 17:42:50,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 18 transitions. [2020-07-28 17:42:50,179 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 18 transitions. Word has length 14 [2020-07-28 17:42:50,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:42:50,180 INFO L479 AbstractCegarLoop]: Abstraction has 19 states and 18 transitions. [2020-07-28 17:42:50,180 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-28 17:42:50,180 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 18 transitions. [2020-07-28 17:42:50,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-28 17:42:50,181 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:42:50,182 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:42:50,389 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-07-28 17:42:50,390 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:42:50,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:42:50,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1192312195, now seen corresponding path program 1 times [2020-07-28 17:42:50,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 17:42:50,394 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [983300415] [2020-07-28 17:42:50,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-07-28 17:42:50,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:42:50,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 19 conjunts are in the unsatisfiable core [2020-07-28 17:42:50,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:42:50,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 17:42:50,613 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2020-07-28 17:42:50,623 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-28 17:42:50,636 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 17:42:50,637 INFO L544 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-28 17:42:50,645 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 17:42:50,646 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-28 17:42:50,646 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:64, output treesize:34 [2020-07-28 17:42:50,802 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-28 17:42:50,858 INFO L280 TraceCheckUtils]: 0: Hoare triple {621#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {621#true} is VALID [2020-07-28 17:42:50,860 INFO L280 TraceCheckUtils]: 1: Hoare triple {621#true} havoc main_#res;havoc main_#t~ret12, main_#t~ret13, main_#t~short14, main_~x~0, main_~res~0;main_~x~0 := ~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; {629#(= (_ +zero 11 53) ULTIMATE.start_trunc_double_~x)} is VALID [2020-07-28 17:42:50,865 INFO L280 TraceCheckUtils]: 2: Hoare triple {629#(= (_ +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~union3;havoc trunc_double_#t~mem2;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; {633#(exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)) (_ +zero 11 53)) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) ULTIMATE.start_trunc_double_~msw~0)))} is VALID [2020-07-28 17:42:50,866 INFO L280 TraceCheckUtils]: 3: Hoare triple {633#(exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)) (_ +zero 11 53)) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) ULTIMATE.start_trunc_double_~msw~0)))} goto; {633#(exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)) (_ +zero 11 53)) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) ULTIMATE.start_trunc_double_~msw~0)))} is VALID [2020-07-28 17:42:50,868 INFO L280 TraceCheckUtils]: 4: Hoare triple {633#(exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)) (_ +zero 11 53)) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) ULTIMATE.start_trunc_double_~msw~0)))} 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); {640#(exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (and (= (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|)) ULTIMATE.start_trunc_double_~signbit~0) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)) (_ +zero 11 53))))} is VALID [2020-07-28 17:42:50,869 INFO L280 TraceCheckUtils]: 5: Hoare triple {640#(exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (and (= (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|)) ULTIMATE.start_trunc_double_~signbit~0) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)) (_ +zero 11 53))))} assume ~bvslt32(trunc_double_~exponent_less_1023~0, 20bv32); {640#(exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (and (= (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|)) ULTIMATE.start_trunc_double_~signbit~0) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)) (_ +zero 11 53))))} is VALID [2020-07-28 17:42:50,870 INFO L280 TraceCheckUtils]: 6: Hoare triple {640#(exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (and (= (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|)) ULTIMATE.start_trunc_double_~signbit~0) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)) (_ +zero 11 53))))} assume ~bvslt32(trunc_double_~exponent_less_1023~0, 0bv32); {640#(exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (and (= (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|)) ULTIMATE.start_trunc_double_~signbit~0) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)) (_ +zero 11 53))))} is VALID [2020-07-28 17:42:50,874 INFO L280 TraceCheckUtils]: 7: Hoare triple {640#(exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (and (= (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|)) ULTIMATE.start_trunc_double_~signbit~0) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)) (_ +zero 11 53))))} call trunc_double_~#iw_u~0.base, trunc_double_~#iw_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intINTTYPE4(trunc_double_~signbit~0, trunc_double_~#iw_u~0.base, ~bvadd32(4bv32, trunc_double_~#iw_u~0.offset), 4bv32);call write~intINTTYPE4(0bv32, trunc_double_~#iw_u~0.base, trunc_double_~#iw_u~0.offset, 4bv32);call trunc_double_#t~mem4 := read~intFLOATTYPE8(trunc_double_~#iw_u~0.base, trunc_double_~#iw_u~0.offset, 8bv32);trunc_double_~x := trunc_double_#t~mem4;call write~intINTTYPE4(trunc_double_#t~union5.lsw, trunc_double_~#iw_u~0.base, trunc_double_~#iw_u~0.offset, 4bv32);call write~intINTTYPE4(trunc_double_#t~union5.msw, trunc_double_~#iw_u~0.base, ~bvadd32(4bv32, trunc_double_~#iw_u~0.offset), 4bv32);havoc trunc_double_#t~mem4;havoc trunc_double_#t~union5.lsw, trunc_double_#t~union5.msw;call ULTIMATE.dealloc(trunc_double_~#iw_u~0.base, trunc_double_~#iw_u~0.offset);havoc trunc_double_~#iw_u~0.base, trunc_double_~#iw_u~0.offset; {629#(= (_ +zero 11 53) ULTIMATE.start_trunc_double_~x)} is VALID [2020-07-28 17:42:50,875 INFO L280 TraceCheckUtils]: 8: Hoare triple {629#(= (_ +zero 11 53) ULTIMATE.start_trunc_double_~x)} goto; {629#(= (_ +zero 11 53) ULTIMATE.start_trunc_double_~x)} is VALID [2020-07-28 17:42:50,876 INFO L280 TraceCheckUtils]: 9: Hoare triple {629#(= (_ +zero 11 53) ULTIMATE.start_trunc_double_~x)} trunc_double_#res := trunc_double_~x; {656#(= |ULTIMATE.start_trunc_double_#res| (_ +zero 11 53))} is VALID [2020-07-28 17:42:50,878 INFO L280 TraceCheckUtils]: 10: Hoare triple {656#(= |ULTIMATE.start_trunc_double_#res| (_ +zero 11 53))} main_#t~ret12 := trunc_double_#res;main_~res~0 := main_#t~ret12;havoc main_#t~ret12;main_#t~short14 := ~fp.eq~DOUBLE(main_~res~0, ~Pluszero~DOUBLE()); {660#(= ULTIMATE.start_main_~res~0 (_ +zero 11 53))} is VALID [2020-07-28 17:42:50,888 INFO L280 TraceCheckUtils]: 11: Hoare triple {660#(= ULTIMATE.start_main_~res~0 (_ +zero 11 53))} assume main_#t~short14;__signbit_double_#in~x := main_~res~0;havoc __signbit_double_#res;havoc __signbit_double_#t~mem10, __signbit_double_#t~union11, __signbit_double_~#gh_u~0.base, __signbit_double_~#gh_u~0.offset, __signbit_double_~x, __signbit_double_~msw~1;__signbit_double_~x := __signbit_double_#in~x;havoc __signbit_double_~msw~1; {664#(= (_ +zero 11 53) ULTIMATE.start___signbit_double_~x)} is VALID [2020-07-28 17:42:50,891 INFO L280 TraceCheckUtils]: 12: Hoare triple {664#(= (_ +zero 11 53) ULTIMATE.start___signbit_double_~x)} call __signbit_double_~#gh_u~0.base, __signbit_double_~#gh_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(__signbit_double_~x, __signbit_double_~#gh_u~0.base, __signbit_double_~#gh_u~0.offset, 8bv32);call __signbit_double_#t~mem10 := read~intINTTYPE4(__signbit_double_~#gh_u~0.base, ~bvadd32(4bv32, __signbit_double_~#gh_u~0.offset), 4bv32);__signbit_double_~msw~1 := __signbit_double_#t~mem10;call write~intFLOATTYPE8(__signbit_double_#t~union11, __signbit_double_~#gh_u~0.base, __signbit_double_~#gh_u~0.offset, 8bv32);havoc __signbit_double_#t~union11;havoc __signbit_double_#t~mem10;call ULTIMATE.dealloc(__signbit_double_~#gh_u~0.base, __signbit_double_~#gh_u~0.offset);havoc __signbit_double_~#gh_u~0.base, __signbit_double_~#gh_u~0.offset; {668#(exists ((v_skolemized_v_prenex_3_3 (_ BitVec 64))) (and (= ULTIMATE.start___signbit_double_~msw~1 ((_ extract 63 32) v_skolemized_v_prenex_3_3)) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_3_3) ((_ extract 62 52) v_skolemized_v_prenex_3_3) ((_ extract 51 0) v_skolemized_v_prenex_3_3)) (_ +zero 11 53))))} is VALID [2020-07-28 17:42:50,898 INFO L280 TraceCheckUtils]: 13: Hoare triple {668#(exists ((v_skolemized_v_prenex_3_3 (_ BitVec 64))) (and (= ULTIMATE.start___signbit_double_~msw~1 ((_ extract 63 32) v_skolemized_v_prenex_3_3)) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_3_3) ((_ extract 62 52) v_skolemized_v_prenex_3_3) ((_ extract 51 0) v_skolemized_v_prenex_3_3)) (_ +zero 11 53))))} goto; {668#(exists ((v_skolemized_v_prenex_3_3 (_ BitVec 64))) (and (= ULTIMATE.start___signbit_double_~msw~1 ((_ extract 63 32) v_skolemized_v_prenex_3_3)) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_3_3) ((_ extract 62 52) v_skolemized_v_prenex_3_3) ((_ extract 51 0) v_skolemized_v_prenex_3_3)) (_ +zero 11 53))))} is VALID [2020-07-28 17:42:50,900 INFO L280 TraceCheckUtils]: 14: Hoare triple {668#(exists ((v_skolemized_v_prenex_3_3 (_ BitVec 64))) (and (= ULTIMATE.start___signbit_double_~msw~1 ((_ extract 63 32) v_skolemized_v_prenex_3_3)) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_3_3) ((_ extract 62 52) v_skolemized_v_prenex_3_3) ((_ extract 51 0) v_skolemized_v_prenex_3_3)) (_ +zero 11 53))))} __signbit_double_#res := (if 0bv32 != ~bvand32(2147483648bv32, __signbit_double_~msw~1) then 1bv32 else 0bv32); {675#(= |ULTIMATE.start___signbit_double_#res| (_ bv0 32))} is VALID [2020-07-28 17:42:50,900 INFO L280 TraceCheckUtils]: 15: Hoare triple {675#(= |ULTIMATE.start___signbit_double_#res| (_ bv0 32))} main_#t~ret13 := __signbit_double_#res;main_#t~short14 := 0bv32 == main_#t~ret13; {679#|ULTIMATE.start_main_#t~short14|} is VALID [2020-07-28 17:42:50,902 INFO L280 TraceCheckUtils]: 16: Hoare triple {679#|ULTIMATE.start_main_#t~short14|} assume !main_#t~short14;havoc main_#t~short14;havoc main_#t~ret13; {622#false} is VALID [2020-07-28 17:42:50,903 INFO L280 TraceCheckUtils]: 17: Hoare triple {622#false} assume !false; {622#false} is VALID [2020-07-28 17:42:50,904 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,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 17:42:51,245 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2020-07-28 17:42:51,252 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-28 17:42:51,255 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 17:42:51,256 INFO L544 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-28 17:42:51,268 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 17:42:51,269 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-28 17:42:51,269 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:59, output treesize:29 [2020-07-28 17:42:51,569 INFO L280 TraceCheckUtils]: 17: Hoare triple {622#false} assume !false; {622#false} is VALID [2020-07-28 17:42:51,570 INFO L280 TraceCheckUtils]: 16: Hoare triple {679#|ULTIMATE.start_main_#t~short14|} assume !main_#t~short14;havoc main_#t~short14;havoc main_#t~ret13; {622#false} is VALID [2020-07-28 17:42:51,571 INFO L280 TraceCheckUtils]: 15: Hoare triple {675#(= |ULTIMATE.start___signbit_double_#res| (_ bv0 32))} main_#t~ret13 := __signbit_double_#res;main_#t~short14 := 0bv32 == main_#t~ret13; {679#|ULTIMATE.start_main_#t~short14|} is VALID [2020-07-28 17:42:51,572 INFO L280 TraceCheckUtils]: 14: Hoare triple {695#(= (bvand (_ bv2147483648 32) ULTIMATE.start___signbit_double_~msw~1) (_ bv0 32))} __signbit_double_#res := (if 0bv32 != ~bvand32(2147483648bv32, __signbit_double_~msw~1) then 1bv32 else 0bv32); {675#(= |ULTIMATE.start___signbit_double_#res| (_ bv0 32))} is VALID [2020-07-28 17:42:51,572 INFO L280 TraceCheckUtils]: 13: Hoare triple {695#(= (bvand (_ bv2147483648 32) ULTIMATE.start___signbit_double_~msw~1) (_ bv0 32))} goto; {695#(= (bvand (_ bv2147483648 32) ULTIMATE.start___signbit_double_~msw~1) (_ bv0 32))} is VALID [2020-07-28 17:42:51,576 INFO L280 TraceCheckUtils]: 12: Hoare triple {702#(forall ((v_skolemized_v_prenex_3_3 (_ BitVec 64))) (or (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_3_3))) (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_3_3) ((_ extract 62 52) v_skolemized_v_prenex_3_3) ((_ extract 51 0) v_skolemized_v_prenex_3_3)) ULTIMATE.start___signbit_double_~x))))} call __signbit_double_~#gh_u~0.base, __signbit_double_~#gh_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(__signbit_double_~x, __signbit_double_~#gh_u~0.base, __signbit_double_~#gh_u~0.offset, 8bv32);call __signbit_double_#t~mem10 := read~intINTTYPE4(__signbit_double_~#gh_u~0.base, ~bvadd32(4bv32, __signbit_double_~#gh_u~0.offset), 4bv32);__signbit_double_~msw~1 := __signbit_double_#t~mem10;call write~intFLOATTYPE8(__signbit_double_#t~union11, __signbit_double_~#gh_u~0.base, __signbit_double_~#gh_u~0.offset, 8bv32);havoc __signbit_double_#t~union11;havoc __signbit_double_#t~mem10;call ULTIMATE.dealloc(__signbit_double_~#gh_u~0.base, __signbit_double_~#gh_u~0.offset);havoc __signbit_double_~#gh_u~0.base, __signbit_double_~#gh_u~0.offset; {695#(= (bvand (_ bv2147483648 32) ULTIMATE.start___signbit_double_~msw~1) (_ bv0 32))} is VALID [2020-07-28 17:42:51,577 INFO L280 TraceCheckUtils]: 11: Hoare triple {706#(forall ((v_skolemized_v_prenex_3_3 (_ BitVec 64))) (or (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_3_3) ((_ extract 62 52) v_skolemized_v_prenex_3_3) ((_ extract 51 0) v_skolemized_v_prenex_3_3)) ULTIMATE.start_main_~res~0)) (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_3_3)))))} assume main_#t~short14;__signbit_double_#in~x := main_~res~0;havoc __signbit_double_#res;havoc __signbit_double_#t~mem10, __signbit_double_#t~union11, __signbit_double_~#gh_u~0.base, __signbit_double_~#gh_u~0.offset, __signbit_double_~x, __signbit_double_~msw~1;__signbit_double_~x := __signbit_double_#in~x;havoc __signbit_double_~msw~1; {702#(forall ((v_skolemized_v_prenex_3_3 (_ BitVec 64))) (or (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_3_3))) (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_3_3) ((_ extract 62 52) v_skolemized_v_prenex_3_3) ((_ extract 51 0) v_skolemized_v_prenex_3_3)) ULTIMATE.start___signbit_double_~x))))} is VALID [2020-07-28 17:42:51,580 INFO L280 TraceCheckUtils]: 10: Hoare triple {710#(forall ((v_skolemized_v_prenex_3_3 (_ BitVec 64))) (or (not (= |ULTIMATE.start_trunc_double_#res| (fp ((_ extract 63 63) v_skolemized_v_prenex_3_3) ((_ extract 62 52) v_skolemized_v_prenex_3_3) ((_ extract 51 0) v_skolemized_v_prenex_3_3)))) (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_3_3)))))} main_#t~ret12 := trunc_double_#res;main_~res~0 := main_#t~ret12;havoc main_#t~ret12;main_#t~short14 := ~fp.eq~DOUBLE(main_~res~0, ~Pluszero~DOUBLE()); {706#(forall ((v_skolemized_v_prenex_3_3 (_ BitVec 64))) (or (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_3_3) ((_ extract 62 52) v_skolemized_v_prenex_3_3) ((_ extract 51 0) v_skolemized_v_prenex_3_3)) ULTIMATE.start_main_~res~0)) (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_3_3)))))} is VALID [2020-07-28 17:42:51,584 INFO L280 TraceCheckUtils]: 9: Hoare triple {714#(forall ((v_skolemized_v_prenex_3_3 (_ BitVec 64))) (or (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_3_3))) (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_3_3) ((_ extract 62 52) v_skolemized_v_prenex_3_3) ((_ extract 51 0) v_skolemized_v_prenex_3_3)) ULTIMATE.start_trunc_double_~x))))} trunc_double_#res := trunc_double_~x; {710#(forall ((v_skolemized_v_prenex_3_3 (_ BitVec 64))) (or (not (= |ULTIMATE.start_trunc_double_#res| (fp ((_ extract 63 63) v_skolemized_v_prenex_3_3) ((_ extract 62 52) v_skolemized_v_prenex_3_3) ((_ extract 51 0) v_skolemized_v_prenex_3_3)))) (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_3_3)))))} is VALID [2020-07-28 17:42:51,585 INFO L280 TraceCheckUtils]: 8: Hoare triple {714#(forall ((v_skolemized_v_prenex_3_3 (_ BitVec 64))) (or (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_3_3))) (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_3_3) ((_ extract 62 52) v_skolemized_v_prenex_3_3) ((_ extract 51 0) v_skolemized_v_prenex_3_3)) ULTIMATE.start_trunc_double_~x))))} goto; {714#(forall ((v_skolemized_v_prenex_3_3 (_ BitVec 64))) (or (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_3_3))) (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_3_3) ((_ extract 62 52) v_skolemized_v_prenex_3_3) ((_ extract 51 0) v_skolemized_v_prenex_3_3)) ULTIMATE.start_trunc_double_~x))))} is VALID [2020-07-28 17:42:51,587 INFO L280 TraceCheckUtils]: 7: Hoare triple {721#(forall ((v_skolemized_v_prenex_3_3 (_ BitVec 64))) (or (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_3_3))) (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_3_3) ((_ extract 62 52) v_skolemized_v_prenex_3_3) ((_ extract 51 0) v_skolemized_v_prenex_3_3)) (fp ((_ extract 63 63) (concat ULTIMATE.start_trunc_double_~signbit~0 (_ bv0 32))) ((_ extract 62 52) (concat ULTIMATE.start_trunc_double_~signbit~0 (_ bv0 32))) ((_ extract 51 0) (concat ULTIMATE.start_trunc_double_~signbit~0 (_ bv0 32))))))))} call trunc_double_~#iw_u~0.base, trunc_double_~#iw_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intINTTYPE4(trunc_double_~signbit~0, trunc_double_~#iw_u~0.base, ~bvadd32(4bv32, trunc_double_~#iw_u~0.offset), 4bv32);call write~intINTTYPE4(0bv32, trunc_double_~#iw_u~0.base, trunc_double_~#iw_u~0.offset, 4bv32);call trunc_double_#t~mem4 := read~intFLOATTYPE8(trunc_double_~#iw_u~0.base, trunc_double_~#iw_u~0.offset, 8bv32);trunc_double_~x := trunc_double_#t~mem4;call write~intINTTYPE4(trunc_double_#t~union5.lsw, trunc_double_~#iw_u~0.base, trunc_double_~#iw_u~0.offset, 4bv32);call write~intINTTYPE4(trunc_double_#t~union5.msw, trunc_double_~#iw_u~0.base, ~bvadd32(4bv32, trunc_double_~#iw_u~0.offset), 4bv32);havoc trunc_double_#t~mem4;havoc trunc_double_#t~union5.lsw, trunc_double_#t~union5.msw;call ULTIMATE.dealloc(trunc_double_~#iw_u~0.base, trunc_double_~#iw_u~0.offset);havoc trunc_double_~#iw_u~0.base, trunc_double_~#iw_u~0.offset; {714#(forall ((v_skolemized_v_prenex_3_3 (_ BitVec 64))) (or (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_3_3))) (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_3_3) ((_ extract 62 52) v_skolemized_v_prenex_3_3) ((_ extract 51 0) v_skolemized_v_prenex_3_3)) ULTIMATE.start_trunc_double_~x))))} is VALID [2020-07-28 17:42:51,588 INFO L280 TraceCheckUtils]: 6: Hoare triple {721#(forall ((v_skolemized_v_prenex_3_3 (_ BitVec 64))) (or (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_3_3))) (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_3_3) ((_ extract 62 52) v_skolemized_v_prenex_3_3) ((_ extract 51 0) v_skolemized_v_prenex_3_3)) (fp ((_ extract 63 63) (concat ULTIMATE.start_trunc_double_~signbit~0 (_ bv0 32))) ((_ extract 62 52) (concat ULTIMATE.start_trunc_double_~signbit~0 (_ bv0 32))) ((_ extract 51 0) (concat ULTIMATE.start_trunc_double_~signbit~0 (_ bv0 32))))))))} assume ~bvslt32(trunc_double_~exponent_less_1023~0, 0bv32); {721#(forall ((v_skolemized_v_prenex_3_3 (_ BitVec 64))) (or (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_3_3))) (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_3_3) ((_ extract 62 52) v_skolemized_v_prenex_3_3) ((_ extract 51 0) v_skolemized_v_prenex_3_3)) (fp ((_ extract 63 63) (concat ULTIMATE.start_trunc_double_~signbit~0 (_ bv0 32))) ((_ extract 62 52) (concat ULTIMATE.start_trunc_double_~signbit~0 (_ bv0 32))) ((_ extract 51 0) (concat ULTIMATE.start_trunc_double_~signbit~0 (_ bv0 32))))))))} is VALID [2020-07-28 17:42:51,588 INFO L280 TraceCheckUtils]: 5: Hoare triple {721#(forall ((v_skolemized_v_prenex_3_3 (_ BitVec 64))) (or (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_3_3))) (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_3_3) ((_ extract 62 52) v_skolemized_v_prenex_3_3) ((_ extract 51 0) v_skolemized_v_prenex_3_3)) (fp ((_ extract 63 63) (concat ULTIMATE.start_trunc_double_~signbit~0 (_ bv0 32))) ((_ extract 62 52) (concat ULTIMATE.start_trunc_double_~signbit~0 (_ bv0 32))) ((_ extract 51 0) (concat ULTIMATE.start_trunc_double_~signbit~0 (_ bv0 32))))))))} assume ~bvslt32(trunc_double_~exponent_less_1023~0, 20bv32); {721#(forall ((v_skolemized_v_prenex_3_3 (_ BitVec 64))) (or (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_3_3))) (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_3_3) ((_ extract 62 52) v_skolemized_v_prenex_3_3) ((_ extract 51 0) v_skolemized_v_prenex_3_3)) (fp ((_ extract 63 63) (concat ULTIMATE.start_trunc_double_~signbit~0 (_ bv0 32))) ((_ extract 62 52) (concat ULTIMATE.start_trunc_double_~signbit~0 (_ bv0 32))) ((_ extract 51 0) (concat ULTIMATE.start_trunc_double_~signbit~0 (_ bv0 32))))))))} is VALID [2020-07-28 17:42:51,591 INFO L280 TraceCheckUtils]: 4: Hoare triple {731#(forall ((v_skolemized_v_prenex_3_3 (_ BitVec 64))) (or (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_3_3) ((_ extract 62 52) v_skolemized_v_prenex_3_3) ((_ extract 51 0) v_skolemized_v_prenex_3_3)) (fp ((_ extract 63 63) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_trunc_double_~msw~0) (_ bv0 32))) ((_ extract 62 52) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_trunc_double_~msw~0) (_ bv0 32))) ((_ extract 51 0) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_trunc_double_~msw~0) (_ bv0 32)))))) (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_3_3)))))} 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); {721#(forall ((v_skolemized_v_prenex_3_3 (_ BitVec 64))) (or (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_3_3))) (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_3_3) ((_ extract 62 52) v_skolemized_v_prenex_3_3) ((_ extract 51 0) v_skolemized_v_prenex_3_3)) (fp ((_ extract 63 63) (concat ULTIMATE.start_trunc_double_~signbit~0 (_ bv0 32))) ((_ extract 62 52) (concat ULTIMATE.start_trunc_double_~signbit~0 (_ bv0 32))) ((_ extract 51 0) (concat ULTIMATE.start_trunc_double_~signbit~0 (_ bv0 32))))))))} is VALID [2020-07-28 17:42:51,592 INFO L280 TraceCheckUtils]: 3: Hoare triple {731#(forall ((v_skolemized_v_prenex_3_3 (_ BitVec 64))) (or (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_3_3) ((_ extract 62 52) v_skolemized_v_prenex_3_3) ((_ extract 51 0) v_skolemized_v_prenex_3_3)) (fp ((_ extract 63 63) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_trunc_double_~msw~0) (_ bv0 32))) ((_ extract 62 52) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_trunc_double_~msw~0) (_ bv0 32))) ((_ extract 51 0) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_trunc_double_~msw~0) (_ bv0 32)))))) (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_3_3)))))} goto; {731#(forall ((v_skolemized_v_prenex_3_3 (_ BitVec 64))) (or (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_3_3) ((_ extract 62 52) v_skolemized_v_prenex_3_3) ((_ extract 51 0) v_skolemized_v_prenex_3_3)) (fp ((_ extract 63 63) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_trunc_double_~msw~0) (_ bv0 32))) ((_ extract 62 52) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_trunc_double_~msw~0) (_ bv0 32))) ((_ extract 51 0) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_trunc_double_~msw~0) (_ bv0 32)))))) (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_3_3)))))} is VALID [2020-07-28 17:42:51,598 INFO L280 TraceCheckUtils]: 2: Hoare triple {714#(forall ((v_skolemized_v_prenex_3_3 (_ BitVec 64))) (or (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_3_3))) (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_3_3) ((_ extract 62 52) v_skolemized_v_prenex_3_3) ((_ extract 51 0) v_skolemized_v_prenex_3_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~union3;havoc trunc_double_#t~mem2;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; {731#(forall ((v_skolemized_v_prenex_3_3 (_ BitVec 64))) (or (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_3_3) ((_ extract 62 52) v_skolemized_v_prenex_3_3) ((_ extract 51 0) v_skolemized_v_prenex_3_3)) (fp ((_ extract 63 63) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_trunc_double_~msw~0) (_ bv0 32))) ((_ extract 62 52) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_trunc_double_~msw~0) (_ bv0 32))) ((_ extract 51 0) (concat (bvand (_ bv2147483648 32) ULTIMATE.start_trunc_double_~msw~0) (_ bv0 32)))))) (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_3_3)))))} is VALID [2020-07-28 17:42:51,600 INFO L280 TraceCheckUtils]: 1: Hoare triple {621#true} havoc main_#res;havoc main_#t~ret12, main_#t~ret13, main_#t~short14, main_~x~0, main_~res~0;main_~x~0 := ~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; {714#(forall ((v_skolemized_v_prenex_3_3 (_ BitVec 64))) (or (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_3_3))) (not (= (fp ((_ extract 63 63) v_skolemized_v_prenex_3_3) ((_ extract 62 52) v_skolemized_v_prenex_3_3) ((_ extract 51 0) v_skolemized_v_prenex_3_3)) ULTIMATE.start_trunc_double_~x))))} is VALID [2020-07-28 17:42:51,600 INFO L280 TraceCheckUtils]: 0: Hoare triple {621#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {621#true} is VALID [2020-07-28 17:42:51,603 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:51,603 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [983300415] [2020-07-28 17:42:51,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:42:51,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 11] imperfect sequences [] total 18 [2020-07-28 17:42:51,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757598408] [2020-07-28 17:42:51,604 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2020-07-28 17:42:51,605 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:42:51,605 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2020-07-28 17:42:51,686 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:42:51,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-28 17:42:51,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 17:42:51,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-28 17:42:51,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2020-07-28 17:42:51,687 INFO L87 Difference]: Start difference. First operand 19 states and 18 transitions. Second operand 18 states. [2020-07-28 17:42:52,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:42:52,943 INFO L93 Difference]: Finished difference Result 19 states and 18 transitions. [2020-07-28 17:42:52,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-28 17:42:52,944 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2020-07-28 17:42:52,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:42:52,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-28 17:42:52,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. [2020-07-28 17:42:52,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-28 17:42:52,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 18 transitions. [2020-07-28 17:42:52,947 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 18 transitions. [2020-07-28 17:42:53,006 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:42:53,006 INFO L225 Difference]: With dead ends: 19 [2020-07-28 17:42:53,006 INFO L226 Difference]: Without dead ends: 0 [2020-07-28 17:42:53,008 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2020-07-28 17:42:53,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-28 17:42:53,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-28 17:42:53,009 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:42:53,009 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-28 17:42:53,009 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 17:42:53,009 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 17:42:53,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:42:53,009 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 17:42:53,009 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 17:42:53,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:42:53,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:42:53,010 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 17:42:53,010 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 17:42:53,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:42:53,010 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 17:42:53,010 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 17:42:53,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:42:53,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:42:53,011 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:42:53,011 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:42:53,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-28 17:42:53,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-28 17:42:53,011 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2020-07-28 17:42:53,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:42:53,011 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-28 17:42:53,011 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-28 17:42:53,012 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 17:42:53,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:42:53,213 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-07-28 17:42:53,216 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-28 17:42:53,426 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 45 [2020-07-28 17:42:53,647 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 59 [2020-07-28 17:42:53,730 INFO L268 CegarLoopResult]: For program point L31(lines 31 46) no Hoare annotation was computed. [2020-07-28 17:42:53,730 INFO L268 CegarLoopResult]: For program point L85(line 85) no Hoare annotation was computed. [2020-07-28 17:42:53,730 INFO L268 CegarLoopResult]: For program point L52-1(lines 52 57) no Hoare annotation was computed. [2020-07-28 17:42:53,731 INFO L268 CegarLoopResult]: For program point L85-2(lines 85 88) no Hoare annotation was computed. [2020-07-28 17:42:53,731 INFO L264 CegarLoopResult]: At program point L52-2(lines 52 57) the Hoare annotation is: false [2020-07-28 17:42:53,731 INFO L268 CegarLoopResult]: For program point L52-3(lines 30 58) no Hoare annotation was computed. [2020-07-28 17:42:53,731 INFO L268 CegarLoopResult]: For program point L48(lines 48 50) no Hoare annotation was computed. [2020-07-28 17:42:53,731 INFO L268 CegarLoopResult]: For program point L65-1(lines 65 69) no Hoare annotation was computed. [2020-07-28 17:42:53,731 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-28 17:42:53,731 INFO L268 CegarLoopResult]: For program point L32-1(lines 32 37) no Hoare annotation was computed. [2020-07-28 17:42:53,732 INFO L264 CegarLoopResult]: At program point L65-2(lines 65 69) the Hoare annotation is: (and (= |ULTIMATE.start_trunc_double_#res| (_ +zero 11 53)) (= (_ +zero 11 53) ULTIMATE.start_trunc_double_~x) (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (and (= (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|)) ULTIMATE.start_trunc_double_~signbit~0) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)) (_ +zero 11 53)))) (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)) (_ +zero 11 53)) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) ULTIMATE.start_trunc_double_~msw~0))) (= (_ +zero 11 53) ULTIMATE.start___signbit_double_~x) (= ULTIMATE.start_main_~res~0 (_ +zero 11 53)) (exists ((|v_skolemized_q#valueAsBitvector_5| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_5|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_5|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_5|)) (_ +zero 11 53)) (= (bvadd (bvashr (bvand (_ bv2146435072 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_5|)) (_ bv20 32)) (_ bv4294966273 32)) ULTIMATE.start_trunc_double_~exponent_less_1023~0))) |ULTIMATE.start_main_#t~short14|) [2020-07-28 17:42:53,732 INFO L264 CegarLoopResult]: At program point L32-2(lines 32 37) the Hoare annotation is: (and (= (_ +zero 11 53) ULTIMATE.start_trunc_double_~x) (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (and (= (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|)) ULTIMATE.start_trunc_double_~signbit~0) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)) (_ +zero 11 53)))) (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)) (_ +zero 11 53)) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) ULTIMATE.start_trunc_double_~msw~0))) (exists ((|v_skolemized_q#valueAsBitvector_5| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_5|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_5|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_5|)) (_ +zero 11 53)) (= (bvadd (bvashr (bvand (_ bv2146435072 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_5|)) (_ bv20 32)) (_ bv4294966273 32)) ULTIMATE.start_trunc_double_~exponent_less_1023~0)))) [2020-07-28 17:42:53,732 INFO L268 CegarLoopResult]: For program point L65-3(lines 65 69) no Hoare annotation was computed. [2020-07-28 17:42:53,732 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-28 17:42:53,732 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-28 17:42:53,733 INFO L271 CegarLoopResult]: At program point L90(lines 74 91) the Hoare annotation is: true [2020-07-28 17:42:53,733 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 86) no Hoare annotation was computed. [2020-07-28 17:42:53,733 INFO L268 CegarLoopResult]: For program point L86(line 86) no Hoare annotation was computed. [2020-07-28 17:42:53,733 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-28 17:42:53,733 INFO L264 CegarLoopResult]: At program point L71(lines 62 72) the Hoare annotation is: (and (= |ULTIMATE.start___signbit_double_#res| (_ bv0 32)) (exists ((v_skolemized_v_prenex_3_3 (_ BitVec 64))) (and (= ULTIMATE.start___signbit_double_~msw~1 ((_ extract 63 32) v_skolemized_v_prenex_3_3)) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_3_3) ((_ extract 62 52) v_skolemized_v_prenex_3_3) ((_ extract 51 0) v_skolemized_v_prenex_3_3)) (_ +zero 11 53)))) (= |ULTIMATE.start_trunc_double_#res| (_ +zero 11 53)) (= (_ +zero 11 53) ULTIMATE.start_trunc_double_~x) (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (and (= (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|)) ULTIMATE.start_trunc_double_~signbit~0) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)) (_ +zero 11 53)))) (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)) (_ +zero 11 53)) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) ULTIMATE.start_trunc_double_~msw~0))) (= (_ +zero 11 53) ULTIMATE.start___signbit_double_~x) (= ULTIMATE.start_main_~res~0 (_ +zero 11 53)) (exists ((|v_skolemized_q#valueAsBitvector_5| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_5|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_5|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_5|)) (_ +zero 11 53)) (= (bvadd (bvashr (bvand (_ bv2146435072 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_5|)) (_ bv20 32)) (_ bv4294966273 32)) ULTIMATE.start_trunc_double_~exponent_less_1023~0))) |ULTIMATE.start_main_#t~short14|) [2020-07-28 17:42:53,733 INFO L268 CegarLoopResult]: For program point L30(lines 30 58) no Hoare annotation was computed. [2020-07-28 17:42:53,733 INFO L264 CegarLoopResult]: At program point L59(lines 17 60) the Hoare annotation is: (and (= |ULTIMATE.start_trunc_double_#res| (_ +zero 11 53)) (= (_ +zero 11 53) ULTIMATE.start_trunc_double_~x) (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (and (= (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|)) ULTIMATE.start_trunc_double_~signbit~0) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)) (_ +zero 11 53)))) (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)) (_ +zero 11 53)) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) ULTIMATE.start_trunc_double_~msw~0))) (exists ((|v_skolemized_q#valueAsBitvector_5| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_5|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_5|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_5|)) (_ +zero 11 53)) (= (bvadd (bvashr (bvand (_ bv2146435072 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_5|)) (_ bv20 32)) (_ bv4294966273 32)) ULTIMATE.start_trunc_double_~exponent_less_1023~0)))) [2020-07-28 17:42:53,734 INFO L268 CegarLoopResult]: For program point L22-1(lines 22 27) no Hoare annotation was computed. [2020-07-28 17:42:53,734 INFO L264 CegarLoopResult]: At program point L22-2(lines 22 27) the Hoare annotation is: (= (_ +zero 11 53) ULTIMATE.start_trunc_double_~x) [2020-07-28 17:42:53,734 INFO L268 CegarLoopResult]: For program point L22-3(lines 22 27) no Hoare annotation was computed. [2020-07-28 17:42:53,734 INFO L268 CegarLoopResult]: For program point L47(lines 47 58) no Hoare annotation was computed. [2020-07-28 17:42:53,734 INFO L268 CegarLoopResult]: For program point L39-1(lines 39 45) no Hoare annotation was computed. [2020-07-28 17:42:53,734 INFO L264 CegarLoopResult]: At program point L39-2(lines 39 45) the Hoare annotation is: false [2020-07-28 17:42:53,738 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 17:42:53,738 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-28 17:42:53,738 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2020-07-28 17:42:53,738 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2020-07-28 17:42:53,738 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2020-07-28 17:42:53,738 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2020-07-28 17:42:53,738 WARN L170 areAnnotationChecker]: L22-3 has no Hoare annotation [2020-07-28 17:42:53,739 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-28 17:42:53,739 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2020-07-28 17:42:53,739 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-28 17:42:53,739 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-28 17:42:53,739 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2020-07-28 17:42:53,739 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2020-07-28 17:42:53,739 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2020-07-28 17:42:53,739 WARN L170 areAnnotationChecker]: L52-3 has no Hoare annotation [2020-07-28 17:42:53,739 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2020-07-28 17:42:53,740 WARN L170 areAnnotationChecker]: L52-3 has no Hoare annotation [2020-07-28 17:42:53,740 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2020-07-28 17:42:53,740 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2020-07-28 17:42:53,740 WARN L170 areAnnotationChecker]: L52-1 has no Hoare annotation [2020-07-28 17:42:53,740 WARN L170 areAnnotationChecker]: L52-3 has no Hoare annotation [2020-07-28 17:42:53,740 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2020-07-28 17:42:53,740 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2020-07-28 17:42:53,740 WARN L170 areAnnotationChecker]: L52-3 has no Hoare annotation [2020-07-28 17:42:53,740 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2020-07-28 17:42:53,740 WARN L170 areAnnotationChecker]: L39-1 has no Hoare annotation [2020-07-28 17:42:53,740 WARN L170 areAnnotationChecker]: L85 has no Hoare annotation [2020-07-28 17:42:53,741 WARN L170 areAnnotationChecker]: L52-1 has no Hoare annotation [2020-07-28 17:42:53,741 WARN L170 areAnnotationChecker]: L52-1 has no Hoare annotation [2020-07-28 17:42:53,741 WARN L170 areAnnotationChecker]: L85 has no Hoare annotation [2020-07-28 17:42:53,741 WARN L170 areAnnotationChecker]: L85 has no Hoare annotation [2020-07-28 17:42:53,741 WARN L170 areAnnotationChecker]: L65-1 has no Hoare annotation [2020-07-28 17:42:53,741 WARN L170 areAnnotationChecker]: L65-3 has no Hoare annotation [2020-07-28 17:42:53,741 WARN L170 areAnnotationChecker]: L85-2 has no Hoare annotation [2020-07-28 17:42:53,742 WARN L170 areAnnotationChecker]: L85-2 has no Hoare annotation [2020-07-28 17:42:53,742 WARN L170 areAnnotationChecker]: L65-1 has no Hoare annotation [2020-07-28 17:42:53,742 WARN L170 areAnnotationChecker]: L65-1 has no Hoare annotation [2020-07-28 17:42:53,742 WARN L170 areAnnotationChecker]: L65-3 has no Hoare annotation [2020-07-28 17:42:53,742 WARN L170 areAnnotationChecker]: L86 has no Hoare annotation [2020-07-28 17:42:53,742 WARN L170 areAnnotationChecker]: L86 has no Hoare annotation [2020-07-28 17:42:53,742 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 17:42:53,742 WARN L170 areAnnotationChecker]: L85-2 has no Hoare annotation [2020-07-28 17:42:53,742 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 17:42:53,742 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-28 17:42:53,747 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,747 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,748 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,748 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,748 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,748 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,748 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,748 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,749 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2020-07-28 17:42:53,749 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2020-07-28 17:42:53,749 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2020-07-28 17:42:53,749 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2020-07-28 17:42:53,756 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,757 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,757 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,757 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,757 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,758 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,758 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,759 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,759 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2020-07-28 17:42:53,759 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2020-07-28 17:42:53,759 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2020-07-28 17:42:53,760 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2020-07-28 17:42:53,774 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,774 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,775 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,775 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,775 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,776 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,776 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,776 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,776 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2020-07-28 17:42:53,776 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2020-07-28 17:42:53,777 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2020-07-28 17:42:53,777 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2020-07-28 17:42:53,778 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,778 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,778 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,779 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,779 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,779 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,779 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,780 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,783 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2020-07-28 17:42:53,783 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2020-07-28 17:42:53,784 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2020-07-28 17:42:53,784 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2020-07-28 17:42:53,785 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_3,QUANTIFIED] [2020-07-28 17:42:53,789 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_3,QUANTIFIED] [2020-07-28 17:42:53,790 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_3,QUANTIFIED] [2020-07-28 17:42:53,790 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_3,QUANTIFIED] [2020-07-28 17:42:53,790 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,791 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,791 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,791 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,791 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,792 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,792 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,792 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,793 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2020-07-28 17:42:53,793 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2020-07-28 17:42:53,793 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2020-07-28 17:42:53,793 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2020-07-28 17:42:53,795 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_3,QUANTIFIED] [2020-07-28 17:42:53,796 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_3,QUANTIFIED] [2020-07-28 17:42:53,796 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_3,QUANTIFIED] [2020-07-28 17:42:53,796 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_3,QUANTIFIED] [2020-07-28 17:42:53,796 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,797 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,797 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,797 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,797 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,798 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,798 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,798 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,798 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2020-07-28 17:42:53,799 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2020-07-28 17:42:53,799 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2020-07-28 17:42:53,799 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2020-07-28 17:42:53,802 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,802 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,803 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,803 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,803 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,803 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,804 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,804 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,804 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2020-07-28 17:42:53,805 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2020-07-28 17:42:53,805 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2020-07-28 17:42:53,805 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2020-07-28 17:42:53,807 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,808 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,808 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,808 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,809 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,809 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,809 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,809 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,810 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2020-07-28 17:42:53,810 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2020-07-28 17:42:53,810 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2020-07-28 17:42:53,810 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2020-07-28 17:42:53,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 05:42:53 BoogieIcfgContainer [2020-07-28 17:42:53,817 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 17:42:53,818 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 17:42:53,818 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 17:42:53,818 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 17:42:53,819 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:46" (3/4) ... [2020-07-28 17:42:53,825 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-07-28 17:42:53,847 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2020-07-28 17:42:53,847 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2020-07-28 17:42:53,848 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-07-28 17:42:53,875 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((~Pluszero~LONGDOUBLE() == x && (\exists v_skolemized_q#valueAsBitvector_6 : bv64 :: ~bvand32(2147483648bv32, v_skolemized_q#valueAsBitvector_6[63:32]) == signbit && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_6[63:63], v_skolemized_q#valueAsBitvector_6[62:52], v_skolemized_q#valueAsBitvector_6[51:0]) == ~Pluszero~LONGDOUBLE())) && (\exists v_skolemized_q#valueAsBitvector_6 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_6[63:63], v_skolemized_q#valueAsBitvector_6[62:52], v_skolemized_q#valueAsBitvector_6[51:0]) == ~Pluszero~LONGDOUBLE() && v_skolemized_q#valueAsBitvector_6[63:32] == msw)) && (\exists v_skolemized_q#valueAsBitvector_5 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_5[63:63], v_skolemized_q#valueAsBitvector_5[62:52], v_skolemized_q#valueAsBitvector_5[51:0]) == ~Pluszero~LONGDOUBLE() && ~bvadd64(~bvashr32(~bvand32(2146435072bv32, v_skolemized_q#valueAsBitvector_5[63:32]), 20bv32), 4294966273bv32) == exponent_less_1023) [2020-07-28 17:42:53,876 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == ~Pluszero~LONGDOUBLE() && ~Pluszero~LONGDOUBLE() == x) && (\exists v_skolemized_q#valueAsBitvector_6 : bv64 :: ~bvand32(2147483648bv32, v_skolemized_q#valueAsBitvector_6[63:32]) == signbit && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_6[63:63], v_skolemized_q#valueAsBitvector_6[62:52], v_skolemized_q#valueAsBitvector_6[51:0]) == ~Pluszero~LONGDOUBLE())) && (\exists v_skolemized_q#valueAsBitvector_6 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_6[63:63], v_skolemized_q#valueAsBitvector_6[62:52], v_skolemized_q#valueAsBitvector_6[51:0]) == ~Pluszero~LONGDOUBLE() && v_skolemized_q#valueAsBitvector_6[63:32] == msw)) && (\exists v_skolemized_q#valueAsBitvector_5 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_5[63:63], v_skolemized_q#valueAsBitvector_5[62:52], v_skolemized_q#valueAsBitvector_5[51:0]) == ~Pluszero~LONGDOUBLE() && ~bvadd64(~bvashr32(~bvand32(2146435072bv32, v_skolemized_q#valueAsBitvector_5[63:32]), 20bv32), 4294966273bv32) == exponent_less_1023) [2020-07-28 17:42:53,876 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((\result == ~Pluszero~LONGDOUBLE() && ~Pluszero~LONGDOUBLE() == x) && (\exists v_skolemized_q#valueAsBitvector_6 : bv64 :: ~bvand32(2147483648bv32, v_skolemized_q#valueAsBitvector_6[63:32]) == signbit && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_6[63:63], v_skolemized_q#valueAsBitvector_6[62:52], v_skolemized_q#valueAsBitvector_6[51:0]) == ~Pluszero~LONGDOUBLE())) && (\exists v_skolemized_q#valueAsBitvector_6 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_6[63:63], v_skolemized_q#valueAsBitvector_6[62:52], v_skolemized_q#valueAsBitvector_6[51:0]) == ~Pluszero~LONGDOUBLE() && v_skolemized_q#valueAsBitvector_6[63:32] == msw)) && ~Pluszero~LONGDOUBLE() == x) && res == ~Pluszero~LONGDOUBLE()) && (\exists v_skolemized_q#valueAsBitvector_5 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_5[63:63], v_skolemized_q#valueAsBitvector_5[62:52], v_skolemized_q#valueAsBitvector_5[51:0]) == ~Pluszero~LONGDOUBLE() && ~bvadd64(~bvashr32(~bvand32(2146435072bv32, v_skolemized_q#valueAsBitvector_5[63:32]), 20bv32), 4294966273bv32) == exponent_less_1023)) && aux-res == 0.0 && __signbit_double(res) == 0-aux [2020-07-28 17:42:53,877 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((\result == 0bv32 && (\exists v_skolemized_v_prenex_3_3 : bv64 :: msw == v_skolemized_v_prenex_3_3[63:32] && ~fp~LONGDOUBLE(v_skolemized_v_prenex_3_3[63:63], v_skolemized_v_prenex_3_3[62:52], v_skolemized_v_prenex_3_3[51:0]) == ~Pluszero~LONGDOUBLE())) && \result == ~Pluszero~LONGDOUBLE()) && ~Pluszero~LONGDOUBLE() == x) && (\exists v_skolemized_q#valueAsBitvector_6 : bv64 :: ~bvand32(2147483648bv32, v_skolemized_q#valueAsBitvector_6[63:32]) == signbit && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_6[63:63], v_skolemized_q#valueAsBitvector_6[62:52], v_skolemized_q#valueAsBitvector_6[51:0]) == ~Pluszero~LONGDOUBLE())) && (\exists v_skolemized_q#valueAsBitvector_6 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_6[63:63], v_skolemized_q#valueAsBitvector_6[62:52], v_skolemized_q#valueAsBitvector_6[51:0]) == ~Pluszero~LONGDOUBLE() && v_skolemized_q#valueAsBitvector_6[63:32] == msw)) && ~Pluszero~LONGDOUBLE() == x) && res == ~Pluszero~LONGDOUBLE()) && (\exists v_skolemized_q#valueAsBitvector_5 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_5[63:63], v_skolemized_q#valueAsBitvector_5[62:52], v_skolemized_q#valueAsBitvector_5[51:0]) == ~Pluszero~LONGDOUBLE() && ~bvadd64(~bvashr32(~bvand32(2146435072bv32, v_skolemized_q#valueAsBitvector_5[63:32]), 20bv32), 4294966273bv32) == exponent_less_1023)) && aux-res == 0.0 && __signbit_double(res) == 0-aux [2020-07-28 17:42:53,907 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 17:42:53,907 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 17:42:53,909 INFO L168 Benchmark]: Toolchain (without parser) took 8976.60 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 221.8 MB). Free memory was 954.9 MB in the beginning and 982.2 MB in the end (delta: -27.3 MB). Peak memory consumption was 194.5 MB. Max. memory is 11.5 GB. [2020-07-28 17:42:53,910 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 17:42:53,910 INFO L168 Benchmark]: CACSL2BoogieTranslator took 581.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 954.9 MB in the beginning and 1.2 GB in the end (delta: -195.4 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2020-07-28 17:42:53,911 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.07 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 17:42:53,911 INFO L168 Benchmark]: Boogie Preprocessor took 46.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2020-07-28 17:42:53,912 INFO L168 Benchmark]: RCFGBuilder took 717.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.4 MB). Peak memory consumption was 38.4 MB. Max. memory is 11.5 GB. [2020-07-28 17:42:53,913 INFO L168 Benchmark]: TraceAbstraction took 7471.45 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 60.8 MB). Free memory was 1.1 GB in the beginning and 989.6 MB in the end (delta: 120.6 MB). Peak memory consumption was 181.4 MB. Max. memory is 11.5 GB. [2020-07-28 17:42:53,913 INFO L168 Benchmark]: Witness Printer took 90.08 ms. Allocated memory is still 1.3 GB. Free memory was 989.6 MB in the beginning and 982.2 MB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 11.5 GB. [2020-07-28 17:42:53,916 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.29 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 581.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 954.9 MB in the beginning and 1.2 GB in the end (delta: -195.4 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 61.07 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.18 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 717.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.4 MB). Peak memory consumption was 38.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7471.45 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 60.8 MB). Free memory was 1.1 GB in the beginning and 989.6 MB in the end (delta: 120.6 MB). Peak memory consumption was 181.4 MB. Max. memory is 11.5 GB. * Witness Printer took 90.08 ms. Allocated memory is still 1.3 GB. Free memory was 989.6 MB in the beginning and 982.2 MB in the end (delta: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 86]: 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: 65]: Loop Invariant [2020-07-28 17:42:53,941 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,941 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,941 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,942 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,942 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,942 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,942 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,943 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,943 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2020-07-28 17:42:53,943 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2020-07-28 17:42:53,943 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2020-07-28 17:42:53,944 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2020-07-28 17:42:53,944 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,945 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,945 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,945 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,945 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,945 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,946 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,946 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,946 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2020-07-28 17:42:53,946 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2020-07-28 17:42:53,947 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2020-07-28 17:42:53,947 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] Derived loop invariant: ((((((\result == ~Pluszero~LONGDOUBLE() && ~Pluszero~LONGDOUBLE() == x) && (\exists v_skolemized_q#valueAsBitvector_6 : bv64 :: ~bvand32(2147483648bv32, v_skolemized_q#valueAsBitvector_6[63:32]) == signbit && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_6[63:63], v_skolemized_q#valueAsBitvector_6[62:52], v_skolemized_q#valueAsBitvector_6[51:0]) == ~Pluszero~LONGDOUBLE())) && (\exists v_skolemized_q#valueAsBitvector_6 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_6[63:63], v_skolemized_q#valueAsBitvector_6[62:52], v_skolemized_q#valueAsBitvector_6[51:0]) == ~Pluszero~LONGDOUBLE() && v_skolemized_q#valueAsBitvector_6[63:32] == msw)) && ~Pluszero~LONGDOUBLE() == x) && res == ~Pluszero~LONGDOUBLE()) && (\exists v_skolemized_q#valueAsBitvector_5 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_5[63:63], v_skolemized_q#valueAsBitvector_5[62:52], v_skolemized_q#valueAsBitvector_5[51:0]) == ~Pluszero~LONGDOUBLE() && ~bvadd64(~bvashr32(~bvand32(2146435072bv32, v_skolemized_q#valueAsBitvector_5[63:32]), 20bv32), 4294966273bv32) == exponent_less_1023)) && aux-res == 0.0 && __signbit_double(res) == 0-aux - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 17]: Loop Invariant [2020-07-28 17:42:53,948 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,949 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,949 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,949 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,949 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,950 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,950 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,950 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,950 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2020-07-28 17:42:53,950 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2020-07-28 17:42:53,951 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2020-07-28 17:42:53,951 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2020-07-28 17:42:53,951 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,952 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,952 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,952 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,952 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,953 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,953 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,953 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,953 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2020-07-28 17:42:53,953 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2020-07-28 17:42:53,954 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2020-07-28 17:42:53,954 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] Derived loop invariant: (((\result == ~Pluszero~LONGDOUBLE() && ~Pluszero~LONGDOUBLE() == x) && (\exists v_skolemized_q#valueAsBitvector_6 : bv64 :: ~bvand32(2147483648bv32, v_skolemized_q#valueAsBitvector_6[63:32]) == signbit && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_6[63:63], v_skolemized_q#valueAsBitvector_6[62:52], v_skolemized_q#valueAsBitvector_6[51:0]) == ~Pluszero~LONGDOUBLE())) && (\exists v_skolemized_q#valueAsBitvector_6 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_6[63:63], v_skolemized_q#valueAsBitvector_6[62:52], v_skolemized_q#valueAsBitvector_6[51:0]) == ~Pluszero~LONGDOUBLE() && v_skolemized_q#valueAsBitvector_6[63:32] == msw)) && (\exists v_skolemized_q#valueAsBitvector_5 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_5[63:63], v_skolemized_q#valueAsBitvector_5[62:52], v_skolemized_q#valueAsBitvector_5[51:0]) == ~Pluszero~LONGDOUBLE() && ~bvadd64(~bvashr32(~bvand32(2146435072bv32, v_skolemized_q#valueAsBitvector_5[63:32]), 20bv32), 4294966273bv32) == exponent_less_1023) - InvariantResult [Line: 62]: Loop Invariant [2020-07-28 17:42:53,955 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_3,QUANTIFIED] [2020-07-28 17:42:53,955 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_3,QUANTIFIED] [2020-07-28 17:42:53,955 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_3,QUANTIFIED] [2020-07-28 17:42:53,955 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_3,QUANTIFIED] [2020-07-28 17:42:53,956 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,956 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,956 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,956 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,957 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,957 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,957 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,957 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,957 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2020-07-28 17:42:53,958 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2020-07-28 17:42:53,958 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2020-07-28 17:42:53,958 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2020-07-28 17:42:53,959 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_3,QUANTIFIED] [2020-07-28 17:42:53,959 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_3,QUANTIFIED] [2020-07-28 17:42:53,959 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_3,QUANTIFIED] [2020-07-28 17:42:53,959 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_3,QUANTIFIED] [2020-07-28 17:42:53,960 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,960 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,960 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,960 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,961 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,961 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,961 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,961 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,962 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2020-07-28 17:42:53,962 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2020-07-28 17:42:53,962 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2020-07-28 17:42:53,962 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] Derived loop invariant: ((((((((\result == 0bv32 && (\exists v_skolemized_v_prenex_3_3 : bv64 :: msw == v_skolemized_v_prenex_3_3[63:32] && ~fp~LONGDOUBLE(v_skolemized_v_prenex_3_3[63:63], v_skolemized_v_prenex_3_3[62:52], v_skolemized_v_prenex_3_3[51:0]) == ~Pluszero~LONGDOUBLE())) && \result == ~Pluszero~LONGDOUBLE()) && ~Pluszero~LONGDOUBLE() == x) && (\exists v_skolemized_q#valueAsBitvector_6 : bv64 :: ~bvand32(2147483648bv32, v_skolemized_q#valueAsBitvector_6[63:32]) == signbit && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_6[63:63], v_skolemized_q#valueAsBitvector_6[62:52], v_skolemized_q#valueAsBitvector_6[51:0]) == ~Pluszero~LONGDOUBLE())) && (\exists v_skolemized_q#valueAsBitvector_6 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_6[63:63], v_skolemized_q#valueAsBitvector_6[62:52], v_skolemized_q#valueAsBitvector_6[51:0]) == ~Pluszero~LONGDOUBLE() && v_skolemized_q#valueAsBitvector_6[63:32] == msw)) && ~Pluszero~LONGDOUBLE() == x) && res == ~Pluszero~LONGDOUBLE()) && (\exists v_skolemized_q#valueAsBitvector_5 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_5[63:63], v_skolemized_q#valueAsBitvector_5[62:52], v_skolemized_q#valueAsBitvector_5[51:0]) == ~Pluszero~LONGDOUBLE() && ~bvadd64(~bvashr32(~bvand32(2146435072bv32, v_skolemized_q#valueAsBitvector_5[63:32]), 20bv32), 4294966273bv32) == exponent_less_1023)) && aux-res == 0.0 && __signbit_double(res) == 0-aux - InvariantResult [Line: 52]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 32]: Loop Invariant [2020-07-28 17:42:53,963 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,964 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,964 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,964 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,964 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,964 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,965 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,965 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,965 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2020-07-28 17:42:53,965 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2020-07-28 17:42:53,965 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2020-07-28 17:42:53,966 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2020-07-28 17:42:53,966 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,966 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,967 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,967 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,967 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,967 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,968 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,968 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-07-28 17:42:53,968 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2020-07-28 17:42:53,968 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2020-07-28 17:42:53,968 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2020-07-28 17:42:53,969 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] Derived loop invariant: ((~Pluszero~LONGDOUBLE() == x && (\exists v_skolemized_q#valueAsBitvector_6 : bv64 :: ~bvand32(2147483648bv32, v_skolemized_q#valueAsBitvector_6[63:32]) == signbit && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_6[63:63], v_skolemized_q#valueAsBitvector_6[62:52], v_skolemized_q#valueAsBitvector_6[51:0]) == ~Pluszero~LONGDOUBLE())) && (\exists v_skolemized_q#valueAsBitvector_6 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_6[63:63], v_skolemized_q#valueAsBitvector_6[62:52], v_skolemized_q#valueAsBitvector_6[51:0]) == ~Pluszero~LONGDOUBLE() && v_skolemized_q#valueAsBitvector_6[63:32] == msw)) && (\exists v_skolemized_q#valueAsBitvector_5 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_5[63:63], v_skolemized_q#valueAsBitvector_5[62:52], v_skolemized_q#valueAsBitvector_5[51:0]) == ~Pluszero~LONGDOUBLE() && ~bvadd64(~bvashr32(~bvand32(2146435072bv32, v_skolemized_q#valueAsBitvector_5[63:32]), 20bv32), 4294966273bv32) == exponent_less_1023) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: ~Pluszero~LONGDOUBLE() == x - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 6.8s, OverallIterations: 4, TraceHistogramMax: 1, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 67 SDtfs, 155 SDslu, 78 SDs, 0 SdLazy, 78 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 14 NumberOfFragments, 275 HoareAnnotationTreeSize, 8 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 278 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 55 NumberOfCodeBlocks, 55 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 102 ConstructedInterpolants, 28 QuantifiedInterpolants, 10554 SizeOfPredicates, 29 NumberOfNonLiveVariables, 157 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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...