./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_1072c_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a2f0cfe4-648d-4915-be54-729d8deeff7a/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a2f0cfe4-648d-4915-be54-729d8deeff7a/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a2f0cfe4-648d-4915-be54-729d8deeff7a/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a2f0cfe4-648d-4915-be54-729d8deeff7a/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1072c_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_a2f0cfe4-648d-4915-be54-729d8deeff7a/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a2f0cfe4-648d-4915-be54-729d8deeff7a/bin-2019/uautomizer --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 c0077a740f714225dc922bb100a19cc0ae47da01 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a2f0cfe4-648d-4915-be54-729d8deeff7a/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a2f0cfe4-648d-4915-be54-729d8deeff7a/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a2f0cfe4-648d-4915-be54-729d8deeff7a/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a2f0cfe4-648d-4915-be54-729d8deeff7a/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1072c_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_a2f0cfe4-648d-4915-be54-729d8deeff7a/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a2f0cfe4-648d-4915-be54-729d8deeff7a/bin-2019/uautomizer --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 c0077a740f714225dc922bb100a19cc0ae47da01 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 15:53:07,793 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 15:53:07,794 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 15:53:07,801 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 15:53:07,801 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 15:53:07,802 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 15:53:07,803 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 15:53:07,804 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 15:53:07,805 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 15:53:07,806 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 15:53:07,806 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 15:53:07,807 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 15:53:07,807 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 15:53:07,808 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 15:53:07,809 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 15:53:07,809 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 15:53:07,810 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 15:53:07,811 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 15:53:07,812 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 15:53:07,813 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 15:53:07,814 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 15:53:07,815 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 15:53:07,816 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 15:53:07,817 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 15:53:07,817 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 15:53:07,817 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 15:53:07,818 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 15:53:07,819 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 15:53:07,819 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 15:53:07,820 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 15:53:07,820 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 15:53:07,821 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 15:53:07,821 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 15:53:07,821 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 15:53:07,821 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 15:53:07,822 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 15:53:07,822 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a2f0cfe4-648d-4915-be54-729d8deeff7a/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 15:53:07,832 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 15:53:07,832 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 15:53:07,833 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 15:53:07,833 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 15:53:07,834 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 15:53:07,834 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 15:53:07,834 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 15:53:07,834 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 15:53:07,834 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 15:53:07,834 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 15:53:07,834 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 15:53:07,835 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 15:53:07,835 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 15:53:07,835 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 15:53:07,835 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 15:53:07,835 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 15:53:07,835 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 15:53:07,835 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 15:53:07,836 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 15:53:07,836 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 15:53:07,836 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 15:53:07,836 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 15:53:07,836 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 15:53:07,836 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 15:53:07,837 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 15:53:07,837 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 15:53:07,837 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 15:53:07,837 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 15:53:07,837 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 15:53:07,837 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 15:53:07,837 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_a2f0cfe4-648d-4915-be54-729d8deeff7a/bin-2019/uautomizer 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 -> c0077a740f714225dc922bb100a19cc0ae47da01 [2018-11-23 15:53:07,861 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 15:53:07,870 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 15:53:07,873 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 15:53:07,874 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 15:53:07,874 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 15:53:07,875 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a2f0cfe4-648d-4915-be54-729d8deeff7a/bin-2019/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_1072c_true-unreach-call.c [2018-11-23 15:53:07,920 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a2f0cfe4-648d-4915-be54-729d8deeff7a/bin-2019/uautomizer/data/e5b78324e/768e633fde7745edbc9b79e0ee291924/FLAGed779f9f0 [2018-11-23 15:53:08,223 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 15:53:08,223 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a2f0cfe4-648d-4915-be54-729d8deeff7a/sv-benchmarks/c/float-newlib/double_req_bl_1072c_true-unreach-call.c [2018-11-23 15:53:08,228 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a2f0cfe4-648d-4915-be54-729d8deeff7a/bin-2019/uautomizer/data/e5b78324e/768e633fde7745edbc9b79e0ee291924/FLAGed779f9f0 [2018-11-23 15:53:08,239 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a2f0cfe4-648d-4915-be54-729d8deeff7a/bin-2019/uautomizer/data/e5b78324e/768e633fde7745edbc9b79e0ee291924 [2018-11-23 15:53:08,241 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 15:53:08,242 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 15:53:08,242 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 15:53:08,243 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 15:53:08,245 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 15:53:08,245 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:53:08" (1/1) ... [2018-11-23 15:53:08,247 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57f3324f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:53:08, skipping insertion in model container [2018-11-23 15:53:08,247 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:53:08" (1/1) ... [2018-11-23 15:53:08,252 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 15:53:08,266 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 15:53:08,385 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:53:08,387 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 15:53:08,406 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:53:08,418 INFO L195 MainTranslator]: Completed translation [2018-11-23 15:53:08,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:53:08 WrapperNode [2018-11-23 15:53:08,419 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 15:53:08,419 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 15:53:08,419 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 15:53:08,419 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 15:53:08,424 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:53:08" (1/1) ... [2018-11-23 15:53:08,433 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:53:08" (1/1) ... [2018-11-23 15:53:08,439 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 15:53:08,439 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 15:53:08,440 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 15:53:08,440 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 15:53:08,483 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:53:08" (1/1) ... [2018-11-23 15:53:08,483 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:53:08" (1/1) ... [2018-11-23 15:53:08,486 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:53:08" (1/1) ... [2018-11-23 15:53:08,486 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:53:08" (1/1) ... [2018-11-23 15:53:08,496 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:53:08" (1/1) ... [2018-11-23 15:53:08,502 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:53:08" (1/1) ... [2018-11-23 15:53:08,503 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:53:08" (1/1) ... [2018-11-23 15:53:08,505 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 15:53:08,505 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 15:53:08,506 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 15:53:08,506 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 15:53:08,506 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:53:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a2f0cfe4-648d-4915-be54-729d8deeff7a/bin-2019/uautomizer/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 [2018-11-23 15:53:08,546 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_double [2018-11-23 15:53:08,546 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_double [2018-11-23 15:53:08,546 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 15:53:08,546 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 15:53:08,546 INFO L130 BoogieDeclarations]: Found specification of procedure trunc_double [2018-11-23 15:53:08,547 INFO L138 BoogieDeclarations]: Found implementation of procedure trunc_double [2018-11-23 15:53:08,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-11-23 15:53:08,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 15:53:08,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 15:53:08,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 15:53:08,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-23 15:53:08,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 15:53:08,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 15:53:08,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 15:53:08,548 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 15:53:08,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 15:53:08,770 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 15:53:08,770 INFO L280 CfgBuilder]: Removed 10 assue(true) statements. [2018-11-23 15:53:08,771 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:53:08 BoogieIcfgContainer [2018-11-23 15:53:08,771 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 15:53:08,771 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 15:53:08,771 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 15:53:08,774 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 15:53:08,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:53:08" (1/3) ... [2018-11-23 15:53:08,775 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f9b7514 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:53:08, skipping insertion in model container [2018-11-23 15:53:08,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:53:08" (2/3) ... [2018-11-23 15:53:08,775 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f9b7514 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:53:08, skipping insertion in model container [2018-11-23 15:53:08,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:53:08" (3/3) ... [2018-11-23 15:53:08,777 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1072c_true-unreach-call.c [2018-11-23 15:53:08,785 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 15:53:08,793 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 15:53:08,806 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 15:53:08,832 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 15:53:08,832 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 15:53:08,832 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 15:53:08,832 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 15:53:08,833 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 15:53:08,833 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 15:53:08,833 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 15:53:08,833 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 15:53:08,833 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 15:53:08,845 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2018-11-23 15:53:08,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 15:53:08,849 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:53:08,850 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:53:08,851 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:53:08,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:53:08,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1697336041, now seen corresponding path program 1 times [2018-11-23 15:53:08,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:53:08,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:53:08,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:53:08,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:53:08,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:53:08,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:53:08,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:53:08,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:53:08,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 15:53:08,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 15:53:08,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 15:53:08,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 15:53:08,956 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 2 states. [2018-11-23 15:53:08,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:53:08,971 INFO L93 Difference]: Finished difference Result 74 states and 105 transitions. [2018-11-23 15:53:08,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 15:53:08,972 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-11-23 15:53:08,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:53:08,977 INFO L225 Difference]: With dead ends: 74 [2018-11-23 15:53:08,977 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 15:53:08,979 INFO L631 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 [2018-11-23 15:53:08,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 15:53:08,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-23 15:53:08,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 15:53:09,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-11-23 15:53:09,001 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 19 [2018-11-23 15:53:09,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:53:09,001 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-23 15:53:09,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 15:53:09,002 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-23 15:53:09,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 15:53:09,002 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:53:09,003 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:53:09,003 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:53:09,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:53:09,003 INFO L82 PathProgramCache]: Analyzing trace with hash 859793106, now seen corresponding path program 1 times [2018-11-23 15:53:09,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:53:09,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:53:09,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:53:09,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:53:09,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:53:09,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:53:09,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:53:09,074 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=6442450951, |#NULL.offset|=6442450946, |old(#NULL.base)|=6442450951, |old(#NULL.offset)|=6442450946] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=6442450951, |old(#NULL.offset)|=6442450946] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=6442450951, |old(#NULL.offset)|=6442450946] [?] RET #110#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret15 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] ~x~0 := ~someUnaryDOUBLEoperation(0.0); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret12 := trunc_double(~x~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |trunc_double_#in~x|=6442450945.0] [?] ~x := #in~x;havoc ~signbit~0;havoc ~msw~0;havoc ~lsw~0;havoc ~exponent_less_1023~0; VAL [trunc_double_~x=6442450945.0, |#NULL.base|=0, |#NULL.offset|=0, |trunc_double_#in~x|=6442450945.0] [?] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8);call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8);call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4);~msw~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296);call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~union1;havoc #t~mem0;call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4);~lsw~0 := #t~mem2;call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~union3;havoc #t~mem2;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [trunc_double_~lsw~0=6442450953, trunc_double_~msw~0=(- 2147483648), trunc_double_~x=6442450945.0, |#NULL.base|=0, |#NULL.offset|=0, |trunc_double_#in~x|=6442450945.0] [?] goto; VAL [trunc_double_~lsw~0=6442450953, trunc_double_~msw~0=(- 2147483648), trunc_double_~x=6442450945.0, |#NULL.base|=0, |#NULL.offset|=0, |trunc_double_#in~x|=6442450945.0] [?] ~signbit~0 := (if ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 else ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 - 4294967296);~exponent_less_1023~0 := ~bitwiseAnd(~msw~0, 2146435072) / 1048576 - 1023; VAL [trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=6442450953, trunc_double_~msw~0=(- 2147483648), trunc_double_~signbit~0=(- 1), trunc_double_~x=6442450945.0, |#NULL.base|=0, |#NULL.offset|=0, |trunc_double_#in~x|=6442450945.0] [?] assume !(~exponent_less_1023~0 < 20); VAL [trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=6442450953, trunc_double_~msw~0=(- 2147483648), trunc_double_~signbit~0=(- 1), trunc_double_~x=6442450945.0, |#NULL.base|=0, |#NULL.offset|=0, |trunc_double_#in~x|=6442450945.0] [?] assume ~exponent_less_1023~0 > 51; VAL [trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=6442450953, trunc_double_~msw~0=(- 2147483648), trunc_double_~signbit~0=(- 1), trunc_double_~x=6442450945.0, |#NULL.base|=0, |#NULL.offset|=0, |trunc_double_#in~x|=6442450945.0] [?] assume 1024 == ~exponent_less_1023~0;#res := ~someBinaryArithmeticDOUBLEoperation(~x, ~x); VAL [trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=6442450953, trunc_double_~msw~0=(- 2147483648), trunc_double_~signbit~0=(- 1), trunc_double_~x=6442450945.0, |#NULL.base|=0, |#NULL.offset|=0, |trunc_double_#in~x|=6442450945.0] [?] assume true; VAL [trunc_double_~exponent_less_1023~0=1024, trunc_double_~lsw~0=6442450953, trunc_double_~msw~0=(- 2147483648), trunc_double_~signbit~0=(- 1), trunc_double_~x=6442450945.0, |#NULL.base|=0, |#NULL.offset|=0, |trunc_double_#in~x|=6442450945.0] [?] RET #114#return; VAL [main_~x~0=6442450945.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret12|=6442450950.0] [?] ~res~0 := #t~ret12;havoc #t~ret12;#t~short14 := ~someBinaryDOUBLEComparisonOperation(~res~0, ~someUnaryDOUBLEoperation(0.0)); VAL [main_~res~0=6442450950.0, main_~x~0=6442450945.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~short14|=false] [?] assume !#t~short14; VAL [main_~res~0=6442450950.0, main_~x~0=6442450945.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~short14|=false] [?] assume !#t~short14;havoc #t~ret13;havoc #t~short14; VAL [main_~res~0=6442450950.0, main_~x~0=6442450945.0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !false; VAL [main_~res~0=6442450950.0, main_~x~0=6442450945.0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=6442450951, #NULL.offset=6442450946, old(#NULL.base)=6442450951, old(#NULL.offset)=6442450946] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6442450951, old(#NULL.offset)=6442450946] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6442450951, old(#NULL.offset)=6442450946] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret15 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L81] ~x~0 := ~someUnaryDOUBLEoperation(0.0); VAL [#NULL.base=0, #NULL.offset=0] [L82] CALL call #t~ret12 := trunc_double(~x~0); VAL [#in~x=6.442450945E9, #NULL.base=0, #NULL.offset=0] [L17-L60] ~x := #in~x; [L18] havoc ~signbit~0; [L19] havoc ~msw~0; [L20] havoc ~lsw~0; [L21] havoc ~exponent_less_1023~0; VAL [#in~x=6.442450945E9, #NULL.base=0, #NULL.offset=0, ~x=6.442450945E9] [L23] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8); [L24] call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L25] call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); [L25] ~msw~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L25] call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L25] havoc #t~union1; [L25] havoc #t~mem0; [L26] call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); [L26] ~lsw~0 := #t~mem2; [L26] call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L26] havoc #t~union3; [L26] havoc #t~mem2; [L23] call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); [L23] havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [#in~x=6.442450945E9, #NULL.base=0, #NULL.offset=0, ~lsw~0=6442450953, ~msw~0=-2147483648, ~x=6.442450945E9] [L28] ~signbit~0 := (if ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 else ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 - 4294967296); [L29] ~exponent_less_1023~0 := ~bitwiseAnd(~msw~0, 2146435072) / 1048576 - 1023; VAL [#in~x=6.442450945E9, #NULL.base=0, #NULL.offset=0, ~exponent_less_1023~0=1024, ~lsw~0=6442450953, ~msw~0=-2147483648, ~signbit~0=-1, ~x=6.442450945E9] [L30-L58] assume !(~exponent_less_1023~0 < 20); VAL [#in~x=6.442450945E9, #NULL.base=0, #NULL.offset=0, ~exponent_less_1023~0=1024, ~lsw~0=6442450953, ~msw~0=-2147483648, ~signbit~0=-1, ~x=6.442450945E9] [L47-L58] assume ~exponent_less_1023~0 > 51; VAL [#in~x=6.442450945E9, #NULL.base=0, #NULL.offset=0, ~exponent_less_1023~0=1024, ~lsw~0=6442450953, ~msw~0=-2147483648, ~signbit~0=-1, ~x=6.442450945E9] [L48-L50] assume 1024 == ~exponent_less_1023~0; [L49] #res := ~someBinaryArithmeticDOUBLEoperation(~x, ~x); VAL [#in~x=6.442450945E9, #NULL.base=0, #NULL.offset=0, ~exponent_less_1023~0=1024, ~lsw~0=6442450953, ~msw~0=-2147483648, ~signbit~0=-1, ~x=6.442450945E9] [L17-L60] ensures true; VAL [#in~x=6.442450945E9, #NULL.base=0, #NULL.offset=0, ~exponent_less_1023~0=1024, ~lsw~0=6442450953, ~msw~0=-2147483648, ~signbit~0=-1, ~x=6.442450945E9] [L82] RET call #t~ret12 := trunc_double(~x~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret12=6.44245095E9, ~x~0=6.442450945E9] [L82] ~res~0 := #t~ret12; [L82] havoc #t~ret12; [L85] #t~short14 := ~someBinaryDOUBLEComparisonOperation(~res~0, ~someUnaryDOUBLEoperation(0.0)); VAL [#NULL.base=0, #NULL.offset=0, #t~short14=false, ~res~0=6.44245095E9, ~x~0=6.442450945E9] [L85] assume !#t~short14; VAL [#NULL.base=0, #NULL.offset=0, #t~short14=false, ~res~0=6.44245095E9, ~x~0=6.442450945E9] [L85-L88] assume !#t~short14; [L85] havoc #t~ret13; [L85] havoc #t~short14; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=6.44245095E9, ~x~0=6.442450945E9] [L86] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=6.44245095E9, ~x~0=6.442450945E9] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=6442450951, #NULL.offset=6442450946, old(#NULL.base)=6442450951, old(#NULL.offset)=6442450946] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6442450951, old(#NULL.offset)=6442450946] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6442450951, old(#NULL.offset)=6442450946] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret15 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L81] ~x~0 := ~someUnaryDOUBLEoperation(0.0); VAL [#NULL.base=0, #NULL.offset=0] [L82] CALL call #t~ret12 := trunc_double(~x~0); VAL [#in~x=6.442450945E9, #NULL.base=0, #NULL.offset=0] [L17-L60] ~x := #in~x; [L18] havoc ~signbit~0; [L19] havoc ~msw~0; [L20] havoc ~lsw~0; [L21] havoc ~exponent_less_1023~0; VAL [#in~x=6.442450945E9, #NULL.base=0, #NULL.offset=0, ~x=6.442450945E9] [L23] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8); [L24] call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L25] call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); [L25] ~msw~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L25] call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L25] havoc #t~union1; [L25] havoc #t~mem0; [L26] call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); [L26] ~lsw~0 := #t~mem2; [L26] call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L26] havoc #t~union3; [L26] havoc #t~mem2; [L23] call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); [L23] havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [#in~x=6.442450945E9, #NULL.base=0, #NULL.offset=0, ~lsw~0=6442450953, ~msw~0=-2147483648, ~x=6.442450945E9] [L28] ~signbit~0 := (if ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 else ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 - 4294967296); [L29] ~exponent_less_1023~0 := ~bitwiseAnd(~msw~0, 2146435072) / 1048576 - 1023; VAL [#in~x=6.442450945E9, #NULL.base=0, #NULL.offset=0, ~exponent_less_1023~0=1024, ~lsw~0=6442450953, ~msw~0=-2147483648, ~signbit~0=-1, ~x=6.442450945E9] [L30-L58] assume !(~exponent_less_1023~0 < 20); VAL [#in~x=6.442450945E9, #NULL.base=0, #NULL.offset=0, ~exponent_less_1023~0=1024, ~lsw~0=6442450953, ~msw~0=-2147483648, ~signbit~0=-1, ~x=6.442450945E9] [L47-L58] assume ~exponent_less_1023~0 > 51; VAL [#in~x=6.442450945E9, #NULL.base=0, #NULL.offset=0, ~exponent_less_1023~0=1024, ~lsw~0=6442450953, ~msw~0=-2147483648, ~signbit~0=-1, ~x=6.442450945E9] [L48-L50] assume 1024 == ~exponent_less_1023~0; [L49] #res := ~someBinaryArithmeticDOUBLEoperation(~x, ~x); VAL [#in~x=6.442450945E9, #NULL.base=0, #NULL.offset=0, ~exponent_less_1023~0=1024, ~lsw~0=6442450953, ~msw~0=-2147483648, ~signbit~0=-1, ~x=6.442450945E9] [L17-L60] ensures true; VAL [#in~x=6.442450945E9, #NULL.base=0, #NULL.offset=0, ~exponent_less_1023~0=1024, ~lsw~0=6442450953, ~msw~0=-2147483648, ~signbit~0=-1, ~x=6.442450945E9] [L82] RET call #t~ret12 := trunc_double(~x~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret12=6.44245095E9, ~x~0=6.442450945E9] [L82] ~res~0 := #t~ret12; [L82] havoc #t~ret12; [L85] #t~short14 := ~someBinaryDOUBLEComparisonOperation(~res~0, ~someUnaryDOUBLEoperation(0.0)); VAL [#NULL.base=0, #NULL.offset=0, #t~short14=false, ~res~0=6.44245095E9, ~x~0=6.442450945E9] [L85] assume !#t~short14; VAL [#NULL.base=0, #NULL.offset=0, #t~short14=false, ~res~0=6.44245095E9, ~x~0=6.442450945E9] [L85-L88] assume !#t~short14; [L85] havoc #t~ret13; [L85] havoc #t~short14; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=6.44245095E9, ~x~0=6.442450945E9] [L86] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=6.44245095E9, ~x~0=6.442450945E9] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6442450951, #NULL!offset=6442450946, old(#NULL!base)=6442450951, old(#NULL!offset)=6442450946] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6442450951, old(#NULL!offset)=6442450946] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret15 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L81] ~x~0 := ~someUnaryDOUBLEoperation(0.0); VAL [#NULL!base=0, #NULL!offset=0] [L82] CALL call #t~ret12 := trunc_double(~x~0); VAL [#in~x=6.442450945E9, #NULL!base=0, #NULL!offset=0] [L17-L60] ~x := #in~x; [L18] havoc ~signbit~0; [L19] havoc ~msw~0; [L20] havoc ~lsw~0; [L21] havoc ~exponent_less_1023~0; VAL [#in~x=6.442450945E9, #NULL!base=0, #NULL!offset=0, ~x=6.442450945E9] [L23] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L24] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L25] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L25] ~msw~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L25] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L25] havoc #t~union1; [L25] havoc #t~mem0; [L26] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L26] ~lsw~0 := #t~mem2; [L26] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L26] havoc #t~union3; [L26] havoc #t~mem2; [L23] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L23] havoc ~#ew_u~0; VAL [#in~x=6.442450945E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=6442450953, ~msw~0=-2147483648, ~x=6.442450945E9] [L28] ~signbit~0 := (if ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 else ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 - 4294967296); [L29] ~exponent_less_1023~0 := ~bitwiseAnd(~msw~0, 2146435072) / 1048576 - 1023; VAL [#in~x=6.442450945E9, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=1024, ~lsw~0=6442450953, ~msw~0=-2147483648, ~signbit~0=-1, ~x=6.442450945E9] [L30] COND FALSE !(~exponent_less_1023~0 < 20) VAL [#in~x=6.442450945E9, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=1024, ~lsw~0=6442450953, ~msw~0=-2147483648, ~signbit~0=-1, ~x=6.442450945E9] [L47] COND TRUE ~exponent_less_1023~0 > 51 VAL [#in~x=6.442450945E9, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=1024, ~lsw~0=6442450953, ~msw~0=-2147483648, ~signbit~0=-1, ~x=6.442450945E9] [L48] COND TRUE 1024 == ~exponent_less_1023~0 [L49] #res := ~someBinaryArithmeticDOUBLEoperation(~x, ~x); VAL [#in~x=6.442450945E9, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=1024, ~lsw~0=6442450953, ~msw~0=-2147483648, ~signbit~0=-1, ~x=6.442450945E9] [L82] RET call #t~ret12 := trunc_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret12=6.44245095E9, ~x~0=6.442450945E9] [L82] ~res~0 := #t~ret12; [L82] havoc #t~ret12; [L85] #t~short14 := ~someBinaryDOUBLEComparisonOperation(~res~0, ~someUnaryDOUBLEoperation(0.0)); VAL [#NULL!base=0, #NULL!offset=0, #t~short14=false, ~res~0=6.44245095E9, ~x~0=6.442450945E9] [L85] COND FALSE !(#t~short14) VAL [#NULL!base=0, #NULL!offset=0, #t~short14=false, ~res~0=6.44245095E9, ~x~0=6.442450945E9] [L85] COND TRUE !#t~short14 [L85] havoc #t~ret13; [L85] havoc #t~short14; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=6.44245095E9, ~x~0=6.442450945E9] [L86] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=6.44245095E9, ~x~0=6.442450945E9] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6442450951, #NULL!offset=6442450946, old(#NULL!base)=6442450951, old(#NULL!offset)=6442450946] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6442450951, old(#NULL!offset)=6442450946] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret15 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L81] ~x~0 := ~someUnaryDOUBLEoperation(0.0); VAL [#NULL!base=0, #NULL!offset=0] [L82] CALL call #t~ret12 := trunc_double(~x~0); VAL [#in~x=6.442450945E9, #NULL!base=0, #NULL!offset=0] [L17-L60] ~x := #in~x; [L18] havoc ~signbit~0; [L19] havoc ~msw~0; [L20] havoc ~lsw~0; [L21] havoc ~exponent_less_1023~0; VAL [#in~x=6.442450945E9, #NULL!base=0, #NULL!offset=0, ~x=6.442450945E9] [L23] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L24] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L25] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L25] ~msw~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L25] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L25] havoc #t~union1; [L25] havoc #t~mem0; [L26] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L26] ~lsw~0 := #t~mem2; [L26] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L26] havoc #t~union3; [L26] havoc #t~mem2; [L23] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L23] havoc ~#ew_u~0; VAL [#in~x=6.442450945E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=6442450953, ~msw~0=-2147483648, ~x=6.442450945E9] [L28] ~signbit~0 := (if ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 else ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 - 4294967296); [L29] ~exponent_less_1023~0 := ~bitwiseAnd(~msw~0, 2146435072) / 1048576 - 1023; VAL [#in~x=6.442450945E9, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=1024, ~lsw~0=6442450953, ~msw~0=-2147483648, ~signbit~0=-1, ~x=6.442450945E9] [L30] COND FALSE !(~exponent_less_1023~0 < 20) VAL [#in~x=6.442450945E9, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=1024, ~lsw~0=6442450953, ~msw~0=-2147483648, ~signbit~0=-1, ~x=6.442450945E9] [L47] COND TRUE ~exponent_less_1023~0 > 51 VAL [#in~x=6.442450945E9, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=1024, ~lsw~0=6442450953, ~msw~0=-2147483648, ~signbit~0=-1, ~x=6.442450945E9] [L48] COND TRUE 1024 == ~exponent_less_1023~0 [L49] #res := ~someBinaryArithmeticDOUBLEoperation(~x, ~x); VAL [#in~x=6.442450945E9, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=1024, ~lsw~0=6442450953, ~msw~0=-2147483648, ~signbit~0=-1, ~x=6.442450945E9] [L82] RET call #t~ret12 := trunc_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret12=6.44245095E9, ~x~0=6.442450945E9] [L82] ~res~0 := #t~ret12; [L82] havoc #t~ret12; [L85] #t~short14 := ~someBinaryDOUBLEComparisonOperation(~res~0, ~someUnaryDOUBLEoperation(0.0)); VAL [#NULL!base=0, #NULL!offset=0, #t~short14=false, ~res~0=6.44245095E9, ~x~0=6.442450945E9] [L85] COND FALSE !(#t~short14) VAL [#NULL!base=0, #NULL!offset=0, #t~short14=false, ~res~0=6.44245095E9, ~x~0=6.442450945E9] [L85] COND TRUE !#t~short14 [L85] havoc #t~ret13; [L85] havoc #t~short14; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=6.44245095E9, ~x~0=6.442450945E9] [L86] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=6.44245095E9, ~x~0=6.442450945E9] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6442450951, #NULL!offset=6442450946, old(#NULL!base)=6442450951, old(#NULL!offset)=6442450946] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6442450951, old(#NULL!offset)=6442450946] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret15 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L81] ~x~0 := ~someUnaryDOUBLEoperation(0.0); VAL [#NULL!base=0, #NULL!offset=0] [L82] CALL call #t~ret12 := trunc_double(~x~0); VAL [#in~x=6.442450945E9, #NULL!base=0, #NULL!offset=0] [L17-L60] ~x := #in~x; [L18] havoc ~signbit~0; [L19] havoc ~msw~0; [L20] havoc ~lsw~0; [L21] havoc ~exponent_less_1023~0; VAL [#in~x=6.442450945E9, #NULL!base=0, #NULL!offset=0, ~x=6.442450945E9] [L23] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L24] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L25] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L25] ~msw~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L25] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L25] havoc #t~union1; [L25] havoc #t~mem0; [L26] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L26] ~lsw~0 := #t~mem2; [L26] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L26] havoc #t~union3; [L26] havoc #t~mem2; [L23] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L23] havoc ~#ew_u~0; VAL [#in~x=6.442450945E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=6442450953, ~msw~0=-2147483648, ~x=6.442450945E9] [L28] ~signbit~0 := (if ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 else ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 - 4294967296); [L29] ~exponent_less_1023~0 := ~bitwiseAnd(~msw~0, 2146435072) / 1048576 - 1023; VAL [#in~x=6.442450945E9, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=1024, ~lsw~0=6442450953, ~msw~0=-2147483648, ~signbit~0=-1, ~x=6.442450945E9] [L30] COND FALSE !(~exponent_less_1023~0 < 20) VAL [#in~x=6.442450945E9, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=1024, ~lsw~0=6442450953, ~msw~0=-2147483648, ~signbit~0=-1, ~x=6.442450945E9] [L47] COND TRUE ~exponent_less_1023~0 > 51 VAL [#in~x=6.442450945E9, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=1024, ~lsw~0=6442450953, ~msw~0=-2147483648, ~signbit~0=-1, ~x=6.442450945E9] [L48] COND TRUE 1024 == ~exponent_less_1023~0 [L49] #res := ~someBinaryArithmeticDOUBLEoperation(~x, ~x); VAL [#in~x=6.442450945E9, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=1024, ~lsw~0=6442450953, ~msw~0=-2147483648, ~signbit~0=-1, ~x=6.442450945E9] [L82] RET call #t~ret12 := trunc_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret12=6.44245095E9, ~x~0=6.442450945E9] [L82] ~res~0 := #t~ret12; [L82] havoc #t~ret12; [L85] #t~short14 := ~someBinaryDOUBLEComparisonOperation(~res~0, ~someUnaryDOUBLEoperation(0.0)); VAL [#NULL!base=0, #NULL!offset=0, #t~short14=false, ~res~0=6.44245095E9, ~x~0=6.442450945E9] [L85] COND FALSE !(#t~short14) VAL [#NULL!base=0, #NULL!offset=0, #t~short14=false, ~res~0=6.44245095E9, ~x~0=6.442450945E9] [L85] COND TRUE !#t~short14 [L85] havoc #t~ret13; [L85] havoc #t~short14; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=6.44245095E9, ~x~0=6.442450945E9] [L86] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=6.44245095E9, ~x~0=6.442450945E9] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6442450951, #NULL!offset=6442450946, old(#NULL!base)=6442450951, old(#NULL!offset)=6442450946] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6442450951, old(#NULL!offset)=6442450946] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret15 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L81] ~x~0 := ~someUnaryDOUBLEoperation(0.0); VAL [#NULL!base=0, #NULL!offset=0] [L82] CALL call #t~ret12 := trunc_double(~x~0); VAL [#in~x=6.442450945E9, #NULL!base=0, #NULL!offset=0] [L17-L60] ~x := #in~x; [L18] havoc ~signbit~0; [L19] havoc ~msw~0; [L20] havoc ~lsw~0; [L21] havoc ~exponent_less_1023~0; VAL [#in~x=6.442450945E9, #NULL!base=0, #NULL!offset=0, ~x=6.442450945E9] [L23] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L24] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L25] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L25] ~msw~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L25] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L25] havoc #t~union1; [L25] havoc #t~mem0; [L26] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L26] ~lsw~0 := #t~mem2; [L26] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L26] havoc #t~union3; [L26] havoc #t~mem2; [L23] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L23] havoc ~#ew_u~0; VAL [#in~x=6.442450945E9, #NULL!base=0, #NULL!offset=0, ~lsw~0=6442450953, ~msw~0=-2147483648, ~x=6.442450945E9] [L28] ~signbit~0 := (if ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 <= 2147483647 then ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 else ~bitwiseAnd(~msw~0, 2147483648) % 4294967296 % 4294967296 - 4294967296); [L29] ~exponent_less_1023~0 := ~bitwiseAnd(~msw~0, 2146435072) / 1048576 - 1023; VAL [#in~x=6.442450945E9, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=1024, ~lsw~0=6442450953, ~msw~0=-2147483648, ~signbit~0=-1, ~x=6.442450945E9] [L30] COND FALSE !(~exponent_less_1023~0 < 20) VAL [#in~x=6.442450945E9, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=1024, ~lsw~0=6442450953, ~msw~0=-2147483648, ~signbit~0=-1, ~x=6.442450945E9] [L47] COND TRUE ~exponent_less_1023~0 > 51 VAL [#in~x=6.442450945E9, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=1024, ~lsw~0=6442450953, ~msw~0=-2147483648, ~signbit~0=-1, ~x=6.442450945E9] [L48] COND TRUE 1024 == ~exponent_less_1023~0 [L49] #res := ~someBinaryArithmeticDOUBLEoperation(~x, ~x); VAL [#in~x=6.442450945E9, #NULL!base=0, #NULL!offset=0, ~exponent_less_1023~0=1024, ~lsw~0=6442450953, ~msw~0=-2147483648, ~signbit~0=-1, ~x=6.442450945E9] [L82] RET call #t~ret12 := trunc_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret12=6.44245095E9, ~x~0=6.442450945E9] [L82] ~res~0 := #t~ret12; [L82] havoc #t~ret12; [L85] #t~short14 := ~someBinaryDOUBLEComparisonOperation(~res~0, ~someUnaryDOUBLEoperation(0.0)); VAL [#NULL!base=0, #NULL!offset=0, #t~short14=false, ~res~0=6.44245095E9, ~x~0=6.442450945E9] [L85] COND FALSE !(#t~short14) VAL [#NULL!base=0, #NULL!offset=0, #t~short14=false, ~res~0=6.44245095E9, ~x~0=6.442450945E9] [L85] COND TRUE !#t~short14 [L85] havoc #t~ret13; [L85] havoc #t~short14; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=6.44245095E9, ~x~0=6.442450945E9] [L86] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=6.44245095E9, ~x~0=6.442450945E9] [L81] double x = -0.0; [L82] CALL, EXPR trunc_double(x) VAL [\old(x)=6442450945] [L18] int signbit; [L19] int msw; [L20] unsigned int lsw; [L21] int exponent_less_1023; VAL [\old(x)=6442450945, x=6442450945] [L23] ieee_double_shape_type ew_u; [L24] ew_u.value = (x) [L25] EXPR ew_u.parts.msw [L25] (msw) = ew_u.parts.msw [L26] EXPR ew_u.parts.lsw [L26] (lsw) = ew_u.parts.lsw [L28] signbit = msw & 0x80000000 [L29] exponent_less_1023 = ((msw & 0x7ff00000) >> 20) - 1023 VAL [\old(x)=6442450945, exponent_less_1023=1024, lsw=2147483657, msw=-2147483648, signbit=-1, x=6442450945] [L30] COND FALSE !(exponent_less_1023 < 20) VAL [\old(x)=6442450945, exponent_less_1023=1024, lsw=2147483657, msw=-2147483648, signbit=-1, x=6442450945] [L47] COND TRUE exponent_less_1023 > 51 VAL [\old(x)=6442450945, exponent_less_1023=1024, lsw=2147483657, msw=-2147483648, signbit=-1, x=6442450945] [L48] COND TRUE exponent_less_1023 == 1024 [L49] return x + x; VAL [\old(x)=6442450945, exponent_less_1023=1024, lsw=2147483657, msw=-2147483648, signbit=-1, x=6442450945] [L82] RET, EXPR trunc_double(x) VAL [trunc_double(x)=6442450950, x=6442450945] [L82] double res = trunc_double(x); [L85] EXPR res == -0.0 && __signbit_double(res) == 1 VAL [res=6442450950, res == -0.0 && __signbit_double(res) == 1=0, x=6442450945] [L85] COND TRUE !(res == -0.0 && __signbit_double(res) == 1) [L86] __VERIFIER_error() VAL [res=6442450950, x=6442450945] ----- [2018-11-23 15:53:09,102 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:53:09 BoogieIcfgContainer [2018-11-23 15:53:09,102 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 15:53:09,102 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 15:53:09,102 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 15:53:09,102 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 15:53:09,103 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:53:08" (3/4) ... [2018-11-23 15:53:09,105 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 15:53:09,105 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 15:53:09,106 INFO L168 Benchmark]: Toolchain (without parser) took 864.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 958.2 MB in the beginning and 1.1 GB in the end (delta: -131.3 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. [2018-11-23 15:53:09,107 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:53:09,107 INFO L168 Benchmark]: CACSL2BoogieTranslator took 176.42 ms. Allocated memory is still 1.0 GB. Free memory was 958.2 MB in the beginning and 944.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-23 15:53:09,108 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.11 ms. Allocated memory is still 1.0 GB. Free memory is still 944.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:53:09,108 INFO L168 Benchmark]: Boogie Preprocessor took 65.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -204.5 MB). Peak memory consumption was 17.3 MB. Max. memory is 11.5 GB. [2018-11-23 15:53:09,108 INFO L168 Benchmark]: RCFGBuilder took 265.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. [2018-11-23 15:53:09,108 INFO L168 Benchmark]: TraceAbstraction took 330.89 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: 28.3 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. [2018-11-23 15:53:09,109 INFO L168 Benchmark]: Witness Printer took 3.17 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. [2018-11-23 15:53:09,110 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 176.42 ms. Allocated memory is still 1.0 GB. Free memory was 958.2 MB in the beginning and 944.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 20.11 ms. Allocated memory is still 1.0 GB. Free memory is still 944.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 65.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.7 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -204.5 MB). Peak memory consumption was 17.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 265.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.5 MB). Peak memory consumption was 31.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 330.89 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: 28.3 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. * Witness Printer took 3.17 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: 86]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someUnaryDOUBLEoperation at line 81, overapproximation of bitwiseAnd at line 28, overapproximation of someBinaryArithmeticDOUBLEoperation at line 49, overapproximation of someBinaryDOUBLEComparisonOperation at line 85. Possible FailurePath: [L81] double x = -0.0; [L82] CALL, EXPR trunc_double(x) VAL [\old(x)=6442450945] [L18] int signbit; [L19] int msw; [L20] unsigned int lsw; [L21] int exponent_less_1023; VAL [\old(x)=6442450945, x=6442450945] [L23] ieee_double_shape_type ew_u; [L24] ew_u.value = (x) [L25] EXPR ew_u.parts.msw [L25] (msw) = ew_u.parts.msw [L26] EXPR ew_u.parts.lsw [L26] (lsw) = ew_u.parts.lsw [L28] signbit = msw & 0x80000000 [L29] exponent_less_1023 = ((msw & 0x7ff00000) >> 20) - 1023 VAL [\old(x)=6442450945, exponent_less_1023=1024, lsw=2147483657, msw=-2147483648, signbit=-1, x=6442450945] [L30] COND FALSE !(exponent_less_1023 < 20) VAL [\old(x)=6442450945, exponent_less_1023=1024, lsw=2147483657, msw=-2147483648, signbit=-1, x=6442450945] [L47] COND TRUE exponent_less_1023 > 51 VAL [\old(x)=6442450945, exponent_less_1023=1024, lsw=2147483657, msw=-2147483648, signbit=-1, x=6442450945] [L48] COND TRUE exponent_less_1023 == 1024 [L49] return x + x; VAL [\old(x)=6442450945, exponent_less_1023=1024, lsw=2147483657, msw=-2147483648, signbit=-1, x=6442450945] [L82] RET, EXPR trunc_double(x) VAL [trunc_double(x)=6442450950, x=6442450945] [L82] double res = trunc_double(x); [L85] EXPR res == -0.0 && __signbit_double(res) == 1 VAL [res=6442450950, res == -0.0 && __signbit_double(res) == 1=0, x=6442450945] [L85] COND TRUE !(res == -0.0 && __signbit_double(res) == 1) [L86] __VERIFIER_error() VAL [res=6442450950, x=6442450945] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 41 locations, 1 error locations. UNSAFE Result, 0.2s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 45 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=41occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 39 NumberOfCodeBlocks, 39 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 18 ConstructedInterpolants, 0 QuantifiedInterpolants, 324 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: 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.23-aa41828 [2018-11-23 15:53:10,531 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 15:53:10,532 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 15:53:10,540 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 15:53:10,540 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 15:53:10,541 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 15:53:10,542 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 15:53:10,543 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 15:53:10,544 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 15:53:10,544 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 15:53:10,545 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 15:53:10,545 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 15:53:10,546 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 15:53:10,546 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 15:53:10,547 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 15:53:10,547 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 15:53:10,548 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 15:53:10,549 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 15:53:10,551 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 15:53:10,552 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 15:53:10,552 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 15:53:10,553 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 15:53:10,554 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 15:53:10,554 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 15:53:10,555 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 15:53:10,555 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 15:53:10,556 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 15:53:10,556 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 15:53:10,557 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 15:53:10,557 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 15:53:10,558 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 15:53:10,558 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 15:53:10,558 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 15:53:10,558 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 15:53:10,559 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 15:53:10,559 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 15:53:10,559 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a2f0cfe4-648d-4915-be54-729d8deeff7a/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 15:53:10,569 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 15:53:10,569 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 15:53:10,570 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 15:53:10,570 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 15:53:10,570 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 15:53:10,571 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 15:53:10,571 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 15:53:10,571 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 15:53:10,571 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 15:53:10,571 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 15:53:10,571 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 15:53:10,571 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 15:53:10,571 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 15:53:10,571 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 15:53:10,572 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 15:53:10,572 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 15:53:10,572 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 15:53:10,572 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 15:53:10,572 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 15:53:10,572 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 15:53:10,572 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 15:53:10,572 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 15:53:10,573 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 15:53:10,573 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 15:53:10,573 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 15:53:10,573 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 15:53:10,573 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 15:53:10,573 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 15:53:10,573 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 15:53:10,573 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 15:53:10,573 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 15:53:10,574 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 15:53:10,574 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_a2f0cfe4-648d-4915-be54-729d8deeff7a/bin-2019/uautomizer 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 -> c0077a740f714225dc922bb100a19cc0ae47da01 [2018-11-23 15:53:10,602 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 15:53:10,611 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 15:53:10,613 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 15:53:10,614 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 15:53:10,615 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 15:53:10,615 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a2f0cfe4-648d-4915-be54-729d8deeff7a/bin-2019/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_1072c_true-unreach-call.c [2018-11-23 15:53:10,660 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a2f0cfe4-648d-4915-be54-729d8deeff7a/bin-2019/uautomizer/data/fbceed344/344497010405495da34e14a25cceb40f/FLAG355cb7742 [2018-11-23 15:53:10,995 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 15:53:10,995 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a2f0cfe4-648d-4915-be54-729d8deeff7a/sv-benchmarks/c/float-newlib/double_req_bl_1072c_true-unreach-call.c [2018-11-23 15:53:11,000 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a2f0cfe4-648d-4915-be54-729d8deeff7a/bin-2019/uautomizer/data/fbceed344/344497010405495da34e14a25cceb40f/FLAG355cb7742 [2018-11-23 15:53:11,010 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a2f0cfe4-648d-4915-be54-729d8deeff7a/bin-2019/uautomizer/data/fbceed344/344497010405495da34e14a25cceb40f [2018-11-23 15:53:11,011 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 15:53:11,012 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 15:53:11,013 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 15:53:11,013 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 15:53:11,016 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 15:53:11,017 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:53:11" (1/1) ... [2018-11-23 15:53:11,019 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f089c66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:53:11, skipping insertion in model container [2018-11-23 15:53:11,019 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:53:11" (1/1) ... [2018-11-23 15:53:11,026 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 15:53:11,040 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 15:53:11,177 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:53:11,182 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 15:53:11,206 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:53:11,224 INFO L195 MainTranslator]: Completed translation [2018-11-23 15:53:11,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:53:11 WrapperNode [2018-11-23 15:53:11,224 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 15:53:11,224 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 15:53:11,224 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 15:53:11,224 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 15:53:11,230 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:53:11" (1/1) ... [2018-11-23 15:53:11,237 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:53:11" (1/1) ... [2018-11-23 15:53:11,243 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 15:53:11,243 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 15:53:11,243 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 15:53:11,243 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 15:53:11,250 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:53:11" (1/1) ... [2018-11-23 15:53:11,250 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:53:11" (1/1) ... [2018-11-23 15:53:11,253 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:53:11" (1/1) ... [2018-11-23 15:53:11,253 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:53:11" (1/1) ... [2018-11-23 15:53:11,265 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:53:11" (1/1) ... [2018-11-23 15:53:11,270 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:53:11" (1/1) ... [2018-11-23 15:53:11,272 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:53:11" (1/1) ... [2018-11-23 15:53:11,275 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 15:53:11,275 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 15:53:11,275 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 15:53:11,275 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 15:53:11,276 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:53:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a2f0cfe4-648d-4915-be54-729d8deeff7a/bin-2019/uautomizer/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 [2018-11-23 15:53:11,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-11-23 15:53:11,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-11-23 15:53:11,345 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_double [2018-11-23 15:53:11,345 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_double [2018-11-23 15:53:11,345 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 15:53:11,346 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 15:53:11,346 INFO L130 BoogieDeclarations]: Found specification of procedure trunc_double [2018-11-23 15:53:11,346 INFO L138 BoogieDeclarations]: Found implementation of procedure trunc_double [2018-11-23 15:53:11,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 15:53:11,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 15:53:11,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 15:53:11,346 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 15:53:11,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 15:53:11,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 15:53:11,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 15:53:11,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 15:53:11,462 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 15:53:11,636 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 15:53:11,662 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 15:53:11,662 INFO L280 CfgBuilder]: Removed 10 assue(true) statements. [2018-11-23 15:53:11,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:53:11 BoogieIcfgContainer [2018-11-23 15:53:11,662 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 15:53:11,663 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 15:53:11,663 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 15:53:11,666 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 15:53:11,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:53:11" (1/3) ... [2018-11-23 15:53:11,667 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aad55c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:53:11, skipping insertion in model container [2018-11-23 15:53:11,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:53:11" (2/3) ... [2018-11-23 15:53:11,667 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aad55c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:53:11, skipping insertion in model container [2018-11-23 15:53:11,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:53:11" (3/3) ... [2018-11-23 15:53:11,668 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1072c_true-unreach-call.c [2018-11-23 15:53:11,674 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 15:53:11,680 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 15:53:11,693 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 15:53:11,714 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 15:53:11,715 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 15:53:11,715 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 15:53:11,715 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 15:53:11,715 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 15:53:11,715 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 15:53:11,715 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 15:53:11,715 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 15:53:11,715 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 15:53:11,728 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2018-11-23 15:53:11,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 15:53:11,732 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:53:11,733 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:53:11,734 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:53:11,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:53:11,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1697336041, now seen corresponding path program 1 times [2018-11-23 15:53:11,740 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 15:53:11,740 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a2f0cfe4-648d-4915-be54-729d8deeff7a/bin-2019/uautomizer/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 [2018-11-23 15:53:11,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:53:11,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:53:11,811 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:53:11,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:53:11,827 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 15:53:11,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:53:11,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 15:53:11,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 15:53:11,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 15:53:11,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 15:53:11,847 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 2 states. [2018-11-23 15:53:11,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:53:11,861 INFO L93 Difference]: Finished difference Result 74 states and 105 transitions. [2018-11-23 15:53:11,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 15:53:11,862 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-11-23 15:53:11,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:53:11,867 INFO L225 Difference]: With dead ends: 74 [2018-11-23 15:53:11,867 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 15:53:11,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 15:53:11,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 15:53:11,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-23 15:53:11,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 15:53:11,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-11-23 15:53:11,901 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 19 [2018-11-23 15:53:11,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:53:11,902 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-23 15:53:11,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 15:53:11,902 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-23 15:53:11,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 15:53:11,903 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:53:11,903 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:53:11,903 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:53:11,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:53:11,904 INFO L82 PathProgramCache]: Analyzing trace with hash 859793106, now seen corresponding path program 1 times [2018-11-23 15:53:11,904 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 15:53:11,904 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a2f0cfe4-648d-4915-be54-729d8deeff7a/bin-2019/uautomizer/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 [2018-11-23 15:53:11,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:53:11,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:53:11,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:53:12,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:53:12,121 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 15:53:12,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:53:12,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 15:53:12,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 15:53:12,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 15:53:12,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 15:53:12,135 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 7 states. [2018-11-23 15:53:12,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:53:12,861 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2018-11-23 15:53:12,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 15:53:12,862 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-11-23 15:53:12,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:53:12,863 INFO L225 Difference]: With dead ends: 56 [2018-11-23 15:53:12,863 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 15:53:12,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-11-23 15:53:12,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 15:53:12,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-23 15:53:12,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 15:53:12,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-11-23 15:53:12,869 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 20 [2018-11-23 15:53:12,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:53:12,870 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-11-23 15:53:12,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 15:53:12,870 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-11-23 15:53:12,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 15:53:12,870 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:53:12,870 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:53:12,871 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:53:12,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:53:12,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1019458128, now seen corresponding path program 1 times [2018-11-23 15:53:12,871 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 15:53:12,871 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a2f0cfe4-648d-4915-be54-729d8deeff7a/bin-2019/uautomizer/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 [2018-11-23 15:53:12,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:53:12,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:53:12,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:53:13,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:53:13,021 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 15:53:13,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:53:13,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 15:53:13,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 15:53:13,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 15:53:13,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 15:53:13,029 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 7 states. [2018-11-23 15:53:13,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:53:13,375 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-11-23 15:53:13,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 15:53:13,376 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-11-23 15:53:13,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:53:13,377 INFO L225 Difference]: With dead ends: 49 [2018-11-23 15:53:13,377 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 15:53:13,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-11-23 15:53:13,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 15:53:13,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-23 15:53:13,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 15:53:13,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-11-23 15:53:13,381 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 22 [2018-11-23 15:53:13,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:53:13,382 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-11-23 15:53:13,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 15:53:13,382 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-11-23 15:53:13,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 15:53:13,382 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:53:13,382 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:53:13,383 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:53:13,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:53:13,383 INFO L82 PathProgramCache]: Analyzing trace with hash 380697694, now seen corresponding path program 1 times [2018-11-23 15:53:13,383 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 15:53:13,383 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a2f0cfe4-648d-4915-be54-729d8deeff7a/bin-2019/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-11-23 15:53:13,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:53:13,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:53:13,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:53:13,451 INFO L478 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 51 treesize of output 45 [2018-11-23 15:53:13,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 38 [2018-11-23 15:53:13,466 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 21 [2018-11-23 15:53:13,467 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 15:53:13,469 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:53:13,471 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:53:13,473 INFO L267 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. [2018-11-23 15:53:13,473 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:51, output treesize:21 [2018-11-23 15:53:13,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:53:13,526 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 15:53:13,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:53:13,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 15:53:13,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 15:53:13,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 15:53:13,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 15:53:13,537 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 7 states. [2018-11-23 15:53:13,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:53:13,628 INFO L93 Difference]: Finished difference Result 34 states and 33 transitions. [2018-11-23 15:53:13,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 15:53:13,629 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-11-23 15:53:13,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:53:13,630 INFO L225 Difference]: With dead ends: 34 [2018-11-23 15:53:13,630 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 15:53:13,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-23 15:53:13,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 15:53:13,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-23 15:53:13,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 15:53:13,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 30 transitions. [2018-11-23 15:53:13,633 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 30 transitions. Word has length 22 [2018-11-23 15:53:13,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:53:13,634 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 30 transitions. [2018-11-23 15:53:13,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 15:53:13,634 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 30 transitions. [2018-11-23 15:53:13,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 15:53:13,634 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:53:13,635 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:53:13,635 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:53:13,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:53:13,635 INFO L82 PathProgramCache]: Analyzing trace with hash 862976725, now seen corresponding path program 1 times [2018-11-23 15:53:13,635 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 15:53:13,636 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a2f0cfe4-648d-4915-be54-729d8deeff7a/bin-2019/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-11-23 15:53:13,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:53:13,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:53:13,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:53:13,776 INFO L478 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 [2018-11-23 15:53:13,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 48 treesize of output 39 [2018-11-23 15:53:13,801 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-11-23 15:53:13,802 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 15:53:13,804 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:53:13,807 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:53:13,816 INFO L267 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. [2018-11-23 15:53:13,816 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:64, output treesize:34 [2018-11-23 15:53:13,973 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:53:13,973 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:53:13,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 43 [2018-11-23 15:53:14,007 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 15:53:14,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2018-11-23 15:53:14,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:53:14,021 INFO L478 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 24 treesize of output 18 [2018-11-23 15:53:14,025 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 4 [2018-11-23 15:53:14,026 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 15:53:14,027 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:53:14,029 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:53:14,035 INFO L267 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. [2018-11-23 15:53:14,035 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:42, output treesize:14 [2018-11-23 15:53:14,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:53:14,205 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 15:53:14,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:53:14,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-11-23 15:53:14,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 15:53:14,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 15:53:14,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-11-23 15:53:14,214 INFO L87 Difference]: Start difference. First operand 31 states and 30 transitions. Second operand 15 states. [2018-11-23 15:53:14,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:53:14,999 INFO L93 Difference]: Finished difference Result 31 states and 30 transitions. [2018-11-23 15:53:15,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 15:53:15,000 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 30 [2018-11-23 15:53:15,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:53:15,001 INFO L225 Difference]: With dead ends: 31 [2018-11-23 15:53:15,001 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 15:53:15,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2018-11-23 15:53:15,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 15:53:15,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 15:53:15,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 15:53:15,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 15:53:15,002 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2018-11-23 15:53:15,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:53:15,002 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 15:53:15,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 15:53:15,002 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 15:53:15,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 15:53:15,005 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 15:53:15,149 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 45 [2018-11-23 15:53:15,401 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 37 [2018-11-23 15:53:15,402 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 15:53:15,403 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 15:53:15,403 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 15:53:15,403 INFO L448 ceAbstractionStarter]: For program point L65-1(lines 65 69) no Hoare annotation was computed. [2018-11-23 15:53:15,403 INFO L444 ceAbstractionStarter]: At program point L65-2(lines 65 69) the Hoare annotation is: (= |__signbit_double_#in~x| __signbit_double_~x) [2018-11-23 15:53:15,403 INFO L448 ceAbstractionStarter]: For program point L65-3(lines 65 69) no Hoare annotation was computed. [2018-11-23 15:53:15,403 INFO L448 ceAbstractionStarter]: For program point __signbit_doubleFINAL(lines 62 72) no Hoare annotation was computed. [2018-11-23 15:53:15,403 INFO L448 ceAbstractionStarter]: For program point __signbit_doubleEXIT(lines 62 72) no Hoare annotation was computed. [2018-11-23 15:53:15,403 INFO L451 ceAbstractionStarter]: At program point __signbit_doubleENTRY(lines 62 72) the Hoare annotation is: true [2018-11-23 15:53:15,403 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 15:53:15,404 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 15:53:15,404 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 15:53:15,404 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 15:53:15,404 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 74 91) the Hoare annotation is: true [2018-11-23 15:53:15,404 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 74 91) no Hoare annotation was computed. [2018-11-23 15:53:15,404 INFO L448 ceAbstractionStarter]: For program point L86(line 86) no Hoare annotation was computed. [2018-11-23 15:53:15,404 INFO L448 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-11-23 15:53:15,404 INFO L444 ceAbstractionStarter]: At program point L85-1(line 85) the Hoare annotation is: (and |main_#t~short14| (exists ((v_prenex_9 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_9) ((_ extract 62 52) v_prenex_9) ((_ extract 51 0) v_prenex_9)) (fp.neg (_ +zero 11 53))) (= (let ((.cse0 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) v_prenex_9)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) main_~res~0))) (= main_~x~0 (fp.neg (_ +zero 11 53)))) [2018-11-23 15:53:15,405 INFO L448 ceAbstractionStarter]: For program point L85-2(line 85) no Hoare annotation was computed. [2018-11-23 15:53:15,405 INFO L444 ceAbstractionStarter]: At program point L82(line 82) the Hoare annotation is: (= main_~x~0 (fp.neg (_ +zero 11 53))) [2018-11-23 15:53:15,405 INFO L448 ceAbstractionStarter]: For program point L82-1(line 82) no Hoare annotation was computed. [2018-11-23 15:53:15,405 INFO L448 ceAbstractionStarter]: For program point L85-4(lines 85 88) no Hoare annotation was computed. [2018-11-23 15:53:15,405 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 74 91) no Hoare annotation was computed. [2018-11-23 15:53:15,405 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 86) no Hoare annotation was computed. [2018-11-23 15:53:15,405 INFO L448 ceAbstractionStarter]: For program point L31(lines 31 46) no Hoare annotation was computed. [2018-11-23 15:53:15,405 INFO L448 ceAbstractionStarter]: For program point L52-1(lines 52 57) no Hoare annotation was computed. [2018-11-23 15:53:15,405 INFO L444 ceAbstractionStarter]: At program point L52-2(lines 52 57) the Hoare annotation is: (and (exists ((v_prenex_7 (_ BitVec 64))) (and (not (bvslt (bvadd (bvashr (bvand (_ bv2146435072 32) ((_ extract 63 32) v_prenex_7)) (_ bv20 32)) (_ bv4294966273 32)) (_ bv20 32))) (= (fp ((_ extract 63 63) v_prenex_7) ((_ extract 62 52) v_prenex_7) ((_ extract 51 0) v_prenex_7)) |trunc_double_#in~x|))) (exists ((v_prenex_7 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_7) ((_ extract 62 52) v_prenex_7) ((_ extract 51 0) v_prenex_7)) |trunc_double_#in~x|) (= (bvadd trunc_double_~exponent_less_1023~0 (_ bv1023 32)) (bvashr (bvand (_ bv2146435072 32) ((_ extract 63 32) v_prenex_7)) (_ bv20 32))))) (= trunc_double_~x |trunc_double_#in~x|) (exists ((v_prenex_7 (_ BitVec 64))) (and (= trunc_double_~msw~0 ((_ extract 63 32) v_prenex_7)) (= (fp ((_ extract 63 63) v_prenex_7) ((_ extract 62 52) v_prenex_7) ((_ extract 51 0) v_prenex_7)) |trunc_double_#in~x|)))) [2018-11-23 15:53:15,406 INFO L448 ceAbstractionStarter]: For program point L52-3(lines 30 58) no Hoare annotation was computed. [2018-11-23 15:53:15,406 INFO L448 ceAbstractionStarter]: For program point L48(lines 48 50) no Hoare annotation was computed. [2018-11-23 15:53:15,406 INFO L448 ceAbstractionStarter]: For program point L32-1(lines 32 37) no Hoare annotation was computed. [2018-11-23 15:53:15,406 INFO L444 ceAbstractionStarter]: At program point L32-2(lines 32 37) the Hoare annotation is: (and (exists ((v_prenex_9 (_ BitVec 64))) (and (= trunc_double_~signbit~0 (bvand (_ bv2147483648 32) ((_ extract 63 32) v_prenex_9))) (= (fp ((_ extract 63 63) v_prenex_9) ((_ extract 62 52) v_prenex_9) ((_ extract 51 0) v_prenex_9)) |trunc_double_#in~x|))) (exists ((v_prenex_8 (_ BitVec 64))) (and (= (bvadd (bvashr (bvand (_ bv2146435072 32) ((_ extract 63 32) v_prenex_8)) (_ bv20 32)) (_ bv4294966273 32)) trunc_double_~exponent_less_1023~0) (= (fp ((_ extract 63 63) v_prenex_8) ((_ extract 62 52) v_prenex_8) ((_ extract 51 0) v_prenex_8)) |trunc_double_#in~x|))) (= trunc_double_~x |trunc_double_#in~x|) (exists ((v_prenex_7 (_ BitVec 64))) (and (= trunc_double_~msw~0 ((_ extract 63 32) v_prenex_7)) (= (fp ((_ extract 63 63) v_prenex_7) ((_ extract 62 52) v_prenex_7) ((_ extract 51 0) v_prenex_7)) |trunc_double_#in~x|)))) [2018-11-23 15:53:15,406 INFO L451 ceAbstractionStarter]: At program point trunc_doubleENTRY(lines 17 60) the Hoare annotation is: true [2018-11-23 15:53:15,406 INFO L448 ceAbstractionStarter]: For program point trunc_doubleEXIT(lines 17 60) no Hoare annotation was computed. [2018-11-23 15:53:15,406 INFO L448 ceAbstractionStarter]: For program point trunc_doubleFINAL(lines 17 60) no Hoare annotation was computed. [2018-11-23 15:53:15,406 INFO L448 ceAbstractionStarter]: For program point L30(lines 30 58) no Hoare annotation was computed. [2018-11-23 15:53:15,406 INFO L448 ceAbstractionStarter]: For program point L22-1(lines 22 27) no Hoare annotation was computed. [2018-11-23 15:53:15,407 INFO L444 ceAbstractionStarter]: At program point L22-2(lines 22 27) the Hoare annotation is: (= trunc_double_~x |trunc_double_#in~x|) [2018-11-23 15:53:15,407 INFO L448 ceAbstractionStarter]: For program point L22-3(lines 22 27) no Hoare annotation was computed. [2018-11-23 15:53:15,407 INFO L448 ceAbstractionStarter]: For program point L47(lines 47 58) no Hoare annotation was computed. [2018-11-23 15:53:15,407 INFO L448 ceAbstractionStarter]: For program point L39-1(lines 39 45) no Hoare annotation was computed. [2018-11-23 15:53:15,407 INFO L444 ceAbstractionStarter]: At program point L39-2(lines 39 45) the Hoare annotation is: (and (exists ((v_prenex_8 (_ BitVec 64))) (and (not (bvslt (bvadd (bvashr (bvand (_ bv2146435072 32) ((_ extract 63 32) v_prenex_8)) (_ bv20 32)) (_ bv4294966273 32)) (_ bv0 32))) (= (fp ((_ extract 63 63) v_prenex_8) ((_ extract 62 52) v_prenex_8) ((_ extract 51 0) v_prenex_8)) |trunc_double_#in~x|))) (exists ((v_prenex_8 (_ BitVec 64))) (and (= (bvadd (bvashr (bvand (_ bv2146435072 32) ((_ extract 63 32) v_prenex_8)) (_ bv20 32)) (_ bv4294966273 32)) trunc_double_~exponent_less_1023~0) (= (fp ((_ extract 63 63) v_prenex_8) ((_ extract 62 52) v_prenex_8) ((_ extract 51 0) v_prenex_8)) |trunc_double_#in~x|))) (= trunc_double_~x |trunc_double_#in~x|) (exists ((v_prenex_7 (_ BitVec 64))) (and (= trunc_double_~msw~0 ((_ extract 63 32) v_prenex_7)) (= (fp ((_ extract 63 63) v_prenex_7) ((_ extract 62 52) v_prenex_7) ((_ extract 51 0) v_prenex_7)) |trunc_double_#in~x|)))) [2018-11-23 15:53:15,415 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,416 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,416 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,416 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,416 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,416 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,417 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,417 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,417 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,417 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,417 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,417 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,418 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,418 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,419 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,419 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,419 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,419 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,422 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,422 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,422 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,422 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,422 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,422 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,423 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2018-11-23 15:53:15,423 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2018-11-23 15:53:15,424 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2018-11-23 15:53:15,424 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2018-11-23 15:53:15,424 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-23 15:53:15,424 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-23 15:53:15,424 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-23 15:53:15,425 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-23 15:53:15,425 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,425 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,425 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,425 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,425 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2018-11-23 15:53:15,425 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2018-11-23 15:53:15,426 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2018-11-23 15:53:15,426 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2018-11-23 15:53:15,426 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-23 15:53:15,426 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-23 15:53:15,426 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-23 15:53:15,426 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-23 15:53:15,426 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,426 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,427 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,427 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,428 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-23 15:53:15,428 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-23 15:53:15,428 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-23 15:53:15,428 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-23 15:53:15,428 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-23 15:53:15,429 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-23 15:53:15,429 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-23 15:53:15,429 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-23 15:53:15,429 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,429 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,429 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,429 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,430 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-23 15:53:15,430 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-23 15:53:15,430 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-23 15:53:15,431 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-23 15:53:15,431 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-23 15:53:15,431 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-23 15:53:15,431 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-23 15:53:15,431 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-23 15:53:15,432 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,432 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,432 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,432 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:53:15 BoogieIcfgContainer [2018-11-23 15:53:15,434 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 15:53:15,434 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 15:53:15,435 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 15:53:15,435 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 15:53:15,435 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:53:11" (3/4) ... [2018-11-23 15:53:15,438 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 15:53:15,444 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 15:53:15,444 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __signbit_double [2018-11-23 15:53:15,444 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 15:53:15,445 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure trunc_double [2018-11-23 15:53:15,448 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2018-11-23 15:53:15,448 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2018-11-23 15:53:15,448 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 15:53:15,465 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: x == \old(x) [2018-11-23 15:53:15,466 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(x) == x [2018-11-23 15:53:15,466 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\exists v_prenex_9 : bv64 :: signbit == ~bvand32(2147483648bv32, v_prenex_9[63:32]) && ~fp~LONGDOUBLE(v_prenex_9[63:63], v_prenex_9[62:52], v_prenex_9[51:0]) == \old(x)) && (\exists v_prenex_8 : bv64 :: ~bvadd64(~bvashr32(~bvand32(2146435072bv32, v_prenex_8[63:32]), 20bv32), 4294966273bv32) == exponent_less_1023 && ~fp~LONGDOUBLE(v_prenex_8[63:63], v_prenex_8[62:52], v_prenex_8[51:0]) == \old(x))) && x == \old(x)) && (\exists v_prenex_7 : bv64 :: msw == v_prenex_7[63:32] && ~fp~LONGDOUBLE(v_prenex_7[63:63], v_prenex_7[62:52], v_prenex_7[51:0]) == \old(x)) [2018-11-23 15:53:15,466 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\exists v_prenex_8 : bv64 :: !~bvslt32(~bvadd64(~bvashr32(~bvand32(2146435072bv32, v_prenex_8[63:32]), 20bv32), 4294966273bv32), 0bv32) && ~fp~LONGDOUBLE(v_prenex_8[63:63], v_prenex_8[62:52], v_prenex_8[51:0]) == \old(x)) && (\exists v_prenex_8 : bv64 :: ~bvadd64(~bvashr32(~bvand32(2146435072bv32, v_prenex_8[63:32]), 20bv32), 4294966273bv32) == exponent_less_1023 && ~fp~LONGDOUBLE(v_prenex_8[63:63], v_prenex_8[62:52], v_prenex_8[51:0]) == \old(x))) && x == \old(x)) && (\exists v_prenex_7 : bv64 :: msw == v_prenex_7[63:32] && ~fp~LONGDOUBLE(v_prenex_7[63:63], v_prenex_7[62:52], v_prenex_7[51:0]) == \old(x)) [2018-11-23 15:53:15,466 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\exists v_prenex_7 : bv64 :: !~bvslt32(~bvadd64(~bvashr32(~bvand32(2146435072bv32, v_prenex_7[63:32]), 20bv32), 4294966273bv32), 20bv32) && ~fp~LONGDOUBLE(v_prenex_7[63:63], v_prenex_7[62:52], v_prenex_7[51:0]) == \old(x)) && (\exists v_prenex_7 : bv64 :: ~fp~LONGDOUBLE(v_prenex_7[63:63], v_prenex_7[62:52], v_prenex_7[51:0]) == \old(x) && ~bvadd64(exponent_less_1023, 1023bv32) == ~bvashr32(~bvand32(2146435072bv32, v_prenex_7[63:32]), 20bv32))) && x == \old(x)) && (\exists v_prenex_7 : bv64 :: msw == v_prenex_7[63:32] && ~fp~LONGDOUBLE(v_prenex_7[63:63], v_prenex_7[62:52], v_prenex_7[51:0]) == \old(x)) [2018-11-23 15:53:15,486 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a2f0cfe4-648d-4915-be54-729d8deeff7a/bin-2019/uautomizer/witness.graphml [2018-11-23 15:53:15,487 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 15:53:15,487 INFO L168 Benchmark]: Toolchain (without parser) took 4475.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 949.7 MB in the beginning and 826.3 MB in the end (delta: 123.5 MB). Peak memory consumption was 261.9 MB. Max. memory is 11.5 GB. [2018-11-23 15:53:15,488 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:53:15,488 INFO L168 Benchmark]: CACSL2BoogieTranslator took 211.14 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 933.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 15:53:15,488 INFO L168 Benchmark]: Boogie Procedure Inliner took 18.52 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:53:15,488 INFO L168 Benchmark]: Boogie Preprocessor took 31.82 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:53:15,489 INFO L168 Benchmark]: RCFGBuilder took 387.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -167.4 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. [2018-11-23 15:53:15,489 INFO L168 Benchmark]: TraceAbstraction took 3771.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 833.0 MB in the end (delta: 268.0 MB). Peak memory consumption was 268.0 MB. Max. memory is 11.5 GB. [2018-11-23 15:53:15,489 INFO L168 Benchmark]: Witness Printer took 52.30 ms. Allocated memory is still 1.2 GB. Free memory was 833.0 MB in the beginning and 826.3 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-11-23 15:53:15,491 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 211.14 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 933.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 18.52 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.82 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 387.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -167.4 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3771.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 833.0 MB in the end (delta: 268.0 MB). Peak memory consumption was 268.0 MB. Max. memory is 11.5 GB. * Witness Printer took 52.30 ms. Allocated memory is still 1.2 GB. Free memory was 833.0 MB in the beginning and 826.3 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 86]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: \old(x) == x - InvariantResult [Line: 52]: Loop Invariant [2018-11-23 15:53:15,498 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,498 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,499 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,499 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,499 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,499 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,499 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,499 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,500 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,500 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,500 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,500 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,500 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,501 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,501 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,501 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,501 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,501 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,501 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,502 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,502 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,502 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,502 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,502 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] Derived loop invariant: (((\exists v_prenex_7 : bv64 :: !~bvslt32(~bvadd64(~bvashr32(~bvand32(2146435072bv32, v_prenex_7[63:32]), 20bv32), 4294966273bv32), 20bv32) && ~fp~LONGDOUBLE(v_prenex_7[63:63], v_prenex_7[62:52], v_prenex_7[51:0]) == \old(x)) && (\exists v_prenex_7 : bv64 :: ~fp~LONGDOUBLE(v_prenex_7[63:63], v_prenex_7[62:52], v_prenex_7[51:0]) == \old(x) && ~bvadd64(exponent_less_1023, 1023bv32) == ~bvashr32(~bvand32(2146435072bv32, v_prenex_7[63:32]), 20bv32))) && x == \old(x)) && (\exists v_prenex_7 : bv64 :: msw == v_prenex_7[63:32] && ~fp~LONGDOUBLE(v_prenex_7[63:63], v_prenex_7[62:52], v_prenex_7[51:0]) == \old(x)) - InvariantResult [Line: 32]: Loop Invariant [2018-11-23 15:53:15,503 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2018-11-23 15:53:15,503 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2018-11-23 15:53:15,503 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2018-11-23 15:53:15,503 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2018-11-23 15:53:15,503 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-23 15:53:15,503 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-23 15:53:15,503 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-23 15:53:15,504 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-23 15:53:15,504 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,504 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,504 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,504 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,504 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2018-11-23 15:53:15,505 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2018-11-23 15:53:15,505 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2018-11-23 15:53:15,505 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_9,QUANTIFIED] [2018-11-23 15:53:15,505 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-23 15:53:15,505 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-23 15:53:15,505 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-23 15:53:15,506 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-23 15:53:15,506 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,506 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,506 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,506 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] Derived loop invariant: (((\exists v_prenex_9 : bv64 :: signbit == ~bvand32(2147483648bv32, v_prenex_9[63:32]) && ~fp~LONGDOUBLE(v_prenex_9[63:63], v_prenex_9[62:52], v_prenex_9[51:0]) == \old(x)) && (\exists v_prenex_8 : bv64 :: ~bvadd64(~bvashr32(~bvand32(2146435072bv32, v_prenex_8[63:32]), 20bv32), 4294966273bv32) == exponent_less_1023 && ~fp~LONGDOUBLE(v_prenex_8[63:63], v_prenex_8[62:52], v_prenex_8[51:0]) == \old(x))) && x == \old(x)) && (\exists v_prenex_7 : bv64 :: msw == v_prenex_7[63:32] && ~fp~LONGDOUBLE(v_prenex_7[63:63], v_prenex_7[62:52], v_prenex_7[51:0]) == \old(x)) - InvariantResult [Line: 39]: Loop Invariant [2018-11-23 15:53:15,506 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-23 15:53:15,507 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-23 15:53:15,507 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-23 15:53:15,507 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-23 15:53:15,507 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-23 15:53:15,507 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-23 15:53:15,507 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-23 15:53:15,508 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-23 15:53:15,508 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,508 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,508 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,508 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,508 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-23 15:53:15,509 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-23 15:53:15,509 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-23 15:53:15,509 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-23 15:53:15,509 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-23 15:53:15,509 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-23 15:53:15,509 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-23 15:53:15,509 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_8,QUANTIFIED] [2018-11-23 15:53:15,510 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,510 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,510 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] [2018-11-23 15:53:15,510 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_7,QUANTIFIED] Derived loop invariant: (((\exists v_prenex_8 : bv64 :: !~bvslt32(~bvadd64(~bvashr32(~bvand32(2146435072bv32, v_prenex_8[63:32]), 20bv32), 4294966273bv32), 0bv32) && ~fp~LONGDOUBLE(v_prenex_8[63:63], v_prenex_8[62:52], v_prenex_8[51:0]) == \old(x)) && (\exists v_prenex_8 : bv64 :: ~bvadd64(~bvashr32(~bvand32(2146435072bv32, v_prenex_8[63:32]), 20bv32), 4294966273bv32) == exponent_less_1023 && ~fp~LONGDOUBLE(v_prenex_8[63:63], v_prenex_8[62:52], v_prenex_8[51:0]) == \old(x))) && x == \old(x)) && (\exists v_prenex_7 : bv64 :: msw == v_prenex_7[63:32] && ~fp~LONGDOUBLE(v_prenex_7[63:63], v_prenex_7[62:52], v_prenex_7[51:0]) == \old(x)) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: x == \old(x) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 41 locations, 1 error locations. SAFE Result, 3.6s OverallTime, 5 OverallIterations, 1 TraceHistogramMax, 1.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 142 SDtfs, 124 SDslu, 509 SDs, 0 SdLazy, 238 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 19 PreInvPairs, 25 NumberOfFragments, 239 HoareAnnotationTreeSize, 19 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 13 FomulaSimplificationsInter, 93 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 113 NumberOfCodeBlocks, 113 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 108 ConstructedInterpolants, 40 QuantifiedInterpolants, 24145 SizeOfPredicates, 21 NumberOfNonLiveVariables, 313 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...