./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/float_req_bl_1092b_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_0b1a24be-59ea-4ae3-a58d-30c5c52c519f/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0b1a24be-59ea-4ae3-a58d-30c5c52c519f/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0b1a24be-59ea-4ae3-a58d-30c5c52c519f/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0b1a24be-59ea-4ae3-a58d-30c5c52c519f/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1092b_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_0b1a24be-59ea-4ae3-a58d-30c5c52c519f/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0b1a24be-59ea-4ae3-a58d-30c5c52c519f/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2e3b677629e69b083ff740542124e952dcae7545 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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_0b1a24be-59ea-4ae3-a58d-30c5c52c519f/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0b1a24be-59ea-4ae3-a58d-30c5c52c519f/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0b1a24be-59ea-4ae3-a58d-30c5c52c519f/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0b1a24be-59ea-4ae3-a58d-30c5c52c519f/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1092b_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_0b1a24be-59ea-4ae3-a58d-30c5c52c519f/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0b1a24be-59ea-4ae3-a58d-30c5c52c519f/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2e3b677629e69b083ff740542124e952dcae7545 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 15:36:17,686 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 15:36:17,687 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 15:36:17,695 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 15:36:17,695 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 15:36:17,696 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 15:36:17,696 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 15:36:17,697 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 15:36:17,699 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 15:36:17,699 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 15:36:17,700 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 15:36:17,700 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 15:36:17,701 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 15:36:17,701 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 15:36:17,702 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 15:36:17,703 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 15:36:17,703 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 15:36:17,704 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 15:36:17,706 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 15:36:17,707 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 15:36:17,708 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 15:36:17,708 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 15:36:17,710 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 15:36:17,710 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 15:36:17,710 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 15:36:17,711 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 15:36:17,712 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 15:36:17,712 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 15:36:17,713 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 15:36:17,714 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 15:36:17,714 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 15:36:17,714 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 15:36:17,714 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 15:36:17,715 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 15:36:17,715 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 15:36:17,716 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 15:36:17,716 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0b1a24be-59ea-4ae3-a58d-30c5c52c519f/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-23 15:36:17,725 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 15:36:17,725 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 15:36:17,726 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 15:36:17,726 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 15:36:17,726 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 15:36:17,726 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 15:36:17,726 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 15:36:17,726 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 15:36:17,727 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 15:36:17,727 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 15:36:17,727 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 15:36:17,727 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 15:36:17,727 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 15:36:17,727 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 15:36:17,727 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 15:36:17,727 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 15:36:17,728 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 15:36:17,728 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 15:36:17,728 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 15:36:17,728 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 15:36:17,728 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 15:36:17,728 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 15:36:17,728 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 15:36:17,728 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 15:36:17,729 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 15:36:17,729 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 15:36:17,729 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 15:36:17,729 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 15:36:17,729 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 15:36:17,729 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 15:36:17,729 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 15:36:17,729 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 15:36:17,730 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 15:36:17,730 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 15:36:17,730 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 15:36:17,730 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 15:36:17,730 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 15:36:17,730 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_0b1a24be-59ea-4ae3-a58d-30c5c52c519f/bin-2019/utaipan 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 -> Taipan 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 -> 2e3b677629e69b083ff740542124e952dcae7545 [2018-11-23 15:36:17,752 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 15:36:17,760 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 15:36:17,762 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 15:36:17,762 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 15:36:17,763 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 15:36:17,763 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0b1a24be-59ea-4ae3-a58d-30c5c52c519f/bin-2019/utaipan/../../sv-benchmarks/c/float-newlib/float_req_bl_1092b_true-unreach-call.c [2018-11-23 15:36:17,799 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0b1a24be-59ea-4ae3-a58d-30c5c52c519f/bin-2019/utaipan/data/3cdd4da6c/225a48dd81b34bc3a13e2295b2565bd2/FLAGe80b865aa [2018-11-23 15:36:18,193 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 15:36:18,193 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0b1a24be-59ea-4ae3-a58d-30c5c52c519f/sv-benchmarks/c/float-newlib/float_req_bl_1092b_true-unreach-call.c [2018-11-23 15:36:18,197 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0b1a24be-59ea-4ae3-a58d-30c5c52c519f/bin-2019/utaipan/data/3cdd4da6c/225a48dd81b34bc3a13e2295b2565bd2/FLAGe80b865aa [2018-11-23 15:36:18,209 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0b1a24be-59ea-4ae3-a58d-30c5c52c519f/bin-2019/utaipan/data/3cdd4da6c/225a48dd81b34bc3a13e2295b2565bd2 [2018-11-23 15:36:18,211 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 15:36:18,212 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 15:36:18,212 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 15:36:18,212 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 15:36:18,214 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 15:36:18,215 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:36:18" (1/1) ... [2018-11-23 15:36:18,217 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f466f4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:18, skipping insertion in model container [2018-11-23 15:36:18,217 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:36:18" (1/1) ... [2018-11-23 15:36:18,223 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 15:36:18,239 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 15:36:18,357 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:36:18,359 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 15:36:18,374 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:36:18,387 INFO L195 MainTranslator]: Completed translation [2018-11-23 15:36:18,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:18 WrapperNode [2018-11-23 15:36:18,388 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 15:36:18,388 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 15:36:18,388 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 15:36:18,388 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 15:36:18,393 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:18" (1/1) ... [2018-11-23 15:36:18,400 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:18" (1/1) ... [2018-11-23 15:36:18,405 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 15:36:18,405 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 15:36:18,405 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 15:36:18,406 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 15:36:18,448 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:18" (1/1) ... [2018-11-23 15:36:18,448 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:18" (1/1) ... [2018-11-23 15:36:18,450 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:18" (1/1) ... [2018-11-23 15:36:18,450 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:18" (1/1) ... [2018-11-23 15:36:18,456 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:18" (1/1) ... [2018-11-23 15:36:18,460 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:18" (1/1) ... [2018-11-23 15:36:18,461 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:18" (1/1) ... [2018-11-23 15:36:18,463 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 15:36:18,463 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 15:36:18,463 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 15:36:18,463 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 15:36:18,464 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0b1a24be-59ea-4ae3-a58d-30c5c52c519f/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 15:36:18,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-11-23 15:36:18,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 15:36:18,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 15:36:18,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 15:36:18,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-23 15:36:18,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 15:36:18,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 15:36:18,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 15:36:18,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 15:36:18,502 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 15:36:18,503 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 15:36:18,503 INFO L130 BoogieDeclarations]: Found specification of procedure ceil_float [2018-11-23 15:36:18,503 INFO L138 BoogieDeclarations]: Found implementation of procedure ceil_float [2018-11-23 15:36:18,503 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_float [2018-11-23 15:36:18,503 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_float [2018-11-23 15:36:18,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 15:36:18,720 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 15:36:18,720 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 15:36:18,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:36:18 BoogieIcfgContainer [2018-11-23 15:36:18,720 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 15:36:18,721 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 15:36:18,721 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 15:36:18,724 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 15:36:18,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:36:18" (1/3) ... [2018-11-23 15:36:18,725 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@662c56da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:36:18, skipping insertion in model container [2018-11-23 15:36:18,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:18" (2/3) ... [2018-11-23 15:36:18,725 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@662c56da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:36:18, skipping insertion in model container [2018-11-23 15:36:18,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:36:18" (3/3) ... [2018-11-23 15:36:18,727 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1092b_true-unreach-call.c [2018-11-23 15:36:18,735 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 15:36:18,742 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 15:36:18,757 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 15:36:18,784 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 15:36:18,784 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 15:36:18,784 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 15:36:18,784 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 15:36:18,784 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 15:36:18,784 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 15:36:18,784 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 15:36:18,785 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 15:36:18,800 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2018-11-23 15:36:18,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 15:36:18,805 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:36:18,806 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:36:18,808 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:36:18,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:36:18,812 INFO L82 PathProgramCache]: Analyzing trace with hash 263185431, now seen corresponding path program 1 times [2018-11-23 15:36:18,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:36:18,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:36:18,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:36:18,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:36:18,853 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:36:18,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:36:18,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:36:18,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:36:18,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 15:36:18,917 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 15:36:18,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 15:36:18,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 15:36:18,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 15:36:18,929 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 2 states. [2018-11-23 15:36:18,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:36:18,943 INFO L93 Difference]: Finished difference Result 78 states and 111 transitions. [2018-11-23 15:36:18,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 15:36:18,944 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-23 15:36:18,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:36:18,949 INFO L225 Difference]: With dead ends: 78 [2018-11-23 15:36:18,950 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 15:36:18,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 15:36:18,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 15:36:18,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-23 15:36:18,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 15:36:18,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2018-11-23 15:36:18,982 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 18 [2018-11-23 15:36:18,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:36:18,982 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2018-11-23 15:36:18,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 15:36:18,982 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2018-11-23 15:36:18,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 15:36:18,983 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:36:18,983 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:36:18,983 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:36:18,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:36:18,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1491196875, now seen corresponding path program 1 times [2018-11-23 15:36:18,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 15:36:18,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:36:18,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:36:18,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:36:18,985 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 15:36:19,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:36:19,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:36:19,054 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=6442450950, |#NULL.offset|=6442450945, |old(#NULL.base)|=6442450950, |old(#NULL.offset)|=6442450945, |old(~huge_ceil~0)|=6442450948.0, ~huge_ceil~0=6442450948.0] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~huge_ceil~0 := 1.0E30; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=6442450950, |old(#NULL.offset)|=6442450945, |old(~huge_ceil~0)|=6442450948.0, ~huge_ceil~0=1000000000000000000000000000000.0] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=6442450950, |old(#NULL.offset)|=6442450945, |old(~huge_ceil~0)|=6442450948.0, ~huge_ceil~0=1000000000000000000000000000000.0] [?] RET #114#return; VAL [|#NULL.base|=0, |#NULL.offset|=0, ~huge_ceil~0=1000000000000000000000000000000.0] [?] CALL call #t~ret9 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0, ~huge_ceil~0=1000000000000000000000000000000.0] [?] ~x~0 := 0.0; VAL [main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, ~huge_ceil~0=1000000000000000000000000000000.0] [?] CALL call #t~ret6 := ceil_float(~x~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |ceil_float_#in~x|=0.0, ~huge_ceil~0=1000000000000000000000000000000.0] [?] ~x := #in~x;havoc ~i0~0;havoc ~j0~0;havoc ~i~0;havoc ~ix~0; VAL [ceil_float_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ceil_float_#in~x|=0.0, ~huge_ceil~0=1000000000000000000000000000000.0] [?] call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.alloc(4);call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4);call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4);~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296);call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4);havoc #t~mem0;havoc #t~union1;call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset);havoc ~#gf_u~0.base, ~#gf_u~0.offset; VAL [ceil_float_~i0~0=(- 2147483648), ceil_float_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ceil_float_#in~x|=0.0, ~huge_ceil~0=1000000000000000000000000000000.0] [?] goto; VAL [ceil_float_~i0~0=(- 2147483648), ceil_float_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ceil_float_#in~x|=0.0, ~huge_ceil~0=1000000000000000000000000000000.0] [?] ~ix~0 := ~bitwiseAnd(~i0~0, 2147483647);~j0~0 := (if (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 <= 2147483647 then (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 else (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 - 4294967296); VAL [ceil_float_~i0~0=(- 2147483648), ceil_float_~ix~0=(- 18014398509481985), ceil_float_~j0~0=2147483520, ceil_float_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ceil_float_#in~x|=0.0, ~huge_ceil~0=1000000000000000000000000000000.0] [?] assume !(~j0~0 < 23); VAL [ceil_float_~i0~0=(- 2147483648), ceil_float_~ix~0=(- 18014398509481985), ceil_float_~j0~0=2147483520, ceil_float_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ceil_float_#in~x|=0.0, ~huge_ceil~0=1000000000000000000000000000000.0] [?] assume !(~ix~0 % 4294967296 < 2139095040);#res := ~someBinaryArithmeticFLOAToperation(~x, ~x); VAL [ceil_float_~i0~0=(- 2147483648), ceil_float_~ix~0=(- 18014398509481985), ceil_float_~j0~0=2147483520, ceil_float_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ceil_float_#in~x|=0.0, ~huge_ceil~0=1000000000000000000000000000000.0] [?] assume true; VAL [ceil_float_~i0~0=(- 2147483648), ceil_float_~ix~0=(- 18014398509481985), ceil_float_~j0~0=2147483520, ceil_float_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |ceil_float_#in~x|=0.0, ~huge_ceil~0=1000000000000000000000000000000.0] [?] RET #118#return; VAL [main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret6|=6442450947.0, ~huge_ceil~0=1000000000000000000000000000000.0] [?] ~res~0 := #t~ret6;havoc #t~ret6;#t~short8 := ~someBinaryFLOATComparisonOperation(~res~0, 0.0); VAL [main_~res~0=6442450947.0, main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~short8|=false, ~huge_ceil~0=1000000000000000000000000000000.0] [?] assume !#t~short8; VAL [main_~res~0=6442450947.0, main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~short8|=false, ~huge_ceil~0=1000000000000000000000000000000.0] [?] assume !#t~short8;havoc #t~ret7;havoc #t~short8; VAL [main_~res~0=6442450947.0, main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, ~huge_ceil~0=1000000000000000000000000000000.0] [?] assume !false; VAL [main_~res~0=6442450947.0, main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0, ~huge_ceil~0=1000000000000000000000000000000.0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=6442450950, #NULL.offset=6442450945, old(#NULL.base)=6442450950, old(#NULL.offset)=6442450945, old(~huge_ceil~0)=6.442450948E9, ~huge_ceil~0=6.442450948E9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L11] ~huge_ceil~0 := 1.0E30; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6442450950, old(#NULL.offset)=6442450945, old(~huge_ceil~0)=6.442450948E9, ~huge_ceil~0=1.0E30] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6442450950, old(#NULL.offset)=6442450945, old(~huge_ceil~0)=6.442450948E9, ~huge_ceil~0=1.0E30] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E30] [?] CALL call #t~ret9 := main(); VAL [#NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E30] [L76] ~x~0 := 0.0; VAL [#NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E30, ~x~0=0.0] [L77] CALL call #t~ret6 := ceil_float(~x~0); VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E30] [L13-L54] ~x := #in~x; [L14] havoc ~i0~0; [L14] havoc ~j0~0; [L15] havoc ~i~0; [L15] havoc ~ix~0; VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E30, ~x=0.0] [L17] call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.alloc(4); [L18] call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4); [L19] call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4); [L19] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L19] call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4); [L19] havoc #t~mem0; [L19] havoc #t~union1; [L17] call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset); [L17] havoc ~#gf_u~0.base, ~#gf_u~0.offset; VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E30, ~i0~0=-2147483648, ~x=0.0] [L21] ~ix~0 := ~bitwiseAnd(~i0~0, 2147483647); [L22] ~j0~0 := (if (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 <= 2147483647 then (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 else (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 - 4294967296); VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=0.0] [L23-L47] assume !(~j0~0 < 23); VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=0.0] [L43-L46] assume !(~ix~0 % 4294967296 < 2139095040); [L44] #res := ~someBinaryArithmeticFLOAToperation(~x, ~x); VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=0.0] [L13-L54] ensures true; VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=0.0] [L77] RET call #t~ret6 := ceil_float(~x~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret6=6.442450947E9, ~huge_ceil~0=1.0E30, ~x~0=0.0] [L77] ~res~0 := #t~ret6; [L77] havoc #t~ret6; [L80] #t~short8 := ~someBinaryFLOATComparisonOperation(~res~0, 0.0); VAL [#NULL.base=0, #NULL.offset=0, #t~short8=false, ~huge_ceil~0=1.0E30, ~res~0=6.442450947E9, ~x~0=0.0] [L80] assume !#t~short8; VAL [#NULL.base=0, #NULL.offset=0, #t~short8=false, ~huge_ceil~0=1.0E30, ~res~0=6.442450947E9, ~x~0=0.0] [L80-L83] assume !#t~short8; [L80] havoc #t~ret7; [L80] havoc #t~short8; VAL [#NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E30, ~res~0=6.442450947E9, ~x~0=0.0] [L81] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E30, ~res~0=6.442450947E9, ~x~0=0.0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=6442450950, #NULL.offset=6442450945, old(#NULL.base)=6442450950, old(#NULL.offset)=6442450945, old(~huge_ceil~0)=6.442450948E9, ~huge_ceil~0=6.442450948E9] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [L11] ~huge_ceil~0 := 1.0E30; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6442450950, old(#NULL.offset)=6442450945, old(~huge_ceil~0)=6.442450948E9, ~huge_ceil~0=1.0E30] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=6442450950, old(#NULL.offset)=6442450945, old(~huge_ceil~0)=6.442450948E9, ~huge_ceil~0=1.0E30] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E30] [?] CALL call #t~ret9 := main(); VAL [#NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E30] [L76] ~x~0 := 0.0; VAL [#NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E30, ~x~0=0.0] [L77] CALL call #t~ret6 := ceil_float(~x~0); VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E30] [L13-L54] ~x := #in~x; [L14] havoc ~i0~0; [L14] havoc ~j0~0; [L15] havoc ~i~0; [L15] havoc ~ix~0; VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E30, ~x=0.0] [L17] call ~#gf_u~0.base, ~#gf_u~0.offset := #Ultimate.alloc(4); [L18] call write~real(~x, ~#gf_u~0.base, ~#gf_u~0.offset, 4); [L19] call #t~mem0 := read~int(~#gf_u~0.base, ~#gf_u~0.offset, 4); [L19] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L19] call write~real(#t~union1, ~#gf_u~0.base, ~#gf_u~0.offset, 4); [L19] havoc #t~mem0; [L19] havoc #t~union1; [L17] call ULTIMATE.dealloc(~#gf_u~0.base, ~#gf_u~0.offset); [L17] havoc ~#gf_u~0.base, ~#gf_u~0.offset; VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E30, ~i0~0=-2147483648, ~x=0.0] [L21] ~ix~0 := ~bitwiseAnd(~i0~0, 2147483647); [L22] ~j0~0 := (if (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 <= 2147483647 then (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 else (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 - 4294967296); VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=0.0] [L23-L47] assume !(~j0~0 < 23); VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=0.0] [L43-L46] assume !(~ix~0 % 4294967296 < 2139095040); [L44] #res := ~someBinaryArithmeticFLOAToperation(~x, ~x); VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=0.0] [L13-L54] ensures true; VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=0.0] [L77] RET call #t~ret6 := ceil_float(~x~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret6=6.442450947E9, ~huge_ceil~0=1.0E30, ~x~0=0.0] [L77] ~res~0 := #t~ret6; [L77] havoc #t~ret6; [L80] #t~short8 := ~someBinaryFLOATComparisonOperation(~res~0, 0.0); VAL [#NULL.base=0, #NULL.offset=0, #t~short8=false, ~huge_ceil~0=1.0E30, ~res~0=6.442450947E9, ~x~0=0.0] [L80] assume !#t~short8; VAL [#NULL.base=0, #NULL.offset=0, #t~short8=false, ~huge_ceil~0=1.0E30, ~res~0=6.442450947E9, ~x~0=0.0] [L80-L83] assume !#t~short8; [L80] havoc #t~ret7; [L80] havoc #t~short8; VAL [#NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E30, ~res~0=6.442450947E9, ~x~0=0.0] [L81] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~huge_ceil~0=1.0E30, ~res~0=6.442450947E9, ~x~0=0.0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6442450950, #NULL!offset=6442450945, old(#NULL!base)=6442450950, old(#NULL!offset)=6442450945, old(~huge_ceil~0)=6.442450948E9, ~huge_ceil~0=6.442450948E9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L11] ~huge_ceil~0 := 1.0E30; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6442450950, old(#NULL!offset)=6442450945, old(~huge_ceil~0)=6.442450948E9, ~huge_ceil~0=1.0E30] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30] [?] CALL call #t~ret9 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30] [L76] ~x~0 := 0.0; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30, ~x~0=0.0] [L77] CALL call #t~ret6 := ceil_float(~x~0); VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30] [L13-L54] ~x := #in~x; [L14] havoc ~i0~0; [L14] havoc ~j0~0; [L15] havoc ~i~0; [L15] havoc ~ix~0; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30, ~x=0.0] [L17] FCALL call ~#gf_u~0 := #Ultimate.alloc(4); [L18] FCALL call write~real(~x, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L19] FCALL call #t~mem0 := read~int({ base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L19] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L19] FCALL call write~real(#t~union1, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L19] havoc #t~mem0; [L19] havoc #t~union1; [L17] FCALL call ULTIMATE.dealloc(~#gf_u~0); [L17] havoc ~#gf_u~0; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30, ~i0~0=-2147483648, ~x=0.0] [L21] ~ix~0 := ~bitwiseAnd(~i0~0, 2147483647); [L22] ~j0~0 := (if (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 <= 2147483647 then (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 else (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 - 4294967296); VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=0.0] [L23] COND FALSE !(~j0~0 < 23) VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=0.0] [L43] COND TRUE !(~ix~0 % 4294967296 < 2139095040) [L44] #res := ~someBinaryArithmeticFLOAToperation(~x, ~x); VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=0.0] [L77] RET call #t~ret6 := ceil_float(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret6=6.442450947E9, ~huge_ceil~0=1.0E30, ~x~0=0.0] [L77] ~res~0 := #t~ret6; [L77] havoc #t~ret6; [L80] #t~short8 := ~someBinaryFLOATComparisonOperation(~res~0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, #t~short8=false, ~huge_ceil~0=1.0E30, ~res~0=6.442450947E9, ~x~0=0.0] [L80] COND FALSE !(#t~short8) VAL [#NULL!base=0, #NULL!offset=0, #t~short8=false, ~huge_ceil~0=1.0E30, ~res~0=6.442450947E9, ~x~0=0.0] [L80] COND TRUE !#t~short8 [L80] havoc #t~ret7; [L80] havoc #t~short8; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30, ~res~0=6.442450947E9, ~x~0=0.0] [L81] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30, ~res~0=6.442450947E9, ~x~0=0.0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6442450950, #NULL!offset=6442450945, old(#NULL!base)=6442450950, old(#NULL!offset)=6442450945, old(~huge_ceil~0)=6.442450948E9, ~huge_ceil~0=6.442450948E9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L11] ~huge_ceil~0 := 1.0E30; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6442450950, old(#NULL!offset)=6442450945, old(~huge_ceil~0)=6.442450948E9, ~huge_ceil~0=1.0E30] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30] [?] CALL call #t~ret9 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30] [L76] ~x~0 := 0.0; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30, ~x~0=0.0] [L77] CALL call #t~ret6 := ceil_float(~x~0); VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30] [L13-L54] ~x := #in~x; [L14] havoc ~i0~0; [L14] havoc ~j0~0; [L15] havoc ~i~0; [L15] havoc ~ix~0; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30, ~x=0.0] [L17] FCALL call ~#gf_u~0 := #Ultimate.alloc(4); [L18] FCALL call write~real(~x, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L19] FCALL call #t~mem0 := read~int({ base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L19] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L19] FCALL call write~real(#t~union1, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L19] havoc #t~mem0; [L19] havoc #t~union1; [L17] FCALL call ULTIMATE.dealloc(~#gf_u~0); [L17] havoc ~#gf_u~0; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30, ~i0~0=-2147483648, ~x=0.0] [L21] ~ix~0 := ~bitwiseAnd(~i0~0, 2147483647); [L22] ~j0~0 := (if (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 <= 2147483647 then (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 else (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 - 4294967296); VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=0.0] [L23] COND FALSE !(~j0~0 < 23) VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=0.0] [L43] COND TRUE !(~ix~0 % 4294967296 < 2139095040) [L44] #res := ~someBinaryArithmeticFLOAToperation(~x, ~x); VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=0.0] [L77] RET call #t~ret6 := ceil_float(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret6=6.442450947E9, ~huge_ceil~0=1.0E30, ~x~0=0.0] [L77] ~res~0 := #t~ret6; [L77] havoc #t~ret6; [L80] #t~short8 := ~someBinaryFLOATComparisonOperation(~res~0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, #t~short8=false, ~huge_ceil~0=1.0E30, ~res~0=6.442450947E9, ~x~0=0.0] [L80] COND FALSE !(#t~short8) VAL [#NULL!base=0, #NULL!offset=0, #t~short8=false, ~huge_ceil~0=1.0E30, ~res~0=6.442450947E9, ~x~0=0.0] [L80] COND TRUE !#t~short8 [L80] havoc #t~ret7; [L80] havoc #t~short8; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30, ~res~0=6.442450947E9, ~x~0=0.0] [L81] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30, ~res~0=6.442450947E9, ~x~0=0.0] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6442450950, #NULL!offset=6442450945, old(#NULL!base)=6442450950, old(#NULL!offset)=6442450945, old(~huge_ceil~0)=6.442450948E9, ~huge_ceil~0=6.442450948E9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L11] ~huge_ceil~0 := 1.0E30; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6442450950, old(#NULL!offset)=6442450945, old(~huge_ceil~0)=6.442450948E9, ~huge_ceil~0=1.0E30] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30] [?] CALL call #t~ret9 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30] [L76] ~x~0 := 0.0; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30, ~x~0=0.0] [L77] CALL call #t~ret6 := ceil_float(~x~0); VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30] [L13-L54] ~x := #in~x; [L14] havoc ~i0~0; [L14] havoc ~j0~0; [L15] havoc ~i~0; [L15] havoc ~ix~0; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30, ~x=0.0] [L17] FCALL call ~#gf_u~0 := #Ultimate.alloc(4); [L18] FCALL call write~real(~x, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L19] FCALL call #t~mem0 := read~int({ base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L19] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L19] FCALL call write~real(#t~union1, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L19] havoc #t~mem0; [L19] havoc #t~union1; [L17] FCALL call ULTIMATE.dealloc(~#gf_u~0); [L17] havoc ~#gf_u~0; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30, ~i0~0=-2147483648, ~x=0.0] [L21] ~ix~0 := ~bitwiseAnd(~i0~0, 2147483647); [L22] ~j0~0 := (if (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 <= 2147483647 then (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 else (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 - 4294967296); VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=0.0] [L23] COND FALSE !(~j0~0 < 23) VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=0.0] [L43] COND TRUE !(~ix~0 % 4294967296 < 2139095040) [L44] #res := ~someBinaryArithmeticFLOAToperation(~x, ~x); VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=0.0] [L77] RET call #t~ret6 := ceil_float(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret6=6.442450947E9, ~huge_ceil~0=1.0E30, ~x~0=0.0] [L77] ~res~0 := #t~ret6; [L77] havoc #t~ret6; [L80] #t~short8 := ~someBinaryFLOATComparisonOperation(~res~0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, #t~short8=false, ~huge_ceil~0=1.0E30, ~res~0=6.442450947E9, ~x~0=0.0] [L80] COND FALSE !(#t~short8) VAL [#NULL!base=0, #NULL!offset=0, #t~short8=false, ~huge_ceil~0=1.0E30, ~res~0=6.442450947E9, ~x~0=0.0] [L80] COND TRUE !#t~short8 [L80] havoc #t~ret7; [L80] havoc #t~short8; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30, ~res~0=6.442450947E9, ~x~0=0.0] [L81] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30, ~res~0=6.442450947E9, ~x~0=0.0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=6442450950, #NULL!offset=6442450945, old(#NULL!base)=6442450950, old(#NULL!offset)=6442450945, old(~huge_ceil~0)=6.442450948E9, ~huge_ceil~0=6.442450948E9] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L11] ~huge_ceil~0 := 1.0E30; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=6442450950, old(#NULL!offset)=6442450945, old(~huge_ceil~0)=6.442450948E9, ~huge_ceil~0=1.0E30] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30] [?] CALL call #t~ret9 := main(); VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30] [L76] ~x~0 := 0.0; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30, ~x~0=0.0] [L77] CALL call #t~ret6 := ceil_float(~x~0); VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30] [L13-L54] ~x := #in~x; [L14] havoc ~i0~0; [L14] havoc ~j0~0; [L15] havoc ~i~0; [L15] havoc ~ix~0; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30, ~x=0.0] [L17] FCALL call ~#gf_u~0 := #Ultimate.alloc(4); [L18] FCALL call write~real(~x, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L19] FCALL call #t~mem0 := read~int({ base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L19] ~i0~0 := (if #t~mem0 % 4294967296 % 4294967296 <= 2147483647 then #t~mem0 % 4294967296 % 4294967296 else #t~mem0 % 4294967296 % 4294967296 - 4294967296); [L19] FCALL call write~real(#t~union1, { base: ~#gf_u~0!base, offset: ~#gf_u~0!offset }, 4); [L19] havoc #t~mem0; [L19] havoc #t~union1; [L17] FCALL call ULTIMATE.dealloc(~#gf_u~0); [L17] havoc ~#gf_u~0; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30, ~i0~0=-2147483648, ~x=0.0] [L21] ~ix~0 := ~bitwiseAnd(~i0~0, 2147483647); [L22] ~j0~0 := (if (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 <= 2147483647 then (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 else (~ix~0 / 8388608 - 127) % 4294967296 % 4294967296 - 4294967296); VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=0.0] [L23] COND FALSE !(~j0~0 < 23) VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=0.0] [L43] COND TRUE !(~ix~0 % 4294967296 < 2139095040) [L44] #res := ~someBinaryArithmeticFLOAToperation(~x, ~x); VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30, ~i0~0=-2147483648, ~ix~0=-18014398509481985, ~j0~0=2147483520, ~x=0.0] [L77] RET call #t~ret6 := ceil_float(~x~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret6=6.442450947E9, ~huge_ceil~0=1.0E30, ~x~0=0.0] [L77] ~res~0 := #t~ret6; [L77] havoc #t~ret6; [L80] #t~short8 := ~someBinaryFLOATComparisonOperation(~res~0, 0.0); VAL [#NULL!base=0, #NULL!offset=0, #t~short8=false, ~huge_ceil~0=1.0E30, ~res~0=6.442450947E9, ~x~0=0.0] [L80] COND FALSE !(#t~short8) VAL [#NULL!base=0, #NULL!offset=0, #t~short8=false, ~huge_ceil~0=1.0E30, ~res~0=6.442450947E9, ~x~0=0.0] [L80] COND TRUE !#t~short8 [L80] havoc #t~ret7; [L80] havoc #t~short8; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30, ~res~0=6.442450947E9, ~x~0=0.0] [L81] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~huge_ceil~0=1.0E30, ~res~0=6.442450947E9, ~x~0=0.0] [L11] static const float huge_ceil = 1.0e30; VAL [\old(huge_ceil)=6442450948, huge_ceil=1000000000000000000000000000000] [L76] float x = 0.0f; VAL [huge_ceil=1000000000000000000000000000000, x=0] [L77] CALL, EXPR ceil_float(x) VAL [\old(x)=0, huge_ceil=1000000000000000000000000000000] [L14] __int32_t i0, j0; [L15] __uint32_t i, ix; VAL [\old(x)=0, huge_ceil=1000000000000000000000000000000, x=0] [L17] ieee_float_shape_type gf_u; [L18] gf_u.value = (x) [L19] EXPR gf_u.word [L19] (i0) = gf_u.word [L21] ix = (i0 & 0x7fffffff) [L22] j0 = (ix >> 23) - 0x7f VAL [\old(x)=0, huge_ceil=1000000000000000000000000000000, i=-18014398509481985, i0=-2147483648, j0=2147483520, x=0] [L23] COND FALSE !(j0 < 23) VAL [\old(x)=0, huge_ceil=1000000000000000000000000000000, i=-18014398509481985, i0=-2147483648, j0=2147483520, x=0] [L43] COND TRUE !((ix) < 0x7f800000L) [L44] return x + x; VAL [\old(x)=0, huge_ceil=1000000000000000000000000000000, i=-18014398509481985, i0=-2147483648, j0=2147483520, x=0] [L77] RET, EXPR ceil_float(x) VAL [ceil_float(x)=6442450947, huge_ceil=1000000000000000000000000000000, x=0] [L77] float res = ceil_float(x); [L80] EXPR res == 0.0f && __signbit_float(res) == 0 VAL [huge_ceil=1000000000000000000000000000000, res=6442450947, res == 0.0f && __signbit_float(res) == 0=0, x=0] [L80] COND TRUE !(res == 0.0f && __signbit_float(res) == 0) [L81] __VERIFIER_error() VAL [huge_ceil=1000000000000000000000000000000, res=6442450947, x=0] ----- [2018-11-23 15:36:19,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:36:19 BoogieIcfgContainer [2018-11-23 15:36:19,091 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 15:36:19,091 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 15:36:19,092 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 15:36:19,092 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 15:36:19,092 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:36:18" (3/4) ... [2018-11-23 15:36:19,095 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 15:36:19,096 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 15:36:19,096 INFO L168 Benchmark]: Toolchain (without parser) took 884.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 959.2 MB in the beginning and 1.1 GB in the end (delta: -122.2 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2018-11-23 15:36:19,097 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:36:19,098 INFO L168 Benchmark]: CACSL2BoogieTranslator took 175.73 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 945.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-23 15:36:19,098 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.05 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:36:19,099 INFO L168 Benchmark]: Boogie Preprocessor took 57.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -195.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-23 15:36:19,099 INFO L168 Benchmark]: RCFGBuilder took 257.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.8 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. [2018-11-23 15:36:19,100 INFO L168 Benchmark]: TraceAbstraction took 370.23 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: 37.9 MB). Peak memory consumption was 37.9 MB. Max. memory is 11.5 GB. [2018-11-23 15:36:19,100 INFO L168 Benchmark]: Witness Printer took 4.17 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:36:19,102 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 175.73 ms. Allocated memory is still 1.0 GB. Free memory was 959.2 MB in the beginning and 945.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.05 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 57.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -195.4 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 257.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.8 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 370.23 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: 37.9 MB). Peak memory consumption was 37.9 MB. Max. memory is 11.5 GB. * Witness Printer took 4.17 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 81]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 80, overapproximation of bitwiseAnd at line 21, overapproximation of someBinaryArithmeticFLOAToperation at line 44. Possible FailurePath: [L11] static const float huge_ceil = 1.0e30; VAL [\old(huge_ceil)=6442450948, huge_ceil=1000000000000000000000000000000] [L76] float x = 0.0f; VAL [huge_ceil=1000000000000000000000000000000, x=0] [L77] CALL, EXPR ceil_float(x) VAL [\old(x)=0, huge_ceil=1000000000000000000000000000000] [L14] __int32_t i0, j0; [L15] __uint32_t i, ix; VAL [\old(x)=0, huge_ceil=1000000000000000000000000000000, x=0] [L17] ieee_float_shape_type gf_u; [L18] gf_u.value = (x) [L19] EXPR gf_u.word [L19] (i0) = gf_u.word [L21] ix = (i0 & 0x7fffffff) [L22] j0 = (ix >> 23) - 0x7f VAL [\old(x)=0, huge_ceil=1000000000000000000000000000000, i=-18014398509481985, i0=-2147483648, j0=2147483520, x=0] [L23] COND FALSE !(j0 < 23) VAL [\old(x)=0, huge_ceil=1000000000000000000000000000000, i=-18014398509481985, i0=-2147483648, j0=2147483520, x=0] [L43] COND TRUE !((ix) < 0x7f800000L) [L44] return x + x; VAL [\old(x)=0, huge_ceil=1000000000000000000000000000000, i=-18014398509481985, i0=-2147483648, j0=2147483520, x=0] [L77] RET, EXPR ceil_float(x) VAL [ceil_float(x)=6442450947, huge_ceil=1000000000000000000000000000000, x=0] [L77] float res = ceil_float(x); [L80] EXPR res == 0.0f && __signbit_float(res) == 0 VAL [huge_ceil=1000000000000000000000000000000, res=6442450947, res == 0.0f && __signbit_float(res) == 0=0, x=0] [L80] COND TRUE !(res == 0.0f && __signbit_float(res) == 0) [L81] __VERIFIER_error() VAL [huge_ceil=1000000000000000000000000000000, res=6442450947, x=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 43 locations, 1 error locations. UNSAFE Result, 0.3s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 52 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=43occurred 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, 37 NumberOfCodeBlocks, 37 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 17 ConstructedInterpolants, 0 QuantifiedInterpolants, 289 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-aa41828 [2018-11-23 15:36:20,564 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 15:36:20,565 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 15:36:20,573 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 15:36:20,574 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 15:36:20,574 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 15:36:20,575 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 15:36:20,577 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 15:36:20,578 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 15:36:20,578 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 15:36:20,579 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 15:36:20,579 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 15:36:20,580 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 15:36:20,580 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 15:36:20,581 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 15:36:20,582 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 15:36:20,582 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 15:36:20,583 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 15:36:20,585 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 15:36:20,586 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 15:36:20,586 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 15:36:20,587 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 15:36:20,589 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 15:36:20,589 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 15:36:20,589 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 15:36:20,590 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 15:36:20,590 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 15:36:20,591 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 15:36:20,591 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 15:36:20,592 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 15:36:20,592 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 15:36:20,593 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 15:36:20,593 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 15:36:20,593 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 15:36:20,594 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 15:36:20,594 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 15:36:20,594 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0b1a24be-59ea-4ae3-a58d-30c5c52c519f/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2018-11-23 15:36:20,605 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 15:36:20,605 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 15:36:20,605 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 15:36:20,606 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 15:36:20,606 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 15:36:20,606 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 15:36:20,606 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 15:36:20,606 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 15:36:20,606 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 15:36:20,606 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 15:36:20,607 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 15:36:20,607 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 15:36:20,607 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 15:36:20,607 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 15:36:20,607 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 15:36:20,608 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 15:36:20,608 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 15:36:20,608 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 15:36:20,608 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 15:36:20,608 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 15:36:20,608 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 15:36:20,608 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 15:36:20,608 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 15:36:20,609 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 15:36:20,609 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 15:36:20,609 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 15:36:20,609 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 15:36:20,609 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 15:36:20,609 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 15:36:20,609 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 15:36:20,610 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 15:36:20,610 INFO L133 SettingsManager]: * Trace refinement strategy=WALRUS [2018-11-23 15:36:20,610 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 15:36:20,610 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 15:36:20,610 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 15:36:20,610 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_0b1a24be-59ea-4ae3-a58d-30c5c52c519f/bin-2019/utaipan 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 -> Taipan 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 -> 2e3b677629e69b083ff740542124e952dcae7545 [2018-11-23 15:36:20,641 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 15:36:20,650 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 15:36:20,652 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 15:36:20,654 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 15:36:20,654 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 15:36:20,654 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0b1a24be-59ea-4ae3-a58d-30c5c52c519f/bin-2019/utaipan/../../sv-benchmarks/c/float-newlib/float_req_bl_1092b_true-unreach-call.c [2018-11-23 15:36:20,698 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0b1a24be-59ea-4ae3-a58d-30c5c52c519f/bin-2019/utaipan/data/c6e10ccd8/0a23d25b721a4c7bbe1eaeb6e945e1e6/FLAGac7d1c140 [2018-11-23 15:36:21,096 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 15:36:21,096 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0b1a24be-59ea-4ae3-a58d-30c5c52c519f/sv-benchmarks/c/float-newlib/float_req_bl_1092b_true-unreach-call.c [2018-11-23 15:36:21,102 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0b1a24be-59ea-4ae3-a58d-30c5c52c519f/bin-2019/utaipan/data/c6e10ccd8/0a23d25b721a4c7bbe1eaeb6e945e1e6/FLAGac7d1c140 [2018-11-23 15:36:21,111 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0b1a24be-59ea-4ae3-a58d-30c5c52c519f/bin-2019/utaipan/data/c6e10ccd8/0a23d25b721a4c7bbe1eaeb6e945e1e6 [2018-11-23 15:36:21,113 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 15:36:21,113 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 15:36:21,114 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 15:36:21,114 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 15:36:21,116 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 15:36:21,117 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:36:21" (1/1) ... [2018-11-23 15:36:21,119 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@567d81a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:21, skipping insertion in model container [2018-11-23 15:36:21,119 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:36:21" (1/1) ... [2018-11-23 15:36:21,126 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 15:36:21,145 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 15:36:21,286 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:36:21,290 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 15:36:21,309 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:36:21,328 INFO L195 MainTranslator]: Completed translation [2018-11-23 15:36:21,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:21 WrapperNode [2018-11-23 15:36:21,329 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 15:36:21,330 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 15:36:21,330 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 15:36:21,330 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 15:36:21,335 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:21" (1/1) ... [2018-11-23 15:36:21,341 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:21" (1/1) ... [2018-11-23 15:36:21,346 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 15:36:21,346 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 15:36:21,347 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 15:36:21,347 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 15:36:21,352 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:21" (1/1) ... [2018-11-23 15:36:21,352 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:21" (1/1) ... [2018-11-23 15:36:21,355 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:21" (1/1) ... [2018-11-23 15:36:21,355 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:21" (1/1) ... [2018-11-23 15:36:21,362 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:21" (1/1) ... [2018-11-23 15:36:21,406 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:21" (1/1) ... [2018-11-23 15:36:21,407 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:21" (1/1) ... [2018-11-23 15:36:21,410 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 15:36:21,411 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 15:36:21,411 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 15:36:21,411 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 15:36:21,411 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0b1a24be-59ea-4ae3-a58d-30c5c52c519f/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 15:36:21,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 15:36:21,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 15:36:21,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 15:36:21,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 15:36:21,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 15:36:21,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 15:36:21,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2018-11-23 15:36:21,443 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 15:36:21,444 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 15:36:21,444 INFO L130 BoogieDeclarations]: Found specification of procedure ceil_float [2018-11-23 15:36:21,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ceil_float [2018-11-23 15:36:21,444 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2018-11-23 15:36:21,444 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_float [2018-11-23 15:36:21,444 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_float [2018-11-23 15:36:21,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 15:36:21,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 15:36:21,732 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 15:36:21,921 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 15:36:21,921 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 15:36:21,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:36:21 BoogieIcfgContainer [2018-11-23 15:36:21,922 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 15:36:21,922 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 15:36:21,922 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 15:36:21,924 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 15:36:21,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:36:21" (1/3) ... [2018-11-23 15:36:21,925 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e7ea7ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:36:21, skipping insertion in model container [2018-11-23 15:36:21,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:36:21" (2/3) ... [2018-11-23 15:36:21,925 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e7ea7ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:36:21, skipping insertion in model container [2018-11-23 15:36:21,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:36:21" (3/3) ... [2018-11-23 15:36:21,927 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1092b_true-unreach-call.c [2018-11-23 15:36:21,935 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 15:36:21,940 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 15:36:21,949 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 15:36:21,970 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 15:36:21,970 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 15:36:21,971 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 15:36:21,971 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 15:36:21,971 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 15:36:21,971 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 15:36:21,971 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 15:36:21,971 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 15:36:21,971 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 15:36:21,981 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2018-11-23 15:36:21,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 15:36:21,985 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:36:21,985 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:36:21,987 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:36:21,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:36:21,990 INFO L82 PathProgramCache]: Analyzing trace with hash 263185431, now seen corresponding path program 1 times [2018-11-23 15:36:21,993 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 15:36:21,993 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0b1a24be-59ea-4ae3-a58d-30c5c52c519f/bin-2019/utaipan/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-11-23 15:36:21,997 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:36:22,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:36:22,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:36:22,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:36:22,063 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 15:36:22,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:36:22,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 15:36:22,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 15:36:22,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 15:36:22,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 15:36:22,086 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 2 states. [2018-11-23 15:36:22,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:36:22,100 INFO L93 Difference]: Finished difference Result 78 states and 111 transitions. [2018-11-23 15:36:22,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 15:36:22,101 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-23 15:36:22,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:36:22,107 INFO L225 Difference]: With dead ends: 78 [2018-11-23 15:36:22,107 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 15:36:22,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 15:36:22,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 15:36:22,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-23 15:36:22,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 15:36:22,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2018-11-23 15:36:22,139 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 18 [2018-11-23 15:36:22,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:36:22,140 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2018-11-23 15:36:22,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 15:36:22,140 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2018-11-23 15:36:22,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 15:36:22,140 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:36:22,141 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:36:22,141 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:36:22,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:36:22,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1491196875, now seen corresponding path program 1 times [2018-11-23 15:36:22,142 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 15:36:22,142 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0b1a24be-59ea-4ae3-a58d-30c5c52c519f/bin-2019/utaipan/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-11-23 15:36:22,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:36:22,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:36:22,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:36:22,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:36:22,306 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 15:36:22,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:36:22,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 15:36:22,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 15:36:22,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 15:36:22,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 15:36:22,315 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand 7 states. [2018-11-23 15:36:23,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:36:23,269 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2018-11-23 15:36:23,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 15:36:23,269 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-11-23 15:36:23,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:36:23,271 INFO L225 Difference]: With dead ends: 60 [2018-11-23 15:36:23,271 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 15:36:23,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-11-23 15:36:23,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 15:36:23,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 38. [2018-11-23 15:36:23,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 15:36:23,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2018-11-23 15:36:23,278 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 19 [2018-11-23 15:36:23,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:36:23,278 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2018-11-23 15:36:23,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 15:36:23,278 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2018-11-23 15:36:23,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 15:36:23,279 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:36:23,279 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:36:23,279 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:36:23,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:36:23,279 INFO L82 PathProgramCache]: Analyzing trace with hash 664765980, now seen corresponding path program 1 times [2018-11-23 15:36:23,280 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 15:36:23,280 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0b1a24be-59ea-4ae3-a58d-30c5c52c519f/bin-2019/utaipan/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-11-23 15:36:23,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:36:23,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:36:23,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:36:23,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:36:23,367 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 15:36:23,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:36:23,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 15:36:23,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 15:36:23,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 15:36:23,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 15:36:23,374 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand 7 states. [2018-11-23 15:36:24,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:36:24,019 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2018-11-23 15:36:24,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 15:36:24,020 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-11-23 15:36:24,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:36:24,021 INFO L225 Difference]: With dead ends: 67 [2018-11-23 15:36:24,021 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 15:36:24,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-11-23 15:36:24,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 15:36:24,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 34. [2018-11-23 15:36:24,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 15:36:24,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2018-11-23 15:36:24,024 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 20 [2018-11-23 15:36:24,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:36:24,025 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2018-11-23 15:36:24,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 15:36:24,025 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2018-11-23 15:36:24,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 15:36:24,025 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:36:24,026 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] [2018-11-23 15:36:24,026 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:36:24,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:36:24,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1845640621, now seen corresponding path program 1 times [2018-11-23 15:36:24,027 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 15:36:24,027 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0b1a24be-59ea-4ae3-a58d-30c5c52c519f/bin-2019/utaipan/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-11-23 15:36:24,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:36:24,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:36:24,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:36:24,804 WARN L180 SmtUtils]: Spent 328.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-23 15:36:24,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:36:24,809 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 15:36:24,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:36:24,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 15:36:24,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 15:36:24,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 15:36:24,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 15:36:24,822 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand 6 states. [2018-11-23 15:36:25,764 WARN L180 SmtUtils]: Spent 362.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-23 15:36:26,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:36:26,237 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2018-11-23 15:36:26,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 15:36:26,241 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-11-23 15:36:26,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:36:26,241 INFO L225 Difference]: With dead ends: 52 [2018-11-23 15:36:26,241 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 15:36:26,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-23 15:36:26,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 15:36:26,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-23 15:36:26,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 15:36:26,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-11-23 15:36:26,246 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 23 [2018-11-23 15:36:26,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:36:26,246 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-11-23 15:36:26,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 15:36:26,246 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-11-23 15:36:26,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 15:36:26,247 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:36:26,247 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] [2018-11-23 15:36:26,247 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:36:26,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:36:26,248 INFO L82 PathProgramCache]: Analyzing trace with hash -530743544, now seen corresponding path program 1 times [2018-11-23 15:36:26,248 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 15:36:26,248 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0b1a24be-59ea-4ae3-a58d-30c5c52c519f/bin-2019/utaipan/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-11-23 15:36:26,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:36:26,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:36:26,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:36:26,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:36:26,338 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 15:36:26,349 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:36:26,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 15:36:26,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 15:36:26,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 15:36:26,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 15:36:26,350 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 6 states. [2018-11-23 15:36:26,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:36:26,591 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-11-23 15:36:26,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 15:36:26,592 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-11-23 15:36:26,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:36:26,592 INFO L225 Difference]: With dead ends: 57 [2018-11-23 15:36:26,592 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 15:36:26,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-11-23 15:36:26,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 15:36:26,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 34. [2018-11-23 15:36:26,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 15:36:26,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-11-23 15:36:26,597 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 24 [2018-11-23 15:36:26,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:36:26,597 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2018-11-23 15:36:26,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 15:36:26,597 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-11-23 15:36:26,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 15:36:26,597 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:36:26,598 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] [2018-11-23 15:36:26,598 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:36:26,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:36:26,598 INFO L82 PathProgramCache]: Analyzing trace with hash 943724535, now seen corresponding path program 1 times [2018-11-23 15:36:26,598 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 15:36:26,598 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0b1a24be-59ea-4ae3-a58d-30c5c52c519f/bin-2019/utaipan/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-11-23 15:36:26,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:36:26,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:36:26,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:36:26,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:36:26,731 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 15:36:26,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:36:26,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 15:36:26,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 15:36:26,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 15:36:26,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 15:36:26,739 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 7 states. [2018-11-23 15:36:26,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:36:26,989 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2018-11-23 15:36:26,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 15:36:26,990 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-11-23 15:36:26,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:36:26,990 INFO L225 Difference]: With dead ends: 52 [2018-11-23 15:36:26,990 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 15:36:26,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-23 15:36:26,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 15:36:26,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-23 15:36:26,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 15:36:26,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-11-23 15:36:26,994 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 25 [2018-11-23 15:36:26,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:36:26,994 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-11-23 15:36:26,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 15:36:26,994 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-11-23 15:36:26,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 15:36:26,995 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:36:26,995 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] [2018-11-23 15:36:26,995 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:36:26,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:36:26,996 INFO L82 PathProgramCache]: Analyzing trace with hash 550697525, now seen corresponding path program 1 times [2018-11-23 15:36:26,996 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 15:36:26,996 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0b1a24be-59ea-4ae3-a58d-30c5c52c519f/bin-2019/utaipan/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2018-11-23 15:36:27,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:36:27,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:36:27,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:36:27,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:36:27,120 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 15:36:27,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:36:27,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 15:36:27,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 15:36:27,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 15:36:27,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-23 15:36:27,128 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 8 states. [2018-11-23 15:36:27,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:36:27,337 INFO L93 Difference]: Finished difference Result 37 states and 36 transitions. [2018-11-23 15:36:27,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 15:36:27,338 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-11-23 15:36:27,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:36:27,338 INFO L225 Difference]: With dead ends: 37 [2018-11-23 15:36:27,338 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 15:36:27,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-11-23 15:36:27,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 15:36:27,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-23 15:36:27,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 15:36:27,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 33 transitions. [2018-11-23 15:36:27,343 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 33 transitions. Word has length 25 [2018-11-23 15:36:27,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:36:27,343 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 33 transitions. [2018-11-23 15:36:27,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 15:36:27,344 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 33 transitions. [2018-11-23 15:36:27,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 15:36:27,344 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 15:36:27,344 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:36:27,345 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 15:36:27,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:36:27,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1832884299, now seen corresponding path program 1 times [2018-11-23 15:36:27,346 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 15:36:27,346 INFO L69 tionRefinementEngine]: Using refinement strategy WalrusRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0b1a24be-59ea-4ae3-a58d-30c5c52c519f/bin-2019/utaipan/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2018-11-23 15:36:27,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:36:27,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:36:27,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:36:27,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:36:27,550 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 15:36:27,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:36:27,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-23 15:36:27,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 15:36:27,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 15:36:27,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-23 15:36:27,558 INFO L87 Difference]: Start difference. First operand 34 states and 33 transitions. Second operand 13 states. [2018-11-23 15:36:28,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:36:28,041 INFO L93 Difference]: Finished difference Result 34 states and 33 transitions. [2018-11-23 15:36:28,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 15:36:28,041 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-11-23 15:36:28,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 15:36:28,042 INFO L225 Difference]: With dead ends: 34 [2018-11-23 15:36:28,042 INFO L226 Difference]: Without dead ends: 0 [2018-11-23 15:36:28,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2018-11-23 15:36:28,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-23 15:36:28,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-23 15:36:28,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-23 15:36:28,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-23 15:36:28,043 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2018-11-23 15:36:28,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 15:36:28,043 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 15:36:28,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 15:36:28,044 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-23 15:36:28,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 15:36:28,046 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-23 15:36:28,178 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-23 15:36:28,178 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-23 15:36:28,178 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-23 15:36:28,178 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-23 15:36:28,178 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (= ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1000000000000000000000000000000.0)) ~huge_ceil~0) [2018-11-23 15:36:28,178 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-23 15:36:28,178 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-23 15:36:28,179 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 68 86) the Hoare annotation is: true [2018-11-23 15:36:28,179 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 68 86) no Hoare annotation was computed. [2018-11-23 15:36:28,179 INFO L448 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2018-11-23 15:36:28,179 INFO L448 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2018-11-23 15:36:28,179 INFO L444 ceAbstractionStarter]: At program point L80-1(line 80) the Hoare annotation is: (or (and |main_#t~short8| (= (_ +zero 8 24) main_~x~0) (= (_ +zero 8 24) main_~res~0)) (not (= ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1000000000000000000000000000000.0)) ~huge_ceil~0))) [2018-11-23 15:36:28,179 INFO L448 ceAbstractionStarter]: For program point L80-2(line 80) no Hoare annotation was computed. [2018-11-23 15:36:28,179 INFO L444 ceAbstractionStarter]: At program point L77(line 77) the Hoare annotation is: (or (not (= ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1000000000000000000000000000000.0)) ~huge_ceil~0)) (= (_ +zero 8 24) main_~x~0)) [2018-11-23 15:36:28,179 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 68 86) no Hoare annotation was computed. [2018-11-23 15:36:28,179 INFO L448 ceAbstractionStarter]: For program point L77-1(line 77) no Hoare annotation was computed. [2018-11-23 15:36:28,179 INFO L448 ceAbstractionStarter]: For program point L80-4(lines 80 83) no Hoare annotation was computed. [2018-11-23 15:36:28,179 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 81) no Hoare annotation was computed. [2018-11-23 15:36:28,179 INFO L448 ceAbstractionStarter]: For program point L23(lines 23 47) no Hoare annotation was computed. [2018-11-23 15:36:28,179 INFO L448 ceAbstractionStarter]: For program point L48(lines 48 52) no Hoare annotation was computed. [2018-11-23 15:36:28,180 INFO L448 ceAbstractionStarter]: For program point L48-1(lines 13 54) no Hoare annotation was computed. [2018-11-23 15:36:28,180 INFO L448 ceAbstractionStarter]: For program point L48-2(lines 48 52) no Hoare annotation was computed. [2018-11-23 15:36:28,180 INFO L448 ceAbstractionStarter]: For program point L36(lines 36 40) no Hoare annotation was computed. [2018-11-23 15:36:28,180 INFO L451 ceAbstractionStarter]: At program point ceil_floatENTRY(lines 13 54) the Hoare annotation is: true [2018-11-23 15:36:28,180 INFO L448 ceAbstractionStarter]: For program point L28(lines 28 30) no Hoare annotation was computed. [2018-11-23 15:36:28,180 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 41) no Hoare annotation was computed. [2018-11-23 15:36:28,180 INFO L448 ceAbstractionStarter]: For program point ceil_floatFINAL(lines 13 54) no Hoare annotation was computed. [2018-11-23 15:36:28,180 INFO L448 ceAbstractionStarter]: For program point L16-1(lines 16 20) no Hoare annotation was computed. [2018-11-23 15:36:28,180 INFO L444 ceAbstractionStarter]: At program point L16-2(lines 16 20) the Hoare annotation is: (or (= |ceil_float_#in~x| ceil_float_~x) (not (= ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1000000000000000000000000000000.0)) ~huge_ceil~0))) [2018-11-23 15:36:28,180 INFO L448 ceAbstractionStarter]: For program point L16-3(lines 16 20) no Hoare annotation was computed. [2018-11-23 15:36:28,181 INFO L448 ceAbstractionStarter]: For program point L37(lines 37 38) no Hoare annotation was computed. [2018-11-23 15:36:28,181 INFO L448 ceAbstractionStarter]: For program point ceil_floatEXIT(lines 13 54) no Hoare annotation was computed. [2018-11-23 15:36:28,181 INFO L448 ceAbstractionStarter]: For program point L37-2(lines 37 38) no Hoare annotation was computed. [2018-11-23 15:36:28,181 INFO L448 ceAbstractionStarter]: For program point L25(lines 25 31) no Hoare annotation was computed. [2018-11-23 15:36:28,181 INFO L448 ceAbstractionStarter]: For program point L34(lines 34 35) no Hoare annotation was computed. [2018-11-23 15:36:28,181 INFO L448 ceAbstractionStarter]: For program point L26(lines 26 30) no Hoare annotation was computed. [2018-11-23 15:36:28,181 INFO L448 ceAbstractionStarter]: For program point L43(lines 43 46) no Hoare annotation was computed. [2018-11-23 15:36:28,181 INFO L448 ceAbstractionStarter]: For program point L59-1(lines 59 63) no Hoare annotation was computed. [2018-11-23 15:36:28,181 INFO L444 ceAbstractionStarter]: At program point L59-2(lines 59 63) the Hoare annotation is: (or (not (= ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1000000000000000000000000000000.0)) ~huge_ceil~0)) (= |__signbit_float_#in~x| __signbit_float_~x)) [2018-11-23 15:36:28,181 INFO L448 ceAbstractionStarter]: For program point L59-3(lines 59 63) no Hoare annotation was computed. [2018-11-23 15:36:28,181 INFO L448 ceAbstractionStarter]: For program point __signbit_floatFINAL(lines 56 66) no Hoare annotation was computed. [2018-11-23 15:36:28,181 INFO L451 ceAbstractionStarter]: At program point __signbit_floatENTRY(lines 56 66) the Hoare annotation is: true [2018-11-23 15:36:28,181 INFO L448 ceAbstractionStarter]: For program point __signbit_floatEXIT(lines 56 66) no Hoare annotation was computed. [2018-11-23 15:36:28,186 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 15:36:28,187 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 15:36:28,189 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 15:36:28,189 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 15:36:28,190 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 15:36:28,190 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 15:36:28,190 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 15:36:28,191 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 15:36:28,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:36:28 BoogieIcfgContainer [2018-11-23 15:36:28,192 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 15:36:28,192 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 15:36:28,193 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 15:36:28,193 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 15:36:28,193 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:36:21" (3/4) ... [2018-11-23 15:36:28,196 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-23 15:36:28,200 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-23 15:36:28,201 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-23 15:36:28,201 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ceil_float [2018-11-23 15:36:28,201 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __signbit_float [2018-11-23 15:36:28,204 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2018-11-23 15:36:28,204 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-11-23 15:36:28,205 INFO L879 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-23 15:36:28,231 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \old(x) == x || !(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0E30)) == huge_ceil) [2018-11-23 15:36:28,231 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: !(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0E30)) == huge_ceil) || \old(x) == x [2018-11-23 15:36:28,252 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_0b1a24be-59ea-4ae3-a58d-30c5c52c519f/bin-2019/utaipan/witness.graphml [2018-11-23 15:36:28,252 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 15:36:28,253 INFO L168 Benchmark]: Toolchain (without parser) took 7139.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 187.2 MB). Free memory was 949.7 MB in the beginning and 1.2 GB in the end (delta: -225.0 MB). Peak memory consumption was 298.0 MB. Max. memory is 11.5 GB. [2018-11-23 15:36:28,254 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:36:28,254 INFO L168 Benchmark]: CACSL2BoogieTranslator took 215.11 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 933.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 15:36:28,254 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.76 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:36:28,254 INFO L168 Benchmark]: Boogie Preprocessor took 63.82 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -168.3 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. [2018-11-23 15:36:28,255 INFO L168 Benchmark]: RCFGBuilder took 511.23 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. [2018-11-23 15:36:28,255 INFO L168 Benchmark]: TraceAbstraction took 6270.04 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 775.1 MB in the end (delta: 306.8 MB). Peak memory consumption was 306.8 MB. Max. memory is 11.5 GB. [2018-11-23 15:36:28,255 INFO L168 Benchmark]: Witness Printer took 59.82 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 72.4 MB). Free memory was 775.1 MB in the beginning and 1.2 GB in the end (delta: -399.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 11.5 GB. [2018-11-23 15:36:28,256 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.15 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 215.11 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 933.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 16.76 ms. Allocated memory is still 1.0 GB. Free memory is still 933.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 63.82 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.8 MB). Free memory was 933.6 MB in the beginning and 1.1 GB in the end (delta: -168.3 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 511.23 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6270.04 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 775.1 MB in the end (delta: 306.8 MB). Peak memory consumption was 306.8 MB. Max. memory is 11.5 GB. * Witness Printer took 59.82 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 72.4 MB). Free memory was 775.1 MB in the beginning and 1.2 GB in the end (delta: -399.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 81]: 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: 59]: Loop Invariant [2018-11-23 15:36:28,259 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 15:36:28,259 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 15:36:28,259 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 15:36:28,259 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: !(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0E30)) == huge_ceil) || \old(x) == x - InvariantResult [Line: 16]: Loop Invariant [2018-11-23 15:36:28,260 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 15:36:28,260 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 15:36:28,260 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-11-23 15:36:28,260 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: \old(x) == x || !(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0E30)) == huge_ceil) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 43 locations, 1 error locations. SAFE Result, 6.2s OverallTime, 8 OverallIterations, 1 TraceHistogramMax, 4.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 244 SDtfs, 279 SDslu, 775 SDs, 0 SdLazy, 444 SolverSat, 38 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 207 GetRequests, 136 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred 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, 8 MinimizatonAttempts, 16 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 22 PreInvPairs, 25 NumberOfFragments, 65 HoareAnnotationTreeSize, 22 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 FomulaSimplificationsInter, 76 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 187 NumberOfCodeBlocks, 187 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 179 ConstructedInterpolants, 26 QuantifiedInterpolants, 26926 SizeOfPredicates, 32 NumberOfNonLiveVariables, 488 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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...