./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_1011b_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_5b8b2bc2-a540-414d-bfd2-cffaeb083968/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5b8b2bc2-a540-414d-bfd2-cffaeb083968/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5b8b2bc2-a540-414d-bfd2-cffaeb083968/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5b8b2bc2-a540-414d-bfd2-cffaeb083968/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1011b_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_5b8b2bc2-a540-414d-bfd2-cffaeb083968/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5b8b2bc2-a540-414d-bfd2-cffaeb083968/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 dbef25694faa90ff4d63502c2f243449da0e6c28 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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_5b8b2bc2-a540-414d-bfd2-cffaeb083968/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5b8b2bc2-a540-414d-bfd2-cffaeb083968/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5b8b2bc2-a540-414d-bfd2-cffaeb083968/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5b8b2bc2-a540-414d-bfd2-cffaeb083968/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1011b_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_5b8b2bc2-a540-414d-bfd2-cffaeb083968/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5b8b2bc2-a540-414d-bfd2-cffaeb083968/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 dbef25694faa90ff4d63502c2f243449da0e6c28 ...................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 13:43:26,652 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:43:26,653 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:43:26,661 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:43:26,661 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:43:26,662 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:43:26,662 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:43:26,664 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:43:26,665 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:43:26,665 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:43:26,666 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:43:26,666 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:43:26,667 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:43:26,668 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:43:26,668 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:43:26,669 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:43:26,670 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:43:26,671 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:43:26,672 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:43:26,673 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:43:26,674 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:43:26,675 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:43:26,677 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:43:26,677 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:43:26,677 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:43:26,678 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:43:26,678 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:43:26,679 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:43:26,680 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:43:26,680 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:43:26,681 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:43:26,681 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:43:26,681 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:43:26,681 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:43:26,682 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:43:26,682 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:43:26,683 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5b8b2bc2-a540-414d-bfd2-cffaeb083968/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 13:43:26,693 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:43:26,693 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:43:26,693 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:43:26,693 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:43:26,694 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:43:26,694 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:43:26,694 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:43:26,694 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:43:26,695 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:43:26,695 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:43:26,695 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:43:26,695 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:43:26,695 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:43:26,695 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:43:26,695 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:43:26,695 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:43:26,696 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:43:26,696 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:43:26,696 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:43:26,696 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:43:26,696 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:43:26,696 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:43:26,696 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:43:26,697 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:43:26,697 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:43:26,697 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:43:26,697 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:43:26,697 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:43:26,697 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:43:26,697 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:43:26,698 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_5b8b2bc2-a540-414d-bfd2-cffaeb083968/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 -> dbef25694faa90ff4d63502c2f243449da0e6c28 [2018-11-23 13:43:26,720 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:43:26,728 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:43:26,731 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:43:26,732 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:43:26,732 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:43:26,733 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5b8b2bc2-a540-414d-bfd2-cffaeb083968/bin-2019/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_1011b_true-unreach-call.c [2018-11-23 13:43:26,779 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5b8b2bc2-a540-414d-bfd2-cffaeb083968/bin-2019/uautomizer/data/ff6c43e3f/06fe193f3a1145e4bfdc989d7df3361c/FLAG811e35947 [2018-11-23 13:43:27,112 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:43:27,113 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5b8b2bc2-a540-414d-bfd2-cffaeb083968/sv-benchmarks/c/float-newlib/double_req_bl_1011b_true-unreach-call.c [2018-11-23 13:43:27,117 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5b8b2bc2-a540-414d-bfd2-cffaeb083968/bin-2019/uautomizer/data/ff6c43e3f/06fe193f3a1145e4bfdc989d7df3361c/FLAG811e35947 [2018-11-23 13:43:27,539 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5b8b2bc2-a540-414d-bfd2-cffaeb083968/bin-2019/uautomizer/data/ff6c43e3f/06fe193f3a1145e4bfdc989d7df3361c [2018-11-23 13:43:27,541 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:43:27,542 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:43:27,542 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:43:27,542 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:43:27,545 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:43:27,545 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:43:27" (1/1) ... [2018-11-23 13:43:27,547 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e873bf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:43:27, skipping insertion in model container [2018-11-23 13:43:27,547 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:43:27" (1/1) ... [2018-11-23 13:43:27,553 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:43:27,566 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:43:27,680 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:43:27,682 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:43:27,697 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:43:27,710 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:43:27,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:43:27 WrapperNode [2018-11-23 13:43:27,710 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:43:27,711 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:43:27,711 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:43:27,711 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:43:27,715 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:43:27" (1/1) ... [2018-11-23 13:43:27,722 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:43:27" (1/1) ... [2018-11-23 13:43:27,726 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:43:27,726 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:43:27,726 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:43:27,726 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:43:27,732 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:43:27" (1/1) ... [2018-11-23 13:43:27,732 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:43:27" (1/1) ... [2018-11-23 13:43:27,733 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:43:27" (1/1) ... [2018-11-23 13:43:27,734 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:43:27" (1/1) ... [2018-11-23 13:43:27,739 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:43:27" (1/1) ... [2018-11-23 13:43:27,742 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:43:27" (1/1) ... [2018-11-23 13:43:27,743 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:43:27" (1/1) ... [2018-11-23 13:43:27,744 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:43:27,745 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:43:27,745 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:43:27,745 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:43:27,745 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:43:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5b8b2bc2-a540-414d-bfd2-cffaeb083968/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 13:43:27,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-11-23 13:43:27,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 13:43:27,822 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_double [2018-11-23 13:43:27,822 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_double [2018-11-23 13:43:27,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:43:27,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:43:27,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-23 13:43:27,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:43:27,823 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_double [2018-11-23 13:43:27,823 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_double [2018-11-23 13:43:27,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:43:27,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:43:27,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 13:43:27,823 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:43:27,824 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:43:27,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:43:27,969 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:43:27,969 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 13:43:27,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:43:27 BoogieIcfgContainer [2018-11-23 13:43:27,970 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:43:27,970 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:43:27,970 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:43:27,973 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:43:27,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:43:27" (1/3) ... [2018-11-23 13:43:27,974 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29714198 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:43:27, skipping insertion in model container [2018-11-23 13:43:27,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:43:27" (2/3) ... [2018-11-23 13:43:27,974 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29714198 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:43:27, skipping insertion in model container [2018-11-23 13:43:27,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:43:27" (3/3) ... [2018-11-23 13:43:27,976 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1011b_true-unreach-call.c [2018-11-23 13:43:27,985 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:43:27,991 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:43:28,000 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:43:28,017 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:43:28,018 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:43:28,018 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:43:28,018 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:43:28,018 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:43:28,018 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:43:28,018 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:43:28,018 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:43:28,018 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:43:28,028 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-11-23 13:43:28,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 13:43:28,032 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:43:28,033 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:43:28,034 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:43:28,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:43:28,037 INFO L82 PathProgramCache]: Analyzing trace with hash -2010282984, now seen corresponding path program 1 times [2018-11-23 13:43:28,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:43:28,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:43:28,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:43:28,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:43:28,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:43:28,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:43:28,126 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 13:43:28,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:43:28,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:43:28,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:43:28,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:43:28,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:43:28,139 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2018-11-23 13:43:28,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:43:28,155 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2018-11-23 13:43:28,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:43:28,156 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-23 13:43:28,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:43:28,163 INFO L225 Difference]: With dead ends: 56 [2018-11-23 13:43:28,163 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 13:43:28,166 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 13:43:28,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 13:43:28,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-23 13:43:28,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 13:43:28,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-11-23 13:43:28,189 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 17 [2018-11-23 13:43:28,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:43:28,189 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-11-23 13:43:28,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:43:28,189 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-11-23 13:43:28,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 13:43:28,190 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:43:28,190 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 13:43:28,190 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:43:28,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:43:28,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1410255941, now seen corresponding path program 1 times [2018-11-23 13:43:28,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:43:28,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:43:28,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:43:28,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:43:28,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:43:28,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:43:28,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:43:28,249 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=12, |#NULL.offset|=9, |old(#NULL.base)|=12, |old(#NULL.offset)|=9] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=12, |old(#NULL.offset)|=9] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=12, |old(#NULL.offset)|=9] [?] RET #65#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret9 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] ~x~0 := ~someUnaryDOUBLEoperation(0.0); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret6 := fabs_double(~x~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |fabs_double_#in~x|=16.0] [?] ~x := #in~x;havoc ~high~0; VAL [fabs_double_~x=16.0, |#NULL.base|=0, |#NULL.offset|=0, |fabs_double_#in~x|=16.0] [?] call ~#gh_u~1.base, ~#gh_u~1.offset := #Ultimate.alloc(8);call write~real(~x, ~#gh_u~1.base, ~#gh_u~1.offset, 8);call #t~mem2 := read~int(~#gh_u~1.base, 4 + ~#gh_u~1.offset, 4);~high~0 := #t~mem2;call write~real(#t~union3, ~#gh_u~1.base, ~#gh_u~1.offset, 8);havoc #t~union3;havoc #t~mem2;call ULTIMATE.dealloc(~#gh_u~1.base, ~#gh_u~1.offset);havoc ~#gh_u~1.base, ~#gh_u~1.offset; VAL [fabs_double_~high~0=23, fabs_double_~x=16.0, |#NULL.base|=0, |#NULL.offset|=0, |fabs_double_#in~x|=16.0] [?] goto; VAL [fabs_double_~high~0=23, fabs_double_~x=16.0, |#NULL.base|=0, |#NULL.offset|=0, |fabs_double_#in~x|=16.0] [?] call ~#sh_u~0.base, ~#sh_u~0.offset := #Ultimate.alloc(8);call write~real(~x, ~#sh_u~0.base, ~#sh_u~0.offset, 8);call write~int(~bitwiseAnd(~high~0, 2147483647), ~#sh_u~0.base, 4 + ~#sh_u~0.offset, 4);call #t~mem4 := read~real(~#sh_u~0.base, ~#sh_u~0.offset, 8);~x := #t~mem4;call write~int(#t~union5.lsw, ~#sh_u~0.base, ~#sh_u~0.offset, 4);call write~int(#t~union5.msw, ~#sh_u~0.base, 4 + ~#sh_u~0.offset, 4);havoc #t~mem4;havoc #t~union5.lsw, #t~union5.msw;call ULTIMATE.dealloc(~#sh_u~0.base, ~#sh_u~0.offset);havoc ~#sh_u~0.base, ~#sh_u~0.offset; VAL [fabs_double_~high~0=23, fabs_double_~x=16.0, |#NULL.base|=0, |#NULL.offset|=0, |fabs_double_#in~x|=16.0] [?] goto; VAL [fabs_double_~high~0=23, fabs_double_~x=16.0, |#NULL.base|=0, |#NULL.offset|=0, |fabs_double_#in~x|=16.0] [?] #res := ~x; VAL [fabs_double_~high~0=23, fabs_double_~x=16.0, |#NULL.base|=0, |#NULL.offset|=0, |fabs_double_#in~x|=16.0, |fabs_double_#res|=16.0] [?] assume true; VAL [fabs_double_~high~0=23, fabs_double_~x=16.0, |#NULL.base|=0, |#NULL.offset|=0, |fabs_double_#in~x|=16.0, |fabs_double_#res|=16.0] [?] RET #69#return; VAL [main_~x~0=16.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret6|=16.0] [?] ~res~0 := #t~ret6;havoc #t~ret6;#t~short8 := ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); VAL [main_~res~0=16.0, main_~x~0=16.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~short8|=false] [?] assume !#t~short8; VAL [main_~res~0=16.0, main_~x~0=16.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~short8|=false] [?] assume !#t~short8;havoc #t~short8;havoc #t~ret7; VAL [main_~res~0=16.0, main_~x~0=16.0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !false; VAL [main_~res~0=16.0, main_~x~0=16.0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=12, #NULL.offset=9, old(#NULL.base)=12, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret9 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L47] ~x~0 := ~someUnaryDOUBLEoperation(0.0); VAL [#NULL.base=0, #NULL.offset=0] [L48] CALL call #t~ret6 := fabs_double(~x~0); VAL [#in~x=16.0, #NULL.base=0, #NULL.offset=0] [L25-L39] ~x := #in~x; [L26] havoc ~high~0; VAL [#in~x=16.0, #NULL.base=0, #NULL.offset=0, ~x=16.0] [L28] call ~#gh_u~1.base, ~#gh_u~1.offset := #Ultimate.alloc(8); [L29] call write~real(~x, ~#gh_u~1.base, ~#gh_u~1.offset, 8); [L30] call #t~mem2 := read~int(~#gh_u~1.base, 4 + ~#gh_u~1.offset, 4); [L30] ~high~0 := #t~mem2; [L30] call write~real(#t~union3, ~#gh_u~1.base, ~#gh_u~1.offset, 8); [L30] havoc #t~union3; [L30] havoc #t~mem2; [L28] call ULTIMATE.dealloc(~#gh_u~1.base, ~#gh_u~1.offset); [L28] havoc ~#gh_u~1.base, ~#gh_u~1.offset; VAL [#in~x=16.0, #NULL.base=0, #NULL.offset=0, ~high~0=23, ~x=16.0] [L33] call ~#sh_u~0.base, ~#sh_u~0.offset := #Ultimate.alloc(8); [L34] call write~real(~x, ~#sh_u~0.base, ~#sh_u~0.offset, 8); [L35] call write~int(~bitwiseAnd(~high~0, 2147483647), ~#sh_u~0.base, 4 + ~#sh_u~0.offset, 4); [L36] call #t~mem4 := read~real(~#sh_u~0.base, ~#sh_u~0.offset, 8); [L36] ~x := #t~mem4; [L36] call write~int(#t~union5.lsw, ~#sh_u~0.base, ~#sh_u~0.offset, 4); [L36] call write~int(#t~union5.msw, ~#sh_u~0.base, 4 + ~#sh_u~0.offset, 4); [L36] havoc #t~mem4; [L36] havoc #t~union5.lsw, #t~union5.msw; [L33] call ULTIMATE.dealloc(~#sh_u~0.base, ~#sh_u~0.offset); [L33] havoc ~#sh_u~0.base, ~#sh_u~0.offset; VAL [#in~x=16.0, #NULL.base=0, #NULL.offset=0, ~high~0=23, ~x=16.0] [L38] #res := ~x; VAL [#in~x=16.0, #NULL.base=0, #NULL.offset=0, #res=16.0, ~high~0=23, ~x=16.0] [L25-L39] ensures true; VAL [#in~x=16.0, #NULL.base=0, #NULL.offset=0, #res=16.0, ~high~0=23, ~x=16.0] [L48] RET call #t~ret6 := fabs_double(~x~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret6=16.0, ~x~0=16.0] [L48] ~res~0 := #t~ret6; [L48] havoc #t~ret6; [L51] #t~short8 := ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); VAL [#NULL.base=0, #NULL.offset=0, #t~short8=false, ~res~0=16.0, ~x~0=16.0] [L51] assume !#t~short8; VAL [#NULL.base=0, #NULL.offset=0, #t~short8=false, ~res~0=16.0, ~x~0=16.0] [L51-L54] assume !#t~short8; [L51] havoc #t~short8; [L51] havoc #t~ret7; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=16.0, ~x~0=16.0] [L52] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=16.0, ~x~0=16.0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=12, #NULL.offset=9, old(#NULL.base)=12, old(#NULL.offset)=9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=9] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=12, old(#NULL.offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret9 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L47] ~x~0 := ~someUnaryDOUBLEoperation(0.0); VAL [#NULL.base=0, #NULL.offset=0] [L48] CALL call #t~ret6 := fabs_double(~x~0); VAL [#in~x=16.0, #NULL.base=0, #NULL.offset=0] [L25-L39] ~x := #in~x; [L26] havoc ~high~0; VAL [#in~x=16.0, #NULL.base=0, #NULL.offset=0, ~x=16.0] [L28] call ~#gh_u~1.base, ~#gh_u~1.offset := #Ultimate.alloc(8); [L29] call write~real(~x, ~#gh_u~1.base, ~#gh_u~1.offset, 8); [L30] call #t~mem2 := read~int(~#gh_u~1.base, 4 + ~#gh_u~1.offset, 4); [L30] ~high~0 := #t~mem2; [L30] call write~real(#t~union3, ~#gh_u~1.base, ~#gh_u~1.offset, 8); [L30] havoc #t~union3; [L30] havoc #t~mem2; [L28] call ULTIMATE.dealloc(~#gh_u~1.base, ~#gh_u~1.offset); [L28] havoc ~#gh_u~1.base, ~#gh_u~1.offset; VAL [#in~x=16.0, #NULL.base=0, #NULL.offset=0, ~high~0=23, ~x=16.0] [L33] call ~#sh_u~0.base, ~#sh_u~0.offset := #Ultimate.alloc(8); [L34] call write~real(~x, ~#sh_u~0.base, ~#sh_u~0.offset, 8); [L35] call write~int(~bitwiseAnd(~high~0, 2147483647), ~#sh_u~0.base, 4 + ~#sh_u~0.offset, 4); [L36] call #t~mem4 := read~real(~#sh_u~0.base, ~#sh_u~0.offset, 8); [L36] ~x := #t~mem4; [L36] call write~int(#t~union5.lsw, ~#sh_u~0.base, ~#sh_u~0.offset, 4); [L36] call write~int(#t~union5.msw, ~#sh_u~0.base, 4 + ~#sh_u~0.offset, 4); [L36] havoc #t~mem4; [L36] havoc #t~union5.lsw, #t~union5.msw; [L33] call ULTIMATE.dealloc(~#sh_u~0.base, ~#sh_u~0.offset); [L33] havoc ~#sh_u~0.base, ~#sh_u~0.offset; VAL [#in~x=16.0, #NULL.base=0, #NULL.offset=0, ~high~0=23, ~x=16.0] [L38] #res := ~x; VAL [#in~x=16.0, #NULL.base=0, #NULL.offset=0, #res=16.0, ~high~0=23, ~x=16.0] [L25-L39] ensures true; VAL [#in~x=16.0, #NULL.base=0, #NULL.offset=0, #res=16.0, ~high~0=23, ~x=16.0] [L48] RET call #t~ret6 := fabs_double(~x~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret6=16.0, ~x~0=16.0] [L48] ~res~0 := #t~ret6; [L48] havoc #t~ret6; [L51] #t~short8 := ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); VAL [#NULL.base=0, #NULL.offset=0, #t~short8=false, ~res~0=16.0, ~x~0=16.0] [L51] assume !#t~short8; VAL [#NULL.base=0, #NULL.offset=0, #t~short8=false, ~res~0=16.0, ~x~0=16.0] [L51-L54] assume !#t~short8; [L51] havoc #t~short8; [L51] havoc #t~ret7; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=16.0, ~x~0=16.0] [L52] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=16.0, ~x~0=16.0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=12, #NULL!offset=9, old(#NULL!base)=12, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=12, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret9 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L47] ~x~0 := ~someUnaryDOUBLEoperation(0.0); VAL [#NULL!base=0, #NULL!offset=0] [L48] CALL call #t~ret6 := fabs_double(~x~0); VAL [#in~x=16.0, #NULL!base=0, #NULL!offset=0] [L25-L39] ~x := #in~x; [L26] havoc ~high~0; VAL [#in~x=16.0, #NULL!base=0, #NULL!offset=0, ~x=16.0] [L28] FCALL call ~#gh_u~1 := #Ultimate.alloc(8); [L29] FCALL call write~real(~x, { base: ~#gh_u~1!base, offset: ~#gh_u~1!offset }, 8); [L30] FCALL call #t~mem2 := read~int({ base: ~#gh_u~1!base, offset: 4 + ~#gh_u~1!offset }, 4); [L30] ~high~0 := #t~mem2; [L30] FCALL call write~real(#t~union3, { base: ~#gh_u~1!base, offset: ~#gh_u~1!offset }, 8); [L30] havoc #t~union3; [L30] havoc #t~mem2; [L28] FCALL call ULTIMATE.dealloc(~#gh_u~1); [L28] havoc ~#gh_u~1; VAL [#in~x=16.0, #NULL!base=0, #NULL!offset=0, ~high~0=23, ~x=16.0] [L33] FCALL call ~#sh_u~0 := #Ultimate.alloc(8); [L34] FCALL call write~real(~x, { base: ~#sh_u~0!base, offset: ~#sh_u~0!offset }, 8); [L35] FCALL call write~int(~bitwiseAnd(~high~0, 2147483647), { base: ~#sh_u~0!base, offset: 4 + ~#sh_u~0!offset }, 4); [L36] FCALL call #t~mem4 := read~real({ base: ~#sh_u~0!base, offset: ~#sh_u~0!offset }, 8); [L36] ~x := #t~mem4; [L36] FCALL call write~int(#t~union5!lsw, { base: ~#sh_u~0!base, offset: ~#sh_u~0!offset }, 4); [L36] FCALL call write~int(#t~union5!msw, { base: ~#sh_u~0!base, offset: 4 + ~#sh_u~0!offset }, 4); [L36] havoc #t~mem4; [L36] havoc #t~union5; [L33] FCALL call ULTIMATE.dealloc(~#sh_u~0); [L33] havoc ~#sh_u~0; VAL [#in~x=16.0, #NULL!base=0, #NULL!offset=0, ~high~0=23, ~x=16.0] [L38] #res := ~x; VAL [#in~x=16.0, #NULL!base=0, #NULL!offset=0, #res=16.0, ~high~0=23, ~x=16.0] [L48] RET call #t~ret6 := fabs_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret6=16.0, ~x~0=16.0] [L48] ~res~0 := #t~ret6; [L48] havoc #t~ret6; [L51] #t~short8 := ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, #t~short8=false, ~res~0=16.0, ~x~0=16.0] [L51] COND FALSE !(#t~short8) VAL [#NULL!base=0, #NULL!offset=0, #t~short8=false, ~res~0=16.0, ~x~0=16.0] [L51] COND TRUE !#t~short8 [L51] havoc #t~short8; [L51] havoc #t~ret7; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=16.0, ~x~0=16.0] [L52] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=16.0, ~x~0=16.0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=12, #NULL!offset=9, old(#NULL!base)=12, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=12, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret9 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L47] ~x~0 := ~someUnaryDOUBLEoperation(0.0); VAL [#NULL!base=0, #NULL!offset=0] [L48] CALL call #t~ret6 := fabs_double(~x~0); VAL [#in~x=16.0, #NULL!base=0, #NULL!offset=0] [L25-L39] ~x := #in~x; [L26] havoc ~high~0; VAL [#in~x=16.0, #NULL!base=0, #NULL!offset=0, ~x=16.0] [L28] FCALL call ~#gh_u~1 := #Ultimate.alloc(8); [L29] FCALL call write~real(~x, { base: ~#gh_u~1!base, offset: ~#gh_u~1!offset }, 8); [L30] FCALL call #t~mem2 := read~int({ base: ~#gh_u~1!base, offset: 4 + ~#gh_u~1!offset }, 4); [L30] ~high~0 := #t~mem2; [L30] FCALL call write~real(#t~union3, { base: ~#gh_u~1!base, offset: ~#gh_u~1!offset }, 8); [L30] havoc #t~union3; [L30] havoc #t~mem2; [L28] FCALL call ULTIMATE.dealloc(~#gh_u~1); [L28] havoc ~#gh_u~1; VAL [#in~x=16.0, #NULL!base=0, #NULL!offset=0, ~high~0=23, ~x=16.0] [L33] FCALL call ~#sh_u~0 := #Ultimate.alloc(8); [L34] FCALL call write~real(~x, { base: ~#sh_u~0!base, offset: ~#sh_u~0!offset }, 8); [L35] FCALL call write~int(~bitwiseAnd(~high~0, 2147483647), { base: ~#sh_u~0!base, offset: 4 + ~#sh_u~0!offset }, 4); [L36] FCALL call #t~mem4 := read~real({ base: ~#sh_u~0!base, offset: ~#sh_u~0!offset }, 8); [L36] ~x := #t~mem4; [L36] FCALL call write~int(#t~union5!lsw, { base: ~#sh_u~0!base, offset: ~#sh_u~0!offset }, 4); [L36] FCALL call write~int(#t~union5!msw, { base: ~#sh_u~0!base, offset: 4 + ~#sh_u~0!offset }, 4); [L36] havoc #t~mem4; [L36] havoc #t~union5; [L33] FCALL call ULTIMATE.dealloc(~#sh_u~0); [L33] havoc ~#sh_u~0; VAL [#in~x=16.0, #NULL!base=0, #NULL!offset=0, ~high~0=23, ~x=16.0] [L38] #res := ~x; VAL [#in~x=16.0, #NULL!base=0, #NULL!offset=0, #res=16.0, ~high~0=23, ~x=16.0] [L48] RET call #t~ret6 := fabs_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret6=16.0, ~x~0=16.0] [L48] ~res~0 := #t~ret6; [L48] havoc #t~ret6; [L51] #t~short8 := ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, #t~short8=false, ~res~0=16.0, ~x~0=16.0] [L51] COND FALSE !(#t~short8) VAL [#NULL!base=0, #NULL!offset=0, #t~short8=false, ~res~0=16.0, ~x~0=16.0] [L51] COND TRUE !#t~short8 [L51] havoc #t~short8; [L51] havoc #t~ret7; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=16.0, ~x~0=16.0] [L52] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=16.0, ~x~0=16.0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=12, #NULL!offset=9, old(#NULL!base)=12, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=12, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret9 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L47] ~x~0 := ~someUnaryDOUBLEoperation(0.0); VAL [#NULL!base=0, #NULL!offset=0] [L48] CALL call #t~ret6 := fabs_double(~x~0); VAL [#in~x=16.0, #NULL!base=0, #NULL!offset=0] [L25-L39] ~x := #in~x; [L26] havoc ~high~0; VAL [#in~x=16.0, #NULL!base=0, #NULL!offset=0, ~x=16.0] [L28] FCALL call ~#gh_u~1 := #Ultimate.alloc(8); [L29] FCALL call write~real(~x, { base: ~#gh_u~1!base, offset: ~#gh_u~1!offset }, 8); [L30] FCALL call #t~mem2 := read~int({ base: ~#gh_u~1!base, offset: 4 + ~#gh_u~1!offset }, 4); [L30] ~high~0 := #t~mem2; [L30] FCALL call write~real(#t~union3, { base: ~#gh_u~1!base, offset: ~#gh_u~1!offset }, 8); [L30] havoc #t~union3; [L30] havoc #t~mem2; [L28] FCALL call ULTIMATE.dealloc(~#gh_u~1); [L28] havoc ~#gh_u~1; VAL [#in~x=16.0, #NULL!base=0, #NULL!offset=0, ~high~0=23, ~x=16.0] [L33] FCALL call ~#sh_u~0 := #Ultimate.alloc(8); [L34] FCALL call write~real(~x, { base: ~#sh_u~0!base, offset: ~#sh_u~0!offset }, 8); [L35] FCALL call write~int(~bitwiseAnd(~high~0, 2147483647), { base: ~#sh_u~0!base, offset: 4 + ~#sh_u~0!offset }, 4); [L36] FCALL call #t~mem4 := read~real({ base: ~#sh_u~0!base, offset: ~#sh_u~0!offset }, 8); [L36] ~x := #t~mem4; [L36] FCALL call write~int(#t~union5!lsw, { base: ~#sh_u~0!base, offset: ~#sh_u~0!offset }, 4); [L36] FCALL call write~int(#t~union5!msw, { base: ~#sh_u~0!base, offset: 4 + ~#sh_u~0!offset }, 4); [L36] havoc #t~mem4; [L36] havoc #t~union5; [L33] FCALL call ULTIMATE.dealloc(~#sh_u~0); [L33] havoc ~#sh_u~0; VAL [#in~x=16.0, #NULL!base=0, #NULL!offset=0, ~high~0=23, ~x=16.0] [L38] #res := ~x; VAL [#in~x=16.0, #NULL!base=0, #NULL!offset=0, #res=16.0, ~high~0=23, ~x=16.0] [L48] RET call #t~ret6 := fabs_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret6=16.0, ~x~0=16.0] [L48] ~res~0 := #t~ret6; [L48] havoc #t~ret6; [L51] #t~short8 := ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, #t~short8=false, ~res~0=16.0, ~x~0=16.0] [L51] COND FALSE !(#t~short8) VAL [#NULL!base=0, #NULL!offset=0, #t~short8=false, ~res~0=16.0, ~x~0=16.0] [L51] COND TRUE !#t~short8 [L51] havoc #t~short8; [L51] havoc #t~ret7; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=16.0, ~x~0=16.0] [L52] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=16.0, ~x~0=16.0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=12, #NULL!offset=9, old(#NULL!base)=12, old(#NULL!offset)=9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=12, old(#NULL!offset)=9] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret9 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L47] ~x~0 := ~someUnaryDOUBLEoperation(0.0); VAL [#NULL!base=0, #NULL!offset=0] [L48] CALL call #t~ret6 := fabs_double(~x~0); VAL [#in~x=16.0, #NULL!base=0, #NULL!offset=0] [L25-L39] ~x := #in~x; [L26] havoc ~high~0; VAL [#in~x=16.0, #NULL!base=0, #NULL!offset=0, ~x=16.0] [L28] FCALL call ~#gh_u~1 := #Ultimate.alloc(8); [L29] FCALL call write~real(~x, { base: ~#gh_u~1!base, offset: ~#gh_u~1!offset }, 8); [L30] FCALL call #t~mem2 := read~int({ base: ~#gh_u~1!base, offset: 4 + ~#gh_u~1!offset }, 4); [L30] ~high~0 := #t~mem2; [L30] FCALL call write~real(#t~union3, { base: ~#gh_u~1!base, offset: ~#gh_u~1!offset }, 8); [L30] havoc #t~union3; [L30] havoc #t~mem2; [L28] FCALL call ULTIMATE.dealloc(~#gh_u~1); [L28] havoc ~#gh_u~1; VAL [#in~x=16.0, #NULL!base=0, #NULL!offset=0, ~high~0=23, ~x=16.0] [L33] FCALL call ~#sh_u~0 := #Ultimate.alloc(8); [L34] FCALL call write~real(~x, { base: ~#sh_u~0!base, offset: ~#sh_u~0!offset }, 8); [L35] FCALL call write~int(~bitwiseAnd(~high~0, 2147483647), { base: ~#sh_u~0!base, offset: 4 + ~#sh_u~0!offset }, 4); [L36] FCALL call #t~mem4 := read~real({ base: ~#sh_u~0!base, offset: ~#sh_u~0!offset }, 8); [L36] ~x := #t~mem4; [L36] FCALL call write~int(#t~union5!lsw, { base: ~#sh_u~0!base, offset: ~#sh_u~0!offset }, 4); [L36] FCALL call write~int(#t~union5!msw, { base: ~#sh_u~0!base, offset: 4 + ~#sh_u~0!offset }, 4); [L36] havoc #t~mem4; [L36] havoc #t~union5; [L33] FCALL call ULTIMATE.dealloc(~#sh_u~0); [L33] havoc ~#sh_u~0; VAL [#in~x=16.0, #NULL!base=0, #NULL!offset=0, ~high~0=23, ~x=16.0] [L38] #res := ~x; VAL [#in~x=16.0, #NULL!base=0, #NULL!offset=0, #res=16.0, ~high~0=23, ~x=16.0] [L48] RET call #t~ret6 := fabs_double(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret6=16.0, ~x~0=16.0] [L48] ~res~0 := #t~ret6; [L48] havoc #t~ret6; [L51] #t~short8 := ~someBinaryDOUBLEComparisonOperation(~res~0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, #t~short8=false, ~res~0=16.0, ~x~0=16.0] [L51] COND FALSE !(#t~short8) VAL [#NULL!base=0, #NULL!offset=0, #t~short8=false, ~res~0=16.0, ~x~0=16.0] [L51] COND TRUE !#t~short8 [L51] havoc #t~short8; [L51] havoc #t~ret7; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=16.0, ~x~0=16.0] [L52] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=16.0, ~x~0=16.0] [L47] double x = -0.0; [L48] CALL, EXPR fabs_double(x) VAL [\old(x)=16] [L26] __uint32_t high; VAL [\old(x)=16, x=16] [L28] ieee_double_shape_type gh_u; [L29] gh_u.value = (x) [L30] EXPR gh_u.parts.msw [L30] (high) = gh_u.parts.msw [L33] ieee_double_shape_type sh_u; [L34] sh_u.value = (x) [L35] sh_u.parts.msw = (high & 0x7fffffff) [L36] EXPR sh_u.value [L36] (x) = sh_u.value [L38] return x; VAL [\old(x)=16, \result=16, high=23, x=16] [L48] RET, EXPR fabs_double(x) VAL [fabs_double(x)=16, x=16] [L48] double res = fabs_double(x); [L51] EXPR res == 0.0 && __signbit_double(res) == 0 VAL [res=16, res == 0.0 && __signbit_double(res) == 0=0, x=16] [L51] COND TRUE !(res == 0.0 && __signbit_double(res) == 0) [L52] __VERIFIER_error() VAL [res=16, x=16] ----- [2018-11-23 13:43:28,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:43:28 BoogieIcfgContainer [2018-11-23 13:43:28,280 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:43:28,280 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:43:28,280 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:43:28,280 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:43:28,281 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:43:27" (3/4) ... [2018-11-23 13:43:28,284 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 13:43:28,284 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:43:28,285 INFO L168 Benchmark]: Toolchain (without parser) took 743.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 958.0 MB in the beginning and 1.1 GB in the end (delta: -129.1 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. [2018-11-23 13:43:28,286 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:43:28,286 INFO L168 Benchmark]: CACSL2BoogieTranslator took 167.95 ms. Allocated memory is still 1.0 GB. Free memory was 958.0 MB in the beginning and 944.6 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-23 13:43:28,287 INFO L168 Benchmark]: Boogie Procedure Inliner took 15.56 ms. Allocated memory is still 1.0 GB. Free memory is still 944.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:43:28,287 INFO L168 Benchmark]: Boogie Preprocessor took 18.10 ms. Allocated memory is still 1.0 GB. Free memory was 944.6 MB in the beginning and 941.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 13:43:28,288 INFO L168 Benchmark]: RCFGBuilder took 225.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 941.9 MB in the beginning and 1.1 GB in the end (delta: -177.9 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. [2018-11-23 13:43:28,288 INFO L168 Benchmark]: TraceAbstraction took 309.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.7 MB). Peak memory consumption was 32.7 MB. Max. memory is 11.5 GB. [2018-11-23 13:43:28,289 INFO L168 Benchmark]: Witness Printer took 3.76 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 13:43:28,292 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 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 167.95 ms. Allocated memory is still 1.0 GB. Free memory was 958.0 MB in the beginning and 944.6 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 15.56 ms. Allocated memory is still 1.0 GB. Free memory is still 944.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.10 ms. Allocated memory is still 1.0 GB. Free memory was 944.6 MB in the beginning and 941.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 225.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 941.9 MB in the beginning and 1.1 GB in the end (delta: -177.9 MB). Peak memory consumption was 14.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 309.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.7 MB). Peak memory consumption was 32.7 MB. Max. memory is 11.5 GB. * Witness Printer took 3.76 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 52]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 51, overapproximation of someUnaryDOUBLEoperation at line 47, overapproximation of bitwiseAnd at line 35. Possible FailurePath: [L47] double x = -0.0; [L48] CALL, EXPR fabs_double(x) VAL [\old(x)=16] [L26] __uint32_t high; VAL [\old(x)=16, x=16] [L28] ieee_double_shape_type gh_u; [L29] gh_u.value = (x) [L30] EXPR gh_u.parts.msw [L30] (high) = gh_u.parts.msw [L33] ieee_double_shape_type sh_u; [L34] sh_u.value = (x) [L35] sh_u.parts.msw = (high & 0x7fffffff) [L36] EXPR sh_u.value [L36] (x) = sh_u.value [L38] return x; VAL [\old(x)=16, \result=16, high=23, x=16] [L48] RET, EXPR fabs_double(x) VAL [fabs_double(x)=16, x=16] [L48] double res = fabs_double(x); [L51] EXPR res == 0.0 && __signbit_double(res) == 0 VAL [res=16, res == 0.0 && __signbit_double(res) == 0=0, x=16] [L51] COND TRUE !(res == 0.0 && __signbit_double(res) == 0) [L52] __VERIFIER_error() VAL [res=16, x=16] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 32 locations, 1 error locations. UNSAFE Result, 0.2s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 32 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=32occurred 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, 36 NumberOfCodeBlocks, 36 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 16 ConstructedInterpolants, 0 QuantifiedInterpolants, 256 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 13:43:29,723 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:43:29,724 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:43:29,732 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:43:29,732 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:43:29,732 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:43:29,733 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:43:29,734 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:43:29,735 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:43:29,736 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:43:29,737 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:43:29,737 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:43:29,737 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:43:29,738 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:43:29,739 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:43:29,739 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:43:29,740 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:43:29,741 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:43:29,743 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:43:29,744 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:43:29,744 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:43:29,745 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:43:29,747 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:43:29,747 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:43:29,747 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:43:29,748 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:43:29,748 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:43:29,749 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:43:29,750 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:43:29,750 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:43:29,750 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:43:29,751 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:43:29,751 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:43:29,751 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:43:29,752 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:43:29,752 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:43:29,753 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5b8b2bc2-a540-414d-bfd2-cffaeb083968/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 13:43:29,763 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:43:29,763 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:43:29,764 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:43:29,764 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:43:29,764 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:43:29,764 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:43:29,765 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:43:29,765 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:43:29,765 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:43:29,765 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:43:29,765 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:43:29,765 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:43:29,765 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:43:29,765 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:43:29,765 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 13:43:29,765 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 13:43:29,766 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:43:29,766 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:43:29,766 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:43:29,766 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:43:29,766 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:43:29,766 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:43:29,766 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:43:29,766 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:43:29,767 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:43:29,767 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:43:29,767 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:43:29,767 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:43:29,767 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 13:43:29,767 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:43:29,767 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 13:43:29,767 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 13:43:29,767 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_5b8b2bc2-a540-414d-bfd2-cffaeb083968/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 -> dbef25694faa90ff4d63502c2f243449da0e6c28 [2018-11-23 13:43:29,795 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:43:29,803 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:43:29,805 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:43:29,806 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:43:29,806 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:43:29,807 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5b8b2bc2-a540-414d-bfd2-cffaeb083968/bin-2019/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_1011b_true-unreach-call.c [2018-11-23 13:43:29,844 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5b8b2bc2-a540-414d-bfd2-cffaeb083968/bin-2019/uautomizer/data/7b9c06e19/dc3364a2b2514bb89fd99e18274d7eff/FLAG0f00d63a6 [2018-11-23 13:43:30,142 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:43:30,142 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5b8b2bc2-a540-414d-bfd2-cffaeb083968/sv-benchmarks/c/float-newlib/double_req_bl_1011b_true-unreach-call.c [2018-11-23 13:43:30,146 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5b8b2bc2-a540-414d-bfd2-cffaeb083968/bin-2019/uautomizer/data/7b9c06e19/dc3364a2b2514bb89fd99e18274d7eff/FLAG0f00d63a6 [2018-11-23 13:43:30,155 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5b8b2bc2-a540-414d-bfd2-cffaeb083968/bin-2019/uautomizer/data/7b9c06e19/dc3364a2b2514bb89fd99e18274d7eff [2018-11-23 13:43:30,157 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:43:30,158 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:43:30,159 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:43:30,159 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:43:30,161 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:43:30,161 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:43:30" (1/1) ... [2018-11-23 13:43:30,163 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c42840c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:43:30, skipping insertion in model container [2018-11-23 13:43:30,163 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:43:30" (1/1) ... [2018-11-23 13:43:30,169 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:43:30,183 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:43:30,301 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:43:30,305 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:43:30,322 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:43:30,340 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:43:30,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:43:30 WrapperNode [2018-11-23 13:43:30,340 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:43:30,341 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:43:30,341 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:43:30,341 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:43:30,346 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:43:30" (1/1) ... [2018-11-23 13:43:30,353 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:43:30" (1/1) ... [2018-11-23 13:43:30,357 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:43:30,357 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:43:30,358 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:43:30,358 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:43:30,363 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:43:30" (1/1) ... [2018-11-23 13:43:30,363 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:43:30" (1/1) ... [2018-11-23 13:43:30,365 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:43:30" (1/1) ... [2018-11-23 13:43:30,366 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:43:30" (1/1) ... [2018-11-23 13:43:30,375 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:43:30" (1/1) ... [2018-11-23 13:43:30,378 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:43:30" (1/1) ... [2018-11-23 13:43:30,380 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:43:30" (1/1) ... [2018-11-23 13:43:30,382 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:43:30,382 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:43:30,382 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:43:30,383 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:43:30,383 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:43:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5b8b2bc2-a540-414d-bfd2-cffaeb083968/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 13:43:30,470 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_double [2018-11-23 13:43:30,470 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_double [2018-11-23 13:43:30,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-11-23 13:43:30,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:43:30,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:43:30,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:43:30,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 13:43:30,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-11-23 13:43:30,471 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_double [2018-11-23 13:43:30,471 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_double [2018-11-23 13:43:30,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:43:30,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:43:30,471 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:43:30,471 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:43:30,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 13:43:30,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:43:30,574 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 13:43:30,595 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 13:43:30,615 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 13:43:30,637 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:43:30,637 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 13:43:30,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:43:30 BoogieIcfgContainer [2018-11-23 13:43:30,637 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:43:30,638 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:43:30,638 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:43:30,640 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:43:30,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:43:30" (1/3) ... [2018-11-23 13:43:30,640 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a75559a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:43:30, skipping insertion in model container [2018-11-23 13:43:30,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:43:30" (2/3) ... [2018-11-23 13:43:30,641 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a75559a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:43:30, skipping insertion in model container [2018-11-23 13:43:30,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:43:30" (3/3) ... [2018-11-23 13:43:30,642 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1011b_true-unreach-call.c [2018-11-23 13:43:30,649 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:43:30,653 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:43:30,663 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:43:30,683 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:43:30,684 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:43:30,684 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:43:30,684 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:43:30,684 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:43:30,684 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:43:30,684 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:43:30,684 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:43:30,685 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:43:30,694 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-11-23 13:43:30,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 13:43:30,698 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:43:30,699 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:43:30,700 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:43:30,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:43:30,703 INFO L82 PathProgramCache]: Analyzing trace with hash -2010282984, now seen corresponding path program 1 times [2018-11-23 13:43:30,706 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:43:30,706 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5b8b2bc2-a540-414d-bfd2-cffaeb083968/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 13:43:30,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:43:30,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:43:30,750 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:43:30,762 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 13:43:30,762 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 13:43:30,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:43:30,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:43:30,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:43:30,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:43:30,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:43:30,783 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2018-11-23 13:43:30,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:43:30,802 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2018-11-23 13:43:30,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:43:30,803 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-23 13:43:30,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:43:30,810 INFO L225 Difference]: With dead ends: 56 [2018-11-23 13:43:30,810 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 13:43:30,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:43:30,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 13:43:30,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-23 13:43:30,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 13:43:30,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-11-23 13:43:30,840 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 17 [2018-11-23 13:43:30,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:43:30,840 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-11-23 13:43:30,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:43:30,840 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-11-23 13:43:30,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 13:43:30,841 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:43:30,841 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 13:43:30,841 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:43:30,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:43:30,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1410255941, now seen corresponding path program 1 times [2018-11-23 13:43:30,842 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:43:30,842 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5b8b2bc2-a540-414d-bfd2-cffaeb083968/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 13:43:30,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:43:30,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:43:30,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:43:31,004 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:43:31,005 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:43:31,010 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 76 treesize of output 82 [2018-11-23 13:43:31,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 52 treesize of output 53 [2018-11-23 13:43:31,077 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:43:31,097 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 53 treesize of output 43 [2018-11-23 13:43:31,104 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 43 treesize of output 27 [2018-11-23 13:43:31,105 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 13:43:31,110 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:43:31,133 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 13:43:31,163 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 13:43:31,163 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:100, output treesize:52 [2018-11-23 13:43:31,370 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 13:43:31,371 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 13:43:31,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:43:31,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-23 13:43:31,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 13:43:31,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 13:43:31,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-11-23 13:43:31,381 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 9 states. [2018-11-23 13:43:31,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:43:31,863 INFO L93 Difference]: Finished difference Result 31 states and 30 transitions. [2018-11-23 13:43:31,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 13:43:31,863 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2018-11-23 13:43:31,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:43:31,864 INFO L225 Difference]: With dead ends: 31 [2018-11-23 13:43:31,864 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 13:43:31,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:43:31,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 13:43:31,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-23 13:43:31,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 13:43:31,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 27 transitions. [2018-11-23 13:43:31,869 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 27 transitions. Word has length 19 [2018-11-23 13:43:31,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:43:31,870 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 27 transitions. [2018-11-23 13:43:31,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 13:43:31,870 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 27 transitions. [2018-11-23 13:43:31,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 13:43:31,871 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:43:31,871 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] [2018-11-23 13:43:31,871 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:43:31,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:43:31,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1929382976, now seen corresponding path program 1 times [2018-11-23 13:43:31,872 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:43:31,872 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5b8b2bc2-a540-414d-bfd2-cffaeb083968/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 13:43:31,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:43:31,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:43:31,992 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:43:32,029 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 13:43:32,038 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2018-11-23 13:43:32,039 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:43:32,044 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 13:43:32,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 13:43:32,056 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:64, output treesize:34 [2018-11-23 13:43:32,289 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:43:32,289 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:43:32,290 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:43:32,291 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:43:32,292 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 85 [2018-11-23 13:43:32,386 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:43:32,387 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:43:32,400 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 3 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 46 treesize of output 56 [2018-11-23 13:43:32,400 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 13:43:32,447 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 35 treesize of output 27 [2018-11-23 13:43:32,448 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 13:43:32,467 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 21 treesize of output 17 [2018-11-23 13:43:32,479 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 13 treesize of output 1 [2018-11-23 13:43:32,479 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 13:43:32,481 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:43:32,490 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 13:43:32,504 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 13:43:32,505 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:67, output treesize:24 [2018-11-23 13:43:32,813 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 13:43:32,814 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 13:43:32,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:43:32,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-11-23 13:43:32,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 13:43:32,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 13:43:32,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-11-23 13:43:32,823 INFO L87 Difference]: Start difference. First operand 28 states and 27 transitions. Second operand 14 states. [2018-11-23 13:43:34,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:43:34,132 INFO L93 Difference]: Finished difference Result 28 states and 27 transitions. [2018-11-23 13:43:34,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 13:43:34,133 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2018-11-23 13:43:34,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:43:34,133 INFO L225 Difference]: With dead ends: 28 [2018-11-23 13:43:34,133 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 13:43:34,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2018-11-23 13:43:34,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 13:43:34,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 13:43:34,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 13:43:34,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 13:43:34,135 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2018-11-23 13:43:34,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:43:34,135 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 13:43:34,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 13:43:34,135 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 13:43:34,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:43:34,138 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 13:43:34,212 INFO L448 ceAbstractionStarter]: For program point L32(lines 32 37) no Hoare annotation was computed. [2018-11-23 13:43:34,212 INFO L448 ceAbstractionStarter]: For program point L32-1(lines 25 39) no Hoare annotation was computed. [2018-11-23 13:43:34,212 INFO L448 ceAbstractionStarter]: For program point L32-2(lines 32 37) no Hoare annotation was computed. [2018-11-23 13:43:34,212 INFO L448 ceAbstractionStarter]: For program point L27-1(lines 27 31) no Hoare annotation was computed. [2018-11-23 13:43:34,213 INFO L444 ceAbstractionStarter]: At program point L27-2(lines 27 31) the Hoare annotation is: (= |fabs_double_#in~x| fabs_double_~x) [2018-11-23 13:43:34,213 INFO L448 ceAbstractionStarter]: For program point fabs_doubleEXIT(lines 25 39) no Hoare annotation was computed. [2018-11-23 13:43:34,213 INFO L451 ceAbstractionStarter]: At program point fabs_doubleENTRY(lines 25 39) the Hoare annotation is: true [2018-11-23 13:43:34,213 INFO L448 ceAbstractionStarter]: For program point fabs_doubleFINAL(lines 25 39) no Hoare annotation was computed. [2018-11-23 13:43:34,213 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 13:43:34,213 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 13:43:34,213 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:43:34,213 INFO L448 ceAbstractionStarter]: For program point __signbit_doubleFINAL(lines 14 24) no Hoare annotation was computed. [2018-11-23 13:43:34,214 INFO L448 ceAbstractionStarter]: For program point __signbit_doubleEXIT(lines 14 24) no Hoare annotation was computed. [2018-11-23 13:43:34,214 INFO L448 ceAbstractionStarter]: For program point L17-1(lines 17 21) no Hoare annotation was computed. [2018-11-23 13:43:34,214 INFO L444 ceAbstractionStarter]: At program point L17-2(lines 17 21) the Hoare annotation is: (= |__signbit_double_#in~x| __signbit_double_~x) [2018-11-23 13:43:34,214 INFO L448 ceAbstractionStarter]: For program point L17-3(lines 17 21) no Hoare annotation was computed. [2018-11-23 13:43:34,214 INFO L451 ceAbstractionStarter]: At program point __signbit_doubleENTRY(lines 14 24) the Hoare annotation is: true [2018-11-23 13:43:34,214 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 13:43:34,214 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-23 13:43:34,215 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 13:43:34,215 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 13:43:34,215 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 41 57) the Hoare annotation is: true [2018-11-23 13:43:34,215 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 41 57) no Hoare annotation was computed. [2018-11-23 13:43:34,215 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 52) no Hoare annotation was computed. [2018-11-23 13:43:34,215 INFO L448 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-11-23 13:43:34,215 INFO L448 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2018-11-23 13:43:34,216 INFO L444 ceAbstractionStarter]: At program point L51-1(line 51) the Hoare annotation is: (and |main_#t~short8| (exists ((v_prenex_6 (_ BitVec 64)) (v_arrayElimCell_4 (_ BitVec 32))) (and (= (let ((.cse0 (concat (bvand (_ bv2147483647 32) ((_ extract 63 32) v_prenex_6)) v_arrayElimCell_4))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) main_~res~0) (= (fp ((_ extract 63 63) v_prenex_6) ((_ extract 62 52) v_prenex_6) ((_ extract 51 0) v_prenex_6)) (fp.neg (_ +zero 11 53))))) (= main_~x~0 (fp.neg (_ +zero 11 53)))) [2018-11-23 13:43:34,216 INFO L448 ceAbstractionStarter]: For program point L51-2(line 51) no Hoare annotation was computed. [2018-11-23 13:43:34,216 INFO L444 ceAbstractionStarter]: At program point L48(line 48) the Hoare annotation is: (= main_~x~0 (fp.neg (_ +zero 11 53))) [2018-11-23 13:43:34,216 INFO L448 ceAbstractionStarter]: For program point L48-1(line 48) no Hoare annotation was computed. [2018-11-23 13:43:34,216 INFO L448 ceAbstractionStarter]: For program point L51-4(lines 51 54) no Hoare annotation was computed. [2018-11-23 13:43:34,216 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 41 57) no Hoare annotation was computed. [2018-11-23 13:43:34,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:43:34 BoogieIcfgContainer [2018-11-23 13:43:34,227 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:43:34,227 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:43:34,227 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:43:34,228 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:43:34,228 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:43:30" (3/4) ... [2018-11-23 13:43:34,231 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 13:43:34,238 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fabs_double [2018-11-23 13:43:34,238 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 13:43:34,238 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __signbit_double [2018-11-23 13:43:34,238 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 13:43:34,242 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2018-11-23 13:43:34,243 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-11-23 13:43:34,243 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 13:43:34,267 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(x) == x [2018-11-23 13:43:34,267 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(x) == x [2018-11-23 13:43:34,281 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_5b8b2bc2-a540-414d-bfd2-cffaeb083968/bin-2019/uautomizer/witness.graphml [2018-11-23 13:43:34,281 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:43:34,282 INFO L168 Benchmark]: Toolchain (without parser) took 4124.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 950.8 MB in the beginning and 903.0 MB in the end (delta: 47.8 MB). Peak memory consumption was 195.2 MB. Max. memory is 11.5 GB. [2018-11-23 13:43:34,283 INFO L168 Benchmark]: CDTParser took 0.13 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 13:43:34,283 INFO L168 Benchmark]: CACSL2BoogieTranslator took 181.88 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 934.7 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 13:43:34,283 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.48 ms. Allocated memory is still 1.0 GB. Free memory is still 934.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:43:34,284 INFO L168 Benchmark]: Boogie Preprocessor took 24.62 ms. Allocated memory is still 1.0 GB. Free memory is still 934.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:43:34,285 INFO L168 Benchmark]: RCFGBuilder took 255.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 934.7 MB in the beginning and 1.1 GB in the end (delta: -181.0 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. [2018-11-23 13:43:34,285 INFO L168 Benchmark]: TraceAbstraction took 3589.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 909.9 MB in the end (delta: 205.7 MB). Peak memory consumption was 205.7 MB. Max. memory is 11.5 GB. [2018-11-23 13:43:34,285 INFO L168 Benchmark]: Witness Printer took 53.97 ms. Allocated memory is still 1.2 GB. Free memory was 909.9 MB in the beginning and 903.0 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2018-11-23 13:43:34,287 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.13 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 181.88 ms. Allocated memory is still 1.0 GB. Free memory was 950.8 MB in the beginning and 934.7 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 16.48 ms. Allocated memory is still 1.0 GB. Free memory is still 934.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.62 ms. Allocated memory is still 1.0 GB. Free memory is still 934.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 255.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 934.7 MB in the beginning and 1.1 GB in the end (delta: -181.0 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3589.06 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 909.9 MB in the end (delta: 205.7 MB). Peak memory consumption was 205.7 MB. Max. memory is 11.5 GB. * Witness Printer took 53.97 ms. Allocated memory is still 1.2 GB. Free memory was 909.9 MB in the beginning and 903.0 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 52]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: \old(x) == x - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: \old(x) == x - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 32 locations, 1 error locations. SAFE Result, 3.5s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 1.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 69 SDtfs, 23 SDslu, 288 SDs, 0 SdLazy, 151 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 72 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred 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, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 12 PreInvPairs, 15 NumberOfFragments, 58 HoareAnnotationTreeSize, 12 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 63 NumberOfCodeBlocks, 63 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 60 ConstructedInterpolants, 20 QuantifiedInterpolants, 18548 SizeOfPredicates, 13 NumberOfNonLiveVariables, 179 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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...