./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_1011a.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_1011a.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 84d0ee37d85bbc2c0fd59ce938796111cbf21a8f ..................................................................................................................................................................................................................................................................................................................................................... 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_1011a.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 84d0ee37d85bbc2c0fd59ce938796111cbf21a8f ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 17:41:41,604 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 17:41:41,606 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 17:41:41,619 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 17:41:41,620 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 17:41:41,621 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 17:41:41,623 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 17:41:41,625 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 17:41:41,627 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 17:41:41,629 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 17:41:41,630 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 17:41:41,632 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 17:41:41,632 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 17:41:41,633 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 17:41:41,635 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 17:41:41,636 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 17:41:41,637 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 17:41:41,638 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 17:41:41,641 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 17:41:41,643 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 17:41:41,645 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 17:41:41,647 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 17:41:41,648 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 17:41:41,649 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 17:41:41,653 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 17:41:41,653 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 17:41:41,654 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 17:41:41,655 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 17:41:41,655 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 17:41:41,657 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 17:41:41,657 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 17:41:41,658 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 17:41:41,659 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 17:41:41,660 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 17:41:41,661 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 17:41:41,662 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 17:41:41,663 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 17:41:41,663 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 17:41:41,663 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 17:41:41,665 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 17:41:41,666 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 17:41:41,667 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:41:41,683 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 17:41:41,683 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 17:41:41,685 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 17:41:41,685 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 17:41:41,686 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 17:41:41,686 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 17:41:41,686 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 17:41:41,687 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 17:41:41,687 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 17:41:41,687 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 17:41:41,687 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 17:41:41,688 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 17:41:41,688 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 17:41:41,688 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 17:41:41,688 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 17:41:41,689 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 17:41:41,689 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 17:41:41,689 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 17:41:41,690 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 17:41:41,690 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 17:41:41,690 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 17:41:41,691 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 17:41:41,691 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 17:41:41,691 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 17:41:41,692 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 17:41:41,692 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 17:41:41,692 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 17:41:41,692 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 17:41:41,693 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 17:41:41,693 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 -> 84d0ee37d85bbc2c0fd59ce938796111cbf21a8f [2020-07-28 17:41:42,020 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 17:41:42,034 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 17:41:42,038 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 17:41:42,039 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 17:41:42,040 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 17:41:42,041 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1011a.c [2020-07-28 17:41:42,116 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4216286d5/7276922524ae41b8b03e75c1b9ff273a/FLAG64985fb04 [2020-07-28 17:41:42,597 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 17:41:42,598 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1011a.c [2020-07-28 17:41:42,603 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4216286d5/7276922524ae41b8b03e75c1b9ff273a/FLAG64985fb04 [2020-07-28 17:41:42,963 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4216286d5/7276922524ae41b8b03e75c1b9ff273a [2020-07-28 17:41:42,967 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 17:41:42,969 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 17:41:42,971 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 17:41:42,971 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 17:41:42,974 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 17:41:42,976 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:41:42" (1/1) ... [2020-07-28 17:41:42,979 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27b299c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:41:42, skipping insertion in model container [2020-07-28 17:41:42,980 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:41:42" (1/1) ... [2020-07-28 17:41:42,988 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 17:41:43,010 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 17:41:43,221 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:41:43,226 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 17:41:43,261 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:41:43,286 INFO L208 MainTranslator]: Completed translation [2020-07-28 17:41:43,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:41:43 WrapperNode [2020-07-28 17:41:43,287 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 17:41:43,288 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 17:41:43,288 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 17:41:43,288 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 17:41:43,298 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:41:43" (1/1) ... [2020-07-28 17:41:43,369 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:41:43" (1/1) ... [2020-07-28 17:41:43,420 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 17:41:43,421 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 17:41:43,421 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 17:41:43,421 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 17:41:43,432 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:41:43" (1/1) ... [2020-07-28 17:41:43,432 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:41:43" (1/1) ... [2020-07-28 17:41:43,439 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:41:43" (1/1) ... [2020-07-28 17:41:43,439 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:41:43" (1/1) ... [2020-07-28 17:41:43,451 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:41:43" (1/1) ... [2020-07-28 17:41:43,456 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:41:43" (1/1) ... [2020-07-28 17:41:43,458 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:41:43" (1/1) ... [2020-07-28 17:41:43,461 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 17:41:43,462 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 17:41:43,462 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 17:41:43,462 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 17:41:43,466 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:41:43" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 17:41:43,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-07-28 17:41:43,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-28 17:41:43,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-07-28 17:41:43,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 17:41:43,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 17:41:43,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-28 17:41:43,530 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-28 17:41:43,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-28 17:41:43,865 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 17:41:43,866 INFO L295 CfgBuilder]: Removed 14 assume(true) statements. [2020-07-28 17:41:43,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:41:43 BoogieIcfgContainer [2020-07-28 17:41:43,875 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 17:41:43,878 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 17:41:43,878 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 17:41:43,881 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 17:41:43,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 05:41:42" (1/3) ... [2020-07-28 17:41:43,885 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48635c93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:41:43, skipping insertion in model container [2020-07-28 17:41:43,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:41:43" (2/3) ... [2020-07-28 17:41:43,887 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48635c93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:41:43, skipping insertion in model container [2020-07-28 17:41:43,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:41:43" (3/3) ... [2020-07-28 17:41:43,894 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1011a.c [2020-07-28 17:41:43,914 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 17:41:43,924 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 17:41:43,941 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 17:41:43,968 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 17:41:43,969 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 17:41:43,969 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 17:41:43,969 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 17:41:43,970 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 17:41:43,970 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 17:41:43,970 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 17:41:43,971 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 17:41:43,988 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2020-07-28 17:41:43,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-07-28 17:41:43,995 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:41:43,996 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:41:43,997 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:41:44,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:41:44,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1641221055, now seen corresponding path program 1 times [2020-07-28 17:41:44,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:41:44,017 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210610894] [2020-07-28 17:41:44,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:41:44,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:41:44,153 INFO L280 TraceCheckUtils]: 0: Hoare triple {22#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {22#true} is VALID [2020-07-28 17:41:44,154 INFO L280 TraceCheckUtils]: 1: Hoare triple {22#true} havoc main_#res;havoc main_#t~ret6, main_#t~ret7, main_#t~short8, main_~x~0, main_~res~0;main_~x~0 := 0.0;fabs_double_#in~x := main_~x~0;havoc fabs_double_#res;havoc fabs_double_#t~mem2, fabs_double_#t~union3, fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset, fabs_double_#t~mem4, fabs_double_#t~union5.lsw, fabs_double_#t~union5.msw, fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset, fabs_double_~x, fabs_double_~high~0;fabs_double_~x := fabs_double_#in~x;havoc fabs_double_~high~0; {22#true} is VALID [2020-07-28 17:41:44,155 INFO L280 TraceCheckUtils]: 2: Hoare triple {22#true} assume !true; {23#false} is VALID [2020-07-28 17:41:44,156 INFO L280 TraceCheckUtils]: 3: Hoare triple {23#false} assume !true; {23#false} is VALID [2020-07-28 17:41:44,156 INFO L280 TraceCheckUtils]: 4: Hoare triple {23#false} fabs_double_#res := fabs_double_~x; {23#false} is VALID [2020-07-28 17:41:44,156 INFO L280 TraceCheckUtils]: 5: Hoare triple {23#false} main_#t~ret6 := fabs_double_#res;main_~res~0 := main_#t~ret6;havoc main_#t~ret6;main_#t~short8 := ~someBinaryDOUBLEComparisonOperation(main_~res~0, 0.0); {23#false} is VALID [2020-07-28 17:41:44,156 INFO L280 TraceCheckUtils]: 6: Hoare triple {23#false} assume !main_#t~short8; {23#false} is VALID [2020-07-28 17:41:44,157 INFO L280 TraceCheckUtils]: 7: Hoare triple {23#false} assume !main_#t~short8;havoc main_#t~ret7;havoc main_#t~short8; {23#false} is VALID [2020-07-28 17:41:44,157 INFO L280 TraceCheckUtils]: 8: Hoare triple {23#false} assume !false; {23#false} is VALID [2020-07-28 17:41:44,160 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:41:44,161 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210610894] [2020-07-28 17:41:44,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:41:44,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-28 17:41:44,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215678041] [2020-07-28 17:41:44,170 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2020-07-28 17:41:44,172 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:41:44,176 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 17:41:44,216 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:41:44,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 17:41:44,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:41:44,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 17:41:44,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 17:41:44,230 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2020-07-28 17:41:44,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:41:44,313 INFO L93 Difference]: Finished difference Result 36 states and 50 transitions. [2020-07-28 17:41:44,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 17:41:44,314 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2020-07-28 17:41:44,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:41:44,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:41:44,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 50 transitions. [2020-07-28 17:41:44,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:41:44,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 50 transitions. [2020-07-28 17:41:44,326 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 50 transitions. [2020-07-28 17:41:44,417 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:41:44,429 INFO L225 Difference]: With dead ends: 36 [2020-07-28 17:41:44,429 INFO L226 Difference]: Without dead ends: 16 [2020-07-28 17:41:44,433 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:41:44,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-07-28 17:41:44,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-07-28 17:41:44,467 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:41:44,468 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2020-07-28 17:41:44,469 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2020-07-28 17:41:44,469 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2020-07-28 17:41:44,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:41:44,472 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2020-07-28 17:41:44,472 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2020-07-28 17:41:44,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:41:44,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:41:44,473 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2020-07-28 17:41:44,473 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2020-07-28 17:41:44,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:41:44,476 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2020-07-28 17:41:44,476 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2020-07-28 17:41:44,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:41:44,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:41:44,477 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:41:44,477 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:41:44,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-28 17:41:44,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2020-07-28 17:41:44,481 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 9 [2020-07-28 17:41:44,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:41:44,482 INFO L479 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2020-07-28 17:41:44,482 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 17:41:44,482 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2020-07-28 17:41:44,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-28 17:41:44,482 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:41:44,483 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:41:44,483 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 17:41:44,483 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:41:44,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:41:44,484 INFO L82 PathProgramCache]: Analyzing trace with hash 558264036, now seen corresponding path program 1 times [2020-07-28 17:41:44,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:41:44,484 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729133916] [2020-07-28 17:41:44,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:41:44,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 17:41:44,527 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 17:41:44,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 17:41:44,553 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 17:41:44,583 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-28 17:41:44,583 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-28 17:41:44,585 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-28 17:41:44,611 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 17:41:44,612 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-28 17:41:44,612 WARN L170 areAnnotationChecker]: L27-2 has no Hoare annotation [2020-07-28 17:41:44,612 WARN L170 areAnnotationChecker]: L27-2 has no Hoare annotation [2020-07-28 17:41:44,612 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2020-07-28 17:41:44,613 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2020-07-28 17:41:44,613 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2020-07-28 17:41:44,613 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2020-07-28 17:41:44,613 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-28 17:41:44,613 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-28 17:41:44,614 WARN L170 areAnnotationChecker]: L32-2 has no Hoare annotation [2020-07-28 17:41:44,614 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-28 17:41:44,614 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2020-07-28 17:41:44,614 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2020-07-28 17:41:44,614 WARN L170 areAnnotationChecker]: L17-2 has no Hoare annotation [2020-07-28 17:41:44,615 WARN L170 areAnnotationChecker]: L17-2 has no Hoare annotation [2020-07-28 17:41:44,615 WARN L170 areAnnotationChecker]: L51-2 has no Hoare annotation [2020-07-28 17:41:44,615 WARN L170 areAnnotationChecker]: L51-2 has no Hoare annotation [2020-07-28 17:41:44,615 WARN L170 areAnnotationChecker]: L17-1 has no Hoare annotation [2020-07-28 17:41:44,616 WARN L170 areAnnotationChecker]: L17-1 has no Hoare annotation [2020-07-28 17:41:44,616 WARN L170 areAnnotationChecker]: L17-3 has no Hoare annotation [2020-07-28 17:41:44,616 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2020-07-28 17:41:44,616 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2020-07-28 17:41:44,616 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2020-07-28 17:41:44,617 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-28 17:41:44,617 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 17:41:44,617 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:41:44,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 05:41:44 BoogieIcfgContainer [2020-07-28 17:41:44,620 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 17:41:44,620 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 17:41:44,621 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 17:41:44,621 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 17:41:44,622 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:41:43" (3/4) ... [2020-07-28 17:41:44,626 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-28 17:41:44,626 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 17:41:44,630 INFO L168 Benchmark]: Toolchain (without parser) took 1660.81 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 88.1 MB). Free memory was 956.2 MB in the beginning and 997.0 MB in the end (delta: -40.8 MB). Peak memory consumption was 47.3 MB. Max. memory is 11.5 GB. [2020-07-28 17:41:44,631 INFO L168 Benchmark]: CDTParser took 0.40 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:41:44,632 INFO L168 Benchmark]: CACSL2BoogieTranslator took 316.89 ms. Allocated memory is still 1.0 GB. Free memory was 956.2 MB in the beginning and 945.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-28 17:41:44,633 INFO L168 Benchmark]: Boogie Procedure Inliner took 132.95 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 88.1 MB). Free memory was 945.5 MB in the beginning and 1.1 GB in the end (delta: -131.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-28 17:41:44,634 INFO L168 Benchmark]: Boogie Preprocessor took 40.55 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:41:44,635 INFO L168 Benchmark]: RCFGBuilder took 413.21 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: 32.1 MB). Peak memory consumption was 32.1 MB. Max. memory is 11.5 GB. [2020-07-28 17:41:44,635 INFO L168 Benchmark]: TraceAbstraction took 742.46 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 41.2 MB). Peak memory consumption was 41.2 MB. Max. memory is 11.5 GB. [2020-07-28 17:41:44,636 INFO L168 Benchmark]: Witness Printer took 6.16 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 997.0 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2020-07-28 17:41:44,641 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.40 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 316.89 ms. Allocated memory is still 1.0 GB. Free memory was 956.2 MB in the beginning and 945.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 132.95 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 88.1 MB). Free memory was 945.5 MB in the beginning and 1.1 GB in the end (delta: -131.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.55 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 413.21 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: 32.1 MB). Peak memory consumption was 32.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 742.46 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 41.2 MB). Peak memory consumption was 41.2 MB. Max. memory is 11.5 GB. * Witness Printer took 6.16 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 997.0 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 52]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 51, overapproximation of bitwiseAnd at line 35. Possible FailurePath: [L47] double x = 0.0; [L26] __uint32_t high; [L28] ieee_double_shape_type gh_u; [L29] gh_u.value = (x) [L30] EXPR gh_u.parts.msw [L30] (high) = gh_u.parts.msw [L33] ieee_double_shape_type sh_u; [L34] sh_u.value = (x) [L35] sh_u.parts.msw = (high & 0x7fffffff) [L36] EXPR sh_u.value [L36] (x) = sh_u.value [L38] return x; [L48] double res = fabs_double(x); [L51] EXPR res == 0.0 && __signbit_double(res) == 0 [L51] COND TRUE !(res == 0.0 && __signbit_double(res) == 0) [L52] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 0.6s, OverallIterations: 2, TraceHistogramMax: 1, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 19 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 20 NumberOfCodeBlocks, 20 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 8 ConstructedInterpolants, 0 QuantifiedInterpolants, 64 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 17:41:46,650 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 17:41:46,653 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 17:41:46,666 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 17:41:46,666 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 17:41:46,668 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 17:41:46,669 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 17:41:46,672 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 17:41:46,674 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 17:41:46,675 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 17:41:46,676 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 17:41:46,678 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 17:41:46,678 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 17:41:46,679 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 17:41:46,681 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 17:41:46,682 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 17:41:46,683 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 17:41:46,684 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 17:41:46,686 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 17:41:46,690 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 17:41:46,692 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 17:41:46,696 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 17:41:46,698 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 17:41:46,701 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 17:41:46,706 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 17:41:46,706 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 17:41:46,706 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 17:41:46,707 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 17:41:46,708 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 17:41:46,709 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 17:41:46,709 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 17:41:46,710 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 17:41:46,711 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 17:41:46,711 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 17:41:46,712 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 17:41:46,713 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 17:41:46,714 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 17:41:46,714 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 17:41:46,714 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 17:41:46,715 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 17:41:46,716 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 17:41:46,717 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:41:46,732 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 17:41:46,732 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 17:41:46,733 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 17:41:46,734 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 17:41:46,734 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 17:41:46,734 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 17:41:46,734 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 17:41:46,735 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 17:41:46,735 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 17:41:46,735 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 17:41:46,735 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 17:41:46,735 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 17:41:46,736 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-07-28 17:41:46,736 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-07-28 17:41:46,736 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 17:41:46,736 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 17:41:46,736 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 17:41:46,737 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 17:41:46,737 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 17:41:46,737 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 17:41:46,737 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 17:41:46,737 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 17:41:46,738 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 17:41:46,738 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 17:41:46,738 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 17:41:46,738 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 17:41:46,739 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-07-28 17:41:46,739 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-07-28 17:41:46,739 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 17:41:46,739 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 17:41:46,739 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-28 17:41:46,740 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 -> 84d0ee37d85bbc2c0fd59ce938796111cbf21a8f [2020-07-28 17:41:47,055 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 17:41:47,071 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 17:41:47,074 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 17:41:47,076 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 17:41:47,076 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 17:41:47,077 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1011a.c [2020-07-28 17:41:47,153 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0fedbbd0/a48923736b5349eba105c2d132c4b38d/FLAGb9189387a [2020-07-28 17:41:47,639 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 17:41:47,639 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1011a.c [2020-07-28 17:41:47,648 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0fedbbd0/a48923736b5349eba105c2d132c4b38d/FLAGb9189387a [2020-07-28 17:41:47,995 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0fedbbd0/a48923736b5349eba105c2d132c4b38d [2020-07-28 17:41:47,999 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 17:41:48,002 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 17:41:48,006 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 17:41:48,006 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 17:41:48,010 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 17:41:48,011 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:41:47" (1/1) ... [2020-07-28 17:41:48,015 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f7c72a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:41:48, skipping insertion in model container [2020-07-28 17:41:48,016 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:41:47" (1/1) ... [2020-07-28 17:41:48,025 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 17:41:48,050 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 17:41:48,270 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:41:48,277 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 17:41:48,303 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:41:48,394 INFO L208 MainTranslator]: Completed translation [2020-07-28 17:41:48,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:41:48 WrapperNode [2020-07-28 17:41:48,395 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 17:41:48,397 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 17:41:48,397 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 17:41:48,397 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 17:41:48,408 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:41:48" (1/1) ... [2020-07-28 17:41:48,434 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:41:48" (1/1) ... [2020-07-28 17:41:48,462 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 17:41:48,462 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 17:41:48,463 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 17:41:48,463 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 17:41:48,473 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:41:48" (1/1) ... [2020-07-28 17:41:48,473 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:41:48" (1/1) ... [2020-07-28 17:41:48,477 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:41:48" (1/1) ... [2020-07-28 17:41:48,478 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:41:48" (1/1) ... [2020-07-28 17:41:48,491 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:41:48" (1/1) ... [2020-07-28 17:41:48,497 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:41:48" (1/1) ... [2020-07-28 17:41:48,499 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:41:48" (1/1) ... [2020-07-28 17:41:48,508 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 17:41:48,509 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 17:41:48,509 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 17:41:48,510 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 17:41:48,511 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:41:48" (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:41:48,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2020-07-28 17:41:48,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2020-07-28 17:41:48,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-28 17:41:48,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2020-07-28 17:41:48,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 17:41:48,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 17:41:48,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2020-07-28 17:41:48,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-28 17:41:49,031 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 17:41:49,031 INFO L295 CfgBuilder]: Removed 14 assume(true) statements. [2020-07-28 17:41:49,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:41:49 BoogieIcfgContainer [2020-07-28 17:41:49,035 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 17:41:49,036 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 17:41:49,037 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 17:41:49,040 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 17:41:49,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 05:41:47" (1/3) ... [2020-07-28 17:41:49,041 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ba42b00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:41:49, skipping insertion in model container [2020-07-28 17:41:49,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:41:48" (2/3) ... [2020-07-28 17:41:49,042 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ba42b00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:41:49, skipping insertion in model container [2020-07-28 17:41:49,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:41:49" (3/3) ... [2020-07-28 17:41:49,044 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1011a.c [2020-07-28 17:41:49,054 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 17:41:49,064 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 17:41:49,075 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 17:41:49,094 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 17:41:49,094 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 17:41:49,094 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 17:41:49,095 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 17:41:49,095 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 17:41:49,095 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 17:41:49,095 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 17:41:49,095 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 17:41:49,109 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2020-07-28 17:41:49,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-07-28 17:41:49,114 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:41:49,115 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:41:49,115 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:41:49,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:41:49,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1641221055, now seen corresponding path program 1 times [2020-07-28 17:41:49,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 17:41:49,133 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1087511395] [2020-07-28 17:41:49,133 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:41:49,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:41:49,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 1 conjunts are in the unsatisfiable core [2020-07-28 17:41:49,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:41:49,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 17:41:49,273 INFO L280 TraceCheckUtils]: 0: Hoare triple {22#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {22#true} is VALID [2020-07-28 17:41:49,275 INFO L280 TraceCheckUtils]: 1: Hoare triple {22#true} havoc main_#res;havoc main_#t~ret6, main_#t~ret7, main_#t~short8, main_~x~0, main_~res~0;main_~x~0 := ~Pluszero~DOUBLE();fabs_double_#in~x := main_~x~0;havoc fabs_double_#res;havoc fabs_double_#t~mem2, fabs_double_#t~union3, fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset, fabs_double_#t~mem4, fabs_double_#t~union5.lsw, fabs_double_#t~union5.msw, fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset, fabs_double_~x, fabs_double_~high~0;fabs_double_~x := fabs_double_#in~x;havoc fabs_double_~high~0; {22#true} is VALID [2020-07-28 17:41:49,276 INFO L280 TraceCheckUtils]: 2: Hoare triple {22#true} assume !true; {23#false} is VALID [2020-07-28 17:41:49,277 INFO L280 TraceCheckUtils]: 3: Hoare triple {23#false} assume !true; {23#false} is VALID [2020-07-28 17:41:49,277 INFO L280 TraceCheckUtils]: 4: Hoare triple {23#false} fabs_double_#res := fabs_double_~x; {23#false} is VALID [2020-07-28 17:41:49,278 INFO L280 TraceCheckUtils]: 5: Hoare triple {23#false} main_#t~ret6 := fabs_double_#res;main_~res~0 := main_#t~ret6;havoc main_#t~ret6;main_#t~short8 := ~fp.eq~DOUBLE(main_~res~0, ~Pluszero~DOUBLE()); {23#false} is VALID [2020-07-28 17:41:49,278 INFO L280 TraceCheckUtils]: 6: Hoare triple {23#false} assume !main_#t~short8; {23#false} is VALID [2020-07-28 17:41:49,278 INFO L280 TraceCheckUtils]: 7: Hoare triple {23#false} assume !main_#t~short8;havoc main_#t~ret7;havoc main_#t~short8; {23#false} is VALID [2020-07-28 17:41:49,278 INFO L280 TraceCheckUtils]: 8: Hoare triple {23#false} assume !false; {23#false} is VALID [2020-07-28 17:41:49,282 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:41:49,282 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 17:41:49,301 INFO L280 TraceCheckUtils]: 8: Hoare triple {23#false} assume !false; {23#false} is VALID [2020-07-28 17:41:49,301 INFO L280 TraceCheckUtils]: 7: Hoare triple {23#false} assume !main_#t~short8;havoc main_#t~ret7;havoc main_#t~short8; {23#false} is VALID [2020-07-28 17:41:49,301 INFO L280 TraceCheckUtils]: 6: Hoare triple {23#false} assume !main_#t~short8; {23#false} is VALID [2020-07-28 17:41:49,302 INFO L280 TraceCheckUtils]: 5: Hoare triple {23#false} main_#t~ret6 := fabs_double_#res;main_~res~0 := main_#t~ret6;havoc main_#t~ret6;main_#t~short8 := ~fp.eq~DOUBLE(main_~res~0, ~Pluszero~DOUBLE()); {23#false} is VALID [2020-07-28 17:41:49,302 INFO L280 TraceCheckUtils]: 4: Hoare triple {23#false} fabs_double_#res := fabs_double_~x; {23#false} is VALID [2020-07-28 17:41:49,303 INFO L280 TraceCheckUtils]: 3: Hoare triple {23#false} assume !true; {23#false} is VALID [2020-07-28 17:41:49,304 INFO L280 TraceCheckUtils]: 2: Hoare triple {22#true} assume !true; {23#false} is VALID [2020-07-28 17:41:49,304 INFO L280 TraceCheckUtils]: 1: Hoare triple {22#true} havoc main_#res;havoc main_#t~ret6, main_#t~ret7, main_#t~short8, main_~x~0, main_~res~0;main_~x~0 := ~Pluszero~DOUBLE();fabs_double_#in~x := main_~x~0;havoc fabs_double_#res;havoc fabs_double_#t~mem2, fabs_double_#t~union3, fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset, fabs_double_#t~mem4, fabs_double_#t~union5.lsw, fabs_double_#t~union5.msw, fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset, fabs_double_~x, fabs_double_~high~0;fabs_double_~x := fabs_double_#in~x;havoc fabs_double_~high~0; {22#true} is VALID [2020-07-28 17:41:49,305 INFO L280 TraceCheckUtils]: 0: Hoare triple {22#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {22#true} is VALID [2020-07-28 17:41:49,305 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:41:49,306 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1087511395] [2020-07-28 17:41:49,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:41:49,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-07-28 17:41:49,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245216850] [2020-07-28 17:41:49,314 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2020-07-28 17:41:49,315 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:41:49,318 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 17:41:49,350 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:41:49,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 17:41:49,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 17:41:49,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 17:41:49,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 17:41:49,361 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2020-07-28 17:41:49,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:41:49,446 INFO L93 Difference]: Finished difference Result 36 states and 50 transitions. [2020-07-28 17:41:49,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 17:41:49,447 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2020-07-28 17:41:49,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:41:49,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:41:49,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 50 transitions. [2020-07-28 17:41:49,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:41:49,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 50 transitions. [2020-07-28 17:41:49,460 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 50 transitions. [2020-07-28 17:41:49,549 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:41:49,560 INFO L225 Difference]: With dead ends: 36 [2020-07-28 17:41:49,561 INFO L226 Difference]: Without dead ends: 16 [2020-07-28 17:41:49,564 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 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:41:49,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-07-28 17:41:49,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-07-28 17:41:49,599 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:41:49,600 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2020-07-28 17:41:49,600 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2020-07-28 17:41:49,600 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2020-07-28 17:41:49,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:41:49,603 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2020-07-28 17:41:49,604 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2020-07-28 17:41:49,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:41:49,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:41:49,605 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2020-07-28 17:41:49,605 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2020-07-28 17:41:49,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:41:49,607 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2020-07-28 17:41:49,607 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2020-07-28 17:41:49,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:41:49,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:41:49,608 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:41:49,608 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:41:49,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-28 17:41:49,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2020-07-28 17:41:49,612 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 9 [2020-07-28 17:41:49,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:41:49,613 INFO L479 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2020-07-28 17:41:49,613 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 17:41:49,613 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2020-07-28 17:41:49,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-28 17:41:49,614 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:41:49,614 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:41:49,838 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-07-28 17:41:49,838 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:41:49,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:41:49,839 INFO L82 PathProgramCache]: Analyzing trace with hash 558264036, now seen corresponding path program 1 times [2020-07-28 17:41:49,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 17:41:49,841 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1304699298] [2020-07-28 17:41:49,842 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:41:49,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:41:49,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 13 conjunts are in the unsatisfiable core [2020-07-28 17:41:49,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:41:49,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 17:41:50,131 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 66 treesize of output 60 [2020-07-28 17:41:50,146 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-28 17:41:50,154 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 17:41:50,154 INFO L544 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-28 17:41:50,177 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 17:41:50,179 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-28 17:41:50,180 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:85, output treesize:46 [2020-07-28 17:41:50,241 INFO L280 TraceCheckUtils]: 0: Hoare triple {172#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {172#true} is VALID [2020-07-28 17:41:50,242 INFO L280 TraceCheckUtils]: 1: Hoare triple {172#true} havoc main_#res;havoc main_#t~ret6, main_#t~ret7, main_#t~short8, main_~x~0, main_~res~0;main_~x~0 := ~Pluszero~DOUBLE();fabs_double_#in~x := main_~x~0;havoc fabs_double_#res;havoc fabs_double_#t~mem2, fabs_double_#t~union3, fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset, fabs_double_#t~mem4, fabs_double_#t~union5.lsw, fabs_double_#t~union5.msw, fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset, fabs_double_~x, fabs_double_~high~0;fabs_double_~x := fabs_double_#in~x;havoc fabs_double_~high~0; {180#(= ULTIMATE.start_fabs_double_~x (_ +zero 11 53))} is VALID [2020-07-28 17:41:50,247 INFO L280 TraceCheckUtils]: 2: Hoare triple {180#(= ULTIMATE.start_fabs_double_~x (_ +zero 11 53))} call fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(fabs_double_~x, fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset, 8bv32);call fabs_double_#t~mem2 := read~intINTTYPE4(fabs_double_~#gh_u~1.base, ~bvadd32(4bv32, fabs_double_~#gh_u~1.offset), 4bv32);fabs_double_~high~0 := fabs_double_#t~mem2;call write~intFLOATTYPE8(fabs_double_#t~union3, fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset, 8bv32);havoc fabs_double_#t~mem2;havoc fabs_double_#t~union3;call ULTIMATE.dealloc(fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset);havoc fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset; {184#(and (= ULTIMATE.start_fabs_double_~x (_ +zero 11 53)) (exists ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (and (= ULTIMATE.start_fabs_double_~x (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|))) (= ULTIMATE.start_fabs_double_~high~0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|)))))} is VALID [2020-07-28 17:41:50,248 INFO L280 TraceCheckUtils]: 3: Hoare triple {184#(and (= ULTIMATE.start_fabs_double_~x (_ +zero 11 53)) (exists ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (and (= ULTIMATE.start_fabs_double_~x (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|))) (= ULTIMATE.start_fabs_double_~high~0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|)))))} goto; {184#(and (= ULTIMATE.start_fabs_double_~x (_ +zero 11 53)) (exists ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (and (= ULTIMATE.start_fabs_double_~x (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|))) (= ULTIMATE.start_fabs_double_~high~0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|)))))} is VALID [2020-07-28 17:41:50,254 INFO L280 TraceCheckUtils]: 4: Hoare triple {184#(and (= ULTIMATE.start_fabs_double_~x (_ +zero 11 53)) (exists ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (and (= ULTIMATE.start_fabs_double_~x (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|))) (= ULTIMATE.start_fabs_double_~high~0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|)))))} call fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(fabs_double_~x, fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset, 8bv32);call write~intINTTYPE4(~bvand32(2147483647bv32, fabs_double_~high~0), fabs_double_~#sh_u~0.base, ~bvadd32(4bv32, fabs_double_~#sh_u~0.offset), 4bv32);call fabs_double_#t~mem4 := read~intFLOATTYPE8(fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset, 8bv32);fabs_double_~x := fabs_double_#t~mem4;call write~intINTTYPE4(fabs_double_#t~union5.lsw, fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset, 4bv32);call write~intINTTYPE4(fabs_double_#t~union5.msw, fabs_double_~#sh_u~0.base, ~bvadd32(4bv32, fabs_double_~#sh_u~0.offset), 4bv32);havoc fabs_double_#t~union5.lsw, fabs_double_#t~union5.msw;havoc fabs_double_#t~mem4;call ULTIMATE.dealloc(fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset);havoc fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset; {180#(= ULTIMATE.start_fabs_double_~x (_ +zero 11 53))} is VALID [2020-07-28 17:41:50,255 INFO L280 TraceCheckUtils]: 5: Hoare triple {180#(= ULTIMATE.start_fabs_double_~x (_ +zero 11 53))} goto; {180#(= ULTIMATE.start_fabs_double_~x (_ +zero 11 53))} is VALID [2020-07-28 17:41:50,256 INFO L280 TraceCheckUtils]: 6: Hoare triple {180#(= ULTIMATE.start_fabs_double_~x (_ +zero 11 53))} fabs_double_#res := fabs_double_~x; {197#(= |ULTIMATE.start_fabs_double_#res| (_ +zero 11 53))} is VALID [2020-07-28 17:41:50,257 INFO L280 TraceCheckUtils]: 7: Hoare triple {197#(= |ULTIMATE.start_fabs_double_#res| (_ +zero 11 53))} main_#t~ret6 := fabs_double_#res;main_~res~0 := main_#t~ret6;havoc main_#t~ret6;main_#t~short8 := ~fp.eq~DOUBLE(main_~res~0, ~Pluszero~DOUBLE()); {201#|ULTIMATE.start_main_#t~short8|} is VALID [2020-07-28 17:41:50,258 INFO L280 TraceCheckUtils]: 8: Hoare triple {201#|ULTIMATE.start_main_#t~short8|} assume !main_#t~short8; {173#false} is VALID [2020-07-28 17:41:50,258 INFO L280 TraceCheckUtils]: 9: Hoare triple {173#false} assume !main_#t~short8;havoc main_#t~ret7;havoc main_#t~short8; {173#false} is VALID [2020-07-28 17:41:50,259 INFO L280 TraceCheckUtils]: 10: Hoare triple {173#false} assume !false; {173#false} is VALID [2020-07-28 17:41:50,260 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:41:50,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 17:41:50,357 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 60 treesize of output 54 [2020-07-28 17:41:50,367 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-28 17:41:50,373 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 17:41:50,373 INFO L544 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-28 17:41:50,389 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 17:41:50,391 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:41:50,391 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:71, output treesize:35 [2020-07-28 17:41:50,527 INFO L280 TraceCheckUtils]: 10: Hoare triple {173#false} assume !false; {173#false} is VALID [2020-07-28 17:41:50,528 INFO L280 TraceCheckUtils]: 9: Hoare triple {173#false} assume !main_#t~short8;havoc main_#t~ret7;havoc main_#t~short8; {173#false} is VALID [2020-07-28 17:41:50,530 INFO L280 TraceCheckUtils]: 8: Hoare triple {201#|ULTIMATE.start_main_#t~short8|} assume !main_#t~short8; {173#false} is VALID [2020-07-28 17:41:50,531 INFO L280 TraceCheckUtils]: 7: Hoare triple {220#(fp.eq |ULTIMATE.start_fabs_double_#res| (_ +zero 11 53))} main_#t~ret6 := fabs_double_#res;main_~res~0 := main_#t~ret6;havoc main_#t~ret6;main_#t~short8 := ~fp.eq~DOUBLE(main_~res~0, ~Pluszero~DOUBLE()); {201#|ULTIMATE.start_main_#t~short8|} is VALID [2020-07-28 17:41:50,533 INFO L280 TraceCheckUtils]: 6: Hoare triple {224#(fp.eq ULTIMATE.start_fabs_double_~x (_ +zero 11 53))} fabs_double_#res := fabs_double_~x; {220#(fp.eq |ULTIMATE.start_fabs_double_#res| (_ +zero 11 53))} is VALID [2020-07-28 17:41:50,534 INFO L280 TraceCheckUtils]: 5: Hoare triple {224#(fp.eq ULTIMATE.start_fabs_double_~x (_ +zero 11 53))} goto; {224#(fp.eq ULTIMATE.start_fabs_double_~x (_ +zero 11 53))} is VALID [2020-07-28 17:41:50,542 INFO L280 TraceCheckUtils]: 4: Hoare triple {231#(forall ((|v_skolemized_q#valueAsBitvector_8| (_ BitVec 64))) (or (fp.eq (fp ((_ extract 63 63) (concat (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_double_~high~0) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_8|))) ((_ extract 62 52) (concat (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_double_~high~0) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_8|))) ((_ extract 51 0) (concat (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_double_~high~0) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_8|)))) (_ +zero 11 53)) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_8|)) ULTIMATE.start_fabs_double_~x))))} call fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(fabs_double_~x, fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset, 8bv32);call write~intINTTYPE4(~bvand32(2147483647bv32, fabs_double_~high~0), fabs_double_~#sh_u~0.base, ~bvadd32(4bv32, fabs_double_~#sh_u~0.offset), 4bv32);call fabs_double_#t~mem4 := read~intFLOATTYPE8(fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset, 8bv32);fabs_double_~x := fabs_double_#t~mem4;call write~intINTTYPE4(fabs_double_#t~union5.lsw, fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset, 4bv32);call write~intINTTYPE4(fabs_double_#t~union5.msw, fabs_double_~#sh_u~0.base, ~bvadd32(4bv32, fabs_double_~#sh_u~0.offset), 4bv32);havoc fabs_double_#t~union5.lsw, fabs_double_#t~union5.msw;havoc fabs_double_#t~mem4;call ULTIMATE.dealloc(fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset);havoc fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset; {224#(fp.eq ULTIMATE.start_fabs_double_~x (_ +zero 11 53))} is VALID [2020-07-28 17:41:50,544 INFO L280 TraceCheckUtils]: 3: Hoare triple {231#(forall ((|v_skolemized_q#valueAsBitvector_8| (_ BitVec 64))) (or (fp.eq (fp ((_ extract 63 63) (concat (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_double_~high~0) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_8|))) ((_ extract 62 52) (concat (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_double_~high~0) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_8|))) ((_ extract 51 0) (concat (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_double_~high~0) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_8|)))) (_ +zero 11 53)) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_8|)) ULTIMATE.start_fabs_double_~x))))} goto; {231#(forall ((|v_skolemized_q#valueAsBitvector_8| (_ BitVec 64))) (or (fp.eq (fp ((_ extract 63 63) (concat (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_double_~high~0) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_8|))) ((_ extract 62 52) (concat (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_double_~high~0) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_8|))) ((_ extract 51 0) (concat (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_double_~high~0) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_8|)))) (_ +zero 11 53)) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_8|)) ULTIMATE.start_fabs_double_~x))))} is VALID [2020-07-28 17:41:50,550 INFO L280 TraceCheckUtils]: 2: Hoare triple {224#(fp.eq ULTIMATE.start_fabs_double_~x (_ +zero 11 53))} call fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(fabs_double_~x, fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset, 8bv32);call fabs_double_#t~mem2 := read~intINTTYPE4(fabs_double_~#gh_u~1.base, ~bvadd32(4bv32, fabs_double_~#gh_u~1.offset), 4bv32);fabs_double_~high~0 := fabs_double_#t~mem2;call write~intFLOATTYPE8(fabs_double_#t~union3, fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset, 8bv32);havoc fabs_double_#t~mem2;havoc fabs_double_#t~union3;call ULTIMATE.dealloc(fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset);havoc fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset; {231#(forall ((|v_skolemized_q#valueAsBitvector_8| (_ BitVec 64))) (or (fp.eq (fp ((_ extract 63 63) (concat (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_double_~high~0) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_8|))) ((_ extract 62 52) (concat (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_double_~high~0) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_8|))) ((_ extract 51 0) (concat (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_double_~high~0) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_8|)))) (_ +zero 11 53)) (not (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_8|)) ULTIMATE.start_fabs_double_~x))))} is VALID [2020-07-28 17:41:50,552 INFO L280 TraceCheckUtils]: 1: Hoare triple {172#true} havoc main_#res;havoc main_#t~ret6, main_#t~ret7, main_#t~short8, main_~x~0, main_~res~0;main_~x~0 := ~Pluszero~DOUBLE();fabs_double_#in~x := main_~x~0;havoc fabs_double_#res;havoc fabs_double_#t~mem2, fabs_double_#t~union3, fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset, fabs_double_#t~mem4, fabs_double_#t~union5.lsw, fabs_double_#t~union5.msw, fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset, fabs_double_~x, fabs_double_~high~0;fabs_double_~x := fabs_double_#in~x;havoc fabs_double_~high~0; {224#(fp.eq ULTIMATE.start_fabs_double_~x (_ +zero 11 53))} is VALID [2020-07-28 17:41:50,552 INFO L280 TraceCheckUtils]: 0: Hoare triple {172#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {172#true} is VALID [2020-07-28 17:41:50,553 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:41:50,554 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1304699298] [2020-07-28 17:41:50,554 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:41:50,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 9 [2020-07-28 17:41:50,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360871947] [2020-07-28 17:41:50,557 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2020-07-28 17:41:50,557 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:41:50,558 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-28 17:41:50,606 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:41:50,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-28 17:41:50,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 17:41:50,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-28 17:41:50,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-07-28 17:41:50,607 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 9 states. [2020-07-28 17:41:51,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:41:51,025 INFO L93 Difference]: Finished difference Result 19 states and 18 transitions. [2020-07-28 17:41:51,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-28 17:41:51,026 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 11 [2020-07-28 17:41:51,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:41:51,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-28 17:41:51,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2020-07-28 17:41:51,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-28 17:41:51,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2020-07-28 17:41:51,030 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 18 transitions. [2020-07-28 17:41:51,082 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:41:51,084 INFO L225 Difference]: With dead ends: 19 [2020-07-28 17:41:51,084 INFO L226 Difference]: Without dead ends: 16 [2020-07-28 17:41:51,085 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2020-07-28 17:41:51,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-07-28 17:41:51,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-07-28 17:41:51,095 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:41:51,095 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2020-07-28 17:41:51,095 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2020-07-28 17:41:51,096 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2020-07-28 17:41:51,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:41:51,098 INFO L93 Difference]: Finished difference Result 16 states and 15 transitions. [2020-07-28 17:41:51,098 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 15 transitions. [2020-07-28 17:41:51,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:41:51,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:41:51,099 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2020-07-28 17:41:51,099 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2020-07-28 17:41:51,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:41:51,101 INFO L93 Difference]: Finished difference Result 16 states and 15 transitions. [2020-07-28 17:41:51,101 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 15 transitions. [2020-07-28 17:41:51,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:41:51,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:41:51,103 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:41:51,103 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:41:51,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-28 17:41:51,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 15 transitions. [2020-07-28 17:41:51,105 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 15 transitions. Word has length 11 [2020-07-28 17:41:51,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:41:51,105 INFO L479 AbstractCegarLoop]: Abstraction has 16 states and 15 transitions. [2020-07-28 17:41:51,105 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-28 17:41:51,106 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 15 transitions. [2020-07-28 17:41:51,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-28 17:41:51,107 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:41:51,107 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:41:51,320 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-07-28 17:41:51,321 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:41:51,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:41:51,322 INFO L82 PathProgramCache]: Analyzing trace with hash -2014349959, now seen corresponding path program 1 times [2020-07-28 17:41:51,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 17:41:51,324 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1182813625] [2020-07-28 17:41:51,324 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:41:51,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:41:51,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 18 conjunts are in the unsatisfiable core [2020-07-28 17:41:51,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:41:51,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 17:41:51,514 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:41:51,525 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 30 treesize of output 24 [2020-07-28 17:41:51,526 INFO L544 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-28 17:41:51,530 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 17:41:51,532 INFO L544 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-28 17:41:51,547 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 17:41:51,549 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-28 17:41:51,550 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:64, output treesize:34 [2020-07-28 17:41:51,555 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-28 17:41:51,556 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_22|, |v_ULTIMATE.start_fabs_double_~#sh_u~0.base_8|, |v_skolemized_q#valueAsBitvector_9|]. (and (= (_ +zero 11 53) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|))) (= ULTIMATE.start_fabs_double_~x (let ((.cse0 (let ((.cse1 (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)))) (concat .cse1 (select (store (select |v_#memory_int_22| |v_ULTIMATE.start_fabs_double_~#sh_u~0.base_8|) (_ bv4 32) .cse1) (_ bv0 32)))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))))) [2020-07-28 17:41:51,556 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [|v_skolemized_q#valueAsBitvector_9|, v_arrayElimCell_4]. (and (= (_ +zero 11 53) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|))) (= (let ((.cse0 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) v_arrayElimCell_4))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) ULTIMATE.start_fabs_double_~x)) [2020-07-28 17:41:51,860 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-28 17:41:51,949 INFO L280 TraceCheckUtils]: 0: Hoare triple {322#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {322#true} is VALID [2020-07-28 17:41:51,951 INFO L280 TraceCheckUtils]: 1: Hoare triple {322#true} havoc main_#res;havoc main_#t~ret6, main_#t~ret7, main_#t~short8, main_~x~0, main_~res~0;main_~x~0 := ~Pluszero~DOUBLE();fabs_double_#in~x := main_~x~0;havoc fabs_double_#res;havoc fabs_double_#t~mem2, fabs_double_#t~union3, fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset, fabs_double_#t~mem4, fabs_double_#t~union5.lsw, fabs_double_#t~union5.msw, fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset, fabs_double_~x, fabs_double_~high~0;fabs_double_~x := fabs_double_#in~x;havoc fabs_double_~high~0; {330#(= ULTIMATE.start_fabs_double_~x (_ +zero 11 53))} is VALID [2020-07-28 17:41:51,960 INFO L280 TraceCheckUtils]: 2: Hoare triple {330#(= ULTIMATE.start_fabs_double_~x (_ +zero 11 53))} call fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(fabs_double_~x, fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset, 8bv32);call fabs_double_#t~mem2 := read~intINTTYPE4(fabs_double_~#gh_u~1.base, ~bvadd32(4bv32, fabs_double_~#gh_u~1.offset), 4bv32);fabs_double_~high~0 := fabs_double_#t~mem2;call write~intFLOATTYPE8(fabs_double_#t~union3, fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset, 8bv32);havoc fabs_double_#t~mem2;havoc fabs_double_#t~union3;call ULTIMATE.dealloc(fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset);havoc fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset; {334#(exists ((|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64))) (and (= ULTIMATE.start_fabs_double_~high~0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) (= (_ +zero 11 53) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|)))))} is VALID [2020-07-28 17:41:51,961 INFO L280 TraceCheckUtils]: 3: Hoare triple {334#(exists ((|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64))) (and (= ULTIMATE.start_fabs_double_~high~0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) (= (_ +zero 11 53) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|)))))} goto; {334#(exists ((|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64))) (and (= ULTIMATE.start_fabs_double_~high~0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) (= (_ +zero 11 53) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|)))))} is VALID [2020-07-28 17:41:51,984 INFO L280 TraceCheckUtils]: 4: Hoare triple {334#(exists ((|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64))) (and (= ULTIMATE.start_fabs_double_~high~0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) (= (_ +zero 11 53) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|)))))} call fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(fabs_double_~x, fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset, 8bv32);call write~intINTTYPE4(~bvand32(2147483647bv32, fabs_double_~high~0), fabs_double_~#sh_u~0.base, ~bvadd32(4bv32, fabs_double_~#sh_u~0.offset), 4bv32);call fabs_double_#t~mem4 := read~intFLOATTYPE8(fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset, 8bv32);fabs_double_~x := fabs_double_#t~mem4;call write~intINTTYPE4(fabs_double_#t~union5.lsw, fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset, 4bv32);call write~intINTTYPE4(fabs_double_#t~union5.msw, fabs_double_~#sh_u~0.base, ~bvadd32(4bv32, fabs_double_~#sh_u~0.offset), 4bv32);havoc fabs_double_#t~union5.lsw, fabs_double_#t~union5.msw;havoc fabs_double_#t~mem4;call ULTIMATE.dealloc(fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset);havoc fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset; {341#(exists ((v_arrayElimCell_4 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64))) (and (= (_ +zero 11 53) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|))) (= (fp ((_ extract 63 63) (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) v_arrayElimCell_4)) ((_ extract 62 52) (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) v_arrayElimCell_4)) ((_ extract 51 0) (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) v_arrayElimCell_4))) ULTIMATE.start_fabs_double_~x)))} is VALID [2020-07-28 17:41:51,985 INFO L280 TraceCheckUtils]: 5: Hoare triple {341#(exists ((v_arrayElimCell_4 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64))) (and (= (_ +zero 11 53) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|))) (= (fp ((_ extract 63 63) (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) v_arrayElimCell_4)) ((_ extract 62 52) (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) v_arrayElimCell_4)) ((_ extract 51 0) (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) v_arrayElimCell_4))) ULTIMATE.start_fabs_double_~x)))} goto; {341#(exists ((v_arrayElimCell_4 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64))) (and (= (_ +zero 11 53) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|))) (= (fp ((_ extract 63 63) (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) v_arrayElimCell_4)) ((_ extract 62 52) (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) v_arrayElimCell_4)) ((_ extract 51 0) (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) v_arrayElimCell_4))) ULTIMATE.start_fabs_double_~x)))} is VALID [2020-07-28 17:41:51,987 INFO L280 TraceCheckUtils]: 6: Hoare triple {341#(exists ((v_arrayElimCell_4 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64))) (and (= (_ +zero 11 53) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|))) (= (fp ((_ extract 63 63) (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) v_arrayElimCell_4)) ((_ extract 62 52) (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) v_arrayElimCell_4)) ((_ extract 51 0) (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) v_arrayElimCell_4))) ULTIMATE.start_fabs_double_~x)))} fabs_double_#res := fabs_double_~x; {348#(exists ((v_arrayElimCell_4 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) v_arrayElimCell_4)) ((_ extract 62 52) (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) v_arrayElimCell_4)) ((_ extract 51 0) (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) v_arrayElimCell_4))) |ULTIMATE.start_fabs_double_#res|) (= (_ +zero 11 53) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|)))))} is VALID [2020-07-28 17:41:51,989 INFO L280 TraceCheckUtils]: 7: Hoare triple {348#(exists ((v_arrayElimCell_4 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) v_arrayElimCell_4)) ((_ extract 62 52) (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) v_arrayElimCell_4)) ((_ extract 51 0) (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) v_arrayElimCell_4))) |ULTIMATE.start_fabs_double_#res|) (= (_ +zero 11 53) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|)))))} main_#t~ret6 := fabs_double_#res;main_~res~0 := main_#t~ret6;havoc main_#t~ret6;main_#t~short8 := ~fp.eq~DOUBLE(main_~res~0, ~Pluszero~DOUBLE()); {352#(exists ((v_arrayElimCell_4 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64))) (and (= (_ +zero 11 53) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|))) (= (fp ((_ extract 63 63) (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) v_arrayElimCell_4)) ((_ extract 62 52) (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) v_arrayElimCell_4)) ((_ extract 51 0) (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) v_arrayElimCell_4))) ULTIMATE.start_main_~res~0)))} is VALID [2020-07-28 17:41:51,990 INFO L280 TraceCheckUtils]: 8: Hoare triple {352#(exists ((v_arrayElimCell_4 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64))) (and (= (_ +zero 11 53) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|))) (= (fp ((_ extract 63 63) (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) v_arrayElimCell_4)) ((_ extract 62 52) (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) v_arrayElimCell_4)) ((_ extract 51 0) (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) v_arrayElimCell_4))) ULTIMATE.start_main_~res~0)))} assume main_#t~short8;__signbit_double_#in~x := main_~res~0;havoc __signbit_double_#res;havoc __signbit_double_#t~mem0, __signbit_double_#t~union1, __signbit_double_~#gh_u~0.base, __signbit_double_~#gh_u~0.offset, __signbit_double_~x, __signbit_double_~msw~0;__signbit_double_~x := __signbit_double_#in~x;havoc __signbit_double_~msw~0; {356#(exists ((v_arrayElimCell_4 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64))) (and (= (_ +zero 11 53) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|))) (= (fp ((_ extract 63 63) (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) v_arrayElimCell_4)) ((_ extract 62 52) (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) v_arrayElimCell_4)) ((_ extract 51 0) (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) v_arrayElimCell_4))) ULTIMATE.start___signbit_double_~x)))} is VALID [2020-07-28 17:41:52,000 INFO L280 TraceCheckUtils]: 9: Hoare triple {356#(exists ((v_arrayElimCell_4 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64))) (and (= (_ +zero 11 53) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|))) (= (fp ((_ extract 63 63) (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) v_arrayElimCell_4)) ((_ extract 62 52) (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) v_arrayElimCell_4)) ((_ extract 51 0) (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) v_arrayElimCell_4))) 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~mem0 := read~intINTTYPE4(__signbit_double_~#gh_u~0.base, ~bvadd32(4bv32, __signbit_double_~#gh_u~0.offset), 4bv32);__signbit_double_~msw~0 := __signbit_double_#t~mem0;call write~intFLOATTYPE8(__signbit_double_#t~union1, __signbit_double_~#gh_u~0.base, __signbit_double_~#gh_u~0.offset, 8bv32);havoc __signbit_double_#t~mem0;havoc __signbit_double_#t~union1;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; {360#(exists ((|v_skolemized_q#valueAsBitvector_10| (_ BitVec 64)) (v_arrayElimCell_4 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64))) (and (= (_ +zero 11 53) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|))) (= ULTIMATE.start___signbit_double_~msw~0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_10|)) (= (fp ((_ extract 63 63) (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) v_arrayElimCell_4)) ((_ extract 62 52) (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) v_arrayElimCell_4)) ((_ extract 51 0) (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) v_arrayElimCell_4))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_10|)))))} is VALID [2020-07-28 17:41:52,002 INFO L280 TraceCheckUtils]: 10: Hoare triple {360#(exists ((|v_skolemized_q#valueAsBitvector_10| (_ BitVec 64)) (v_arrayElimCell_4 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64))) (and (= (_ +zero 11 53) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|))) (= ULTIMATE.start___signbit_double_~msw~0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_10|)) (= (fp ((_ extract 63 63) (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) v_arrayElimCell_4)) ((_ extract 62 52) (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) v_arrayElimCell_4)) ((_ extract 51 0) (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) v_arrayElimCell_4))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_10|)))))} goto; {360#(exists ((|v_skolemized_q#valueAsBitvector_10| (_ BitVec 64)) (v_arrayElimCell_4 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64))) (and (= (_ +zero 11 53) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|))) (= ULTIMATE.start___signbit_double_~msw~0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_10|)) (= (fp ((_ extract 63 63) (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) v_arrayElimCell_4)) ((_ extract 62 52) (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) v_arrayElimCell_4)) ((_ extract 51 0) (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) v_arrayElimCell_4))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_10|)))))} is VALID [2020-07-28 17:41:52,004 INFO L280 TraceCheckUtils]: 11: Hoare triple {360#(exists ((|v_skolemized_q#valueAsBitvector_10| (_ BitVec 64)) (v_arrayElimCell_4 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64))) (and (= (_ +zero 11 53) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|))) (= ULTIMATE.start___signbit_double_~msw~0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_10|)) (= (fp ((_ extract 63 63) (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) v_arrayElimCell_4)) ((_ extract 62 52) (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) v_arrayElimCell_4)) ((_ extract 51 0) (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) v_arrayElimCell_4))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_10|)))))} __signbit_double_#res := (if 0bv32 != ~bvand32(2147483648bv32, __signbit_double_~msw~0) then 1bv32 else 0bv32); {367#(= |ULTIMATE.start___signbit_double_#res| (_ bv0 32))} is VALID [2020-07-28 17:41:52,008 INFO L280 TraceCheckUtils]: 12: Hoare triple {367#(= |ULTIMATE.start___signbit_double_#res| (_ bv0 32))} main_#t~ret7 := __signbit_double_#res;main_#t~short8 := 0bv32 == main_#t~ret7; {371#|ULTIMATE.start_main_#t~short8|} is VALID [2020-07-28 17:41:52,009 INFO L280 TraceCheckUtils]: 13: Hoare triple {371#|ULTIMATE.start_main_#t~short8|} assume !main_#t~short8;havoc main_#t~ret7;havoc main_#t~short8; {323#false} is VALID [2020-07-28 17:41:52,009 INFO L280 TraceCheckUtils]: 14: Hoare triple {323#false} assume !false; {323#false} is VALID [2020-07-28 17:41:52,011 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:41:52,012 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 17:41:52,401 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 55 treesize of output 49 [2020-07-28 17:41:52,411 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 34 treesize of output 28 [2020-07-28 17:41:52,412 INFO L544 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-28 17:41:52,416 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 17:41:52,416 INFO L544 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-28 17:41:52,425 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 17:41:52,426 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-28 17:41:52,427 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:62, output treesize:35 [2020-07-28 17:41:52,432 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-28 17:41:52,432 WARN L407 uantifierElimination]: Input elimination task: ∀ [|v_#memory_int_22|, |v_ULTIMATE.start_fabs_double_~#sh_u~0.base_8|, |v_skolemized_q#valueAsBitvector_10|]. (or (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_10|))) (not (= (let ((.cse0 (let ((.cse1 (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_double_~high~0))) (concat .cse1 (select (store (select |v_#memory_int_22| |v_ULTIMATE.start_fabs_double_~#sh_u~0.base_8|) (_ bv4 32) .cse1) (_ bv0 32)))))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_10|))))) [2020-07-28 17:41:52,433 WARN L408 uantifierElimination]: ElimStorePlain result: ∀ [v_arrayElimCell_6, |v_skolemized_q#valueAsBitvector_10|]. (or (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_10|))) (not (= (let ((.cse0 (concat (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_double_~high~0) v_arrayElimCell_6))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_10|))))) [2020-07-28 17:41:52,679 INFO L280 TraceCheckUtils]: 14: Hoare triple {323#false} assume !false; {323#false} is VALID [2020-07-28 17:41:52,680 INFO L280 TraceCheckUtils]: 13: Hoare triple {371#|ULTIMATE.start_main_#t~short8|} assume !main_#t~short8;havoc main_#t~ret7;havoc main_#t~short8; {323#false} is VALID [2020-07-28 17:41:52,680 INFO L280 TraceCheckUtils]: 12: Hoare triple {367#(= |ULTIMATE.start___signbit_double_#res| (_ bv0 32))} main_#t~ret7 := __signbit_double_#res;main_#t~short8 := 0bv32 == main_#t~ret7; {371#|ULTIMATE.start_main_#t~short8|} is VALID [2020-07-28 17:41:52,681 INFO L280 TraceCheckUtils]: 11: Hoare triple {387#(= (_ bv0 32) (bvand (_ bv2147483648 32) ULTIMATE.start___signbit_double_~msw~0))} __signbit_double_#res := (if 0bv32 != ~bvand32(2147483648bv32, __signbit_double_~msw~0) then 1bv32 else 0bv32); {367#(= |ULTIMATE.start___signbit_double_#res| (_ bv0 32))} is VALID [2020-07-28 17:41:52,682 INFO L280 TraceCheckUtils]: 10: Hoare triple {387#(= (_ bv0 32) (bvand (_ bv2147483648 32) ULTIMATE.start___signbit_double_~msw~0))} goto; {387#(= (_ bv0 32) (bvand (_ bv2147483648 32) ULTIMATE.start___signbit_double_~msw~0))} is VALID [2020-07-28 17:41:52,685 INFO L280 TraceCheckUtils]: 9: Hoare triple {394#(forall ((|v_skolemized_q#valueAsBitvector_10| (_ BitVec 64))) (or (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_10|))) (not (= ULTIMATE.start___signbit_double_~x (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_10|))))))} 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~mem0 := read~intINTTYPE4(__signbit_double_~#gh_u~0.base, ~bvadd32(4bv32, __signbit_double_~#gh_u~0.offset), 4bv32);__signbit_double_~msw~0 := __signbit_double_#t~mem0;call write~intFLOATTYPE8(__signbit_double_#t~union1, __signbit_double_~#gh_u~0.base, __signbit_double_~#gh_u~0.offset, 8bv32);havoc __signbit_double_#t~mem0;havoc __signbit_double_#t~union1;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; {387#(= (_ bv0 32) (bvand (_ bv2147483648 32) ULTIMATE.start___signbit_double_~msw~0))} is VALID [2020-07-28 17:41:52,687 INFO L280 TraceCheckUtils]: 8: Hoare triple {398#(forall ((|v_skolemized_q#valueAsBitvector_10| (_ BitVec 64))) (or (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_10|))) (not (= ULTIMATE.start_main_~res~0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_10|))))))} assume main_#t~short8;__signbit_double_#in~x := main_~res~0;havoc __signbit_double_#res;havoc __signbit_double_#t~mem0, __signbit_double_#t~union1, __signbit_double_~#gh_u~0.base, __signbit_double_~#gh_u~0.offset, __signbit_double_~x, __signbit_double_~msw~0;__signbit_double_~x := __signbit_double_#in~x;havoc __signbit_double_~msw~0; {394#(forall ((|v_skolemized_q#valueAsBitvector_10| (_ BitVec 64))) (or (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_10|))) (not (= ULTIMATE.start___signbit_double_~x (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_10|))))))} is VALID [2020-07-28 17:41:52,689 INFO L280 TraceCheckUtils]: 7: Hoare triple {402#(forall ((|v_skolemized_q#valueAsBitvector_10| (_ BitVec 64))) (or (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_10|))) (not (= |ULTIMATE.start_fabs_double_#res| (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_10|))))))} main_#t~ret6 := fabs_double_#res;main_~res~0 := main_#t~ret6;havoc main_#t~ret6;main_#t~short8 := ~fp.eq~DOUBLE(main_~res~0, ~Pluszero~DOUBLE()); {398#(forall ((|v_skolemized_q#valueAsBitvector_10| (_ BitVec 64))) (or (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_10|))) (not (= ULTIMATE.start_main_~res~0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_10|))))))} is VALID [2020-07-28 17:41:52,691 INFO L280 TraceCheckUtils]: 6: Hoare triple {406#(forall ((|v_skolemized_q#valueAsBitvector_10| (_ BitVec 64))) (or (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_10|))) (not (= ULTIMATE.start_fabs_double_~x (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_10|))))))} fabs_double_#res := fabs_double_~x; {402#(forall ((|v_skolemized_q#valueAsBitvector_10| (_ BitVec 64))) (or (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_10|))) (not (= |ULTIMATE.start_fabs_double_#res| (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_10|))))))} is VALID [2020-07-28 17:41:52,691 INFO L280 TraceCheckUtils]: 5: Hoare triple {406#(forall ((|v_skolemized_q#valueAsBitvector_10| (_ BitVec 64))) (or (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_10|))) (not (= ULTIMATE.start_fabs_double_~x (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_10|))))))} goto; {406#(forall ((|v_skolemized_q#valueAsBitvector_10| (_ BitVec 64))) (or (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_10|))) (not (= ULTIMATE.start_fabs_double_~x (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_10|))))))} is VALID [2020-07-28 17:41:52,695 INFO L280 TraceCheckUtils]: 4: Hoare triple {413#(forall ((|v_skolemized_q#valueAsBitvector_10| (_ BitVec 64)) (v_arrayElimCell_6 (_ BitVec 32))) (or (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_10|))) (not (= (fp ((_ extract 63 63) (concat (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_double_~high~0) v_arrayElimCell_6)) ((_ extract 62 52) (concat (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_double_~high~0) v_arrayElimCell_6)) ((_ extract 51 0) (concat (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_double_~high~0) v_arrayElimCell_6))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_10|))))))} call fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(fabs_double_~x, fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset, 8bv32);call write~intINTTYPE4(~bvand32(2147483647bv32, fabs_double_~high~0), fabs_double_~#sh_u~0.base, ~bvadd32(4bv32, fabs_double_~#sh_u~0.offset), 4bv32);call fabs_double_#t~mem4 := read~intFLOATTYPE8(fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset, 8bv32);fabs_double_~x := fabs_double_#t~mem4;call write~intINTTYPE4(fabs_double_#t~union5.lsw, fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset, 4bv32);call write~intINTTYPE4(fabs_double_#t~union5.msw, fabs_double_~#sh_u~0.base, ~bvadd32(4bv32, fabs_double_~#sh_u~0.offset), 4bv32);havoc fabs_double_#t~union5.lsw, fabs_double_#t~union5.msw;havoc fabs_double_#t~mem4;call ULTIMATE.dealloc(fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset);havoc fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset; {406#(forall ((|v_skolemized_q#valueAsBitvector_10| (_ BitVec 64))) (or (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_10|))) (not (= ULTIMATE.start_fabs_double_~x (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_10|))))))} is VALID [2020-07-28 17:41:52,697 INFO L280 TraceCheckUtils]: 3: Hoare triple {413#(forall ((|v_skolemized_q#valueAsBitvector_10| (_ BitVec 64)) (v_arrayElimCell_6 (_ BitVec 32))) (or (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_10|))) (not (= (fp ((_ extract 63 63) (concat (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_double_~high~0) v_arrayElimCell_6)) ((_ extract 62 52) (concat (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_double_~high~0) v_arrayElimCell_6)) ((_ extract 51 0) (concat (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_double_~high~0) v_arrayElimCell_6))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_10|))))))} goto; {413#(forall ((|v_skolemized_q#valueAsBitvector_10| (_ BitVec 64)) (v_arrayElimCell_6 (_ BitVec 32))) (or (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_10|))) (not (= (fp ((_ extract 63 63) (concat (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_double_~high~0) v_arrayElimCell_6)) ((_ extract 62 52) (concat (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_double_~high~0) v_arrayElimCell_6)) ((_ extract 51 0) (concat (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_double_~high~0) v_arrayElimCell_6))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_10|))))))} is VALID [2020-07-28 17:41:52,707 INFO L280 TraceCheckUtils]: 2: Hoare triple {420#(forall ((|v_skolemized_q#valueAsBitvector_10| (_ BitVec 64)) (v_arrayElimCell_6 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64))) (or (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_10|))) (not (= (fp ((_ extract 63 63) (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) v_arrayElimCell_6)) ((_ extract 62 52) (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) v_arrayElimCell_6)) ((_ extract 51 0) (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) v_arrayElimCell_6))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_10|)))) (not (= ULTIMATE.start_fabs_double_~x (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|))))))} call fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(fabs_double_~x, fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset, 8bv32);call fabs_double_#t~mem2 := read~intINTTYPE4(fabs_double_~#gh_u~1.base, ~bvadd32(4bv32, fabs_double_~#gh_u~1.offset), 4bv32);fabs_double_~high~0 := fabs_double_#t~mem2;call write~intFLOATTYPE8(fabs_double_#t~union3, fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset, 8bv32);havoc fabs_double_#t~mem2;havoc fabs_double_#t~union3;call ULTIMATE.dealloc(fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset);havoc fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset; {413#(forall ((|v_skolemized_q#valueAsBitvector_10| (_ BitVec 64)) (v_arrayElimCell_6 (_ BitVec 32))) (or (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_10|))) (not (= (fp ((_ extract 63 63) (concat (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_double_~high~0) v_arrayElimCell_6)) ((_ extract 62 52) (concat (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_double_~high~0) v_arrayElimCell_6)) ((_ extract 51 0) (concat (bvand (_ bv2147483647 32) ULTIMATE.start_fabs_double_~high~0) v_arrayElimCell_6))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_10|))))))} is VALID [2020-07-28 17:41:52,710 INFO L280 TraceCheckUtils]: 1: Hoare triple {322#true} havoc main_#res;havoc main_#t~ret6, main_#t~ret7, main_#t~short8, main_~x~0, main_~res~0;main_~x~0 := ~Pluszero~DOUBLE();fabs_double_#in~x := main_~x~0;havoc fabs_double_#res;havoc fabs_double_#t~mem2, fabs_double_#t~union3, fabs_double_~#gh_u~1.base, fabs_double_~#gh_u~1.offset, fabs_double_#t~mem4, fabs_double_#t~union5.lsw, fabs_double_#t~union5.msw, fabs_double_~#sh_u~0.base, fabs_double_~#sh_u~0.offset, fabs_double_~x, fabs_double_~high~0;fabs_double_~x := fabs_double_#in~x;havoc fabs_double_~high~0; {420#(forall ((|v_skolemized_q#valueAsBitvector_10| (_ BitVec 64)) (v_arrayElimCell_6 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64))) (or (= (_ bv0 32) (bvand (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_10|))) (not (= (fp ((_ extract 63 63) (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) v_arrayElimCell_6)) ((_ extract 62 52) (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) v_arrayElimCell_6)) ((_ extract 51 0) (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) v_arrayElimCell_6))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_10|)))) (not (= ULTIMATE.start_fabs_double_~x (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|))))))} is VALID [2020-07-28 17:41:52,710 INFO L280 TraceCheckUtils]: 0: Hoare triple {322#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {322#true} is VALID [2020-07-28 17:41:52,713 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:41:52,713 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1182813625] [2020-07-28 17:41:52,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:41:52,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 11] imperfect sequences [] total 18 [2020-07-28 17:41:52,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037437798] [2020-07-28 17:41:52,714 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 15 [2020-07-28 17:41:52,715 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:41:52,715 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2020-07-28 17:41:52,845 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:41:52,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-28 17:41:52,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 17:41:52,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-28 17:41:52,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2020-07-28 17:41:52,849 INFO L87 Difference]: Start difference. First operand 16 states and 15 transitions. Second operand 18 states. [2020-07-28 17:41:54,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:41:54,241 INFO L93 Difference]: Finished difference Result 16 states and 15 transitions. [2020-07-28 17:41:54,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-28 17:41:54,241 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 15 [2020-07-28 17:41:54,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:41:54,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-28 17:41:54,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 15 transitions. [2020-07-28 17:41:54,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-28 17:41:54,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 15 transitions. [2020-07-28 17:41:54,244 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 15 transitions. [2020-07-28 17:41:54,516 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:41:54,516 INFO L225 Difference]: With dead ends: 16 [2020-07-28 17:41:54,517 INFO L226 Difference]: Without dead ends: 0 [2020-07-28 17:41:54,517 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=138, Invalid=414, Unknown=0, NotChecked=0, Total=552 [2020-07-28 17:41:54,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-28 17:41:54,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-28 17:41:54,518 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:41:54,518 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-28 17:41:54,518 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 17:41:54,518 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 17:41:54,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:41:54,519 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 17:41:54,519 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 17:41:54,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:41:54,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:41:54,519 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 17:41:54,519 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 17:41:54,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:41:54,520 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 17:41:54,520 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 17:41:54,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:41:54,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:41:54,520 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:41:54,520 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:41:54,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-28 17:41:54,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-28 17:41:54,521 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2020-07-28 17:41:54,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:41:54,521 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-28 17:41:54,521 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-28 17:41:54,521 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 17:41:54,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:41:54,722 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-07-28 17:41:54,725 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-28 17:41:55,089 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2020-07-28 17:41:55,102 INFO L268 CegarLoopResult]: For program point L27-1(lines 27 31) no Hoare annotation was computed. [2020-07-28 17:41:55,102 INFO L264 CegarLoopResult]: At program point L27-2(lines 27 31) the Hoare annotation is: (= ULTIMATE.start_fabs_double_~x (_ +zero 11 53)) [2020-07-28 17:41:55,103 INFO L264 CegarLoopResult]: At program point L23(lines 14 24) the Hoare annotation is: (and (= ULTIMATE.start_fabs_double_~x (_ +zero 11 53)) (= |ULTIMATE.start___signbit_double_#res| (_ bv0 32)) (= |ULTIMATE.start_fabs_double_#res| (_ +zero 11 53)) (exists ((|v_skolemized_q#valueAsBitvector_10| (_ BitVec 64)) (v_arrayElimCell_4 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64))) (and (= (_ +zero 11 53) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|))) (= ULTIMATE.start___signbit_double_~msw~0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_10|)) (= (let ((.cse0 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) v_arrayElimCell_4))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_10|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_10|))))) |ULTIMATE.start_main_#t~short8| (exists ((v_arrayElimCell_4 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64))) (and (= (_ +zero 11 53) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|))) (= (let ((.cse1 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) v_arrayElimCell_4))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1))) ULTIMATE.start_main_~res~0))) (exists ((|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64))) (and (= ULTIMATE.start_fabs_double_~high~0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) (= (_ +zero 11 53) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|))))) (exists ((v_arrayElimCell_4 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64))) (and (= (_ +zero 11 53) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|))) (= (let ((.cse2 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) v_arrayElimCell_4))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))) ULTIMATE.start___signbit_double_~x)))) [2020-07-28 17:41:55,103 INFO L268 CegarLoopResult]: For program point L52(line 52) no Hoare annotation was computed. [2020-07-28 17:41:55,103 INFO L268 CegarLoopResult]: For program point L32(lines 32 37) no Hoare annotation was computed. [2020-07-28 17:41:55,103 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-28 17:41:55,103 INFO L268 CegarLoopResult]: For program point L32-1(lines 25 39) no Hoare annotation was computed. [2020-07-28 17:41:55,103 INFO L268 CegarLoopResult]: For program point L32-2(lines 32 37) no Hoare annotation was computed. [2020-07-28 17:41:55,103 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-28 17:41:55,103 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-28 17:41:55,104 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 52) no Hoare annotation was computed. [2020-07-28 17:41:55,104 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-28 17:41:55,104 INFO L268 CegarLoopResult]: For program point L17-1(lines 17 21) no Hoare annotation was computed. [2020-07-28 17:41:55,104 INFO L264 CegarLoopResult]: At program point L17-2(lines 17 21) the Hoare annotation is: (and (= ULTIMATE.start_fabs_double_~x (_ +zero 11 53)) (= |ULTIMATE.start_fabs_double_#res| (_ +zero 11 53)) |ULTIMATE.start_main_#t~short8| (exists ((v_arrayElimCell_4 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64))) (and (= (_ +zero 11 53) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|))) (= (let ((.cse0 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) v_arrayElimCell_4))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) ULTIMATE.start_main_~res~0))) (exists ((|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64))) (and (= ULTIMATE.start_fabs_double_~high~0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) (= (_ +zero 11 53) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|))))) (exists ((v_arrayElimCell_4 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64))) (and (= (_ +zero 11 53) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|))) (= (let ((.cse1 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) v_arrayElimCell_4))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1))) ULTIMATE.start___signbit_double_~x)))) [2020-07-28 17:41:55,104 INFO L268 CegarLoopResult]: For program point L17-3(lines 17 21) no Hoare annotation was computed. [2020-07-28 17:41:55,105 INFO L264 CegarLoopResult]: At program point L38(lines 25 39) the Hoare annotation is: (and (= ULTIMATE.start_fabs_double_~x (_ +zero 11 53)) (= |ULTIMATE.start_fabs_double_#res| (_ +zero 11 53)) (exists ((|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64))) (and (= ULTIMATE.start_fabs_double_~high~0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) (= (_ +zero 11 53) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_9|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_9|)))))) [2020-07-28 17:41:55,105 INFO L271 CegarLoopResult]: At program point L55(lines 41 56) the Hoare annotation is: true [2020-07-28 17:41:55,105 INFO L268 CegarLoopResult]: For program point L51(line 51) no Hoare annotation was computed. [2020-07-28 17:41:55,105 INFO L268 CegarLoopResult]: For program point L51-2(lines 51 54) no Hoare annotation was computed. [2020-07-28 17:41:55,111 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 17:41:55,111 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-28 17:41:55,111 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2020-07-28 17:41:55,111 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2020-07-28 17:41:55,111 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2020-07-28 17:41:55,111 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2020-07-28 17:41:55,112 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2020-07-28 17:41:55,112 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2020-07-28 17:41:55,112 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-28 17:41:55,112 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-28 17:41:55,112 WARN L170 areAnnotationChecker]: L32-2 has no Hoare annotation [2020-07-28 17:41:55,112 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2020-07-28 17:41:55,112 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2020-07-28 17:41:55,112 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2020-07-28 17:41:55,113 WARN L170 areAnnotationChecker]: L17-1 has no Hoare annotation [2020-07-28 17:41:55,113 WARN L170 areAnnotationChecker]: L17-3 has no Hoare annotation [2020-07-28 17:41:55,113 WARN L170 areAnnotationChecker]: L51-2 has no Hoare annotation [2020-07-28 17:41:55,113 WARN L170 areAnnotationChecker]: L51-2 has no Hoare annotation [2020-07-28 17:41:55,113 WARN L170 areAnnotationChecker]: L17-1 has no Hoare annotation [2020-07-28 17:41:55,113 WARN L170 areAnnotationChecker]: L17-1 has no Hoare annotation [2020-07-28 17:41:55,113 WARN L170 areAnnotationChecker]: L17-3 has no Hoare annotation [2020-07-28 17:41:55,114 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2020-07-28 17:41:55,114 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2020-07-28 17:41:55,114 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 17:41:55,114 WARN L170 areAnnotationChecker]: L51-2 has no Hoare annotation [2020-07-28 17:41:55,114 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 17:41:55,114 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:41:55,118 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:446) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:693) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:217) 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:41:55,123 INFO L168 Benchmark]: Toolchain (without parser) took 7122.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 207.6 MB). Free memory was 960.2 MB in the beginning and 1.1 GB in the end (delta: -139.3 MB). Peak memory consumption was 68.3 MB. Max. memory is 11.5 GB. [2020-07-28 17:41:55,124 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 17:41:55,125 INFO L168 Benchmark]: CACSL2BoogieTranslator took 389.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 960.2 MB in the beginning and 1.1 GB in the end (delta: -181.9 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2020-07-28 17:41:55,126 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-07-28 17:41:55,126 INFO L168 Benchmark]: Boogie Preprocessor took 46.11 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 17:41:55,127 INFO L168 Benchmark]: RCFGBuilder took 526.59 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: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. [2020-07-28 17:41:55,128 INFO L168 Benchmark]: TraceAbstraction took 6084.34 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 61.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.5 MB). Peak memory consumption was 71.4 MB. Max. memory is 11.5 GB. [2020-07-28 17:41:55,132 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 389.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 960.2 MB in the beginning and 1.1 GB in the end (delta: -181.9 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 65.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.11 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 526.59 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: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6084.34 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 61.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.5 MB). Peak memory consumption was 71.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 52]: 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 - ExceptionOrErrorResult: UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...