./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_1011b.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_1011b.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 dbef25694faa90ff4d63502c2f243449da0e6c28 ..................................................................................................................................................................................................................................................................................................................................................... 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_1011b.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 dbef25694faa90ff4d63502c2f243449da0e6c28 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:42,755 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 17:41:42,758 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 17:41:42,771 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 17:41:42,771 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 17:41:42,773 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 17:41:42,774 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 17:41:42,776 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 17:41:42,778 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 17:41:42,780 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 17:41:42,781 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 17:41:42,782 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 17:41:42,783 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 17:41:42,784 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 17:41:42,785 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 17:41:42,786 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 17:41:42,787 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 17:41:42,788 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 17:41:42,790 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 17:41:42,793 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 17:41:42,795 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 17:41:42,796 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 17:41:42,797 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 17:41:42,798 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 17:41:42,801 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 17:41:42,801 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 17:41:42,802 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 17:41:42,803 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 17:41:42,805 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 17:41:42,806 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 17:41:42,806 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 17:41:42,807 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 17:41:42,808 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 17:41:42,811 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 17:41:42,812 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 17:41:42,813 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 17:41:42,814 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 17:41:42,814 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 17:41:42,814 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 17:41:42,815 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 17:41:42,816 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 17:41:42,817 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:42,833 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 17:41:42,834 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 17:41:42,835 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 17:41:42,835 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 17:41:42,836 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 17:41:42,836 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 17:41:42,837 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 17:41:42,837 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 17:41:42,837 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 17:41:42,837 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 17:41:42,838 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 17:41:42,838 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 17:41:42,838 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 17:41:42,838 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 17:41:42,839 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 17:41:42,839 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 17:41:42,839 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 17:41:42,840 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 17:41:42,840 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 17:41:42,840 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 17:41:42,841 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 17:41:42,841 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 17:41:42,841 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 17:41:42,841 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 17:41:42,842 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 17:41:42,842 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 17:41:42,842 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 17:41:42,843 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 17:41:42,843 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 17:41:42,843 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 -> dbef25694faa90ff4d63502c2f243449da0e6c28 [2020-07-28 17:41:43,168 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 17:41:43,182 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 17:41:43,186 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 17:41:43,188 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 17:41:43,188 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 17:41:43,189 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1011b.c [2020-07-28 17:41:43,254 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62cac22b2/2b6c41f258554f2ea1f3f3729419b457/FLAGcaac4ead4 [2020-07-28 17:41:43,658 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 17:41:43,659 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1011b.c [2020-07-28 17:41:43,665 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62cac22b2/2b6c41f258554f2ea1f3f3729419b457/FLAGcaac4ead4 [2020-07-28 17:41:44,021 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62cac22b2/2b6c41f258554f2ea1f3f3729419b457 [2020-07-28 17:41:44,024 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 17:41:44,027 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 17:41:44,029 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 17:41:44,029 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 17:41:44,039 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 17:41:44,041 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:41:44" (1/1) ... [2020-07-28 17:41:44,045 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e8b784 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:41:44, skipping insertion in model container [2020-07-28 17:41:44,045 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:41:44" (1/1) ... [2020-07-28 17:41:44,055 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 17:41:44,077 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 17:41:44,316 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:41:44,323 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 17:41:44,368 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:41:44,398 INFO L208 MainTranslator]: Completed translation [2020-07-28 17:41:44,399 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:41:44 WrapperNode [2020-07-28 17:41:44,399 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 17:41:44,401 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 17:41:44,401 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 17:41:44,401 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 17:41:44,413 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:44" (1/1) ... [2020-07-28 17:41:44,430 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:44" (1/1) ... [2020-07-28 17:41:44,576 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 17:41:44,577 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 17:41:44,577 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 17:41:44,577 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 17:41:44,588 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:44" (1/1) ... [2020-07-28 17:41:44,589 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:44" (1/1) ... [2020-07-28 17:41:44,603 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:44" (1/1) ... [2020-07-28 17:41:44,604 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:44" (1/1) ... [2020-07-28 17:41:44,628 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:44" (1/1) ... [2020-07-28 17:41:44,634 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:44" (1/1) ... [2020-07-28 17:41:44,642 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:44" (1/1) ... [2020-07-28 17:41:44,645 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 17:41:44,648 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 17:41:44,648 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 17:41:44,649 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 17:41:44,650 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:41:44" (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:44,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2020-07-28 17:41:44,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-28 17:41:44,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-07-28 17:41:44,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 17:41:44,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 17:41:44,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-28 17:41:44,726 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-28 17:41:44,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-28 17:41:45,143 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 17:41:45,144 INFO L295 CfgBuilder]: Removed 14 assume(true) statements. [2020-07-28 17:41:45,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:41:45 BoogieIcfgContainer [2020-07-28 17:41:45,148 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 17:41:45,150 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 17:41:45,150 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 17:41:45,153 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 17:41:45,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 05:41:44" (1/3) ... [2020-07-28 17:41:45,155 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@500258df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:41:45, skipping insertion in model container [2020-07-28 17:41:45,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:41:44" (2/3) ... [2020-07-28 17:41:45,155 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@500258df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:41:45, skipping insertion in model container [2020-07-28 17:41:45,156 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:41:45" (3/3) ... [2020-07-28 17:41:45,157 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1011b.c [2020-07-28 17:41:45,170 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 17:41:45,178 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 17:41:45,194 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 17:41:45,222 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 17:41:45,222 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 17:41:45,222 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 17:41:45,223 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 17:41:45,223 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 17:41:45,223 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 17:41:45,223 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 17:41:45,224 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 17:41:45,241 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2020-07-28 17:41:45,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-07-28 17:41:45,248 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:41:45,250 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:41:45,250 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:41:45,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:41:45,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1641221055, now seen corresponding path program 1 times [2020-07-28 17:41:45,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:41:45,270 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262036643] [2020-07-28 17:41:45,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:41:45,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:41:45,428 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:45,429 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 := ~someUnaryDOUBLEoperation(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:45,431 INFO L280 TraceCheckUtils]: 2: Hoare triple {22#true} assume !true; {23#false} is VALID [2020-07-28 17:41:45,431 INFO L280 TraceCheckUtils]: 3: Hoare triple {23#false} assume !true; {23#false} is VALID [2020-07-28 17:41:45,432 INFO L280 TraceCheckUtils]: 4: Hoare triple {23#false} fabs_double_#res := fabs_double_~x; {23#false} is VALID [2020-07-28 17:41:45,433 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:45,433 INFO L280 TraceCheckUtils]: 6: Hoare triple {23#false} assume !main_#t~short8; {23#false} is VALID [2020-07-28 17:41:45,434 INFO L280 TraceCheckUtils]: 7: Hoare triple {23#false} assume !main_#t~short8;havoc main_#t~short8;havoc main_#t~ret7; {23#false} is VALID [2020-07-28 17:41:45,434 INFO L280 TraceCheckUtils]: 8: Hoare triple {23#false} assume !false; {23#false} is VALID [2020-07-28 17:41:45,437 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:45,443 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262036643] [2020-07-28 17:41:45,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:41:45,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-28 17:41:45,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899660459] [2020-07-28 17:41:45,451 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2020-07-28 17:41:45,453 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:41:45,459 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 17:41:45,486 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:45,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 17:41:45,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:41:45,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 17:41:45,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 17:41:45,507 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2020-07-28 17:41:45,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:41:45,572 INFO L93 Difference]: Finished difference Result 36 states and 50 transitions. [2020-07-28 17:41:45,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 17:41:45,573 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2020-07-28 17:41:45,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:41:45,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:41:45,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 50 transitions. [2020-07-28 17:41:45,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:41:45,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 50 transitions. [2020-07-28 17:41:45,586 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 50 transitions. [2020-07-28 17:41:45,671 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:45,683 INFO L225 Difference]: With dead ends: 36 [2020-07-28 17:41:45,683 INFO L226 Difference]: Without dead ends: 16 [2020-07-28 17:41:45,687 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:45,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-07-28 17:41:45,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-07-28 17:41:45,725 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:41:45,725 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2020-07-28 17:41:45,726 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2020-07-28 17:41:45,726 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2020-07-28 17:41:45,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:41:45,729 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2020-07-28 17:41:45,730 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2020-07-28 17:41:45,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:41:45,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:41:45,731 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2020-07-28 17:41:45,731 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2020-07-28 17:41:45,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:41:45,733 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2020-07-28 17:41:45,734 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2020-07-28 17:41:45,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:41:45,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:41:45,735 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:41:45,735 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:41:45,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-28 17:41:45,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2020-07-28 17:41:45,739 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 9 [2020-07-28 17:41:45,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:41:45,739 INFO L479 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2020-07-28 17:41:45,739 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 17:41:45,740 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2020-07-28 17:41:45,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-28 17:41:45,740 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:41:45,740 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:41:45,741 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 17:41:45,741 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:41:45,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:41:45,742 INFO L82 PathProgramCache]: Analyzing trace with hash 558264036, now seen corresponding path program 1 times [2020-07-28 17:41:45,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:41:45,742 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442209383] [2020-07-28 17:41:45,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:41:45,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 17:41:45,788 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 17:41:45,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 17:41:45,814 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 17:41:45,842 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-28 17:41:45,842 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-28 17:41:45,844 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-28 17:41:45,876 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 17:41:45,880 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-28 17:41:45,881 WARN L170 areAnnotationChecker]: L27-2 has no Hoare annotation [2020-07-28 17:41:45,881 WARN L170 areAnnotationChecker]: L27-2 has no Hoare annotation [2020-07-28 17:41:45,881 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2020-07-28 17:41:45,881 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2020-07-28 17:41:45,882 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2020-07-28 17:41:45,882 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2020-07-28 17:41:45,883 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-28 17:41:45,883 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-28 17:41:45,883 WARN L170 areAnnotationChecker]: L32-2 has no Hoare annotation [2020-07-28 17:41:45,885 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2020-07-28 17:41:45,885 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2020-07-28 17:41:45,892 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2020-07-28 17:41:45,893 WARN L170 areAnnotationChecker]: L17-2 has no Hoare annotation [2020-07-28 17:41:45,893 WARN L170 areAnnotationChecker]: L17-2 has no Hoare annotation [2020-07-28 17:41:45,893 WARN L170 areAnnotationChecker]: L51-2 has no Hoare annotation [2020-07-28 17:41:45,893 WARN L170 areAnnotationChecker]: L51-2 has no Hoare annotation [2020-07-28 17:41:45,893 WARN L170 areAnnotationChecker]: L17-1 has no Hoare annotation [2020-07-28 17:41:45,893 WARN L170 areAnnotationChecker]: L17-1 has no Hoare annotation [2020-07-28 17:41:45,893 WARN L170 areAnnotationChecker]: L17-3 has no Hoare annotation [2020-07-28 17:41:45,894 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2020-07-28 17:41:45,894 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2020-07-28 17:41:45,894 WARN L170 areAnnotationChecker]: L56 has no Hoare annotation [2020-07-28 17:41:45,894 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-28 17:41:45,894 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 17:41:45,896 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:45,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 05:41:45 BoogieIcfgContainer [2020-07-28 17:41:45,900 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 17:41:45,901 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 17:41:45,901 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 17:41:45,901 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 17:41:45,904 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:45" (3/4) ... [2020-07-28 17:41:45,908 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-28 17:41:45,909 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 17:41:45,912 INFO L168 Benchmark]: Toolchain (without parser) took 1885.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 957.5 MB in the beginning and 1.1 GB in the end (delta: -112.9 MB). Peak memory consumption was 40.7 MB. Max. memory is 11.5 GB. [2020-07-28 17:41:45,914 INFO L168 Benchmark]: CDTParser took 0.30 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:45,917 INFO L168 Benchmark]: CACSL2BoogieTranslator took 371.06 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 946.8 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:45,918 INFO L168 Benchmark]: Boogie Procedure Inliner took 175.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -196.5 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. [2020-07-28 17:41:45,919 INFO L168 Benchmark]: Boogie Preprocessor took 70.51 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:45,920 INFO L168 Benchmark]: RCFGBuilder took 500.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2020-07-28 17:41:45,921 INFO L168 Benchmark]: TraceAbstraction took 750.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 11.5 GB. [2020-07-28 17:41:45,921 INFO L168 Benchmark]: Witness Printer took 8.18 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:45,939 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.30 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 371.06 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 946.8 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 175.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -196.5 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 70.51 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 500.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 750.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 11.5 GB. * Witness Printer took 8.18 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. * 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 someUnaryDOUBLEoperation at line 47, 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.1s, 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:47,949 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 17:41:47,951 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 17:41:47,964 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 17:41:47,965 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 17:41:47,966 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 17:41:47,968 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 17:41:47,970 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 17:41:47,972 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 17:41:47,973 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 17:41:47,975 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 17:41:47,976 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 17:41:47,977 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 17:41:47,978 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 17:41:47,979 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 17:41:47,981 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 17:41:47,983 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 17:41:47,985 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 17:41:47,987 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 17:41:47,992 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 17:41:47,997 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 17:41:48,001 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 17:41:48,004 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 17:41:48,007 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 17:41:48,012 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 17:41:48,013 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 17:41:48,013 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 17:41:48,015 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 17:41:48,016 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 17:41:48,018 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 17:41:48,018 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 17:41:48,019 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 17:41:48,021 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 17:41:48,022 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 17:41:48,027 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 17:41:48,027 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 17:41:48,029 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 17:41:48,029 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 17:41:48,029 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 17:41:48,030 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 17:41:48,032 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 17:41:48,033 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:48,059 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 17:41:48,060 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 17:41:48,062 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 17:41:48,063 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 17:41:48,063 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 17:41:48,063 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 17:41:48,064 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 17:41:48,064 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 17:41:48,064 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 17:41:48,064 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 17:41:48,066 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 17:41:48,066 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 17:41:48,066 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-07-28 17:41:48,067 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-07-28 17:41:48,067 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 17:41:48,068 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 17:41:48,068 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 17:41:48,068 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 17:41:48,068 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 17:41:48,070 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 17:41:48,070 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 17:41:48,071 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 17:41:48,071 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 17:41:48,071 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 17:41:48,071 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 17:41:48,071 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 17:41:48,072 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-07-28 17:41:48,072 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-07-28 17:41:48,072 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 17:41:48,072 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 17:41:48,073 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-28 17:41:48,073 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 -> dbef25694faa90ff4d63502c2f243449da0e6c28 [2020-07-28 17:41:48,435 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 17:41:48,448 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 17:41:48,452 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 17:41:48,453 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 17:41:48,454 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 17:41:48,455 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1011b.c [2020-07-28 17:41:48,517 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/272dfbf00/0829ceda136a42cba54c0601a969d4f2/FLAG6cb086130 [2020-07-28 17:41:48,955 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 17:41:48,956 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1011b.c [2020-07-28 17:41:48,963 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/272dfbf00/0829ceda136a42cba54c0601a969d4f2/FLAG6cb086130 [2020-07-28 17:41:49,363 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/272dfbf00/0829ceda136a42cba54c0601a969d4f2 [2020-07-28 17:41:49,367 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 17:41:49,370 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 17:41:49,371 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 17:41:49,372 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 17:41:49,375 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 17:41:49,377 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:41:49" (1/1) ... [2020-07-28 17:41:49,379 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28b5a801 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:41:49, skipping insertion in model container [2020-07-28 17:41:49,380 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:41:49" (1/1) ... [2020-07-28 17:41:49,386 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 17:41:49,402 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 17:41:49,572 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:41:49,580 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 17:41:49,610 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:41:49,698 INFO L208 MainTranslator]: Completed translation [2020-07-28 17:41:49,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:41:49 WrapperNode [2020-07-28 17:41:49,699 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 17:41:49,700 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 17:41:49,700 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 17:41:49,700 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 17:41:49,707 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:49" (1/1) ... [2020-07-28 17:41:49,717 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:49" (1/1) ... [2020-07-28 17:41:49,756 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 17:41:49,757 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 17:41:49,758 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 17:41:49,758 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 17:41:49,768 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:49" (1/1) ... [2020-07-28 17:41:49,769 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:49" (1/1) ... [2020-07-28 17:41:49,783 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:49" (1/1) ... [2020-07-28 17:41:49,784 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:49" (1/1) ... [2020-07-28 17:41:49,807 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:49" (1/1) ... [2020-07-28 17:41:49,818 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:49" (1/1) ... [2020-07-28 17:41:49,820 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:49" (1/1) ... [2020-07-28 17:41:49,825 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 17:41:49,826 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 17:41:49,826 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 17:41:49,827 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 17:41:49,828 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:41:49" (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:49,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2020-07-28 17:41:49,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2020-07-28 17:41:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-28 17:41:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2020-07-28 17:41:49,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 17:41:49,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 17:41:49,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2020-07-28 17:41:49,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-28 17:41:50,277 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 17:41:50,278 INFO L295 CfgBuilder]: Removed 14 assume(true) statements. [2020-07-28 17:41:50,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:41:50 BoogieIcfgContainer [2020-07-28 17:41:50,282 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 17:41:50,283 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 17:41:50,284 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 17:41:50,287 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 17:41:50,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 05:41:49" (1/3) ... [2020-07-28 17:41:50,288 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1676de02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:41:50, skipping insertion in model container [2020-07-28 17:41:50,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:41:49" (2/3) ... [2020-07-28 17:41:50,289 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1676de02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:41:50, skipping insertion in model container [2020-07-28 17:41:50,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:41:50" (3/3) ... [2020-07-28 17:41:50,292 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1011b.c [2020-07-28 17:41:50,305 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 17:41:50,318 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 17:41:50,356 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 17:41:50,388 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 17:41:50,389 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 17:41:50,389 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 17:41:50,389 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 17:41:50,390 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 17:41:50,390 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 17:41:50,390 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 17:41:50,390 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 17:41:50,406 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2020-07-28 17:41:50,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-07-28 17:41:50,411 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:41:50,412 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:41:50,412 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:41:50,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:41:50,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1641221055, now seen corresponding path program 1 times [2020-07-28 17:41:50,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 17:41:50,428 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1242037516] [2020-07-28 17:41:50,428 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:50,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:41:50,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 1 conjunts are in the unsatisfiable core [2020-07-28 17:41:50,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:41:50,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 17:41:50,556 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:50,557 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 := ~fp.neg~DOUBLE(~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:50,558 INFO L280 TraceCheckUtils]: 2: Hoare triple {22#true} assume !true; {23#false} is VALID [2020-07-28 17:41:50,559 INFO L280 TraceCheckUtils]: 3: Hoare triple {23#false} assume !true; {23#false} is VALID [2020-07-28 17:41:50,559 INFO L280 TraceCheckUtils]: 4: Hoare triple {23#false} fabs_double_#res := fabs_double_~x; {23#false} is VALID [2020-07-28 17:41:50,559 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:50,560 INFO L280 TraceCheckUtils]: 6: Hoare triple {23#false} assume !main_#t~short8; {23#false} is VALID [2020-07-28 17:41:50,560 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:50,560 INFO L280 TraceCheckUtils]: 8: Hoare triple {23#false} assume !false; {23#false} is VALID [2020-07-28 17:41:50,563 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,564 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 17:41:50,576 INFO L280 TraceCheckUtils]: 8: Hoare triple {23#false} assume !false; {23#false} is VALID [2020-07-28 17:41:50,576 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:50,577 INFO L280 TraceCheckUtils]: 6: Hoare triple {23#false} assume !main_#t~short8; {23#false} is VALID [2020-07-28 17:41:50,577 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:50,577 INFO L280 TraceCheckUtils]: 4: Hoare triple {23#false} fabs_double_#res := fabs_double_~x; {23#false} is VALID [2020-07-28 17:41:50,578 INFO L280 TraceCheckUtils]: 3: Hoare triple {23#false} assume !true; {23#false} is VALID [2020-07-28 17:41:50,582 INFO L280 TraceCheckUtils]: 2: Hoare triple {22#true} assume !true; {23#false} is VALID [2020-07-28 17:41:50,583 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 := ~fp.neg~DOUBLE(~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:50,583 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:50,584 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,585 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1242037516] [2020-07-28 17:41:50,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:41:50,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-07-28 17:41:50,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497166927] [2020-07-28 17:41:50,594 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2020-07-28 17:41:50,596 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:41:50,599 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 17:41:50,626 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:50,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 17:41:50,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 17:41:50,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 17:41:50,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 17:41:50,639 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2020-07-28 17:41:50,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:41:50,737 INFO L93 Difference]: Finished difference Result 36 states and 50 transitions. [2020-07-28 17:41:50,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 17:41:50,737 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2020-07-28 17:41:50,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:41:50,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:41:50,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 50 transitions. [2020-07-28 17:41:50,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:41:50,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 50 transitions. [2020-07-28 17:41:50,759 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 50 transitions. [2020-07-28 17:41:50,858 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:50,869 INFO L225 Difference]: With dead ends: 36 [2020-07-28 17:41:50,869 INFO L226 Difference]: Without dead ends: 16 [2020-07-28 17:41:50,873 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:50,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-07-28 17:41:50,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-07-28 17:41:50,907 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:41:50,907 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2020-07-28 17:41:50,908 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2020-07-28 17:41:50,908 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2020-07-28 17:41:50,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:41:50,911 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2020-07-28 17:41:50,911 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2020-07-28 17:41:50,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:41:50,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:41:50,912 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2020-07-28 17:41:50,912 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2020-07-28 17:41:50,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:41:50,915 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2020-07-28 17:41:50,915 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2020-07-28 17:41:50,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:41:50,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:41:50,916 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:41:50,916 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:41:50,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-28 17:41:50,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2020-07-28 17:41:50,920 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 9 [2020-07-28 17:41:50,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:41:50,920 INFO L479 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2020-07-28 17:41:50,920 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 17:41:50,921 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2020-07-28 17:41:50,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-28 17:41:50,921 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:41:50,921 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:41:51,142 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-07-28 17:41:51,143 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:41:51,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:41:51,144 INFO L82 PathProgramCache]: Analyzing trace with hash 558264036, now seen corresponding path program 1 times [2020-07-28 17:41:51,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 17:41:51,147 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1038366887] [2020-07-28 17:41:51,147 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:51,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:41:51,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 13 conjunts are in the unsatisfiable core [2020-07-28 17:41:51,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:41:51,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 17:41:51,460 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:51,472 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-28 17:41:51,481 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 17:41:51,481 INFO L544 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-28 17:41:51,500 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 17:41:51,502 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:51,503 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:92, output treesize:53 [2020-07-28 17:41:51,629 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-28 17:41:51,664 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:51,665 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 := ~fp.neg~DOUBLE(~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 (fp.neg (_ +zero 11 53)))} is VALID [2020-07-28 17:41:51,668 INFO L280 TraceCheckUtils]: 2: Hoare triple {180#(= ULTIMATE.start_fabs_double_~x (fp.neg (_ +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~union3;havoc fabs_double_#t~mem2;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 (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|)))) (= ULTIMATE.start_fabs_double_~x (fp.neg (_ +zero 11 53))))} is VALID [2020-07-28 17:41:51,671 INFO L280 TraceCheckUtils]: 3: Hoare triple {184#(and (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|)))) (= ULTIMATE.start_fabs_double_~x (fp.neg (_ +zero 11 53))))} goto; {184#(and (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|)))) (= ULTIMATE.start_fabs_double_~x (fp.neg (_ +zero 11 53))))} is VALID [2020-07-28 17:41:51,686 INFO L280 TraceCheckUtils]: 4: Hoare triple {184#(and (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|)))) (= ULTIMATE.start_fabs_double_~x (fp.neg (_ +zero 11 53))))} 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; {191#(exists ((|v_skolemized_q#valueAsBitvector_8| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (and (= (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|)) (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|))) (= (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|)) (fp.neg (_ +zero 11 53))) (= ULTIMATE.start_fabs_double_~x (fp ((_ extract 63 63) (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_8|))) ((_ extract 62 52) (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_8|))) ((_ extract 51 0) (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_8|)))))))} is VALID [2020-07-28 17:41:51,691 INFO L280 TraceCheckUtils]: 5: Hoare triple {191#(exists ((|v_skolemized_q#valueAsBitvector_8| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (and (= (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|)) (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|))) (= (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|)) (fp.neg (_ +zero 11 53))) (= ULTIMATE.start_fabs_double_~x (fp ((_ extract 63 63) (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_8|))) ((_ extract 62 52) (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_8|))) ((_ extract 51 0) (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_8|)))))))} goto; {191#(exists ((|v_skolemized_q#valueAsBitvector_8| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (and (= (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|)) (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|))) (= (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|)) (fp.neg (_ +zero 11 53))) (= ULTIMATE.start_fabs_double_~x (fp ((_ extract 63 63) (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_8|))) ((_ extract 62 52) (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_8|))) ((_ extract 51 0) (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_8|)))))))} is VALID [2020-07-28 17:41:51,696 INFO L280 TraceCheckUtils]: 6: Hoare triple {191#(exists ((|v_skolemized_q#valueAsBitvector_8| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (and (= (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|)) (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|))) (= (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|)) (fp.neg (_ +zero 11 53))) (= ULTIMATE.start_fabs_double_~x (fp ((_ extract 63 63) (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_8|))) ((_ extract 62 52) (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_8|))) ((_ extract 51 0) (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_8|)))))))} fabs_double_#res := fabs_double_~x; {198#(exists ((|v_skolemized_q#valueAsBitvector_8| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (and (= |ULTIMATE.start_fabs_double_#res| (fp ((_ extract 63 63) (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_8|))) ((_ extract 62 52) (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_8|))) ((_ extract 51 0) (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_8|))))) (= (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|)) (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|))) (= (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|)) (fp.neg (_ +zero 11 53)))))} is VALID [2020-07-28 17:41:51,700 INFO L280 TraceCheckUtils]: 7: Hoare triple {198#(exists ((|v_skolemized_q#valueAsBitvector_8| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (and (= |ULTIMATE.start_fabs_double_#res| (fp ((_ extract 63 63) (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_8|))) ((_ extract 62 52) (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_8|))) ((_ extract 51 0) (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_8|))))) (= (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|)) (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|))) (= (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|)) (fp.neg (_ +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()); {202#|ULTIMATE.start_main_#t~short8|} is VALID [2020-07-28 17:41:51,701 INFO L280 TraceCheckUtils]: 8: Hoare triple {202#|ULTIMATE.start_main_#t~short8|} assume !main_#t~short8; {173#false} is VALID [2020-07-28 17:41:51,702 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:51,702 INFO L280 TraceCheckUtils]: 10: Hoare triple {173#false} assume !false; {173#false} is VALID [2020-07-28 17:41:51,704 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:51,704 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 17:41:51,825 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:51,835 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-28 17:41:51,841 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 17:41:51,841 INFO L544 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-28 17:41:51,856 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 17:41:51,857 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:51,857 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:71, output treesize:35 [2020-07-28 17:41:52,034 INFO L280 TraceCheckUtils]: 10: Hoare triple {173#false} assume !false; {173#false} is VALID [2020-07-28 17:41:52,034 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:52,037 INFO L280 TraceCheckUtils]: 8: Hoare triple {202#|ULTIMATE.start_main_#t~short8|} assume !main_#t~short8; {173#false} is VALID [2020-07-28 17:41:52,046 INFO L280 TraceCheckUtils]: 7: Hoare triple {221#(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()); {202#|ULTIMATE.start_main_#t~short8|} is VALID [2020-07-28 17:41:52,047 INFO L280 TraceCheckUtils]: 6: Hoare triple {225#(fp.eq ULTIMATE.start_fabs_double_~x (_ +zero 11 53))} fabs_double_#res := fabs_double_~x; {221#(fp.eq |ULTIMATE.start_fabs_double_#res| (_ +zero 11 53))} is VALID [2020-07-28 17:41:52,048 INFO L280 TraceCheckUtils]: 5: Hoare triple {225#(fp.eq ULTIMATE.start_fabs_double_~x (_ +zero 11 53))} goto; {225#(fp.eq ULTIMATE.start_fabs_double_~x (_ +zero 11 53))} is VALID [2020-07-28 17:41:52,055 INFO L280 TraceCheckUtils]: 4: Hoare triple {232#(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; {225#(fp.eq ULTIMATE.start_fabs_double_~x (_ +zero 11 53))} is VALID [2020-07-28 17:41:52,057 INFO L280 TraceCheckUtils]: 3: Hoare triple {232#(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; {232#(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:52,063 INFO L280 TraceCheckUtils]: 2: Hoare triple {225#(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~union3;havoc fabs_double_#t~mem2;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; {232#(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:52,064 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 := ~fp.neg~DOUBLE(~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; {225#(fp.eq ULTIMATE.start_fabs_double_~x (_ +zero 11 53))} is VALID [2020-07-28 17:41:52,065 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:52,066 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,066 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1038366887] [2020-07-28 17:41:52,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:41:52,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 10 [2020-07-28 17:41:52,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320844324] [2020-07-28 17:41:52,069 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2020-07-28 17:41:52,069 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:41:52,070 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-28 17:41:52,135 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:52,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-28 17:41:52,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 17:41:52,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-28 17:41:52,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-07-28 17:41:52,138 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 10 states. [2020-07-28 17:41:53,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:41:53,031 INFO L93 Difference]: Finished difference Result 19 states and 18 transitions. [2020-07-28 17:41:53,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-28 17:41:53,031 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 11 [2020-07-28 17:41:53,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:41:53,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-28 17:41:53,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 18 transitions. [2020-07-28 17:41:53,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-28 17:41:53,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 18 transitions. [2020-07-28 17:41:53,035 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 18 transitions. [2020-07-28 17:41:53,148 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:53,150 INFO L225 Difference]: With dead ends: 19 [2020-07-28 17:41:53,150 INFO L226 Difference]: Without dead ends: 16 [2020-07-28 17:41:53,151 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2020-07-28 17:41:53,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-07-28 17:41:53,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-07-28 17:41:53,168 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:41:53,168 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2020-07-28 17:41:53,168 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2020-07-28 17:41:53,168 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2020-07-28 17:41:53,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:41:53,170 INFO L93 Difference]: Finished difference Result 16 states and 15 transitions. [2020-07-28 17:41:53,170 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 15 transitions. [2020-07-28 17:41:53,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:41:53,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:41:53,171 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2020-07-28 17:41:53,171 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2020-07-28 17:41:53,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:41:53,173 INFO L93 Difference]: Finished difference Result 16 states and 15 transitions. [2020-07-28 17:41:53,173 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 15 transitions. [2020-07-28 17:41:53,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:41:53,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:41:53,174 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:41:53,174 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:41:53,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-28 17:41:53,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 15 transitions. [2020-07-28 17:41:53,175 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 15 transitions. Word has length 11 [2020-07-28 17:41:53,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:41:53,176 INFO L479 AbstractCegarLoop]: Abstraction has 16 states and 15 transitions. [2020-07-28 17:41:53,176 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-28 17:41:53,176 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 15 transitions. [2020-07-28 17:41:53,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-28 17:41:53,177 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:41:53,177 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:53,382 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-07-28 17:41:53,383 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:41:53,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:41:53,384 INFO L82 PathProgramCache]: Analyzing trace with hash -2014349959, now seen corresponding path program 1 times [2020-07-28 17:41:53,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 17:41:53,386 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [171491945] [2020-07-28 17:41:53,386 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:53,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:41:53,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 18 conjunts are in the unsatisfiable core [2020-07-28 17:41:53,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:41:53,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 17:41:53,575 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:53,584 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:53,584 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:53,588 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 17:41:53,589 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:53,598 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 17:41:53,599 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:53,599 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:35 [2020-07-28 17:41:53,607 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-28 17:41:53,608 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 (= 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)))) (= (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.neg (_ +zero 11 53)))) [2020-07-28 17:41:53,608 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [|v_skolemized_q#valueAsBitvector_9|, v_arrayElimCell_4]. (and (= (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) (= (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.neg (_ +zero 11 53)))) [2020-07-28 17:41:53,911 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-28 17:41:53,999 INFO L280 TraceCheckUtils]: 0: Hoare triple {325#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {325#true} is VALID [2020-07-28 17:41:54,000 INFO L280 TraceCheckUtils]: 1: Hoare triple {325#true} havoc main_#res;havoc main_#t~ret6, main_#t~ret7, main_#t~short8, main_~x~0, main_~res~0;main_~x~0 := ~fp.neg~DOUBLE(~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; {333#(= ULTIMATE.start_fabs_double_~x (fp.neg (_ +zero 11 53)))} is VALID [2020-07-28 17:41:54,004 INFO L280 TraceCheckUtils]: 2: Hoare triple {333#(= ULTIMATE.start_fabs_double_~x (fp.neg (_ +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~union3;havoc fabs_double_#t~mem2;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; {337#(exists ((|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64))) (and (= ULTIMATE.start_fabs_double_~high~0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) (= (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.neg (_ +zero 11 53)))))} is VALID [2020-07-28 17:41:54,005 INFO L280 TraceCheckUtils]: 3: Hoare triple {337#(exists ((|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64))) (and (= ULTIMATE.start_fabs_double_~high~0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) (= (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.neg (_ +zero 11 53)))))} goto; {337#(exists ((|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64))) (and (= ULTIMATE.start_fabs_double_~high~0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) (= (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.neg (_ +zero 11 53)))))} is VALID [2020-07-28 17:41:54,023 INFO L280 TraceCheckUtils]: 4: Hoare triple {337#(exists ((|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64))) (and (= ULTIMATE.start_fabs_double_~high~0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_9|)) (= (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.neg (_ +zero 11 53)))))} 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; {344#(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_~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|)) (fp.neg (_ +zero 11 53)))))} is VALID [2020-07-28 17:41:54,024 INFO L280 TraceCheckUtils]: 5: Hoare triple {344#(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_~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|)) (fp.neg (_ +zero 11 53)))))} goto; {344#(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_~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|)) (fp.neg (_ +zero 11 53)))))} is VALID [2020-07-28 17:41:54,025 INFO L280 TraceCheckUtils]: 6: Hoare triple {344#(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_~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|)) (fp.neg (_ +zero 11 53)))))} fabs_double_#res := fabs_double_~x; {351#(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|) (= (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.neg (_ +zero 11 53)))))} is VALID [2020-07-28 17:41:54,026 INFO L280 TraceCheckUtils]: 7: Hoare triple {351#(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|) (= (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.neg (_ +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()); {355#(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_main_~res~0) (= (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.neg (_ +zero 11 53)))))} is VALID [2020-07-28 17:41:54,033 INFO L280 TraceCheckUtils]: 8: Hoare triple {355#(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_main_~res~0) (= (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.neg (_ +zero 11 53)))))} 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; {359#(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___signbit_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|)) (fp.neg (_ +zero 11 53)))))} is VALID [2020-07-28 17:41:54,037 INFO L280 TraceCheckUtils]: 9: Hoare triple {359#(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___signbit_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|)) (fp.neg (_ +zero 11 53)))))} 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; {363#(exists ((|v_skolemized_q#valueAsBitvector_10| (_ BitVec 64)) (v_arrayElimCell_4 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64))) (and (= 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|))) (= (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.neg (_ +zero 11 53)))))} is VALID [2020-07-28 17:41:54,038 INFO L280 TraceCheckUtils]: 10: Hoare triple {363#(exists ((|v_skolemized_q#valueAsBitvector_10| (_ BitVec 64)) (v_arrayElimCell_4 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64))) (and (= 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|))) (= (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.neg (_ +zero 11 53)))))} goto; {363#(exists ((|v_skolemized_q#valueAsBitvector_10| (_ BitVec 64)) (v_arrayElimCell_4 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64))) (and (= 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|))) (= (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.neg (_ +zero 11 53)))))} is VALID [2020-07-28 17:41:54,039 INFO L280 TraceCheckUtils]: 11: Hoare triple {363#(exists ((|v_skolemized_q#valueAsBitvector_10| (_ BitVec 64)) (v_arrayElimCell_4 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64))) (and (= 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|))) (= (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.neg (_ +zero 11 53)))))} __signbit_double_#res := (if 0bv32 != ~bvand32(2147483648bv32, __signbit_double_~msw~0) then 1bv32 else 0bv32); {370#(= |ULTIMATE.start___signbit_double_#res| (_ bv0 32))} is VALID [2020-07-28 17:41:54,043 INFO L280 TraceCheckUtils]: 12: Hoare triple {370#(= |ULTIMATE.start___signbit_double_#res| (_ bv0 32))} main_#t~ret7 := __signbit_double_#res;main_#t~short8 := 0bv32 == main_#t~ret7; {374#|ULTIMATE.start_main_#t~short8|} is VALID [2020-07-28 17:41:54,044 INFO L280 TraceCheckUtils]: 13: Hoare triple {374#|ULTIMATE.start_main_#t~short8|} assume !main_#t~short8;havoc main_#t~ret7;havoc main_#t~short8; {326#false} is VALID [2020-07-28 17:41:54,044 INFO L280 TraceCheckUtils]: 14: Hoare triple {326#false} assume !false; {326#false} is VALID [2020-07-28 17:41:54,046 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:54,046 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 17:41:54,482 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:54,493 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:54,494 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:54,500 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 17:41:54,501 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:54,513 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-28 17:41:54,514 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:54,515 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:62, output treesize:35 [2020-07-28 17:41:54,520 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-28 17:41:54,521 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:54,521 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:55,091 INFO L280 TraceCheckUtils]: 14: Hoare triple {326#false} assume !false; {326#false} is VALID [2020-07-28 17:41:55,092 INFO L280 TraceCheckUtils]: 13: Hoare triple {374#|ULTIMATE.start_main_#t~short8|} assume !main_#t~short8;havoc main_#t~ret7;havoc main_#t~short8; {326#false} is VALID [2020-07-28 17:41:55,092 INFO L280 TraceCheckUtils]: 12: Hoare triple {370#(= |ULTIMATE.start___signbit_double_#res| (_ bv0 32))} main_#t~ret7 := __signbit_double_#res;main_#t~short8 := 0bv32 == main_#t~ret7; {374#|ULTIMATE.start_main_#t~short8|} is VALID [2020-07-28 17:41:55,093 INFO L280 TraceCheckUtils]: 11: Hoare triple {390#(= (_ 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); {370#(= |ULTIMATE.start___signbit_double_#res| (_ bv0 32))} is VALID [2020-07-28 17:41:55,094 INFO L280 TraceCheckUtils]: 10: Hoare triple {390#(= (_ bv0 32) (bvand (_ bv2147483648 32) ULTIMATE.start___signbit_double_~msw~0))} goto; {390#(= (_ bv0 32) (bvand (_ bv2147483648 32) ULTIMATE.start___signbit_double_~msw~0))} is VALID [2020-07-28 17:41:55,096 INFO L280 TraceCheckUtils]: 9: Hoare triple {397#(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; {390#(= (_ bv0 32) (bvand (_ bv2147483648 32) ULTIMATE.start___signbit_double_~msw~0))} is VALID [2020-07-28 17:41:55,099 INFO L280 TraceCheckUtils]: 8: Hoare triple {401#(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; {397#(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:55,100 INFO L280 TraceCheckUtils]: 7: Hoare triple {405#(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()); {401#(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:55,102 INFO L280 TraceCheckUtils]: 6: Hoare triple {409#(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; {405#(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:55,103 INFO L280 TraceCheckUtils]: 5: Hoare triple {409#(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; {409#(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:55,106 INFO L280 TraceCheckUtils]: 4: Hoare triple {416#(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; {409#(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:55,107 INFO L280 TraceCheckUtils]: 3: Hoare triple {416#(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; {416#(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:55,117 INFO L280 TraceCheckUtils]: 2: Hoare triple {423#(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~union3;havoc fabs_double_#t~mem2;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; {416#(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:55,120 INFO L280 TraceCheckUtils]: 1: Hoare triple {325#true} havoc main_#res;havoc main_#t~ret6, main_#t~ret7, main_#t~short8, main_~x~0, main_~res~0;main_~x~0 := ~fp.neg~DOUBLE(~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; {423#(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:55,120 INFO L280 TraceCheckUtils]: 0: Hoare triple {325#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven; {325#true} is VALID [2020-07-28 17:41:55,123 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:55,123 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [171491945] [2020-07-28 17:41:55,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:41:55,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 11] imperfect sequences [] total 18 [2020-07-28 17:41:55,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765653159] [2020-07-28 17:41:55,125 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 15 [2020-07-28 17:41:55,125 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:41:55,125 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2020-07-28 17:41:55,296 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:55,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-28 17:41:55,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 17:41:55,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-28 17:41:55,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2020-07-28 17:41:55,298 INFO L87 Difference]: Start difference. First operand 16 states and 15 transitions. Second operand 18 states. [2020-07-28 17:41:57,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:41:57,047 INFO L93 Difference]: Finished difference Result 16 states and 15 transitions. [2020-07-28 17:41:57,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-28 17:41:57,048 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 15 [2020-07-28 17:41:57,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:41:57,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-28 17:41:57,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. [2020-07-28 17:41:57,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-28 17:41:57,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. [2020-07-28 17:41:57,050 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 15 transitions. [2020-07-28 17:41:57,510 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:57,510 INFO L225 Difference]: With dead ends: 16 [2020-07-28 17:41:57,510 INFO L226 Difference]: Without dead ends: 0 [2020-07-28 17:41:57,511 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=136, Invalid=464, Unknown=0, NotChecked=0, Total=600 [2020-07-28 17:41:57,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-28 17:41:57,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-28 17:41:57,511 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:41:57,511 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-28 17:41:57,511 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 17:41:57,512 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 17:41:57,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:41:57,512 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 17:41:57,512 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 17:41:57,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:41:57,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:41:57,512 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 17:41:57,513 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 17:41:57,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:41:57,513 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 17:41:57,513 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 17:41:57,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:41:57,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:41:57,513 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:41:57,513 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:41:57,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-28 17:41:57,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-28 17:41:57,514 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2020-07-28 17:41:57,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:41:57,514 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-28 17:41:57,514 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-28 17:41:57,514 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 17:41:57,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:41:57,715 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-07-28 17:41:57,719 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-28 17:41:57,950 WARN L193 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2020-07-28 17:41:58,266 WARN L193 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 73 [2020-07-28 17:41:58,278 INFO L268 CegarLoopResult]: For program point L27-1(lines 27 31) no Hoare annotation was computed. [2020-07-28 17:41:58,278 INFO L264 CegarLoopResult]: At program point L27-2(lines 27 31) the Hoare annotation is: (= ULTIMATE.start_fabs_double_~x (fp.neg (_ +zero 11 53))) [2020-07-28 17:41:58,278 INFO L271 CegarLoopResult]: At program point L56(lines 41 57) the Hoare annotation is: true [2020-07-28 17:41:58,279 INFO L264 CegarLoopResult]: At program point L23(lines 14 24) the Hoare annotation is: (and (= |ULTIMATE.start___signbit_double_#res| (_ bv0 32)) (exists ((|v_skolemized_q#valueAsBitvector_10| (_ BitVec 64)) (v_arrayElimCell_4 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64))) (and (= 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|))) (= (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.neg (_ +zero 11 53))))) (exists ((v_arrayElimCell_4 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64))) (and (= (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) (= (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.neg (_ +zero 11 53))))) |ULTIMATE.start_main_#t~short8| (exists ((v_arrayElimCell_4 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64))) (and (= (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) (= (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.neg (_ +zero 11 53))))) (exists ((|v_skolemized_q#valueAsBitvector_8| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (let ((.cse4 (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|)))) (and (= |ULTIMATE.start_fabs_double_#res| (let ((.cse3 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_8|)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))) (= .cse4 (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|))) (= .cse4 (fp.neg (_ +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|)) (= (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.neg (_ +zero 11 53))))) (exists ((|v_skolemized_q#valueAsBitvector_8| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (let ((.cse5 (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|)))) (and (= .cse5 (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|))) (= .cse5 (fp.neg (_ +zero 11 53))) (= ULTIMATE.start_fabs_double_~x (let ((.cse6 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_8|)))) (fp ((_ extract 63 63) .cse6) ((_ extract 62 52) .cse6) ((_ extract 51 0) .cse6)))))))) [2020-07-28 17:41:58,279 INFO L268 CegarLoopResult]: For program point L52(line 52) no Hoare annotation was computed. [2020-07-28 17:41:58,279 INFO L268 CegarLoopResult]: For program point L32(lines 32 37) no Hoare annotation was computed. [2020-07-28 17:41:58,279 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-28 17:41:58,280 INFO L268 CegarLoopResult]: For program point L32-1(lines 25 39) no Hoare annotation was computed. [2020-07-28 17:41:58,280 INFO L268 CegarLoopResult]: For program point L32-2(lines 32 37) no Hoare annotation was computed. [2020-07-28 17:41:58,280 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-28 17:41:58,280 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-28 17:41:58,280 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 52) no Hoare annotation was computed. [2020-07-28 17:41:58,280 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-28 17:41:58,281 INFO L268 CegarLoopResult]: For program point L17-1(lines 17 21) no Hoare annotation was computed. [2020-07-28 17:41:58,281 INFO L264 CegarLoopResult]: At program point L17-2(lines 17 21) the Hoare annotation is: (and (exists ((v_arrayElimCell_4 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64))) (and (= (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) (= (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.neg (_ +zero 11 53))))) |ULTIMATE.start_main_#t~short8| (exists ((v_arrayElimCell_4 (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_9| (_ BitVec 64))) (and (= (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) (= (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.neg (_ +zero 11 53))))) (exists ((|v_skolemized_q#valueAsBitvector_8| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (let ((.cse3 (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|)))) (and (= |ULTIMATE.start_fabs_double_#res| (let ((.cse2 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_8|)))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2)))) (= .cse3 (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|))) (= .cse3 (fp.neg (_ +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|)) (= (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.neg (_ +zero 11 53))))) (exists ((|v_skolemized_q#valueAsBitvector_8| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (let ((.cse4 (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|)))) (and (= .cse4 (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|))) (= .cse4 (fp.neg (_ +zero 11 53))) (= ULTIMATE.start_fabs_double_~x (let ((.cse5 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_8|)))) (fp ((_ extract 63 63) .cse5) ((_ extract 62 52) .cse5) ((_ extract 51 0) .cse5)))))))) [2020-07-28 17:41:58,281 INFO L268 CegarLoopResult]: For program point L17-3(lines 17 21) no Hoare annotation was computed. [2020-07-28 17:41:58,282 INFO L264 CegarLoopResult]: At program point L38(lines 25 39) the Hoare annotation is: (and (exists ((|v_skolemized_q#valueAsBitvector_8| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (let ((.cse1 (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|)))) (and (= |ULTIMATE.start_fabs_double_#res| (let ((.cse0 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_8|)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0)))) (= .cse1 (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|))) (= .cse1 (fp.neg (_ +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|)) (= (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.neg (_ +zero 11 53))))) (exists ((|v_skolemized_q#valueAsBitvector_8| (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (let ((.cse2 (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|)))) (and (= .cse2 (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|))) (= .cse2 (fp.neg (_ +zero 11 53))) (= ULTIMATE.start_fabs_double_~x (let ((.cse3 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|)) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_8|)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))))) [2020-07-28 17:41:58,282 INFO L268 CegarLoopResult]: For program point L51(line 51) no Hoare annotation was computed. [2020-07-28 17:41:58,282 INFO L268 CegarLoopResult]: For program point L51-2(lines 51 54) no Hoare annotation was computed. [2020-07-28 17:41:58,287 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 17:41:58,287 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-28 17:41:58,287 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2020-07-28 17:41:58,287 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2020-07-28 17:41:58,287 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2020-07-28 17:41:58,287 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2020-07-28 17:41:58,288 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2020-07-28 17:41:58,288 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2020-07-28 17:41:58,288 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-28 17:41:58,288 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2020-07-28 17:41:58,288 WARN L170 areAnnotationChecker]: L32-2 has no Hoare annotation [2020-07-28 17:41:58,288 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2020-07-28 17:41:58,288 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2020-07-28 17:41:58,288 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2020-07-28 17:41:58,288 WARN L170 areAnnotationChecker]: L17-1 has no Hoare annotation [2020-07-28 17:41:58,289 WARN L170 areAnnotationChecker]: L17-3 has no Hoare annotation [2020-07-28 17:41:58,289 WARN L170 areAnnotationChecker]: L51-2 has no Hoare annotation [2020-07-28 17:41:58,289 WARN L170 areAnnotationChecker]: L51-2 has no Hoare annotation [2020-07-28 17:41:58,289 WARN L170 areAnnotationChecker]: L17-1 has no Hoare annotation [2020-07-28 17:41:58,289 WARN L170 areAnnotationChecker]: L17-1 has no Hoare annotation [2020-07-28 17:41:58,290 WARN L170 areAnnotationChecker]: L17-3 has no Hoare annotation [2020-07-28 17:41:58,290 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2020-07-28 17:41:58,290 WARN L170 areAnnotationChecker]: L52 has no Hoare annotation [2020-07-28 17:41:58,290 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 17:41:58,291 WARN L170 areAnnotationChecker]: L51-2 has no Hoare annotation [2020-07-28 17:41:58,291 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 17:41:58,291 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:58,294 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:58,298 INFO L168 Benchmark]: Toolchain (without parser) took 8929.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 198.7 MB). Free memory was 956.2 MB in the beginning and 1.0 GB in the end (delta: -75.7 MB). Peak memory consumption was 123.0 MB. Max. memory is 11.5 GB. [2020-07-28 17:41:58,299 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 17:41:58,300 INFO L168 Benchmark]: CACSL2BoogieTranslator took 327.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -169.9 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2020-07-28 17:41:58,301 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.27 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: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. [2020-07-28 17:41:58,301 INFO L168 Benchmark]: Boogie Preprocessor took 68.44 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:58,302 INFO L168 Benchmark]: RCFGBuilder took 456.28 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: 24.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. [2020-07-28 17:41:58,303 INFO L168 Benchmark]: TraceAbstraction took 8012.23 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 68.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 61.4 MB). Peak memory consumption was 130.1 MB. Max. memory is 11.5 GB. [2020-07-28 17:41:58,307 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 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 327.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -169.9 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 57.27 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: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 68.44 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 456.28 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: 24.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8012.23 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 68.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 61.4 MB). Peak memory consumption was 130.1 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...